Better Sampling Bounds for
Restricted Delaunay Triangulations and a
Star-Shaped Property for Restricted Voronoi Cells
Abstract
The restricted Delaunay triangulation of a closed surface and a finite point set is a subcomplex of the Delaunay tetrahedralization of whose triangles approximate . It is well known that if is a sufficiently dense sample of a smooth , then the union of the restricted Delaunay triangles is homeomorphic to . We show that an -sample with suffices. By comparison, Dey proves it for a -sample; our improved sampling bound reduces the number of sample points required by a factor of . More importantly, we improve a related sampling bound of Cheng et al. for Delaunay surface meshing, reducing the number of sample points required by a factor of . The first step of our homeomorphism proof is particularly interesting: we show that for a -sample, the restricted Voronoi cell of each site is homeomorphic to a disk, and the orthogonal projection of the cell onto (the plane tangent to at ) is star-shaped.
Keywords and phrases:
Restricted Delaunay triangulation, restricted Voronoi diagram, surface sampling, surface mesh generation, surface reconstruction, -sample, homeomorphismCopyright and License:
2012 ACM Subject Classification:
Theory of computation Computational geometryAcknowledgements:
I thank Nina Amenta, Jean-Daniel Boissonnat, Siu-Wing Cheng, Tamal Dey, Arijit Ghosh, and Marc Khoury for discussions about surface sampling; and INRIA Sophia-Antipolis and the Geometrica Group, where this work began, for their kind reception during my 2010 sabbatical.Funding:
Supported by the National Science Foundation under Award CCF-1909204.Editors:
Hee-Kap Ahn, Michael Hoffmann, and Amir NayyeriSeries and Publisher:
Leibniz International Proceedings in Informatics, Schloss Dagstuhl – Leibniz-Zentrum für Informatik
1 Introduction
The restricted Delaunay triangulation (RDT) is a well-established way of generating good-quality triangulations on curved surfaces [23]. Researchers have developed a theory of surface sampling to determine how we should sample points on a surface to guarantee that an RDT (or a related triangulation) is a topologically correct and geometrically accurate approximation of the surface [1, 2, 3, 6, 10, 12, 13, 14, 15, 17, 16, 18, 20, 23, 24, 26, 31, 34, 35]. RDTs and this surface sampling theory have equipped geometers to rigorously prove the correctness of algorithms for surface reconstruction [20] and surface mesh generation [18].
Think of the RDT as a function that takes in two inputs: a smooth, closed (compact with no boundary) surface and a finite set of points, called sites (or vertices of the RDT). The set is a sample or a point cloud. The output is a simplicial complex whose vertices are . The RDT is a subcomplex of the three-dimensional Delaunay triangulation , but in typical usage contains no tetrahedra; only triangles, edges, and the vertices .
If is sufficiently dense, is a (topological) triangulation of , which means that the underlying space of , written , is homeomorphic to . This paper proves that a modest sampling requirement suffices to guarantee that homeomorphism.
What does it mean for to be “sufficiently dense”? Intuitively, there should be no large unsampled bare spots on . Ideally, sampling requirements are adaptive, as a denser spacing of sites is needed in regions where has higher curvature or closely-spaced “parts” like fingers on a hand, but simple regions need few sites. Many provably good algorithms for surface reconstruction assume that is a so-called -sample of (defined in Section 2), an adaptive sample in which a smaller implies more sites, closer together.
One main result of this paper is that if is a -sample of , the underlying space of the RDT is homeomorphic to . Dey [20] proved the same for a -sample. The new result reduces the number of sample points required by a factor of (the square of ). Some well-known surface reconstruction algorithms such as the Crust [1] and Cocone [3] algorithms rely on identifying a superset of the RDT’s triangles then paring them down. Any substantial relaxation of their sampling requirements is good news for a broad swath of existing algorithms, and it helps to explain why they work well in practice.
As a point of comparison, Bjerkevik [5] shows that no proof will ever guarantee homeomorphism for -samples, as there exist -samples with multiple, topologically different, correct reconstructions. (This limitation holds also for smooth, closed curves in the plane.)
We define another adaptive sampling condition better suited to mesh generation, enabling stronger sampling bounds: we prove homeomorphism for what we call a -Voronoi sample. Cheng et al. [18] proved the same for a -Voronoi sample; our result reduces the number of sample points required by a factor of . Our bound implies better sampling bounds for existing surface meshing algorithms; it is this paper’s most important result.
Also of interest are the new techniques introduced here to obtain these bounds. In particular, for a -sample or a -Voronoi sample, the restricted Voronoi cell of each site (defined in Section 2) is homeomorphic to a disk. Moreover, let denote the plane tangent to at ; the orthogonal projection of ’s cell onto is star-shaped: a union of (infinitely many) line segments terminating at . It seems a bit surprising that restricted Voronoi cells are better behaved with respect to coarse samples than restricted Voronoi vertices or edges, because the proofs by Dey [20] and Cheng et al. [18] use the soundness of the restricted Voronoi edges to establish the soundness of the restricted Voronoi cells. This paper reverses that sequence and, in my opinion, gets at the heart of the reasons why a restricted Voronoi cell is nicely shaped. Remarkably, the results about the Voronoi cells generalize to manifolds of higher dimension embedded in higher-dimensional spaces with no degradation in the bounds [32], although the homeomorphism result does not and cannot generalize to higher dimensions [16, 11, 9].
Not everyone gets excited by improved constants, but I advocate for the importance of tighter sampling theory for computational geometry – just as numerical analysts have devoted much effort to improving constants associated with quadrature rules, interpolation theory, and more. Strong bounds show that RDTs are useful, not merely theoretical.
2 Restricted Delaunay triangulations and -samples
The RDT is defined by dualizing a restricted Voronoi diagram, which will be our main object of study. Let denote the Euclidean distance from to ; equivalently, the length of the line segment . Given a closed surface and a sample , the restricted Voronoi cell of a site is for all . Equivalently, , where is ’s standard Voronoi cell in . The name “restricted Voronoi cell” means that is the restriction of to the surface . See Figure 1.
A restricted Voronoi face is any nonempty intersection of one or more restricted Voronoi cells – i.e., for some face in . In particular, a restricted Voronoi vertex is the nonempty intersection of with an edge in ; and a restricted Voronoi edge is the nonempty intersection of with a polygonal -face in . Typically these entities are a single point and a (curvy) path on , respectively, but if is not dense enough, they may take on more pathological forms – e.g., a restricted Voronoi “edge” could be a cycle, a pair of disjoint paths, or even a -dimensional blob. This paper aims to determine sampling conditions that eliminate such pathologies. The restricted Voronoi diagram is the cell complex containing all the restricted Voronoi faces (including the restricted Voronoi cells).
The Delaunay subdivision is the polyhedral complex dual to the Voronoi diagram, and the restricted Delaunay subdivision is the subcomplex of dual to the restricted Voronoi diagram. That is, for each Voronoi face , let be the set of sites whose Voronoi cells include and let be the convex hull of ; we say that is the face dual to . Then . The restricted Delaunay subdivision contains the dual faces whose primal faces intersect ; that is, . The restricted Voronoi face has the same dual face as , . It is customary to subdivide the polyhedra in into tetrahedra (in which case the duality is no longer strict); accordingly, we can subdivide the polygons in into triangles and call it a restricted Delaunay triangulation. This paper’s results apply whether we do or don’t.
A crucial observation in the theory of surface sampling is that the sampling density necessary for accurate approximation is proportional to a field called the local feature size. The medial axis of , illustrated in Figure 2, is the closure of the set of all points in for which the closest point on is not unique. A medial ball is a ball whose center lies on and whose boundary intersects (tangentially), but the interior of the ball does not. For any point , there are one or two medial balls that have on their boundaries, called medial balls at . One is inside . If there are two, the other is outside. If not, there is an open halfspace tangent to at , disjoint from , that we call a degenerate “medial ball.”
The local feature size function is , where . We require that is smooth in the sense that . (-continuity suffices.)
A finite point set is an -sample of if for every point , there is a site such that . That is, the ball with center and radius contains at least one site. A finite is an -Voronoi sample of if and for every site and every point , . That is, is a subset of the ball with center and radius . (Note that this condition implies the -small condition of Cheng et al. [18], though the converse is not true.) Only -samples are a well-known concept, but -Voronoi samples are nice because tends to give better sampling bounds than .
Like the classical proofs [1, 18, 20], this paper’s homeomorphism proofs rely on the Topological Ball Theorem of Edelsbrunner and Shah [23]. Given a sample of a closed surface , this theorem states that is homeomorphic to if and satisfy two properties. The closed ball property is that for each Voronoi face , is either empty or a topological closed -ball where is the dimension of . That is,
-
A.
for a Voronoi -cell , is a topological closed disk;
-
B.
for a Voronoi -face , is a topological closed interval or ;
-
C.
for a Voronoi edge , contains at most one point; and
-
D.
for a Voronoi vertex , .
If A–D hold, the generic intersection property is that for each , and . In this definition, “interior” and “boundary” are interpreted by the rules of -manifolds (for ) and -manifolds (for ). (They are not the interior and boundary with respect to .) For a smooth , the generic intersection property holds if properties A–D hold and there is no face and no point such that . That is,
-
E.
there is no point where intersects a -face of tangentially; and
-
F.
there is no point where intersects an edge of tangentially.
This paper is organized around proving that these conditions hold for a sufficiently dense sample : properties A and E in Section 4, properties C and F in Section 5, and property B in Section 6. Property D ensures that contains no polyhedra – only faces of dimension two or less. Property D cannot be enforced by dense sampling, but it can be enforced by an infinitesimal perturbation of so that intersects no Voronoi vertex. This perturbation is easy to simulate symbolically in software simply by treating each Voronoi vertex on as if it were strictly inside (when deciding which faces of are in ).
Unlike in Dey [20] or Cheng et al. [18], our proof of property A does not rely on property B or C. Property A holds for a -sample or a -Voronoi sample, whereas we prove property B only for a -sample or a -Voronoi sample. Property B (restricted Voronoi edges) is the bottleneck that determines our sampling requirements.
Some algorithms for triangulating surfaces guarantee topological correctness without RDTs, by other methods [4, 8, 19, 27, 29]. One alternative is to consider Voronoi diagrams with other distance metrics. Dyer, Zhang, and Möller [21, 22] and others [28, 7] use intrinsic distances within , also known as geodesic distances when is smooth, to define intrinsic Voronoi diagrams that dualize to intrinsic Delaunay triangulations (IDTs). Advantages are that the Voronoi cells are trivially star-shaped, and the sampling requirements needed to guarantee a homeomorphic triangulation are mild [22]. But intrinsic distances on smooth surfaces are painful to compute [30]. Restricted Delaunay triangulations will probably remain popular as an easy alternative. So let us see how far we can push them.
3 A relationship between surface points and nearby tangent planes
For a smooth, closed surface and a point , let denote the plane tangent to at . ( passes through ; not necessarily through the origin.) Lemma 1, below, establishes a relationship between and for two nearby points . This relationship prepares us to prove in Section 4 that under suitable sampling conditions, a restricted Voronoi cell is a topological disk with a star-shaped projection on its site’s tangent plane. Lemma 1 is surprisingly strong; the constant (as it is applied in Theorem 6) will likely be hard to beat.
Let and be the two open balls of radius tangent to at , and let and be their centers. As and are subsets of the open medial balls at , they are disjoint from .
Lemma 1.
Consider two points such that , where . Then and lie on strictly opposite sides of .
Proof.
Suppose for the sake of contradiction that and do not lie on strictly opposite sides of , as illustrated in Figure 3, left. Then and . Moreover, either or does not intersect the relative interior of .
Let be the open medial ball tangent to at that is on the same side of as (either side if ), as illustrated. If is an open halfspace then , (as ), (as ), and the lemma follows. So assume is bounded. Its center lies on ’s medial axis. The line segment is perpendicular to .
Observe that is in the relative interior of . If , then . Otherwise, does not intersect the relative interior of , so , , and (the last two because and cannot be on the side of opposite from ). By Pythagoras’ Theorem, and . As lies on the medial axis, (by the definition of ), so .
The surface intersects none of the open balls , , or , but it passes between and at . As is closed and cuts space into two pieces, one containing and one containing , the ball must lie in one of those two pieces. Choose the labels and so that lies in the same piece as , as illustrated; then must be disjoint from . The radii of and are and respectively, so . Combining this with the inequality gives . Combining this with the inequality gives .
Let be the line through , , and (the vertical axis in Figure 3). Create a coordinate system with and such that is the coordinate in the direction parallel to and is the distance from to (the horizontal axis in Figure 3). Then . Rewrite this as . As , . Combining these with the inequality gives .
As , we have , which is equivalent to , hence . The result follows by contradiction.
4 Restricted Voronoi cells are topological disks
This section investigates sampling conditions that guarantee that (1) every restricted Voronoi cell has the topology of a closed disk (closed ball property A), (2) the projection of each restricted Voronoi cell onto its site’s tangent plane is star-shaped, and (3) no -face in intersects tangentially (generic intersection property E). Theorem 6 shows that a -Voronoi sample suffices, and Corollary 9 shows that a -sample suffices.
Consider a site , its Voronoi cell , and its restricted Voronoi cell . Let be the map that orthogonally projects onto . Note that .
Define a radial path to be a topological closed interval such that
-
1.
one endpoint of is the site ,
-
2.
the other endpoint – call it – lies on the boundary of ,
-
3.
every point on lies in the interior of , and
-
4.
is a homeomorphism from to a line segment on with endpoints and , where denotes the restriction of to the domain .
We will see that under suitable sampling conditions, every point in lies on exactly one radial path, except itself (Lemma 4). It follows that we can decompose into radial paths such that no two share a point besides (Lemma 5). That is, if we remove from each radial path, then we have a partition of into paths. Therefore, is star-shaped. Although itself is not star-shaped, its decomposition into radial paths is a curvy variant of “star-shaped.” As the lengths of the projected radial paths vary continuously with their polar angles, is homeomorphic to a closed disk (Theorem 6).
Let be the line normal to at (orthogonal to ). Let and be the two open balls of radius tangent to at , and let and be their centers. Then .
The following lemma implies that if you are standing on the boundary of and you walk toward on a radial path, you immediately enter the interior of . (The proof of Lemma 4 develops this idea further.) It also implies generic intersection property E.
Lemma 2.
Consider two distinct sites and a point . Suppose that where . Let be the plane that orthogonally bisects the line segment (thus ). By Lemma 1, intersects the relative interior of the line segment at a lone point . Let be the open ray , and observe that .
Then and are strictly on the same side of .
Proof.
See Figure 3, right. Neither nor intersects , hence neither ball contains , hence and . Therefore, each of and lies either on or on the same side of as , as illustrated. (More broadly, .) As and , does not intersect the relative interior of . By contrast, does intersect the relative interior of (at ). Recall that ’s origin lies on . Therefore, the open ray is strictly on the same side of as the relative interior of , which contains .
Lemma 4, below, shows that under suitable sampling conditions, every point in lies on one and only one radial path. It depends on the simple observation of Lemma 3.
Lemma 3.
Let be two points such that . There exists an open neighborhood of such that is a homeomorphism from to its image .
Proof.
As , by Lemma 1 (or Lemma 13), is not perpendicular to . It follows from the smoothness of that if is sufficiently small, is injective. As is injective and both and its inverse are continuous, is a homeomorphism.
Lemma 4.
Consider a site , its restricted Voronoi cell , and a point . Let be the closed ray with origin that passes through . Suppose that for every point , , where .
Then there is a unique radial path such that . Furthermore, is the only radial path such that .
Proof.
For every point (including ), , as if we have a contradiction: and imply that is in or and thus not in .
Define the point set (the intersection of with the closed halfplane with boundary , passing through ). Clearly, . Let be the connected component of that contains . We will show that is a radial path.
As , for every point , and by Lemma 3 there exists an open neighborhood of such that is a homeomorphism, so is a homeomorphism from to its image . In other words, is a local homeomorphism from to its image . As is connected and is embedded in the ray , is a (global) homeomorphism. (Intuitively, the map cannot cause the path to double back on itself, so is an injection.) Therefore, is a topological interval or a lone point.
As is compact and is closed, is compact and is compact. Let and be the endpoints of , chosen so that ; see Figure 4. As is a homeomorphism, and are the endpoints of . As contains and , and . We will show that (which implies that is star-shaped) and that is on the boundary of , thereby establishing the first two criteria for to be a radial path.
But first, we show that is in the interior of , the third criterion for to be a radial path. Suppose for the sake of contradiction that a point lies on the boundary of . Then also lies in the restricted Voronoi cell of another site , and where is the plane that orthogonally bisects . Clearly, . By Lemma 1, intersects at a lone point . Let be the open ray . Observe that ; moreover, is tangent to at , as illustrated in Figure 4.
By Lemma 2, and are strictly on the same side of . Hence if you walk along from to – opposite to the direction of – you enter ’s side of at the instant you leave , as illustrated. This contradicts the fact that . So is in the interior of .
Let us return to the first two criteria for to be a radial path. Consider a point . By Lemma 3, there exists an open neighborhood of such that is a homeomorphism. Define and let be the connected component of that contains , illustrated in Figure 4. As is in the interiors of and , is in the interior of . As is a homeomorphism, is in the relative interior of , so is a path (topological interval) on with in its relative interior.
First, consider the case where is in the interior of (but ). Then we can shrink the open neighborhood of so that and thus , and thereby have . As is the connected component of that contains , . Hence is not an endpoint of . We have seen that is in the interior of ; it follows that only and can be endpoints of . That is, the endpoint is either or . Moreover, as is an endpoint of , is on the boundary of (establishing the second criterion).
Second, consider the case where . In this case, the path looks like in Figure 4. We use this case to show that . Suppose for the sake of contradiction that ; then . It follows that as you walk along from , you exit the restricted Voronoi cell in both directions along . Let be the open ray where (hence ); is tangent to at . As exits , there exists a site and a plane that orthogonally bisects such that and enters ’s side of at . But this contradicts the fact that, by Lemma 2, and are strictly on the same side of . Thus , so .
Therefore, the endpoints of are and , is on the boundary of , is in its interior, and is a homeomorphism from to . By definition, is a radial path.
To see that is the only radial path containing , observe that every radial path containing is a subset of , and moreover is a subset of (because a radial path is connected). No strict subset of can be a radial path, because every connected strict subset of is missing either or a point on the boundary of .
The reasoning of this proof holds equally well if we replace with any other point , so every connected component of contains . Therefore, is connected. Hence and no radial path besides has its projection on .
It follows that we can decompose into radial paths. Hence is star-shaped. It also follows that the orthogonal projection , restricted to , is a homeomorphism.
Lemma 5.
Let be a site and let be its restricted Voronoi cell. Suppose that for every point , , where .
Let be the set of all radial paths for all points in .
Then ; hence is star-shaped. Moreover, no two paths in share a common point besides , and there is a one-to-one correspondence between paths in and points where intersects the boundary of .
Moreover, is a homeomorphism from to its image on .
Proof.
By Lemma 4, for each point , there is a unique radial path such that . Every radial path contains . Hence . As each lies on only one radial path, no two paths in share a common point besides . By definition, each radial path contains exactly one point on the boundary of . Hence there is a one-to-one correspondence between radial paths and points where intersects the boundary of .
Let us see that is an injection. Consider two points such that ; we will see that . For every radial path , is a homeomorphism by the definition of radial path, so if and lie on the same radial path, then . If and lie on distinct radial paths, then , because by Lemma 4, for any two distinct radial paths , and lie on two distinct rays with origin .
As is compact and is injective and continuous, is a homeomorphism [33].
Lemma 5 shows that is homeomorphic to its image on , but what is the shape of ? We obtain a homeomorphism from to a closed unit disk on by simply scaling each line segment to have unit length. Thus we arrive at this section’s main theorem, Theorem 6, which states that is a topological closed disk. The proof is deferred to the full-length paper [32], but here is a sketch of the ideas.
Let be the set of the orthogonal projections of the radial paths onto . Then we can write , a decomposition of into line segments with endpoint , no two leaving in the same direction (but every direction on is represented).
For every point , let be the length of the unique line segment in that contains . Thus is a function over the domain , but is not defined. One can show that is continuous [32]. This is a consequence of two facts: is a compact point set and every point on a line segment except one endpoint is in the interior of .
Let map each line segment in to a line segment with unit length (while preserving its direction) – specifically, for and . Then is continuous as is continuous and positive. As is a bijective, continuous map with a continuous inverse, is a homeomorphism from to a closed unit disk.
Theorem 6.
Let be a site and let be its restricted Voronoi cell. Suppose that for every point , , where .
Then is a homeomorphism from to a closed unit disk on .
If we impose the condition of Theorem 6 on all the restricted Voronoi cells, every connected component of has at least six sites on it. Lemma 7 follows easily from Lemmas 4 and 13, but there isn’t quite enough space here for the proof; see the full-length paper [32].
Lemma 7.
Let be an -Voronoi sample of for some . Every connected component of has at least six sites and six restricted Voronoi cells on it.
To apply Theorem 6 to -samples, observe that -samples are -Voronoi samples.
Lemma 8 (Feature Translation Lemma [3, 20]).
Let be a smooth, closed surface and let be points such that for some . Then
Corollary 9.
Let be an -sample of for .
Then every restricted Voronoi cell in is homeomorphic to a closed disk (closed disk property A), does not intersect any -face of tangentially (generic intersection property E), every connected component of has at least six sites and six restricted Voronoi cells on it, and no restricted Voronoi cell intersects the interior of another.
Proof.
Consider any site and any point . As is an -sample, . By the Feature Translation Lemma (Lemma 8), .
5 Restricted Voronoi vertices are lone points
A restricted Voronoi vertex is a nonempty intersection of with an edge in . However, without suitable sampling conditions, such an intersection might contain many points, even infinitely many. This section describes sampling conditions that guarantee closed ball property C: an intersection of three distinct restricted Voronoi cells contains at most one point, thereby justifying the name “vertex.” Generic intersection property F comes as a byproduct. Lemma 10 shows that a -Voronoi sample suffices, and Corollary 11 shows that a -sample suffices (which follows from Lemmas 10 and 8). Both proofs are postponed to the full-length paper [32], as restricted Voronoi vertices are not the bottleneck limiting our homeomorphism theorems’ sample bounds. (Restricted Voronoi edges are the bottleneck; see Section 6.) Note that Cheng et al. [18] prove Lemma 10 for a -Voronoi sample.
Lemma 10.
Consider three distinct sites and the triangle , where is the vertex at ’s largest plane angle. Let , the restricted Voronoi face dual to . Let be the line containing all points equidistant to the sites , , and (thus ). Suppose that for every point , , where is the positive real root of , with approximate value .
Then contains at most one point (i.e., a restricted Voronoi vertex). Moreover, if contains a point, is not tangent to at that point.
Corollary 11.
Let be an -sample of for . Consider three distinct sites and let . Let be the line containing all points equidistant to the sites , , and .
Then contains at most one point, and is not tangent to at that point.
6 Restricted Voronoi edges are topological intervals
Theorem 6 and Corollary 9 give conditions under which restricted Voronoi cells are topological closed disks. Lemma 10 and Corollary 11 give conditions under which the intersection of three distinct restricted Voronoi cells is at most one point. What about an intersection of two distinct restricted Voronoi cells? That could be empty, a restricted Voronoi vertex, or a restricted Voronoi edge, the last being a nonempty intersection of with a -face of . Under suitable sampling conditions, Lemma 17, below, guarantees closed ball property B: each restricted Voronoi edge is a topological interval.
The next six lemmas derive conditions in which an intersection is one interval or one isolated point. Lemma 15 applies to -samples, whereas Lemma 16 applies to -Voronoi samples, and Lemma 17 concludes both. Lemma 12 has no sampling requirements, only topological requirements; see the full-length paper for a proof [32].
Lemma 12.
Let be a restricted Voronoi diagram. Suppose that every restricted Voronoi cell is a topological closed disk and every intersection of three distinct restricted Voronoi cells is either empty or a lone point (henceforth called a restricted Voronoi vertex). Suppose also that no restricted Voronoi cell intersects the interior of another.
Then for every pair of distinct sites , is one of these three: empty; a topological circle containing no restricted Voronoi vertex; or a union of disjoint topological closed intervals and isolated points, where each isolated point is a restricted Voronoi vertex and each interval contains exactly two restricted Voronoi vertices which are its endpoints.
Moreover, if each connected component of has at least three sites in lying on it, then the possibility that is a topological circle is eliminated, every restricted Voronoi cell has at least two restricted Voronoi vertices on its boundary, and every connected component of has at least two restricted Voronoi vertices on it.
A closed cuts space into two pieces, a bounded inside piece and an unbounded outside piece. For a point , let denote the outside-facing vector normal to at (and normal to ). Let denote the angle separating two vectors.
Lemma 13 (Normal Variation Lemma [25]).
Consider two points and let . If , then where
Lemma 14 (Triangle Normal Lemma [25]).
Let be a triangle whose vertices lie on . Let be the radius of ’s circumscribing circle. Let be a vertex of and let be ’s plane angle at . Let be a vector normal to . Let denote the affine hull of . Then
Lemma 15.
Let be a restricted Voronoi vertex and let be its dual restricted Delaunay triangle. (If ’s dual face is a polygon, you may choose any three of its vertices.) Let be a vector normal to , directed so that (as illustrated in Figure 5). Let and suppose that .
Then and . Equivalently, and are positive.
Proof.
Let be the vertex at ’s largest plane angle. As , by the Normal Variation Lemma (Lemma 13), and .
Let be ’s circumradius. As Figure 5 illustrates, , because lies on the line perpendicular to through ’s circumcenter and is the distance from to that line. By the Feature Translation Lemma (Lemma 8), and . Hence and .
If ’s plane angle at is or greater, then by the Triangle Normal Lemma (Lemma 14), . Therefore, and .
Otherwise, ’s plane angle at is less than , so ’s largest plane angle (at ) is greater than . By the Triangle Normal Lemma, . Therefore, either or . The latter case is not possible, because . In the former case, and .
Lemma 16.
Let be a restricted Voronoi vertex and let be its dual restricted Delaunay triangle. (If ’s dual face is a polygon, you may choose any three of its vertices.) Let be the vertex at ’s largest plane angle. Let be a vector normal to , directed so that . Let and suppose that and .
Then and . Equivalently, and are positive.
The final lemma shows that a nonempty intersection of two restricted Voronoi cells is either a lone restricted Voronoi vertex (a “degenerate” case where four or more restricted Voronoi cells share a restricted Voronoi vertex, whereas the common case is three cells sharing a vertex) or a lone topological interval justifying the name “restricted Voronoi edge.”
Lemma 17.
Let be a restricted Voronoi diagram that satisfies all the conditions of Lemma 12, including the condition that at least three sites in lie on each connected component of . Suppose that closed ball property D and generic intersection properties E and F hold: no vertex of lies on , and no edge and no -face of intersects tangentially. Suppose also that for every restricted Voronoi vertex , either
-
for every site such that , or
-
for every site such that .
Let be two distinct sites, let , and let .
Then one of these three claims holds: is empty; is a lone point (a restricted Voronoi vertex) and is an edge; or is homeomorphic to a closed interval and is a -face.
Proof.
Suppose is nonempty. By Lemma 12, is a union of disjoint topological intervals and isolated points. As is nonempty and no vertex of lies on (closed ball property D), is not a vertex of . Hence is either an edge or a -face of . If is a Voronoi edge, then is the intersection of three or more Voronoi cells and thus is the intersection of three or more restricted Voronoi cells; so by assumption (the conditions of Lemma 12), is a lone restricted Voronoi vertex and the result holds.
Only the case where is a -face of remains. As closed ball property D and generic intersection properties E and F hold, cannot contain any isolated points; so is a union of disjoint topological intervals. By Lemma 12, each interval contains exactly two restricted Voronoi vertices, its endpoints. Both of them lie on the boundary of .
Let be an outside-facing vector normal to at . We will see shortly that is not perpendicular to . Assign a direction to each edge of such that the angle between and each directed edge is at most , as illustrated in Figure 6. As is a convex polygon, we thus partition its edges into two chains, each monotone in the direction . (An edge perpendicular to – there are at most two – can be assigned to either chain.)
Let be a restricted Voronoi vertex on an edge of . Let be ’s dual restricted Delaunay triangle (or polygon) with vertices and . Let be a vector that points in the same direction as , and observe that is normal to and . By Lemma 15 or Lemma 16, and . The latter implies that is not perpendicular to (as promised). The former implies that as one walks along one of the directed monotone chains, one might encounter a restricted Voronoi vertex where the chain passes from inside to outside , but not from outside to inside. Therefore, there can be only one restricted Voronoi vertex on each chain, and only two restricted Voronoi vertices on . It follows that is just a single topological interval.
7 The restricted Delaunay triangulation is homeomorphic to
We conclude with homeomorphism theorems for -samples and -Voronoi samples.
Theorem 18.
Let be a finite -sample of for some . Suppose that no vertex of the three-dimensional Voronoi diagram lies on . Then the underlying space of the restricted Delaunay triangulation, , is homeomorphic to .
Proof.
Corollary 9 guarantees closed ball property A and generic intersection property E. Corollary 11 guarantees closed ball property C and generic intersection property F. Closed ball property D holds by assumption. By Corollary 9, every connected component of has at least six sites on it and no restricted Voronoi cell intersects the interior of another; all the preconditions of Lemmas 12 and 17 are satisfied. Lemma 17 guarantees closed ball property B. As and satisfy the preconditions A–F of the Topological Ball Theorem [23], is homeomorphic to .
Theorem 19.
Let be a finite -Voronoi sample of for some . Suppose that no vertex of the three-dimensional Voronoi diagram lies on . Then the underlying space of the restricted Delaunay triangulation, , is homeomorphic to .
Proof.
References
- [1] Nina Amenta and Marshall W. Bern. Surface Reconstruction by Voronoi Filtering. Discrete & Computational Geometry, 22(4):481–504, June 1999. doi:10.1007/PL00009475.
- [2] Nina Amenta, Marshall W. Bern, and David Eppstein. The Crust and the -Skeleton: Combinatorial Curve Reconstruction. Graphical Models and Image Processing, 60(2):125–135, March 1998. doi:10.1006/gmip.1998.0465.
- [3] Nina Amenta, Sunghee Choi, Tamal K. Dey, and Naveen Leekha. A Simple Algorithm for Homeomorphic Surface Reconstruction. International Journal of Computational Geometry and Applications, 12(1–2):125–141, 2002. doi:10.1142/S0218195902000773.
- [4] Dominique Attali and André Lieutier. Geometry-Driven Collapses for Converting a Čech Complex into a Triangulation of a Nicely Triangulable Shape. Discrete & Computational Geometry, 54(4):798–825, December 2015. doi:10.1007/s00454-015-9733-7.
- [5] Håvard Bakke Bjerkevik. Tighter Bounds for Reconstruction from -Samples. In Xavier Goaoc and Michael Kerber, editors, 38th International Symposium on Computational Geometry, volume 224 of Leibniz International Proceedings in Informatics (LIPIcs), pages 9:1–9:17, Berlin, Germany, June 2022. Schloss Dagstuhl – Leibniz-Zentrum für Informatik. doi:10.4230/LIPIcs.SoCG.2022.9.
- [6] Jean-Daniel Boissonnat, Frédéric Chazal, and Mariette Yvinec. Geometric and Topological Inference, volume 57. Cambridge University Press, September 2018. doi:10.1017/9781108297806.
- [7] Jean-Daniel Boissonnat, Ramsay Dyer, and Arijit Ghosh. Delaunay Triangulation of Manifolds. Foundations of Computational Mathematics, 18(2):399–431, April 2018. doi:10.1007/s10208-017-9344-1.
- [8] Jean-Daniel Boissonnat, Ramsay Dyer, Arijit Ghosh, André Lieutier, and Mathijs Wintraecken. Local Conditions for Triangulating Submanifolds of Euclidean Space. Discrete & Computational Geometry, 66(2):666–686, September 2021. doi:10.1007/s00454-020-00233-9.
- [9] Jean-Daniel Boissonnat, Ramsay Dyer, Arijit Ghosh, and Nikolay Martynchuk. An Obstruction to Delaunay Triangulations in Riemannian Manifolds. Discrete & Computational Geometry, 59(1):226–237, January 2018. doi:10.1007/s00454-017-9908-5.
- [10] Jean-Daniel Boissonnat and Arijit Ghosh. Manifold Reconstruction Using Tangential Delaunay Complexes. Discrete & Computational Geometry, 51(1):221–267, January 2014. doi:10.1007/s00454-013-9557-2.
- [11] Jean-Daniel Boissonnat, Leonidas J. Guibas, and Steve Y. Oudot. Manifold Reconstruction in Arbitrary Dimensions Using Witness Complexes. Discrete & Computational Geometry, 42(1):37–70, July 2009. doi:10.1007/s00454-009-9175-1.
- [12] Jean-Daniel Boissonnat and Steve Oudot. Provably Good Surface Sampling and Approximation. In Symposium on Geometry Processing, pages 9–18. Eurographics Association, June 2003. doi:10.2312/SGP/SGP03/009-019.
- [13] Jean-Daniel Boissonnat and Steve Oudot. Provably Good Sampling and Meshing of Surfaces. Graphical Models, 67(5):405–451, September 2005. doi:10.1016/j.gmod.2005.01.004.
- [14] Dobrina Boltcheva and Bruno Lévy. Surface Reconstruction by Computing Restricted Voronoi Cells in Parallel. Computer-Aided Design, 90:123–134, September 2017. doi:10.1016/j.cad.2017.05.011.
- [15] Ho-Lun Cheng, Tamal Krishna Dey, Herbert Edelsbrunner, and John Sullivan. Dynamic Skin Triangulation. Discrete & Computational Geometry, 25(4):525–568, December 2001. doi:10.1007/s00454-001-0007-1.
- [16] Siu-Wing Cheng, Tamal Krishna Dey, and Edgar A. Ramos. Manifold Reconstruction from Point Samples. In Proceedings of the Sixteenth Annual Symposium on Discrete Algorithms, pages 1018–1027, Vancouver, British Columbia, Canada, January 2005. URL: http://dl.acm.org/citation.cfm?id=1070432.1070579.
- [17] Siu-Wing Cheng, Tamal Krishna Dey, Edgar A. Ramos, and Tathagata Ray. Sampling and Meshing a Surface with Guaranteed Topology and Geometry. SIAM Journal on Computing, 37(4):1199–1227, 2007. doi:10.1137/060665889.
- [18] Siu-Wing Cheng, Tamal Krishna Dey, and Jonathan Richard Shewchuk. Delaunay Mesh Generation. Chapman and Hall / CRC Computer and Information Science Series. CRC Press, Boca Raton, Florida, 2013. URL: http://www.crcpress.com/product/isbn/9781584887300.
- [19] David Cohen-Steiner, André Lieutier, and Julien Vuillamy. Lexicographic Optimal Homologous Chains and Applications to Point Cloud Triangulations. In Sergio Cabello and Danny Z. Chen, editors, 36th International Symposium on Computational Geometry, volume 164 of Leibniz International Proceedings in Informatics (LIPIcs), pages 32:1–32:17. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2020. doi:10.4230/LIPIcs.SoCG.2020.32.
- [20] Tamal Krishna Dey. Curve and Surface Reconstruction: Algorithms with Mathematical Analysis. Cambridge University Press, New York, 2007. doi:10.1017/CBO9780511546860.
- [21] Ramsay Dyer, Hao Zhang, and Torsten Möller. Delaunay Mesh Construction. In Proceedings of the Fifth Symposium on Geometry Processing, pages 273–282. Eurographics Association, July 2007. doi:10.2312/SGP/SGP07/273-282.
- [22] Ramsay Dyer, Hao Zhang, and Torsten Möller. Surface Sampling and the Intrinsic Voronoi Diagram. Computer Graphics Forum, 27(5):1393–1402, July 2008. doi:10.1111/j.1467-8659.2008.01279.x.
- [23] Herbert Edelsbrunner and Nimish R. Shah. Triangulating Topological Spaces. International Journal of Computational Geometry and Applications, 7(4):365–378, August 1997. doi:10.1142/S0218195997000223.
- [24] Marc Khoury and Jonathan Richard Shewchuk. Fixed Points of the Restricted Delaunay Triangulation Operator. In Sándor P. Fekete and Anna Lubiw, editors, 32nd International Symposium on Computational Geometry, volume 51 of Leibniz International Proceedings in Informatics (LIPIcs), pages 47:1–47:15, Boston, Massachusetts, June 2016. Schloss Dagstuhl – Leibniz-Zentrum für Informatik. doi:10.4230/LIPIcs.SOCG.2016.47.
- [25] Marc Khoury and Jonathan Richard Shewchuk. Approximation Bounds for Interpolation and Normals on Triangulated Surfaces and Manifolds, November 2019. arXiv:1911.03424.
- [26] Marc Khoury and Jonathan Richard Shewchuk. Restricted Constrained Delaunay Triangulations. In Kevin Buchin and Éric Colin de Verdière, editors, 37th International Symposium on Computational Geometry, volume 189 of Leibniz International Proceedings in Informatics (LIPIcs), pages 49:1–49:16, Buffalo, New York, June 2021. Schloss Dagstuhl – Leibniz-Zentrum für Informatik. doi:10.4230/LIPIcs.SoCG.2021.49.
- [27] Jisu Kim, Jaehyeok Shin, Frédéric Chazal, Alessandro Rinaldo, and Larry A. Wasserman. Homotopy Reconstruction via the Cech Complex and the Vietoris-Rips Complex. In Sergio Cabello and Danny Z. Chen, editors, 36th International Symposium on Computational Geometry, volume 164 of Leibniz International Proceedings in Informatics (LIPIcs), pages 54:1–54:19. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2020. doi:10.4230/LIPIcs.SoCG.2020.54.
- [28] Gregory Leibon. Random Delaunay Triangulations, the Thurston–Andreev Theorem, and Metric Uniformization. PhD thesis, University of California at San Diego, San Diego, California, 1999.
- [29] Partha Niyogi, Stephen Smale, and Shmuel Weinberger. Finding the Homology of Submanifolds with High Confidence from Random Samples. Discrete & Computational Geometry, 39(1–3):419–441, March 2008. doi:10.1007/s00454-008-9053-2.
- [30] Nicholas M. Patrikalakis and Takashi Maekawa. Shape Interrogation for Computer Aided Design and Manufacturing. Springer, 2002. doi:10.1007/978-3-642-04074-0.
- [31] Jeanne Pellerin, Bruno Lévy, and Guillaume Caumon. Toward Mixed-Element Meshing Based on Restricted Voronoi Diagrams. Procedia Engineering, 82:279–290, 2014. doi:10.1016/j.proeng.2014.10.390.
- [32] Jonathan Richard Shewchuk. Better Sampling Bounds for Restricted Delaunay Triangulations and a Star-Shaped Property for Restricted Voronoi Cells, March 2026. arXiv:2603.19826.
- [33] Wilson A. Sutherland. Introduction to Metric and Topological Spaces. Oxford University Press, second edition, 2009. doi:10.1093/oso/9780199563074.001.0001.
- [34] Pengfei Wang, Zixiong Wang, Shiqing Xin, Xifeng Gao, Wenping Wang, and Changhe Tu. Restricted Delaunay Triangulation for Explicit Surface Reconstruction. ACM Transactions on Graphics, 41(5):180:1–180:20, October 2022. doi:10.1145/3533768.
- [35] Dong-Ming Yan, Bruno Lévy, Yang Liu, Feng Sun, and Wenping Wang. Isotropic Remeshing with Fast and Exact Computation of Restricted Voronoi Diagram. Computer Graphics Forum, 28(5):1445–1454, 2009. doi:10.1111/j.1467-8659.2009.01521.x.
