1/50 department of computer science and engineering localized delaunay refinement for sampling and...
TRANSCRIPT
![Page 1: 1/50 Department of Computer Science and Engineering Localized Delaunay Refinement for Sampling and Meshing Tamal K. Dey Joshua A. Levine Andrew G. Slatton](https://reader036.vdocuments.us/reader036/viewer/2022062804/56649d145503460f949e88b9/html5/thumbnails/1.jpg)
1/50Department of Computer Science and Engineering
Localized Delaunay Refinement for Sampling
and Meshing
Tamal K. Dey Joshua A. Levine Andrew G. Slatton
The Ohio State University
![Page 2: 1/50 Department of Computer Science and Engineering Localized Delaunay Refinement for Sampling and Meshing Tamal K. Dey Joshua A. Levine Andrew G. Slatton](https://reader036.vdocuments.us/reader036/viewer/2022062804/56649d145503460f949e88b9/html5/thumbnails/2.jpg)
2/50Department of Computer Science and Engineering
Restricted Delaunay
• Del S|M: Collection of Delaunay simplices t where Vt intersects M
![Page 3: 1/50 Department of Computer Science and Engineering Localized Delaunay Refinement for Sampling and Meshing Tamal K. Dey Joshua A. Levine Andrew G. Slatton](https://reader036.vdocuments.us/reader036/viewer/2022062804/56649d145503460f949e88b9/html5/thumbnails/3.jpg)
3/50Department of Computer Science and Engineering
Delaunay Refinement
• Input surface M• Check
conditions• If violated,
insert• Vt∩M into S
• Output: Del S|M
![Page 4: 1/50 Department of Computer Science and Engineering Localized Delaunay Refinement for Sampling and Meshing Tamal K. Dey Joshua A. Levine Andrew G. Slatton](https://reader036.vdocuments.us/reader036/viewer/2022062804/56649d145503460f949e88b9/html5/thumbnails/4.jpg)
4/50Department of Computer Science and Engineering
Existing Methods
• Check surface Delaunay ball size [BO05]
• Check topological disk [CDRR06]
![Page 5: 1/50 Department of Computer Science and Engineering Localized Delaunay Refinement for Sampling and Meshing Tamal K. Dey Joshua A. Levine Andrew G. Slatton](https://reader036.vdocuments.us/reader036/viewer/2022062804/56649d145503460f949e88b9/html5/thumbnails/5.jpg)
5/50Department of Computer Science and Engineering
Limitations
• Traditional refinement maintains Delaunay triangulation in memory
• This does not scale well• Causes memory thrashing• May be aborted by OS
![Page 6: 1/50 Department of Computer Science and Engineering Localized Delaunay Refinement for Sampling and Meshing Tamal K. Dey Joshua A. Levine Andrew G. Slatton](https://reader036.vdocuments.us/reader036/viewer/2022062804/56649d145503460f949e88b9/html5/thumbnails/6.jpg)
6/50Department of Computer Science and Engineering
Our Contribution
• A simple algorithm that avoids the scaling issues of the Delaunay triangulation• Avoids memory thrashing• Topological and geometric guarantees• Guarantee of termination• Potentially parallelizable
![Page 7: 1/50 Department of Computer Science and Engineering Localized Delaunay Refinement for Sampling and Meshing Tamal K. Dey Joshua A. Levine Andrew G. Slatton](https://reader036.vdocuments.us/reader036/viewer/2022062804/56649d145503460f949e88b9/html5/thumbnails/7.jpg)
7/50Department of Computer Science and Engineering
A Natural Solution
• Use an octree T to divide S and process points in each node v of T separately
![Page 8: 1/50 Department of Computer Science and Engineering Localized Delaunay Refinement for Sampling and Meshing Tamal K. Dey Joshua A. Levine Andrew G. Slatton](https://reader036.vdocuments.us/reader036/viewer/2022062804/56649d145503460f949e88b9/html5/thumbnails/8.jpg)
8/50Department of Computer Science and Engineering
Two Concerns
• Termination• Mesh consistency
![Page 9: 1/50 Department of Computer Science and Engineering Localized Delaunay Refinement for Sampling and Meshing Tamal K. Dey Joshua A. Levine Andrew G. Slatton](https://reader036.vdocuments.us/reader036/viewer/2022062804/56649d145503460f949e88b9/html5/thumbnails/9.jpg)
9/50Department of Computer Science and Engineering
Termination Trouble
• A locally furthest point in node v can be very close to a point in other nodes
![Page 10: 1/50 Department of Computer Science and Engineering Localized Delaunay Refinement for Sampling and Meshing Tamal K. Dey Joshua A. Levine Andrew G. Slatton](https://reader036.vdocuments.us/reader036/viewer/2022062804/56649d145503460f949e88b9/html5/thumbnails/10.jpg)
10/50Department of Computer Science and Engineering
Messing Mesh Consistency
• Individual meshes do not blend consistently across boundaries
![Page 11: 1/50 Department of Computer Science and Engineering Localized Delaunay Refinement for Sampling and Meshing Tamal K. Dey Joshua A. Levine Andrew G. Slatton](https://reader036.vdocuments.us/reader036/viewer/2022062804/56649d145503460f949e88b9/html5/thumbnails/11.jpg)
11/50Department of Computer Science and Engineering
LocDel Algorithm: Overview
• Process nodes from a queue Q• Refines nodes with parameter λ if
there are violations
![Page 12: 1/50 Department of Computer Science and Engineering Localized Delaunay Refinement for Sampling and Meshing Tamal K. Dey Joshua A. Levine Andrew G. Slatton](https://reader036.vdocuments.us/reader036/viewer/2022062804/56649d145503460f949e88b9/html5/thumbnails/12.jpg)
12/50Department of Computer Science and Engineering
Splitting and reprocessing
• Split• Let S = ∩ S
• Split into eight children if ||S||> • Reprocess
![Page 13: 1/50 Department of Computer Science and Engineering Localized Delaunay Refinement for Sampling and Meshing Tamal K. Dey Joshua A. Levine Andrew G. Slatton](https://reader036.vdocuments.us/reader036/viewer/2022062804/56649d145503460f949e88b9/html5/thumbnails/13.jpg)
13/50Department of Computer Science and Engineering
Splitting
![Page 14: 1/50 Department of Computer Science and Engineering Localized Delaunay Refinement for Sampling and Meshing Tamal K. Dey Joshua A. Levine Andrew G. Slatton](https://reader036.vdocuments.us/reader036/viewer/2022062804/56649d145503460f949e88b9/html5/thumbnails/14.jpg)
14/50Department of Computer Science and Engineering
Refining node
• Augment• Assemble
R=NUS
• Compute Del R|M
• Refine• Surface Delaunay
ball larger than λ
• Fp Del R|M is not a disk
![Page 15: 1/50 Department of Computer Science and Engineering Localized Delaunay Refinement for Sampling and Meshing Tamal K. Dey Joshua A. Levine Andrew G. Slatton](https://reader036.vdocuments.us/reader036/viewer/2022062804/56649d145503460f949e88b9/html5/thumbnails/15.jpg)
15/50Department of Computer Science and Engineering
Returned points for violations
• Checking Violations • Large triangle t incident to p ϵ S
•Radius of surface ball > λ•Return (p,p*) where p* is furthest dual(t) ∩
M
• Non-disk surface star Fp
•Return (p,p*) where p* is the furthest dual(t) ∩ M among all triangles
![Page 16: 1/50 Department of Computer Science and Engineering Localized Delaunay Refinement for Sampling and Meshing Tamal K. Dey Joshua A. Levine Andrew G. Slatton](https://reader036.vdocuments.us/reader036/viewer/2022062804/56649d145503460f949e88b9/html5/thumbnails/16.jpg)
16/50Department of Computer Science and Engineering
Point Insertions
• Modified insertion strategy• If nearest point s
ϵ S to p* is within λ/8 and s ≠ p, then add s to R
• Else add p* to R
• p* augments S, but s does not
![Page 17: 1/50 Department of Computer Science and Engineering Localized Delaunay Refinement for Sampling and Meshing Tamal K. Dey Joshua A. Levine Andrew G. Slatton](https://reader036.vdocuments.us/reader036/viewer/2022062804/56649d145503460f949e88b9/html5/thumbnails/17.jpg)
18/50Department of Computer Science and Engineering
Reprocessing nodes
• Needed for mesh consistency• Suppose s is
added• Enqueue each
node ' ≠ s.t. d(s, ') ≤ 2λ
![Page 18: 1/50 Department of Computer Science and Engineering Localized Delaunay Refinement for Sampling and Meshing Tamal K. Dey Joshua A. Levine Andrew G. Slatton](https://reader036.vdocuments.us/reader036/viewer/2022062804/56649d145503460f949e88b9/html5/thumbnails/18.jpg)
19/50Department of Computer Science and Engineering
Maintaining light structures
• For each node keep:• S = S ∩
• Up ϵ S Fp
• Output: union of surface stars Up ϵ S Fp
![Page 19: 1/50 Department of Computer Science and Engineering Localized Delaunay Refinement for Sampling and Meshing Tamal K. Dey Joshua A. Levine Andrew G. Slatton](https://reader036.vdocuments.us/reader036/viewer/2022062804/56649d145503460f949e88b9/html5/thumbnails/19.jpg)
20/50Department of Computer Science and Engineering
Termination
• If insertions are finite, so are enqueues and splits
• Augmenting R by an existing point does not grow S
• Consider inserting a new point s• Nearest point ≠ p → at least λ/8 from S• Insertion due to triangle size → at least λ from S
• Else → at least εM from S by Proposition 1
![Page 20: 1/50 Department of Computer Science and Engineering Localized Delaunay Refinement for Sampling and Meshing Tamal K. Dey Joshua A. Levine Andrew G. Slatton](https://reader036.vdocuments.us/reader036/viewer/2022062804/56649d145503460f949e88b9/html5/thumbnails/20.jpg)
21/50Department of Computer Science and Engineering
Termination
• Proposition 1 [Cheng-Dey-Ramos-Ray 2007]:
• εM>0 s.t. if intersections of all edges of Vp with M lie within εM of p then Fp forms a topological disk
![Page 21: 1/50 Department of Computer Science and Engineering Localized Delaunay Refinement for Sampling and Meshing Tamal K. Dey Joshua A. Levine Andrew G. Slatton](https://reader036.vdocuments.us/reader036/viewer/2022062804/56649d145503460f949e88b9/html5/thumbnails/21.jpg)
22/50Department of Computer Science and Engineering
Guarantees
• The underlying space of the output mesh is a 2-manifold without boundary
• Each point in the output is within distance λ of M
• λ*>0 s.t. if λ<λ* the output is isotopic to M with Hausdorff distance of O(λ2)
![Page 22: 1/50 Department of Computer Science and Engineering Localized Delaunay Refinement for Sampling and Meshing Tamal K. Dey Joshua A. Levine Andrew G. Slatton](https://reader036.vdocuments.us/reader036/viewer/2022062804/56649d145503460f949e88b9/html5/thumbnails/22.jpg)
23/50Department of Computer Science and Engineering
Manifoldness
• We require surface stars to fit together globally
• Consistency condition: In the output complex UpFp, a triangle abc is in Fa if and only if it is also in Fb and Fc
![Page 23: 1/50 Department of Computer Science and Engineering Localized Delaunay Refinement for Sampling and Meshing Tamal K. Dey Joshua A. Levine Andrew G. Slatton](https://reader036.vdocuments.us/reader036/viewer/2022062804/56649d145503460f949e88b9/html5/thumbnails/23.jpg)
24/50Department of Computer Science and Engineering
Manifoldness
Theorem: At termination UFp Del S|M
• Consider the last time is processed; t in • Size condition → t in Del S|M when is done
• If t Del S|M afterward, there is a point s in Delaunay ball. But, s causes to be reprocessed
![Page 24: 1/50 Department of Computer Science and Engineering Localized Delaunay Refinement for Sampling and Meshing Tamal K. Dey Joshua A. Levine Andrew G. Slatton](https://reader036.vdocuments.us/reader036/viewer/2022062804/56649d145503460f949e88b9/html5/thumbnails/24.jpg)
25/50Department of Computer Science and Engineering
Topology
• For sufficiently small λ• Homeomorphism follows from [Amenta-
Choi-Dey-Leekha 02]
• Isotopy and Hausdorff distance follow from [Boissonnat-Oudot 05]
![Page 25: 1/50 Department of Computer Science and Engineering Localized Delaunay Refinement for Sampling and Meshing Tamal K. Dey Joshua A. Levine Andrew G. Slatton](https://reader036.vdocuments.us/reader036/viewer/2022062804/56649d145503460f949e88b9/html5/thumbnails/25.jpg)
26/50Department of Computer Science and Engineering
Results
• Varying does not change the mesh qualitatively
![Page 26: 1/50 Department of Computer Science and Engineering Localized Delaunay Refinement for Sampling and Meshing Tamal K. Dey Joshua A. Levine Andrew G. Slatton](https://reader036.vdocuments.us/reader036/viewer/2022062804/56649d145503460f949e88b9/html5/thumbnails/26.jpg)
27/50Department of Computer Science and Engineering
Results
• Optimal is platform-dependent
![Page 27: 1/50 Department of Computer Science and Engineering Localized Delaunay Refinement for Sampling and Meshing Tamal K. Dey Joshua A. Levine Andrew G. Slatton](https://reader036.vdocuments.us/reader036/viewer/2022062804/56649d145503460f949e88b9/html5/thumbnails/27.jpg)
28/50Department of Computer Science and Engineering
Results
![Page 28: 1/50 Department of Computer Science and Engineering Localized Delaunay Refinement for Sampling and Meshing Tamal K. Dey Joshua A. Levine Andrew G. Slatton](https://reader036.vdocuments.us/reader036/viewer/2022062804/56649d145503460f949e88b9/html5/thumbnails/28.jpg)
29/50Department of Computer Science and Engineering
Results
![Page 29: 1/50 Department of Computer Science and Engineering Localized Delaunay Refinement for Sampling and Meshing Tamal K. Dey Joshua A. Levine Andrew G. Slatton](https://reader036.vdocuments.us/reader036/viewer/2022062804/56649d145503460f949e88b9/html5/thumbnails/29.jpg)
30/50Department of Computer Science and Engineering
Results
![Page 30: 1/50 Department of Computer Science and Engineering Localized Delaunay Refinement for Sampling and Meshing Tamal K. Dey Joshua A. Levine Andrew G. Slatton](https://reader036.vdocuments.us/reader036/viewer/2022062804/56649d145503460f949e88b9/html5/thumbnails/30.jpg)
31/50Department of Computer Science and Engineering
Conclusions
• A simple algorithm for Delaunay refinement
• Avoids memory thrashing• Topological and geometric
guarantees• Guarantee of termination• Potentially parallelizable
![Page 31: 1/50 Department of Computer Science and Engineering Localized Delaunay Refinement for Sampling and Meshing Tamal K. Dey Joshua A. Levine Andrew G. Slatton](https://reader036.vdocuments.us/reader036/viewer/2022062804/56649d145503460f949e88b9/html5/thumbnails/31.jpg)
32/50Department of Computer Science and Engineering
Thank You