• No results found

An Effective Condition for Sampling Surfaces with Guarantees

N/A
N/A
Protected

Academic year: 2022

Share "An Effective Condition for Sampling Surfaces with Guarantees"

Copied!
12
0
0

Laster.... (Se fulltekst nå)

Fulltekst

(1)

G. Elber, N. Patrikalakis, P. Brunet (Editors)

An Effective Condition for Sampling Surfaces with Guarantees

J-D Boissonnat and S. Oudot

INRIA, 2004 route des lucioles, 06902 Sophia-Antipolis, France. {Jean-Daniel.Boissonnat, Steve.Oudot}@sophia.inria.fr

Abstract

The notion ofε-sample, as introduced by Amenta and Bern, has proven to be a key concept in the theory of sampled surfaces.

Of particular interest is the fact that, if E is anε-sample of a smooth surface S for a sufficiently smallε, then the Delaunay triangulation of E restricted to S is a good approximation of S, both in a topological and in a geometric sense. Hence, if one can construct anε-sample, one also gets a good approximation of the surface. Moreover, correct reconstruction is ensured by various algorithms.

In this paper, we introduce the notion of looseε-sample. We show that the set of looseε-samples contains and is asymptotically identical to the set ofε-samples. The main advantage of looseε-samples overε-samples is that they are easier to check and to construct. We also present a simple algorithm that constructs provably good surface samples and meshes.

Categories and Subject Descriptors(according to ACM CCS): I.3.5 [Computer Graphics]: Curve, surface, solid, and object repre- sentations

This work has been partially supported by the IST Programme of the EU as a Shared-cost RTD (FET Open) Project under Contract No IST-2000-26473 (ECG - Effective Computational Geometry for Curves and Surfaces).

1. Introduction

Meshing and reconstructing surfaces are two fundamental prob- lems in geometry processing. In surface reconstruction, a finite set of pointsE on a surfaceSis given and one wants to compute a good approximation ofSfromE. This is of course only possible if Eis a good sample ofSin some sense. In surface mesh generation, the problem is somehow opposite. A surfaceSis known and we want to compute a triangulated surface that suitably approximates S. Clearly, the vertices of the triangulated surface have to sample correctlyS. Hence, in both applications and also in many others, including the new arena of point set surfaces [1, 2], the notion of good sample is crucial.

The notion ofε-sample, as introduced by Amenta and Bern [3], has proven to be a key concept in the theory of sampled surfaces.

Roughly, anε-sampleE of a surfaceSis a (non necessarily uni- form) point set that is sufficiently dense with respect to thedistance to the medial axisofS– see section 2. Of particular interest is the fact that ifEis anε-sample of a smooth surfaceSfor a sufficiently smallε, the Delaunay triangulation ofErestricted toS, Del|S(E), is a good approximation ofS, both in a topological and in a geometric sense (see section 2 for more details). Hence, given anε-sample of a surface, it is easy to get a good approximation of the surface.

This result (and variants of it) plays a central role in the analysis

of all surface reconstruction algorithms that offer theoretical guar- antees [9]. In particular, ifEis anε-sample of a smooth surfaceS for a sufficiently smallε, these algorithms can reconstruct a surface that has the same topology type asSand is close toS.

One drawback of the concept ofε-sample is the fact that it is dif- ficult to check whether a sample is anε-sample of a given surface, and even more difficult to construct a (preferably sparse)ε-sample of a given surface. This is due to the fact that a direct application of the definition of anε-sample leads to complicated operations like cutting the surface with balls.

In this paper, we introduce the notion of looseε-sample. The set of looseε-samples contains and is asymptotically identical to the set ofε-samples. The main advantage of looseε-samples overε- samples is that they are easier to check and to construct. Indeed, checking that a sample is a loose ε-sample reduces to checking whether a finite number of spheres are small enough with respect to the distance from their centers to the medial axis of the surface.

We also present a construction algorithm which is a variant of Chew’s surface meshing algorithm [14]. Given a smooth closed sur- faceS, the algorithm generates a sparseε-sampleEand at the same time a triangulated surface Del|S(E). The triangulated surface has the same topological type asS, is close toSfor the Hausdorff dis- tance (see theorem 4.8) and can provide good approximations of normals, areas and curvatures. A remarkable feature of the algo- rithm is that the surface needs only to be known through an oracle that, given a line segment, detects whether the segment intersects the surface and, in the affirmative, returns an intersection point and the distance to the medial axis at that point (or any smaller non-

(2)

zero quantity). This makes the algorithm useful in a wide variety of contexts and for a large class of surfaces.

The paper is organized as follows. In section 2, we recall useful concepts and introduce the notion of looseε-sample. In section 3, we present some local properties of looseε-samples that are used in section 4 to establish our main results. We prove that, for suffi- ciently smallε, Del|S(E)is a 2-manifold without boundary that is ambient isotopic toSand whose Hausdorff distance toSisO(ε2).

We also prove thatSis covered by the so-called surface Delaunay balls, and that looseε-samples areε(1+16ε)-samples. In section 5, we bound the size of looseε-samples. As an application of our results, we present in section 6 our surface mesh generator.

