Hang Si. Weierstrass Institute for Applied Analysis and Stochastics Berlin, Germany. Tetrahedron II
|
|
- Imogene Newman
- 6 years ago
- Views:
Transcription
1 W eierstraß-institut für Angew andte Analysis und Stochastik 3D Boundary Recovery and Constrained Delaunay Tetrahedralizations Hang Si Weierstrass Institute for Applied Analysis and Stochastics Berlin, Germany Tetrahedron II 3D Boundary Recovery and Constrained Delaunay Tetrahedralizations October 17, (29)
2 Outline 1 3D Boundary Recovery The Problem Related Work 2 Constrained Delaunay Tetrahedralizations Definitions Algorithms Examples 3D Boundary Recovery and Constrained Delaunay Tetrahedralizations October 17, (29)
3 he Problem Outline 1 3D Boundary Recovery The Problem Related Work 2 Constrained Delaunay Tetrahedralizations Definitions Algorithms Examples 3D Boundary Recovery and Constrained Delaunay Tetrahedralizations October 17, (29)
4 he Problem The 3D Boundary Recovery Problem Given a 3D polyhedron P, its edges and faces are called the boundaries. The goal is to partition P into a tetrahedralization T which may contain additional points (so called Steiner points (1) ). Steiner points are not allowed on boundaries of P (for some applications). A polyhedron P A tetrahedralization T of P (1) Jakob Steiner ( ), a Switzerland native and a geometer from Berlin. 3D Boundary Recovery and Constrained Delaunay Tetrahedralizations October 17, (29)
5 he Problem Known and Open Problems If Steiner points are not allowed: A simple polyhedron may not have a tetrahedralization. [Schönhardt 28] The problem of deciding whether P can be tetrahedralized is NP-complete. [Rupper and Seidel 92] If Steiner points are allowed: A simple polyhedron with n vertices may require Ω(n 2 ) Steiner points. [Chazelle 84] How to reduce the number of Steiner points? How to improve the quality of the boundary recovery (any guarantee on element shape)?... 3D Boundary Recovery and Constrained Delaunay Tetrahedralizations October 17, (29)
6 he Problem Challenges In realistic applications, the robustness and efficiency of handling complicated domain boundaries remain a big challenge. The surface mesh of a floating oil platform with helical strakes. (F. Shakib, ACUSIM) 3D Boundary Recovery and Constrained Delaunay Tetrahedralizations October 17, (29)
7 elated Work Outline 1 3D Boundary Recovery The Problem Related Work 2 Constrained Delaunay Tetrahedralizations Definitions Algorithms Examples 3D Boundary Recovery and Constrained Delaunay Tetrahedralizations October 17, (29)
8 elated Work Convex Decomposition Methods Convex polyhedra are easy to tetrahedrlize. Algorithms: [Chazelle 84], [Chazelle and Palios 90] (1), [Bajaj and Dey 92], etc. The complexities of the above algorithms are guaranteed. (1) If P is simple, it can be decomposed into O(n + r 2 ) tetrahedra. A number of non-practical issues: very complicated, result large number of Steiner points, no quality concern, etc. A simple ployhedron with A result of algorithm (1). 20 vertices, 2 reflex edges 138 nodes, 280 tetrahedra. 3D Boundary Recovery and Constrained Delaunay Tetrahedralizations October 17, (29)
9 elated Work Constrained Boundary Recovery Methods (Popular in Engineering) No Steiner points are allowed on boundaries. Algorithms: [George, Hecht, and Saltel 91] (1), [Weatherill and Hassan 94] (2), [George, Borouchaki, and Saltel 03], etc. (1) Use edge/face flips together with interior Steiner points insertion. (2) Insert Steiner points at where the boundaries and T intersect, remove them from the boundaries afterwards. A number of difficulties, e.g., robustness, 3D point deletion, complexity. a b a b a b 3D Boundary Recovery and Constrained Delaunay Tetrahedralizations October 17, (29)
10 elated Work Constrained Boundary Recovery Methods (Popular in Engineering) No Steiner points are allowed on boundaries. Algorithms: [George, Hecht, and Saltel 91] (1), [Weatherill and Hassan 94] (2), [George, Borouchaki, and Saltel 03], etc. (1) Use edge/face flips together with interior Steiner points insertion. (2) Insert Steiner points at where the boundaries and T intersect, remove them from the boundaries afterwards. A number of difficulties, e.g., robustness, 3D point deletion, complexity. a b a b a b 3D Boundary Recovery and Constrained Delaunay Tetrahedralizations October 17, (29)
11 elated Work Conforming Delaunay Methods (Popular in Computational Geometry) Use Delaunay simplices to recover the boundaries. Algorithms: [Murphy, Mount, and Gable 00], [Cohen-Steiner, de Verdière, and Yvinec 02], [Cheng and Poon 03], etc. May need too many Steiner points. An Ω(n 2 ) lower bound example on the number of Steiner points. 3D Boundary Recovery and Constrained Delaunay Tetrahedralizations October 17, (29)
12 elated Work Constrained Delaunay Methods Use constrained Delaunay simplices to recover the boundaries. Algorithms: [Shewchuk 98,02,03], [Si and Gärtner 04,05]. Conforming Delaunay method Constrained Delaunay method 51 vertices, 103 tetrahedra 20 vertices, 29 tetrahedra. 3D Boundary Recovery and Constrained Delaunay Tetrahedralizations October 17, (29)
13 efinitions Outline 1 3D Boundary Recovery The Problem Related Work 2 Constrained Delaunay Tetrahedralizations Definitions Algorithms Examples 3D Boundary Recovery and Constrained Delaunay Tetrahedralizations October 17, (29)
14 efinitions Piecewise Linear Complexes Definition 3.1. A piecewise linear complex (PLC) X is a collection of faces with the following properties: 1. Each k-face f is a union of polytopes in the same k-dimensional affine space. 2. The set X is closed under taking boundaries. 3. X is closed under intersection. 4. If dim(f 1 f 2) = dim(f 1) then f 1 f 2, and dim(f 1) < dim(f 2). A PLC non-plcs 3D Boundary Recovery and Constrained Delaunay Tetrahedralizations October 17, (29)
15 efinitions Notations Let X be a 3D PLC, i.e., X is a collection of faces of dimensions up to 3. The underlying space X is the union of all faces of X. A tetrahedralization T of X is a 3D simplicial complex such that T = X. The boundary X is a 2D PLC, and 2 X = ( X) is a 1D PLC. Let f X, i.e., f may be a vertex, or a segment, or a facet. The relatively interior relint(f) = f \ f. f f relint(f) 3D Boundary Recovery and Constrained Delaunay Tetrahedralizations October 17, (29)
16 efinitions Visibility Definition 3.2. Two points p, q R 3 are visible to each other if: (i) relint(pq) X =, or (ii) f X, s.t. pq f = pq, and relint(pq) f =. Otherwise, p and q are invisible to each other. p x r z y q 3D Boundary Recovery and Constrained Delaunay Tetrahedralizations October 17, (29)
17 efinitions Constrained Delaunay Definition 3.3. A tetrahedron t is constrained Delaunay within X if: (i) relint( i t) i+1 X =, for all i = 0,..., 3, and (ii) The circumsphere of t contains no vertex which is visible from relint(t). d c a b p f q 3D Boundary Recovery and Constrained Delaunay Tetrahedralizations October 17, (29)
18 efinitions Constrained Delaunay Tetrahedralization Definition 3.4. T is a constrained Delaunay tetrahedralization (CDT) of X if: (i) T is a tetrahedralization of X, and (ii) every tetrahedron of T is constrained Delaunay within X. A PLC X A CDT T of X. 3D Boundary Recovery and Constrained Delaunay Tetrahedralizations October 17, (29)
19 efinitions Constrained Delaunay Tetrahedralization Definition 3.4. T is a constrained Delaunay tetrahedralization (CDT) of X if: (i) T is a tetrahedralization of X, and (ii) every tetrahedron of T is constrained Delaunay within X. A PLC X A CDT T of X. Remarks: (1) A CDT T of X may contain Steiner points (Steiner CDT). (2) T is a pure CDT of X if T contains no Steiner point. (3) A pure CDT of X may not exist, while there are infinitely many Steiner CDTs of X. 3D Boundary Recovery and Constrained Delaunay Tetrahedralizations October 17, (29)
20 efinitions Combinatorial Properties of CDTs Let K be any constrained tetrahedralization of X, f X. A face abc K is locally constrained Delaunay if abc f = abc, or abc is a convex hull face, or e lies outside the circumsphere of abcd, where abcd, abce K. d d a c a c b b e Lemma 3.5 (Constrained Delaunay Lemma). If every face of K is locally constrained Delaunay, then K is a CDT of X. Lemma 3.6 (Uniqueness). If no 5 vertices of T share a common sphere, then T is unique. e 3D Boundary Recovery and Constrained Delaunay Tetrahedralizations October 17, (29)
21 efinitions CDTs with no Steiner point Let X be a 3D PLC. A simplex t is strongly Delaunay if there exists a circumscribed sphere Σ of t, such that no vertex of X lies inside and on Σ. Theorem 3.7 ([Shewchuk 98]). If all segment of X are strongly Delaunay, then X has a CDT with no Steiner point. A PLC X A PLC X Corollary 3.8. If no 5 vertices of X share a common sphere, and all segment of X are Delaunay, then X has a CDT with no Steiner point, and it is unique. 3D Boundary Recovery and Constrained Delaunay Tetrahedralizations October 17, (29)
22 lgorithms Outline 1 3D Boundary Recovery The Problem Related Work 2 Constrained Delaunay Tetrahedralizations Definitions Algorithms Examples 3D Boundary Recovery and Constrained Delaunay Tetrahedralizations October 17, (29)
23 lgorithms Constructing the CDT of a PLC Given a 3D PLC X, a CDT is constructed in the following subsequent phases: (1) Form the Delaunay tetrahedralization T of the vertices of X. (2) Form the surface triangulation F from the facets of X. (3) Perturb the vertices in F and T (add Steiner points). (4) Recover the segments of F in T (add Steiner points). (5) Recover the facets of F in T. (6) Remove tetrahedra outside X from T. (7) Remove Steiner points from X (for constrained boundary recovery). 3D Boundary Recovery and Constrained Delaunay Tetrahedralizations October 17, (29)
24 lgorithms Segment Recovery Protecting Sharp Corners Corner lopping [Ruppert 95, Shewchuk 02, Pav and Walkington 05]. 3D Boundary Recovery and Constrained Delaunay Tetrahedralizations October 17, (29)
25 lgorithms Segment Recovery Protecting Sharp Corners Corner lopping [Ruppert 95, Shewchuk 02, Pav and Walkington 05]. 3D Boundary Recovery and Constrained Delaunay Tetrahedralizations October 17, (29)
26 lgorithms Segment Recovery Protecting Sharp Corners Corner lopping [Ruppert 95, Shewchuk 02, Pav and Walkington 05]. 3D Boundary Recovery and Constrained Delaunay Tetrahedralizations October 17, (29)
27 lgorithms Segment Recovery Protecting Sharp Corners Protect sharp corner adaptively [Si and Gärtner 05]. 3D Boundary Recovery and Constrained Delaunay Tetrahedralizations October 17, (29)
28 lgorithms Segment Recovery Protecting Sharp Corners Protect sharp corner adaptively [Si and Gärtner 05]. 3D Boundary Recovery and Constrained Delaunay Tetrahedralizations October 17, (29)
29 lgorithms Segment Recovery Protecting Sharp Corners Protect sharp corner adaptively [Si and Gärtner 05]. 3D Boundary Recovery and Constrained Delaunay Tetrahedralizations October 17, (29)
30 lgorithms Segment Recovery Protecting Sharp Corners Protect sharp corner adaptively [Si and Gärtner 05]. 3D Boundary Recovery and Constrained Delaunay Tetrahedralizations October 17, (29)
31 lgorithms Segment Recovery Protecting Sharp Corners Protect sharp corner adaptively [Si and Gärtner 05]. 3D Boundary Recovery and Constrained Delaunay Tetrahedralizations October 17, (29)
32 lgorithms Segment Recovery Protecting Sharp Corners Protect sharp corner adaptively [Si and Gärtner 05]. 3D Boundary Recovery and Constrained Delaunay Tetrahedralizations October 17, (29)
33 lgorithms Segment Recovery Protecting Sharp Corners Protect sharp corner adaptively [Si and Gärtner 05]. 3D Boundary Recovery and Constrained Delaunay Tetrahedralizations October 17, (29)
34 lgorithms Segment Recovery Protecting Sharp Corners Protect sharp corner adaptively [Si and Gärtner 05]. 3D Boundary Recovery and Constrained Delaunay Tetrahedralizations October 17, (29)
35 lgorithms Facet Recovery Cavity Tetrahedralization A cavity C is tetrahedralized by the following procedure. 1. Verify C. Enlarge C until all faces of C are Delaunay. e1 e2 e1 e2 p1 σ p2 p1 σ p2 q1 q2 q1 q2 2. Tetrahedralize C. 3D Boundary Recovery and Constrained Delaunay Tetrahedralizations October 17, (29)
36 xamples Outline 1 3D Boundary Recovery The Problem Related Work 2 Constrained Delaunay Tetrahedralizations Definitions Algorithms Examples 3D Boundary Recovery and Constrained Delaunay Tetrahedralizations October 17, (29)
37 xamples Example 1 Cami1a A 3D PLC The DT The surface mesh 460 vertices, 328 facets 2637 tetrahedra 954 subfaces, 706 segments A CDT Facet recovery Segment recovery with 505 Steiner points 22 missing subfaces Steiner points 3D Boundary Recovery and Constrained Delaunay Tetrahedralizations October 17, (29)
38 xamples Example 2 Layers A single-layer PLC The DT 114 vertices, 1 facets 293 tetrahedra A CDT with 2 Steiner points The pure CDT (no Steiner point) 3D Boundary Recovery and Constrained Delaunay Tetrahedralizations October 17, (29)
39 xamples Example 2 Layers A 5-layer PLC The DT 130 vertices, 5 facets 391 tetrahedra A CDT with 10 Steiner points The pure CDT (no Steiner point) 3D Boundary Recovery and Constrained Delaunay Tetrahedralizations October 17, (29)
40 xamples Complexity Issues n the number of input points, s the number of Steiner points, m the number of output points (i.e., m = n + s). Steps Algorithms Worst case General case (1) Delaunay tetrahedralization O(n 2 ) O(n log n) (2) Surface triangulation O(n log n) (3) Vertex perturbation [Si et al 05] O(n log n) (4) Segment recovery [Si et al 05] O(sn 2 log n) O(s log n) (5) Facet recovery [Shewchuk 03] O(m 2 log m) 3D Boundary Recovery and Constrained Delaunay Tetrahedralizations October 17, (29)
41 xamples Runtime Statistics The PLC models are available from INRIA s repository ( Tested by TetGen (compiled by g++ with -O3 option) on a linux workstation (Intel CPU 3.60GHz, 8GB). Times are reported in seconds. Heart Fan Crystal Dragon Mech. Input nodes 3,588 6,516 11,706 21,104 57,270 Input faces 7,620 13,180 26,399 41, ,680 Steiner points 3,622 4,992 10,789 1,817 1,963 DT Surfmesh Perturb Segment Facet Total D Boundary Recovery and Constrained Delaunay Tetrahedralizations October 17, (29)
42 Summary 3D Boundary Recovery remains a challenging problem in both theory and practice. Constrained Delaunay methods are one of the effective methods for solving the problem. We gave an overview about constrained Delaunay tetrahedralizations: definitions, algorithms, and complexity issues. Segment recovery is one of the crucial steps for constructing CDTs. 3D Boundary Recovery and Constrained Delaunay Tetrahedralizations October 17, (29)
Meshing Piecewise Linear Complexes by Constrained Delaunay Tetrahedralizations
Meshing Piecewise Linear Complexes by Constrained Delaunay Tetrahedralizations Hang Si and Klaus Gärtner Weierstrass Institute for Applied Analysis and Stochastics, Berlin, Germany {si, gaertner}@wias-berlin.de
More informationWeierstraß-Institut. für Angewandte Analysis und Stochastik. Leibniz-Institut im Forschungsverbund Berlin e. V. Preprint ISSN
Weierstraß-Institut für Angewandte Analysis und Stochastik Leibniz-Institut im Forschungsverbund Berlin e. V. Preprint ISSN 2198-5855 On indecomposable polyhedra and the number of interior Steiner points
More informationWeierstraß-Institut. im Forschungsverbund Berlin e.v. Preprint ISSN
Weierstraß-Institut für Angewandte Analysis und Stochastik im Forschungsverbund Berlin e.v. Preprint ISSN 0946 8633 The Existence of Triangulations of Non-convex Polyhedra without New Vertices Hang Si
More informationCollars and Intestines: Practical Conforming Delaunay Refinement
Collars and Intestines: Practical Conforming Delaunay Refinement Alexander Rand and Noel Walkington Carnegie Mellon University Summary. While several existing Delaunay refinement algorithms allow acute
More informationGeneral-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties
General-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties Jonathan Richard Shewchuk July 9, 2007 Department of Electrical Engineering and Computer Sciences
More informationConstrained Delaunay Tetrahedralizations and Provably Good Boundary Recovery
Constrained Delaunay Tetrahedralizations and Provably Good Boundary Recovery Jonathan Richard Shewchuk University of California at Berkeley, Berkeley, CA, U.S.A. jrs@cs.berkeley.edu Abstract In two dimensions,
More informationComplex conforming Delaunay triangulation
. RESEARCH PAPERS. SCIENCE CHINA Information Sciences June 2010 Vol. 53 No. 6: 1130 1140 doi: 10.1007/s11432-010-0097-6 Complex conforming Delaunay triangulation MENG XianHai 1, LI JiGang 1, YANG Qin 1,
More informationConstrained Boundary Recovery for Three Dimensional Delaunay Triangulations
INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING Int. J. Numer. Meth. Engng 2004; 00:01 [Version: 2000/01/19 v2.0] Constrained Boundary Recovery for Three Dimensional Delaunay Triangulations
More informationThe Strange Complexity of Constrained Delaunay Triangulation
The Strange Complexity of Constrained Delaunay Triangulation Nicolas Grislain École Normale Supérieure de Lyon Lyon, France ngrislai@ens-lyon.fr Jonathan Richard Shewchuk Computer Science Division University
More informationVoronoi diagrams Delaunay Triangulations. Pierre Alliez Inria
Voronoi diagrams Delaunay Triangulations Pierre Alliez Inria Voronoi Diagram Voronoi Diagram Voronoi Diagram The collection of the non-empty Voronoi regions and their faces, together with their incidence
More informationTetGen A Quality Tetrahedral Mesh Generator and Three-Dimensional Delaunay Triangulator
TetGen A Quality Tetrahedral Mesh Generator and Three-Dimensional Delaunay Triangulator Version 1.4 User s Manual January 18, 2006 Hang Si si@wias-berlin.de http://tetgen.berlios.de c 2002, 2004, 2005,
More informationOutline. CGAL par l exemplel. Current Partners. The CGAL Project.
CGAL par l exemplel Computational Geometry Algorithms Library Raphaëlle Chaine Journées Informatique et GéomG ométrie 1 er Juin 2006 - LIRIS Lyon Outline Overview Strengths Design Structure Kernel Convex
More informationApproximating Polygonal Objects by Deformable Smooth Surfaces
Approximating Polygonal Objects by Deformable Smooth Surfaces Ho-lun Cheng and Tony Tan School of Computing, National University of Singapore hcheng,tantony@comp.nus.edu.sg Abstract. We propose a method
More informationCombinatorics of Beacon-based Routing in Three Dimensions
Combinatorics of Beacon-based Routing in Three Dimensions Jonas Cleve [0000 0001 8480 1726] ( ) and Wolfgang Mulzer [0000 0002 1948 5840] Institut für Informatik, Freie Universität Berlin, Berlin, Germany
More informationScientific Computing WS 2018/2019. Lecture 12. Jürgen Fuhrmann Lecture 12 Slide 1
Scientific Computing WS 2018/2019 Lecture 12 Jürgen Fuhrmann juergen.fuhrmann@wias-berlin.de Lecture 12 Slide 1 Recap For more discussion of mesh generation, see J.R. Shewchuk: Lecture Notes on Delaunay
More informationVoronoi diagram and Delaunay triangulation
Voronoi diagram and Delaunay triangulation Ioannis Emiris & Vissarion Fisikopoulos Dept. of Informatics & Telecommunications, University of Athens Computational Geometry, spring 2015 Outline 1 Voronoi
More informationAn Analysis of Shewchuk s Delaunay Refinement Algorithm
An Analysis of Shewchuk s Delaunay Refinement Algorithm Hang Si Weierstrass Institute for Applied Analysis and Stochastics (WIAS), Berlin si@wias-berlin.de Summary. Shewchuk s Delaunay refinement algorithm
More informationWeighted Delaunay Refinement for Polyhedra with Small Angles
Weighted Delaunay Refinement for Polyhedra with Small Angles Siu-Wing Cheng Tamal K. Dey Tathagata Ray September 21, 2005 Abstract Recently, a provable Delaunay meshing algorithm called QMesh has been
More informationTopological Issues in Hexahedral Meshing
Topological Issues in Hexahedral Meshing David Eppstein Univ. of California, Irvine Dept. of Information and Computer Science Outline I. What is meshing? Problem statement Types of mesh Quality issues
More informationTiling Three-Dimensional Space with Simplices. Shankar Krishnan AT&T Labs - Research
Tiling Three-Dimensional Space with Simplices Shankar Krishnan AT&T Labs - Research What is a Tiling? Partition of an infinite space into pieces having a finite number of distinct shapes usually Euclidean
More informationA Point-Placement Strategy for Conforming Delaunay Tetrahedralization
A Point-Placement Strategy for Conforming Delaunay Tetrahedralization Michael Murphy David M. Mount Carl W. Gable Abstract A strategy is presented to find a set of points which yields a Conforming Delaunay
More informationCOMP331/557. Chapter 2: The Geometry of Linear Programming. (Bertsimas & Tsitsiklis, Chapter 2)
COMP331/557 Chapter 2: The Geometry of Linear Programming (Bertsimas & Tsitsiklis, Chapter 2) 49 Polyhedra and Polytopes Definition 2.1. Let A 2 R m n and b 2 R m. a set {x 2 R n A x b} is called polyhedron
More informationA Constrained Delaunay Triangle Mesh Method for Three-Dimensional Unstructured Boundary Point Cloud
International Journal of Computer Systems (ISSN: 2394-1065), Volume 03 Issue 02, February, 2016 Available at http://www.ijcsonline.com/ A Constrained Delaunay Triangle Mesh Method for Three-Dimensional
More informationCombinatorial Geometry & Topology arising in Game Theory and Optimization
Combinatorial Geometry & Topology arising in Game Theory and Optimization Jesús A. De Loera University of California, Davis LAST EPISODE... We discuss the content of the course... Convex Sets A set is
More information29 TRIANGULATIONS AND MESH GENERATION
29 TRIANGULATIONS AND MESH GENERATION Marshall Bern, Jonathan R. Shewchuk, and Nina Amenta INTRODUCTION A triangulation is a partition of a geometric domain, such as a point set, polygon, or polyhedron,
More informationLinear Programming in Small Dimensions
Linear Programming in Small Dimensions Lekcija 7 sergio.cabello@fmf.uni-lj.si FMF Univerza v Ljubljani Edited from slides by Antoine Vigneron Outline linear programming, motivation and definition one dimensional
More informationComputational Geometry
Computational Geometry 600.658 Convexity A set S is convex if for any two points p, q S the line segment pq S. S p S q Not convex Convex? Convexity A set S is convex if it is the intersection of (possibly
More informationCOMPUTATIONAL GEOMETRY
Thursday, September 20, 2007 (Ming C. Lin) Review on Computational Geometry & Collision Detection for Convex Polytopes COMPUTATIONAL GEOMETRY (Refer to O'Rourke's and Dutch textbook ) 1. Extreme Points
More informationOutline of the presentation
Surface Reconstruction Petra Surynková Charles University in Prague Faculty of Mathematics and Physics petra.surynkova@mff.cuni.cz Outline of the presentation My work up to now Surfaces of Building Practice
More informationCS 372: Computational Geometry Lecture 10 Linear Programming in Fixed Dimension
CS 372: Computational Geometry Lecture 10 Linear Programming in Fixed Dimension Antoine Vigneron King Abdullah University of Science and Technology November 7, 2012 Antoine Vigneron (KAUST) CS 372 Lecture
More informationTutorial 3 Comparing Biological Shapes Patrice Koehl and Joel Hass
Tutorial 3 Comparing Biological Shapes Patrice Koehl and Joel Hass University of California, Davis, USA http://www.cs.ucdavis.edu/~koehl/ims2017/ What is a shape? A shape is a 2-manifold with a Riemannian
More informationLinear Complexity Hexahedral Mesh Generation
Linear Complexity Hexahedral Mesh Generation David Eppstein Department of Information and Computer Science University of California, Irvine, CA 92717 http://www.ics.uci.edu/ eppstein/ Tech. Report 95-51
More informationLecture 3: Partitioning Polygons & Polyhedra CS 763 F16. Polyhedra
CS 763 F16 Polyhedra dice, Pompei, 1st century icosahedral die, Roman, 2nd century - 47 - CS 763 F16 Polyhedra Platonic solids cuboctahedron Pentagonal orthocupolarotunda polycrystalline morphology - 48
More informationPolygon decomposition. Motivation: Art gallery problem
CG Lecture 3 Polygon decomposition 1. Polygon triangulation Triangulation theory Monotone polygon triangulation 2. Polygon decomposition into monotone pieces 3. Trapezoidal decomposition 4. Convex decomposition
More information66 III Complexes. R p (r) }.
66 III Complexes III.4 Alpha Complexes In this section, we use a radius constraint to introduce a family of subcomplexes of the Delaunay complex. These complexes are similar to the Čech complexes but differ
More informationPlanar Graphs. 1 Graphs and maps. 1.1 Planarity and duality
Planar Graphs In the first half of this book, we consider mostly planar graphs and their geometric representations, mostly in the plane. We start with a survey of basic results on planar graphs. This chapter
More informationIsotopic Approximation within a Tolerance Volume
Isotopic Approximation within a Tolerance Volume Manish Mandad David Cohen-Steiner Pierre Alliez Inria Sophia Antipolis - 1 Goals and Motivation - 2 Goals and Motivation Input: Tolerance volume of a surface
More informationConvex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes
Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes Menelaos I. Karavelas joint work with Eleni Tzanaki University of Crete & FO.R.T.H. OrbiCG/ Workshop on Computational
More informationOn 3d Irreducible and Indecomposable Polyhedra and The Number of Interior Steiner Points
Weierstrass Institute for Applied Analysis and Stochastics On 3d Irreducible and Indecomposable Polyhedra and The Number of Interior Steiner Points Hang Si and Nadja Goerigk Tetrahedron V - Liége - 2016.07.05
More informationThe Art Gallery Problem
The Art Gallery Problem Connor Bohlken Nebraska Wesleyan University cbohlken@nebrwesleyan.edu May 11, 2016 Abstract Given a polygonal art gallery of n vertices, how many security guards are necessary to
More informationTriangles and Squares David Eppstein, ICS Theory Group, April 20, 2001
Triangles and Squares David Eppstein, ICS Theory Group, April 20, 2001 Which unit-side-length convex polygons can be formed by packing together unit squares and unit equilateral triangles? For instance
More informationVoronoi Diagrams, Delaunay Triangulations and Polytopes
Voronoi Diagrams, Delaunay Triangulations and Polytopes Jean-Daniel Boissonnat MPRI, Lecture 2 Computational Geometry Learning Voronoi, Delaunay & Polytopes MPRI, Lecture 2 1 / 43 Voronoi diagrams in nature
More informationOverview of Unstructured Mesh Generation Methods
Overview of Unstructured Mesh Generation Methods Structured Meshes local mesh points and cells do not depend on their position but are defined by a general rule. Lead to very efficient algorithms and storage.
More informationeled by polyhedral objects, a triangulation having a low line stabbing number could act as a simple, yet ecient, data structure for ray tracing we jus
Line Stabbing Bounds in Three Dimensions Pankaj K. Agarwal y Boris Aronov z Subhash Suri x Abstract Let S be a set of (possibly degenerate) triangles in < 3 whose interiors are disjoint. A triangulation
More information1 Automatic Mesh Generation
1 AUTOMATIC MESH GENERATION 1 1 Automatic Mesh Generation 1.1 Mesh Definition Mesh M is a discrete representation of geometric model in terms of its geometry G, topology T, and associated attributes A.
More informationA star-based data structure to store efficiently 3D topography in a database
A star-based data structure to store efficiently 3D topography in a database Hugo LEDOUX Delft University of Technology Martijn MEIJERS Delft University of Technology December 24, 2013 This is the draft
More information4.2 Simplicial Homology Groups
4.2. SIMPLICIAL HOMOLOGY GROUPS 93 4.2 Simplicial Homology Groups 4.2.1 Simplicial Complexes Let p 0, p 1,... p k be k + 1 points in R n, with k n. We identify points in R n with the vectors that point
More informationALGORITHMS FOR TRIANGULATING POLYHEDRA INTO A SMALL NUMBER OF TETRAHEDRA. Milica Stojanović. 1. Introduction
MATEMATIQKI VESNIK 57 (2005), 1 9 UDK 514.122 originalni nauqni rad research paper ALGORITHMS FOR TRIANGULATING POLYHEDRA INTO A SMALL NUMBER OF TETRAHEDRA Milica Stojanović Abstract. Two algorithms for
More informationLecture 1 Discrete Geometric Structures
Lecture 1 Discrete Geometric Structures Jean-Daniel Boissonnat Winter School on Computational Geometry and Topology University of Nice Sophia Antipolis January 23-27, 2017 Computational Geometry and Topology
More informationLecture 3 Randomized Algorithms
Lecture 3 Randomized Algorithms Jean-Daniel Boissonnat Winter School on Computational Geometry and Topology University of Nice Sophia Antipolis January 23-27, 2017 Computational Geometry and Topology Randomized
More informationMeshing Volumes with Curved Boundaries
Engineering with Computers manuscript No. (will be inserted by the editor) Meshing Volumes with Curved Boundaries Steve Oudot 1, Laurent Rineau 2, Mariette Yvinec 3 1 INRIA, BP 93 06902 Sophia Antipolis,
More informationConforming Delaunay triangulations in 3D
Computational Geometry 28 (2004) 217 233 www.elsevier.com/locate/comgeo Conforming Delaunay triangulations in 3D David Cohen-Steiner a, Éric Colin de Verdière b,, Mariette Yvinec a a INRIA, Sophia-Antipolis,
More informationOn the Size of Higher-Dimensional Triangulations
Combinatorial and Computational Geometry MSRI Publications Volume 52, 2005 On the Size of Higher-Dimensional Triangulations PETER BRASS Abstract. I show that there are sets of n points in three dimensions,
More informationThree-Dimensional α Shapes
Herbert Edelsbrunner and Ernst P. Mücke ACM Tran. Graph. 13(1), 1994 20 September 2005 1 2 α-complexes Edelsbrunner s Algorithm 3 Properties Surface Reconstruction Shape Question Given a set of points,
More informationMesh Generation through Delaunay Refinement
Mesh Generation through Delaunay Refinement 3D Meshes Mariette Yvinec MPRI 2009-2010, C2-14-1, Lecture 4b ENSL Winter School, january 2010 Input : C : a 2D PLC in R 3 (piecewise linear complex) Ω : a bounded
More informationReasonably ecient Delaunay based mesh. generator in 3 dimensions. H. Borouchaki, F. Hecht, E. Saltel and P.L. George.
Reasonably ecient Delaunay based mesh generator in 3 dimensions H. Borouchaki, F. Hecht, E. Saltel and P.L. George August 23, 1995 INRIA, Domaine de Voluceau, Rocquencourt, BP 105, 78153 Le Chesnay Cedex,
More informationChapter 4 Concepts from Geometry
Chapter 4 Concepts from Geometry An Introduction to Optimization Spring, 2014 Wei-Ta Chu 1 Line Segments The line segment between two points and in R n is the set of points on the straight line joining
More informationG 6i try. On the Number of Minimal 1-Steiner Trees* Discrete Comput Geom 12:29-34 (1994)
Discrete Comput Geom 12:29-34 (1994) G 6i try 9 1994 Springer-Verlag New York Inc. On the Number of Minimal 1-Steiner Trees* B. Aronov, 1 M. Bern, 2 and D. Eppstein 3 Computer Science Department, Polytechnic
More informationACTUALLY DOING IT : an Introduction to Polyhedral Computation
ACTUALLY DOING IT : an Introduction to Polyhedral Computation Jesús A. De Loera Department of Mathematics Univ. of California, Davis http://www.math.ucdavis.edu/ deloera/ 1 What is a Convex Polytope? 2
More informationTight Cocone DIEGO SALUME SEPTEMBER 18, 2013
Tight Cocone DIEGO SALUME SEPTEMBER 18, 2013 Summary Problem: The Cocone algorithm produces surfaces with holes and artifacts in undersampled areas in the data. Solution: Extend the Cocone algorithm to
More informationDelaunay Refinement by Corner Lopping
Delaunay Refinement by Corner Lopping Steven E. Pav 1 and Noel J. Walkington 2 1 University of California at San Diego, La Jolla, CA. spav@ucsd.edu 2 Carnegie Mellon University, Pittsburgh, PA. noelw@andrew.cmu.edu
More informationGENERALIZED INSERTION REGION GUIDES FOR DELAUNAY MESH REFINEMENT
SIAM J. SCI. COMPUT. Vol. 34, No. 3, pp. A1333 A1350 c 2012 Society for Industrial and Applied Mathematics GENERALIZED INSERTION REGION GUIDES FOR DELAUNAY MESH REFINEMENT ANDREY N. CHERNIKOV AND NIKOS
More informationGeometric bistellar flips: the setting, the context and a construction
Geometric bistellar flips: the setting, the context and a construction Francisco Santos Abstract. We give a self-contained introduction to the theory of secondary polytopes and geometric bistellar flips
More informationPREPRINT 2006:36. Airbag Folding Based on Origami Mathematics CHRISTOFFER CROMVIK KENNETH ERIKSSON
PREPRINT 2006:36 Airbag Folding Based on Origami Mathematics CHRISTOFFER CROMVIK KENNETH ERIKSSON Department of Mathematical Sciences Division of Mathematics CHALMERS UNIVERSITY OF TECHNOLOGY GÖTEBORG
More informationGENERALIZED INSERTION REGION GUIDES FOR DELAUNAY MESH REFINEMENT
GENERALIZED INSERTION REGION GUIDES FOR DELAUNAY MESH REFINEMENT ANDREY N. CHERNIKOV AND NIKOS P. CHRISOCHOIDES Abstract. Mesh generation by Delaunay refinement is a widely used technique for constructing
More informationMeshing Skin Surfaces with Certified Topology
Meshing Skin Surfaces with Certified Topology Nico Kruithof and Gert Vegter Department of Mathematics and Computing Science University of Groningen, The Netherlands {nico,gert}@cs.rug.nl Abstract We present
More informationGuaranteed Quality Parallel Delaunay Refinement for Restricted Polyhedral Domains
Guaranteed Quality Parallel Delaunay Refinement for Restricted Polyhedral Domains Démian Nave a,,1, Nikos Chrisochoides b,,2 L. Paul Chew c,3 a Pittsburgh Supercomputing Center, Carnegie Mellon University,
More informationRepresenting Three-Dimensional Topography in a DBMS with a Star-Based Data Structure
Representing Three-Dimensional Topography in a DBMS with a Star-Based Data Structure Hugo Ledoux and Martijn Meijers Abstract For storing and modelling three-dimensional topographic objects (e.g. buildings,
More informationTiling Polyhedra with Tetrahedra
CCCG 2012, Charlottetown, P.E.I., August 8 10, 2012 Tiling Polyhedra with Tetrahedra Andras Bezdek Braxton Carrigan Abstract When solving an algorithmic problem involving a polyhedron in R 3, it is common
More informationConvex Geometry arising in Optimization
Convex Geometry arising in Optimization Jesús A. De Loera University of California, Davis Berlin Mathematical School Summer 2015 WHAT IS THIS COURSE ABOUT? Combinatorial Convexity and Optimization PLAN
More informationA Polynomial Time Algorithm for Multivariate Interpolation in Arbitrary Dimension via the Delaunay Triangulation
A Polynomial Time Algorithm for Multivariate Interpolation in Arbitrary Dimension via the Delaunay Triangulation Tyler Chang, Layne Watson, Thomas Lux, Bo Li, Li Xu, Ali Butt, Kirk Cameron, and Yili Hong
More informationTopological Data Analysis - I. Afra Zomorodian Department of Computer Science Dartmouth College
Topological Data Analysis - I Afra Zomorodian Department of Computer Science Dartmouth College September 3, 2007 1 Acquisition Vision: Images (2D) GIS: Terrains (3D) Graphics: Surfaces (3D) Medicine: MRI
More informationComplexity of Delaunay triangulation for points on lower-dimensional polyhedra
Complexity of Delaunay triangulation for points on lower-dimensional polyhedra Nina Amenta UC Davis Dominique Attali CNRS-LIS Grenoble Olivier Devillers INRIA Sophia-Antipolis Abstract We show that the
More informationMeshing Volumes Bounded by Smooth Surfaces
Meshing Volumes Bounded by Smooth Surfaces Steve Oudot, Laurent Rineau, Mariette Yvinec To cite this version: Steve Oudot, Laurent Rineau, Mariette Yvinec. Meshing Volumes Bounded by Smooth Surfaces. International
More informationMaximal admissible faces and asymptotic bounds for the normal surface solution space
Maximal admissible faces and asymptotic bounds for the normal surface solution space Benjamin A. Burton Author s self-archived version Available from http://www.maths.uq.edu.au/~bab/papers/ Abstract The
More informationTriangulations of polytopes
Triangulations of polytopes Francisco Santos Universidad de Cantabria http://personales.unican.es/santosf Outline of the talk 1. Triangulations of polytopes 2. Geometric bistellar flips 3. Regular and
More informationConvex Hulls in 3D. Definitions. Size of a Convex Hull in 3D. Collision detection: The smallest volume polyhedral that contains a set of points in 3D.
Convex Hulls in 3D SMD156 Lecture 11 Convex Hulls in Higher Dimensions Voronoi diagrams 3D Incremental Algorithm Collision detection: 1 2 Definitions The smallest volume polyhedral that contains a set
More informationA New Approach to Output-Sensitive Voronoi Diagrams and Delaunay Triangulations
A New Approach to Output-Sensitive Voronoi Diagrams and Delaunay Triangulations Don Sheehy INRIA Saclay, France soon: UConn Joint work with Gary Miller at CMU Voronoi Diagrams Voronoi Diagrams The Voronoi
More informationRigidity of ball-polyhedra via truncated Voronoi and Delaunay complexes
!000111! NNNiiinnnttthhh IIInnnttteeerrrnnnaaatttiiiooonnnaaalll SSSyyymmmpppooosssiiiuuummm ooonnn VVVooorrrooonnnoooiii DDDiiiaaagggrrraaammmsss iiinnn SSSccciiieeennnccceee aaannnddd EEEnnngggiiinnneeeeeerrriiinnnggg
More informationLecture Notes on Delaunay Mesh Generation
Lecture Notes on Delaunay Mesh Generation Jonathan Richard Shewchuk September 20, 1999 Department of Electrical Engineering and Computer Science University of California at Berkeley Berkeley, CA 94720
More informationEdge Guards for Polyhedra in Three-Space
Edge Guards for Polyhedra in Three-Space Javier Cano Csaba D. Tóth Jorge Urrutia Abstract It is shown that every polyhedron in R with m edges can be guarded with at most 27 2m The bound improves to 5 6
More informationQuality Meshing for Polyhedra with Small Angles
Quality Meshing for Polyhedra with Small Angles Siu-Wing Cheng Tamal K. Dey Edgar A. Ramos Tathagata Ray April 11, 2005 Abstract We present an algorithm to compute a Delaunay mesh conforming to a polyhedron
More informationFinding Small Triangulations of Polytope Boundaries Is Hard
Discrete Comput Geom 24:503 517 (2000) DOI: 10.1007/s004540010052 Discrete & Computational Geometry 2000 Springer-Verlag New York Inc. Finding Small Triangulations of Polytope Boundaries Is Hard J. Richter-Gebert
More informationREINER HORST. License or copyright restrictions may apply to redistribution; see
MATHEMATICS OF COMPUTATION Volume 66, Number 218, April 1997, Pages 691 698 S 0025-5718(97)00809-0 ON GENERALIZED BISECTION OF n SIMPLICES REINER HORST Abstract. A generalized procedure of bisection of
More informationCourse 16 Geometric Data Structures for Computer Graphics. Voronoi Diagrams
Course 16 Geometric Data Structures for Computer Graphics Voronoi Diagrams Dr. Elmar Langetepe Institut für Informatik I Universität Bonn Geometric Data Structures for CG July 27 th Voronoi Diagrams San
More informationSome Open Problems in Graph Theory and Computational Geometry
Some Open Problems in Graph Theory and Computational Geometry David Eppstein Univ. of California, Irvine Dept. of Information and Computer Science ICS 269, January 25, 2002 Two Models of Algorithms Research
More informationModeling and Analysis of Hybrid Systems
Modeling and Analysis of Hybrid Systems Convex polyhedra Prof. Dr. Erika Ábrahám Informatik 2 - LuFG Theory of Hybrid Systems RWTH Aachen University Szeged, Hungary, 27 September - 06 October 2017 Ábrahám
More informationModeling and Analysis of Hybrid Systems
Modeling and Analysis of Hybrid Systems 6. Convex polyhedra Prof. Dr. Erika Ábrahám Informatik 2 - LuFG Theory of Hybrid Systems RWTH Aachen University Szeged, Hungary, 27 September - 06 October 2017 Ábrahám
More informationBasic Measures for Imprecise Point Sets in R d
Basic Measures for Imprecise Point Sets in R d Heinrich Kruger Masters Thesis Game and Media Technology Department of Information and Computing Sciences Utrecht University September 2008 INF/SCR-08-07
More informationDirichlet Voronoi Diagrams and Delaunay Triangulations
Chapter 9 Dirichlet Voronoi Diagrams and Delaunay Triangulations 9.1 Dirichlet Voronoi Diagrams In this chapter we present very briefly the concepts of a Voronoi diagram and of a Delaunay triangulation.
More informationComplexity of Delaunay Triangulation for Points on Lower-dimensional Polyhedra.
published in Proc. 18th ACM-SIAM Sympos. Discrete Algorithms (SODA) 2007, p.1106 1113. Complexity of Delaunay Triangulation for Points on Lower-dimensional Polyhedra. Nina Amenta UC Davis Dominique Attali
More informationAn Interface-fitted Mesh Generator and Polytopal Element Methods for Elliptic Interface Problems
An Interface-fitted Mesh Generator and Polytopal Element Methods for Elliptic Interface Problems Long Chen University of California, Irvine chenlong@math.uci.edu Joint work with: Huayi Wei (Xiangtan University),
More informationElementary Combinatorial Topology
Elementary Combinatorial Topology Frédéric Meunier Université Paris Est, CERMICS, Ecole des Ponts Paristech, 6-8 avenue Blaise Pascal, 77455 Marne-la-Vallée Cedex E-mail address: frederic.meunier@cermics.enpc.fr
More information2D Geometry. Pierre Alliez Inria Sophia Antipolis
2D Geometry Pierre Alliez Inria Sophia Antipolis Outline Sample problems Polygons Graphs Convex hull Voronoi diagram Delaunay triangulation Sample Problems Line Segment Intersection Theorem: Segments (p
More informationMesh Generation. Jean-Daniel Boissonnat DataShape, INRIA
Mesh Generation Jean-Daniel Boissonnat DataShape, INRIA http://www-sop.inria.fr/datashape Algorithmic Geometry Mesh generation J-D. Boissonnat 1 / 27 Meshing surfaces and 3D domains visualization and graphics
More informationLecture 3: Art Gallery Problems and Polygon Triangulation
EECS 396/496: Computational Geometry Fall 2017 Lecture 3: Art Gallery Problems and Polygon Triangulation Lecturer: Huck Bennett In this lecture, we study the problem of guarding an art gallery (specified
More information(a) (b) (c) (d) (e) (f) Figure 3.1: What is a polygon?
Chapter 3 Polygons Although we can think of a line l R 2 as an infinite point set that consists of all points in R 2 that are on l, there still exists a finite description for l. Such a description is,
More informationShellings, the Euler-Poincaré Formula for Polytopes, Dehn-Sommerville Equations, the Upper Bound Theorem
Chapter 8 Shellings, the Euler-Poincaré Formula for Polytopes, Dehn-Sommerville Equations, the Upper Bound Theorem 8.1 Shellings The notion of shellability is motivated by the desire to give an inductive
More informationUNTANGLING AND OPTIMIZATION OF UNSTRUCTURED HEXAHEDRAL MESHES
UNTANLIN AND OPTIMIZATION OF UNSTRUCTURED HEXAHEDRAL MESHES K. Kovalev (*), M. Delanaye (**), Ch. Hirsch (*) kvk@stro.vub.ac.be (*) Vrije Universiteit Brussel, Pleinlaan,, 1050 Brussels (**) NUMECA Int.,
More informationQuadratic and cubic b-splines by generalizing higher-order voronoi diagrams
Quadratic and cubic b-splines by generalizing higher-order voronoi diagrams Yuanxin Liu and Jack Snoeyink Joshua Levine April 18, 2007 Computer Science and Engineering, The Ohio State University 1 / 24
More information