Dirichlet cells in the shortest-path metric

We present a new approach to the problems of construction of constrained Delaunay triangulations and Dirichlet cells for arbitrary constraint configurations. A metric equal to the length of the shortest boundary-conforming path between two points is introduced. Dirichlet cells in the new metric resemble classical cells, while taking into account point visibility through the constraints. We prove statements that precisely describe the form of these cells.