2. Definitions and preliminary observations

In the paper,Sdenotes a compact, orientable, twice-differentiable surface without boundary.Swill be called a smooth closed surface for short. By−→n(p)we denote the surface normal at pointpS, and byT(p)the plane tangent toSatp.

Our analysis uses the fact that locally a smooth surface is the graph of a function. More precisely, given an orthonormal frame (O,x,y,z)ofR3, a subset ofR3is said to bexy-monotoneif it is the graph of a function of the two variablesxandy. Aterrainis a sur- face that isxy-monotone in some frame(O,x,y,z)ofR3. Similarly, given an orthonormal frame(O,x,y)ofR2, a subset ofR2is said to bex-monotoneif it is the graph of a function of variablex.

2.1. Restricted Delaunay triangulation

In the paper,Edenotes a finite point sample ofSand Del(E)the 3- dimensional Delaunay triangulation ofE. ByV(E)we denote the set of the edges of the Voronoi diagram ofE.

We call Delaunay triangulation ofE restricted to S, and we note Del|S(E), the sub-complex of Del(E)that consists of the facets of Del(E)whose dual Voronoi edges intersectS. An edge or vertex of Del(E)belongs to Del|S(E)if it is incident to at least one facet of Del|S(E). Notice that we depart from the usual definition [14, 19]

and do not consider vertices and edges with no incident facet of Del|S(E).

A facet (resp. edge, vertex) of Del|S(E)is called arestricted De- launay facet(resp.restricted Delaunay edge,restricted Delaunay vertex). For a restricted Delaunay facet f, we callsurface Delau- nay ballof f any ball circumscribing f centered at some point of Sf, where f is the Voronoi edge dual to f. We callsurface Delaunay patchthe intersection of a surface Delaunay ball withS.

Notice that the centers of the surface Delaunay balls are precisely the intersection points ofSandV(E).

2.2. ε-samples and looseε-samples

Themedial axisofS, denoted byM, is the topological closure of the set of points ofR3that have more than one nearest neighbour inS.

For a pointx∈R3, we calldistance to the medial axisatx, and writedM(x), the Euclidean distance fromxto the medial axis ofS.

As noticed by Amenta and Bern [3], dM is 1-Lipschitz, i.e.

|dM(x)−dM(y)| ≤ kxyk.

We define dMinf = inf{dM(x),xS} and dMsup = sup{dM(x),xS}. Since S is a smooth closed surface, both dinfM anddsupM are finite and strictly positive constants.

We borrow from Amenta and Bern [3] the notion ofε-sample, defined below. In the whole paper,B(c,r)denotes the ball of center cand radiusr.

Definition 2.1Eis anε-sampleofSif∀xS,EB(x,εdM(x))6=

∅.

For sufficiently small values ofε,ε-samples enjoy many beautiful properties. We recall the most important ones in our context.

Normals:the angle between the normal to a facet fof Del|S(E) and the normal toSat the vertices offisO(ε)[3].

Area:the area of Del|S(E)approximates the area ofS[25].

Curvatures: the curvature tensor of S can be estimated from Del|S(E)[15].

Homeomorphism:Del|S(E)is homeomorphic toS[3].

Hausdorff distance: the Hausdorff distance between S and Del|S(E) isO(ε) [10]. In this paper, we give anO(ε2)bound (theorem 4.8).

Reconstruction:several algorithms can reconstruct fromEa sur- face that is homeomorphic [3, 4, 9, 17] or even ambient isotopic [6] toS.

We will show that these properties hold for looseε-samples as well.

Definition 2.2E is alooseε-sampleofSif∀xS∩ V(E), EB(x,εdM(x))6=∅.

Since the centers of the surface Delaunay balls are precisely the intersection points ofSwith the Voronoi edges,E is a loose ε-sample if and only if every surface Delaunay ballB(c,r)has a radius of at mostεdM(c).

ε-samples and looseε-samples are closely related but not iden- tical concepts. The next lemma follows from definitions 2.1 and 2.2.

Lemma 2.3IfEis anε-sample, then it is a looseε-sample.

The converse is true asymptotically, as we will see in section 4.3 (corollary 4.13).

2.3. Other notations

The following constants are used in the paper:

• ε0 is the only positive root of equation 1−8ε +arcsin1−εε

π4 = 0.ε0≈0.091.

•ε1is the only positive root of equation1−7ε +arcsinε1−ε3π4=0.

ε1≈0.096.

•ε2=4+9ππ ≈0.097.

• ε3 is the only positive root of equation 1−5εε +arcsinε1−ε3

π2 = 0.ε3≈0.17.

• ε4 is the only positive root of equation 1−4ε +arcsinε1−ε3

π4 = 0.ε4≈0.12.

We also use the notation(−→u,−→v)to denote the modulus of the angle (measured in[−π,π]) between vectors−→u and−→v ofR3, and

u.−→v to denote their dot-product.

102

(3)

3. Local properties of looseε-samples

In this section, we prove that surface Delaunay balls of sufficiently small radii keep important properties of planar disks. In particular, we show that they intersectSalong topological disks whose bound- aries pairwise intersect in at most two points (proposition 3.9).

