Constraining boundaries are usually defined as a set of vertices, edges,
and facets which are closed under intersection. All
intersections between entities in
must be present in
. The
facets are bounded by edges of
. All vertices of facets and edges
must be contained in
.
In two dimensions such a set is called a planar straight line graph
(PSLG) and in higher dimensions piecewise linear complex
(PLC).
A Delaunay Triangulation of the vertices of
will generally not be
conform with the edges and facets of
(Fig. 5.3-a).
Special means are required to incorporate
into the Delaunay
Triangulation. Two different theoretical concepts exist which extend the
definition of the Delaunay Triangulation for boundaries.
Furthermore, two different approaches exist when to incorporate the
boundaries from an algorithmic point of view.
![]() |