3.1. Technical lemmas

In this paragraph, we recall several lemmas by Amenta and Bern [3] that will be useful in the remainder of the paper.

Lemma 3.1 Let fbe a facet of Del|S(E). Assume that every sur- face Delaunay ballB(c,r)offis such thatr≤ρdM(c), withρ<17. Letabe a vertex off. Ifahas an inner angle of at leastπ/3, then the smaller angle between the line normal tofand the normal toSata is at most arcsinρ1−ρ3. Otherwise, the smaller angle between the line normal to fand the normal toSatais at most1−7ρ +arcsinρ1−ρ3. Proof The radius of any surface Delaunay ball of f is at most

1−ρρ dM(a), thus the proof of lemma 7 of Amenta and Bern [3]

holds here.

Lemma 3.2 For any two points p and qon Swith kpqk ≤ ρ dM(p), the smaller angle between the line segment pqand the surface normal atpis at leastπ2−arcsinρ2.

Lemma 3.3 For any two points p and qon Swith kpqk ≤ ρ min{dM(p),dM(q)}, for anyρ< 13, the angle between the nor- mals toSatpand atqis at most 1−3ρρ .

We will need the two following corollaries of the above lemmas.

Lemma 3.4Letcandc0 be two points ofSsuch thatkcc0k ≤ ε(dM(c) +dM(c0)), whereε<18. There exists a vector−→v orthogo- nal to−→

cc0, such that the angle between−→v and the normal toSat any point ofSB(c,2εdM(c))is at most 1−8ε +arcsin1−εε . Hence, if ε≤ε0, this angle is at most π4.

Proof LetB+=B(c,2εdM(c)). We have

xB+S,kxck ≤2εdM(c) (1) thus

xB+S,dM(x) ≥dM(c)− kxck

≥(1−2ε)dM(c) (2) (1) and (2) give

xB+S,kxck ≤ 2ε

1−2ε min{dM(c),dM(x)} which implies, according to lemma 3.3,

xB+S,(−→n(x),−→n(c))≤ 2ε/(1−2ε)

1−6ε/(1−2ε) = 2ε 1−8ε We havekcc0k ≤εdM(c) +εdM(c0)≤2εdM(c) +εkcc0k, i.e.kcc0k ≤1−ε dM(c). Thus, lemma 3.2 tells that

min{(−→

cc0,−→n(c)),(−→n(c),−→ cc0)} ≥π

2−arcsin ε

1−ε (3) Inside plane(c,−→

cc0,−→n(c)), let−→v be the unitary vector that is or- thogonal to−→

cc0and has a positive scalar product with−→n(c). Ac- cording to (3) we have(−→n(c),−→v)≤arcsin1−εε . Thus,

xSB+,(−→n(x),−→v) ≤(−→n(x),−→n(c)) + (−→n(c),−→v)

1−8ε +arcsin1−εε

Lemma 3.5LetB=B(c,r)be a ball centered atcSof radius r≤εdM(c), withε<19, and letvbe a point ofSB. The normals toSatvand at any point ofSB(v,2r)make an angle of at most

1−9ε . Hence, ifε<ε2, this angle is less thanπ2and, by lemma 9.4, SB(v,2r)is a terrain.

Proof We haver≤εdM(c)≤ε (dM(v) +kvck), which is at mostε(dM(v) +r)sincevlies inB. Thus,r1−εε dM(v). There- fore,∀xSB(v,2r),

kxvk ≤2r≤1−ε dM(v)

1−ε (dM(x) +kxvk)

which implies kxvk ≤ 1−3ε dM(x). It follows thatkxvk ≤ ρmin{dM(x),dM(v)}, withρ= 1−3ε . Thus, according to lemma 3.3,

n(x),−→n(v)

≤ ρ

1−3ρ= 2ε 1−9ε

3.2. Topological disks and terrains

Lemma 3.6 ([8])LetBbe a ball that intersectsS. If the intersection is not a topological disk, thenBcontains a point of the medial axis ofS. As a consequence, ifEis a looseε-sample, withε<1, then surface Delaunay patches are topological disks.

Lemma 3.7IfE is a loose ε-sample, withε<ε2, then, for ev- ery surface Delaunay ball B=B(c,r), for any point xSB, SB(x,2r)is a topological disk and a terrain.

Proof Since E is a loose ε-sample, we have r ≤ε dM(c)≤ ε(dM(x) +kxck)≤ε(dM(x) +r), that is,r1−εε dM(x). Thus, 2r<dM(x)sinceε<ε2<13. According to lemma 3.6,SB(x,2r) is thus a topological disk. The fact thatSB(x,2r)is a terrain fol- lows from lemma 3.5, sinceε<ε2.

3.3. Pseudo-disks

Definition 3.8Topological disks are pseudo-disks if they pairwise intersect along topological disks (that may be empty or reduced to a point) and if their boundaries pairwise intersect in at most two points.

Observe that the boundaries of two pseudo-disks either do not intersect, or intersect in one point tangentially, or intersect in two points transversally.

Proposition 3.9IfEis a looseε-sample, withε≤ε0, then surface Delaunay patches are pseudo-disks.

Proof LetB=B(c,r)andB0=B(c0,r0)be two surface Delaunay balls. According to lemma 3.6,D=BSandD0=B0Sare topo- logical disks, sinceε≤ε0<1. Their boundariesCandC0are topo- logical circles. Let us assume that ballsBandB0intersect, the other case being trivial. Notice that none of them can be contained in the other one, since they are Delaunay balls. Thus, their bounding 103

(4)

P c z

y x

G

Γ

Ll

Lr

Figure 1:Definition of G

P c Cone

z y x

G’

G

Figure 2:Definition of G0

spheres∂Band∂B0also intersect. LetΓbe the circle∂B∩∂B0,ρ its radius (ρ<min{r,r0}) andPits supporting plane. We define

∆=BPand notice thatΓ=∂∆. SinceSis a closed surface, we haveC⊂∂BandC0⊂∂B0, which implies that

CC0S∩Γ (4)

LetB+=B(c,2r). Sincekcc0k ≤r+r0≤εdM(c) +εdM(c0), whereε≤ε0, by lemma 3.4 there exists a vector−→v orthogonal to

−→

cc0such that

xSB+,(−→n(x),−→v)≤π

4 (5)

Let us choose inR3a reference frame of originc, ofy-axis directed along−→

c0c, and ofz-axis directed along−→v. We callLlandLrthe two lines ofP, parallel to thez-axis, that are tangent toΓ. The region of Pbounded byLlandLris calledG(see figure 1). In the following, ξdenotesSB+G.

Lemma 3.10ξis a connectedx-monotone arc.

Proof According to (5), we have∀xSB+, (−→n(x),−→v)≤π4. Thus, by lemma 9.4, B+Sisxy-monotone, which implies that ξisx-monotone. Moreover, according to lemma 9.5,B+Slies outside the cone of apexcS, of vertical axis and of half-angleπ4.

The equation of the cone in our frame isz2=x2+y2. It intersects Palong two hyperbolic arcs of equationsz=±√

x2+d2, where dris the distance fromctoP. Consider the subregionG0 ofG that is bounded vertically by the two hyperbolic arcs (see figure 2).

SinceSB+lies outside the cone,ξis included inG0.

The points of G0 that are farthest from c are the points (±ρ,−d,±p

ρ2+d2). Their distance tocis q2(ρ2+d2)<2r

In other words, G0 ⊂int(B+). It follows that ξ is included in int(B+)and cannot intersect∂B+. Its endpoints must then lie on the vertical linesLr andLl. But there can be only one endpoint per vertical line, sinceξisx-monotone. Hence,ξhas at most two endpoints and is thus connected.

Lemma 3.11|S∩Γ| ≤2.

Proof Let us assume for a contradiction that|S∩Γ|>2. First, we show that there exists a point where the curvature ofξis high and hence the distance to the medial axisMis small. Then we work out a contradiction with the fact thatEis a looseε-sample, withε≤ε0. Claim 1There exists a pointqat which the curvature ofξis at least

1ρ.

Proof We made the assumption that|S∩Γ|>2. SinceΓ⊂Gand Γ⊂B+,ξalso intersectsΓmore than twice. And sinceξis con- nected by lemma 3.10, there is a subarcabofξthat lies outside∆ and whose endpointsaandblie onΓ. This subarc may be reduced to a point (a=b), sinceξmay be tangent toΓ. But in this case, in the vicinity ofa,ξis locally included in∆and tangent toΓata.

Thus, its curvature atais at least 1ρ, which proves the claim with q=a. So now we assume that arcabofξis not reduced to a point.

Sinceξisx-monotone by lemma 3.10,aandblie on the same half ofΓ, upper half or lower half (say upper half). Thus, the smaller arc ofΓthat joinsaandbis alsox-monotone. Then, by lemma 9.3, there is a pointqof arcabofξat which the curvature ofξis at least

1ρ, which proves the claim.

Claim 2dM(q)≤ρ√ 2.

Proof Let−→nξ(q)be the normal to planar curveξat pointq. By inequation (5),−→n(q)is not orthogonal toP, thus−→nξ(q)is oriented along the projection of−→n(q)ontoP. Hence, by lemma 9.2, we have (−→n(q),−→nξ(q))≤(−→n(q),−→v)which is at mostπ4by inequation (5).

According to theorem 9.1, we then have atq II(ξ00)≥cosπ

4kξ00k

ξ0is the unit tangent vector ofξatqandkξ00kis the curvature ofξ atq, which is more than 1ρaccording to claim 1. So, atqwe have

II(ξ00)≥ 1 ρ√

2 (6)

Recall thatIIis a symmetric bilinear form, thus it can be diago- nalized in an orthonormal frame, and its eigenvalues are the min- imum and maximum curvatures ofSatq. Let us call these val- uesκmin(q)andκmax(q)respectively. Sinceξ0is a unit vector, we haveII(ξ00)≤max{|κmin(q)|,|κmax(q)|}. It follows, according to (6), that max{|κmin(q)|,|κmax(q)|} ≥ρ12, or, equivalently, that the minimal radius of curvature ofSatqis at mostρ√

2. The result follows.

104

(5)

The end of the proof of the lemma is immediate. We have dM(c) ≤ dM(q) +kcqk

≤ ρ√ 2+2r

r(√ 2+2) So, the radius of ballBis at least 1

2+2 dM(c), which contradicts the assumption thatE is a looseε-sample, withε≤ε0< 1

2+2. From lemma 3.11, it immediately follows that|CC0| ≤2, by (4).

Lemma 3.12S∩∆is not reduced to two points.

Proof Let us assume thatSintersects∆in two points exactly, say aandb. Then, the subarc ofξthat joins pointsaandblies outside

∆. It follows, by the same reasoning as in the proof of claim 1, that there exists some pointqofξat which the curvature ofξis at least 1ρ. It follows by claim 2 thatdM(q)≤ρ√

2, which leads to a contradiction, as in the end of the proof of lemma 3.11.

It follows from the above lemmas thatDandD0 intersect along a topological disk. The result is clear if DD0 or if D0D.

Otherwise, we have|CC0| ≤2, by lemma 3.11. If|CC0|=0, thenDD0 is empty. If|CC0|=1, thenDD0 is reduced to a point. If |CC0|=2, thenDD0 is either a topological disk or equal toCC0. But ifDD0=CC0, then S∩∆=CC0 sinceCC0S∩∆⊆DD0. This contradicts lemma 3.12. Hence, DD0is not equal toCC0and is therefore a topological disk. This ends the proof of proposition 3.9.

4. Global properties of looseε-samples

In this section,Eis a looseε-sample ofS, withε≤ε0. We prove that Del|S(E)is a manifold without boundary (theorem 4.5), ambi- ent isotopic toS(corollary 4.7), at Hausdorff distanceO(ε2)from S(theorem 4.8). From the latter we deduce thatEis anε(1+16ε)- sample ofS(corollary 4.13). We also prove that the surface Delau- nay balls coverS(theorem 4.15).

4.1. Manifold

We first prove that every edge of Del|S(E)is incident to exactly two facets of Del|S(E). We then prove that every vertex of Del|S(E)has only oneumbrella. An umbrella of a vertexvis a subset of facets of Del|S(E)incident tovwhose adjacency graph is a cycle.

Lemma 4.1The dual of a facet of Del|S(E)intersectsSonly once, and transversally.

Proof Let f be a facet of Del|S(E), and fits dual Voronoi edge.

We denote byathe vertex offthat has the largest inner angle. We have ˆaπ3, and sinceε≤ε0<17, lemma 3.1 says that

n(a),−→nf

≤arcsinε√ 3

1−ε (7)

where−→nf denotes the unitary vector orthogonal to f that makes the smaller angle with−→n(a). LetBabe the ballB(a,1−εε dM(a)).

For any surface Delaunay ballB(c,r)that circumscribesf, we have kcak=r ≤εdM(c)

≤ε(dM(a) +kcak)

Hence,kcak ≤1−εε dM(a). In other words, every center of sur- face Delaunay ball offlies inBa. In addition, we have

xBaS,kxak ≤1−εε dM(a)

1−εε (dM(x) +kxak) which implieskxak ≤1−2εε dM(x). According to lemma 3.3, we then have∀xBaS,

(−→n(x),−→n(a))≤ ε/(1−2ε)

1−3ε/(1−2ε)= ε

1−5ε (8)

(7) and (8) give

xBaS, −→n(x),−→nf

≤(−→n(x),−→n(a)) + −→n(a),−→nf

1−5εε +arcsinε1−ε3

which is less thanπ2 sinceε≤ε03. Thus, by lemma 9.4,BaS is a terrain over the planeΠfthat supportsf. Sincefis orthogonal toΠf, it cannot intersectBaSmore than once, nor tangentially.

And since every center of surface Delaunay ball of flies inBa, f cannot intersectSmore than once, nor tangentially.

For a restricted Delaunay facetf, we denote byBf= (cf,rf)the corresponding surface Delaunay ball. The surface Delaunay patch of f,SBf, is denoted byDf. We defineCf=∂Df.

Lemma 4.2Let f and f0be restricted Delaunay facets that share an edge. They make a dihedral angle greater thanπ2.

Proof This result is a consequence of theorem 1 of [24]. The latter states that the dihedral angle is at leastπ−2

1−4ε+arcsinε1−ε3 , which is greater than π2sinceε≤ε04.

From lemmas 4.1 and 4.2 we deduce the following result.

Proposition 4.3Every edge of Del|S(E)is incident to exactly two facets of Del|S(E).

Proof Letebe an edge of Del|S(E). We denote byethe Voronoi face dual toe. SinceShas no boundary,S∩aff(e)is a union of simple closed curves, none of which intersects the boundary∂eof etangentially, by lemma 4.1. Thus, by the Jordan curve theorem, each curve ofS∩aff(e)intersects∂eat an even number of points.

It follows thatSintersects∂eat an even number of points. More- over, by lemma 4.1, each edge of∂ecan be intersected at most once byS. Thus,Sintersects an even number of edges of∂e, and eis incident to an even number of restricted Delaunay facets.

In addition, two restricted Delaunay facets incident toemake a di- hedral angle greater than π2, by lemma 4.2. It follows thatemay be incident to at most three restricted Delaunay facets. In conclu- sion, the number of restricted Delaunay facets incident toeis even, strictly positive (sincee∈Del|S(E)) and at most three, hence it is equal to two.

It follows from the above proposition that the restricted Delau- nay facets incident to a vertex of Del|S(E)form a set of umbrellas.

Proposition 4.4Every vertex of Del|S(E)has exactly one umbrella.

Proof Letabe a vertex of Del|S(E). Let F(a)be the set of all facets of Del|S(E)that are incident toa. Letfabe the facet ofF(a) that has the surface Delaunay ball of largest radius. We callrfathis radius. ThenB(a,2rfa)contains the surface Delaunay balls of all facets ofF(a). Moreover, by lemma 3.7,SB(a,2rfa)is a topolog- ical disk and a terrain over some planeΠ. We projectSB(a,2rfa) ontoΠ. This projection preserves topological properties such as 105

(6)

pseudo-disks. For simplicity of notations, we shall identify objects with their projection ontoΠ. LetF1(a)be an umbrella ofa. We call U1(a)the union of the facets ofF1(a), andR1(a)the union of the surface Delaunay patches associated with the facets ofF1(a).

Claim a∈int(R1(a)).

Proof Ifa∈int(U1(a)), then it is clear thata∈int(R1(a)), since surface Delaunay patches are pseudo-disks, by proposition 3.9.

Now, let us assume thatalies on the boundary ofU1(a). Let[av]

be an edge of the boundary that is incident toa. By proposition 4.3, [av]is incident to two facets of Del|S(E), say(a,v,x)and(a,v,x0).

These facets belong toF1(a)since they are incident toa, and they both lie on the same side of[av]which is a boundary edge ofU1(a).

Thus, since surface Delaunay patches are pseudo-disks by proposi- tion 3.9, eitherxis included in the interior of the surface Delaunay patch of(a,v,x0)orx0is included in the interior of the surface De- launay patch of(a,v,x), which violates the Delaunay property.

We now assume for a contradiction that there exists a restricted Delaunay facet f= (a,b,d)∈/F1(a)that is incident toa. Vertices banddlie outside int(R1(a)), whereasalies in int(R1(a)), by the above claim. It follows thatCf intersects the boundary ofR1(a), at some pointzthat lies on the boundary of the surface Delaunay patch of some facet f0= (a,b0,d0)ofF1(a). By proposition 3.9,Cf and Cf0 intersect at pointsaandzonly. By the same proposition, open arcs(a,b0)and(a,d0)ofCf0are included in int(R1(a)). Sincea∈ int(R1(a)),zlies on arc(b0,d0)ofCf0. Ifz6=b0andz6=d0, thenb0 andd0lie on different sides ofCf, hence one of them lies in int(Df), which violates the Delaunay property. Otherwise (sayz=b0),d0 must lie outsideDf. In this case, consider the facet f00= (a,b0,d00) ofF1(a)that is incident to f0through edge[a,b0]. By proposition 3.9,Cfintersects arc(b0,d00)ofCf00at pointb0only, thusd0andd00 lie on different sides ofCf. Hence, eitherd0ord00lies in int(Df), which violates the Delaunay property.

The next theorem follows from propositions 4.3 and 4.4.

Theorem 4.5 LetSbe a smooth closed surface andE a looseε- sample ofS. Ifε≤ε0≈0.091, then Del|S(E)is a 2-manifold with- out boundary.

Since Del|S(E)is a closed 2-manifold embedded inR3, we can orient the normals of its facets consistently. For instance, they can be chosen so as to point to the unbounded component of R3\Del|S(E).

4.2. Homeomorphism and ambient isotopy

Letπ: R3Smap each point ofR3to the closest point ofS. In [4], the authors have shown that the restriction ofπto a 2-simplicial complexW whose vertices lie onSis a homeomorphism between WandS, provided that:

H0 Wis a manifold without boundary.

H1 Whas a vertex on each connected component ofS.

H2 The angle between the oriented normals of any two incident facets ofWis less thanπ2.

H3(SMALLTRIANGLECONDITION) every facet f ofW has a circumcircle of radius at most 1−ε1.3εdM(a), whereais any vertex of

f.

H4 (FLAT TRIANGLE CONDITION) the normal to ev- ery facet f of W makes an angle of at most arcsin1−ε1.3ε + arcsin 2

3sin

2arcsin1.3ε1−ε

with−→n(a), whereais the vertex with the largest interior angle inf.

We will show that H0, H2, H3 and H4 are satisfied byW = Del|S(E)in our context. H0 has already been stated for Del|S(E) in theorem 4.5.

Proofof H2

Letabe a vertex of Del|S(E)and letF(a)be the umbrella ofa. By lemma 3.1, the smaller angle between−→n(a)and the line normal to any facet ofF(a)is at most 1−7ε +arcsinε1−ε3, which is less than

π4 sinceε≤ε01. It follows that the angle between−→n(a)and the oriented normal of the facet is less than π4 or greater than 4. Moreover, any two consecutive facets in the umbrella ofamake a dihedral angle greater than π2, by lemma 4.2, thus the angles be- tween−→n(a)and the oriented normals of the facets ofF(a)are all less thanπ4, or they are all greater than4. It follows that the angle between the oriented normals of any two facets ofF(a)is less than

π2.

Proof of H3

SinceEis a looseε-sample, every facetfof Del|S(E)has a surface Delaunay ballBf=B(cf,rf)of radiusrf≤εdM(cf). Letabe any vertex of f. We havedM(cf)≤dM(a) +kacfk ≤dM(a) +rf, thus rf1−εε dM(a). It follows that the circumcircle of f has a radius of at most1−εε dM(a)≤1−ε1.3εdM(a). Sinceε≤ε0, the radius is at most 1−εε00 dM(a)≈0.1dM(a).

Proof of H4

Let f∈Del|S(E)andabe the vertex of f with the largest inner angle. By lemma 3.1, we have(−→nf,−→n(a))≤arcsinε1−ε3, which is at most arcsin1−ε1.3ε+arcsin 2

3sin

2arcsin1.3ε1−ε

. Sinceε≤ε0, the angle is at most arcsinε1−ε030≈0.175 radians.

The following result is then a direct consequence of theorem 19 of [4].

Theorem 4.6LetSbe a smooth closed surface andE a looseε- sample ofS, withε≤ε0≈0.091, such that Del|S(E)has a vertex on each connected component ofS. Then the restriction of the map- pingπto Del|S(E)is a homeomorphism between Del|S(E)andS.

Corollary 4.7LetSbe a smooth closed surface andEa looseε- sample ofS, withε≤ε0≈0.091, such that Del|S(E)has a vertex on each connected component ofS. Then Del|S(E)andSare ambient isotopic.

ProofSince the SMALLTRIANGLECONDITIONis verified by the facets of Del|S(E), lemma 12 of [4] tells that∀x∈Del|S(E),kx− π(x)k<0.165dM(π(x)). Moreover, according to theorem 4.6,πis a homeomorphism between Del|S(E)andS. Thus, by theorem 9 of [6], Del|S(E)andSare ambient isotopic.

4.3. Hausdorff distance

Theorem 4.8LetSbe a smooth closed surface andE a looseε- sample ofS, withε≤ε0≈0.091, such that Del|S(E)has a vertex on each connected component ofS. Then the Hausdorff distance betweenSand Del|S(E)is at most 8.5ε2dMsup.

106

(7)

The idea is to bound the distance from Del|S(E)toS, and then to use the surjectivity ofπto prove that the bound also holds for the distance fromSto Del|S(E).

Lemma 4.9 Let cS. For any point xSat distance at most εdM(c)fromc, the distance fromxtoT(c)is at most12ε2dM(c).

Proof LetB1andB2be the two balls of radiusdM(c), tangent toS atc. Their interiors cannot intersectSand therefore do not contain x. Letx0be the intersection point other thancof the segment[c,x]

with the boundary ofB1B2. Lethbe the distance ofxtoT(c)and θthe angle between−→cxandT(c). We have

kcx0k=2dM(c)sinθ≤ kcxk ≤εdM(c) Therefore, sinθ≤ε2 andh=kcxksinθ≤12ε2dM(c).

Lemma 4.10LetcSand letybe a point ofT(c)at distance at mostεdM(c)fromc. The distance ofytoSis at most 8ε2dM(c).

Proof Letzbe the point ofSclosest toy,tits projection ontoT(c) andφ=∠yzt, which is also the angle between the normals toSat candz. We have

kczk ≤ kcyk+kyzk ≤2kcyk ≤2εdM(c) It then follows from lemma 4.9 thatkztk ≤4ε2dM(c). Moreover, dM(c)≤dM(z) +kczk, thuskczk ≤ 1−2ε dM(z). It follows from lemma 3.3 thatφ≤1−8ε . Sinceε≤ε0≤0.1, we have1−8ε ≤ 1, thusφ≤1. It follows that cos1φ1−1φ2

2 ≤1+φ2, from which we deduce

kyzk=kcosφztk ≤4ε2dM(c)

1+

1−8ε

2

≤8ε2dM(c)

With lemmas 4.9 and 4.10, we can bound the distance from Del|S(E)toS.

Proposition 4.11Every pointx∈Del|S(E)is at distance at most 8.5ε2dM(c)≤8.5ε2dMsupfromS, wherecis the center of the sur- face Delaunay ball of the facet that containsx.

Proof Letx∈Del|S(E). Let f be a facet of Del|S(E)on whichx lies, and letB(c,r)be the surface Delaunay ball off. Letx0be the orthogonal projection ofxontoT(c). For any vertexaof f, we havekack ≤r, which is at mostεdM(c)sinceE is a looseε- sample. Thus, by lemma 4.9, the distance fromatoT(c)is at most

12ε2dM(c). Since this is true for every vertex off, it is also true for any point of f, and forxin particular. Hence,kxx0k ≤12ε2dM(c).

In addition, we havekx0ck ≤ kxck ≤εdM(c). Thus, by lemma 4.10, the distance fromx0toSis at most 8ε2dM(c). It follows that the distance fromxtoSis at most 8.5ε2dM(c)≤8.5ε2dMsup.

We can now bound the distance fromSto Del|S(E), which com- pletes the proof of theorem 4.8.

Proposition 4.12 Every point xS is at distance at most min{8.5ε2dsupM ,10.5ε2dM(x)}from Del|S(E).

Proof LetxS. Since the restriction ofπto Del|S(E)is surjec- tive, we haveπ−1|Del|S(E)(x)6=∅. Letx0∈π−1|Del|S(E)(x). According to proposition 4.11,kxx0k ≤8.5ε2dM(c)≤8.5ε2dMsup, wherecis the center of the surface Delaunay ball of the facet that containsx0.

In addition, we havekx0ck ≤ε dM(c), since E is a looseε- sample. Thus,kxck ≤(ε+8.5ε2)dM(c)≤(ε+8.5ε2)(dM(x) + kxck). It follows that kxck ≤ 1−ε−8.5ε+8.5ε2ε2dM(x), which is at most 0.2dM(x)sinceε≤ε0. Hence,

kxx0k ≤8.5ε2dM(c)≤8.5ε2(dM(x) +kxck)≤10.5ε2dM(x)

By lemma 2.3, we know thatε-samples are looseε-samples. The converse is not true but the following corollary shows that loose ε-samples are close to beε-samples.

Corollary 4.13LetSbe a smooth closed surface andEa looseε- sample ofS, withε≤ε0≈0.091, such that Del|S(E)has a vertex on each connected component ofS. ThenEis anε(1+16ε)-sample ofS.

Proof By proposition 4.12, any pointxSis at distance at most 10.5ε2dM(x)from Del|S(E). Letx0be the point of Del|S(E)clos- est tox, and f the facet of Del|S(E)that contains x0. We callc the center of the surface Delaunay ball of f, andc0the center of the circumcircle off. Letabe the vertex of f closest tox0. Since x0 belongs to f, we havekx0ak ≤ kc0ak ≤ kcak. More- over,kcak ≤εdM(c)≤ε(dM(a) +kcak), that is,kcak ≤

1−εε dM(a). Thus,

kxak ≤ kxx0k+kx0ak

≤10.5ε2dM(x) +1−εε dM(a)

≤10.5ε2dM(x) +1−εε (dM(x) +kxak) It follows that

kxak ≤10.5(1−ε)

1−2ε ε2dM(x) + ε 1−2εdM(x) Sinceε≤ε0, we have10.5(1−ε)1−2ε ≤12 and 1−2ε1 ≤1+4ε, thus,

kxak ≤12ε2dM(x) +ε(1+4ε)dM(x)

4.4. Covering

LetSf∈Del|S(E)Bf (orSfBf, for short) denote the union of the surface Delaunay balls.

Letf0= (a,b,c)be a facet of Del|S(E). Our goal is to prove that Cf0⊂int

SfBf

. In fact, we will prove a slightly more precise result, stated as lemma 4.14.

LetF(f0)be the set of all facets of Del|S(E)that are incident to f0, except f0. Since, by theorem 4.5, Del|S(E)is a manifold with- out boundary,F(f0)contains one facet of Del|S(E)incident tof0 through each edge of f0. We defineR(f0)as the union of all surface Delaunay patches associated with facets ofF(f0).

Lemma 4.14Cf0⊆int(R(f0)∪Df0).

Proof We call fab, fbcand facthe three facets ofF(f0)that are incident to f0through edgesab,bcandacrespectively. By propo- sition 3.9, arcsab,bcandacofCf0are included inDfab,Dfbcand Dfacrespectively, and only their endpoints may lie onCfab,Cfbcor Cfac. Thus, the three arcs are included in the interior ofR(f0), ex- cept for their endpoints which may possibly lie on some boundary 107

Referanser

RELATERTE DOKUMENTER

We may as- sume that for sufficiently large c 0 and for surfaces sampled densely enough the normal cone condition guarantees that the corresponding surface patch can be seen as a

In this paper we present an algorithm that uses these properties to generate a piecewise linear approximation of implicit curves and surfaces, that is isotopic to the curve or

To make the implicit surface sensitive to fea- tures of the original sampled surface, we take the width of the Gaussian function to be a fraction of the local feature size..

F or the classes of smooth surfaces studied the representation is unique. That is, the surface σ can be reconstructed from its two representing planar regions. ALL surfaces can

Supposing that the surface is an ideal reflector or refractor, point ~l that receives the illumination of a light source after a single or multiple reflection or re- fraction can

Approximating Subdivision with RBF Kernels A key observation for our method is that if we study the be- havior of a subdivision algorithm (surface or volume) after an infinite number

4.3 Subdivision Surfaces 157 According to the benchmarks presented above, the distance between an arbitrary point and a subdivision surface should be determined using an efficient

Our contributions are twofold: (1) a theoret- ical surface in which the road intersection zones are modeled by Coons patches while the trajectories between intersection are given by