A New Approach to Output-Sensitive Voronoi Diagrams and Delaunay Triangulations
|
|
- Deborah Gordon
- 5 years ago
- Views:
Transcription
1 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
2 Voronoi Diagrams
3 Voronoi Diagrams The Voronoi cell of p is the set of reverse nearest neighbors of p.
4 Voronoi Diagrams The Voronoi cell of p is the set of reverse nearest neighbors of p.
5 Voronoi Diagrams The Voronoi cell of p is the set of reverse nearest neighbors of p. The Voronoi diagram is dual to the Delaunay triangulation.
6 Voronoi Diagrams The Voronoi cell of p is the set of reverse nearest neighbors of p. The Voronoi diagram is dual to the Delaunay triangulation.
7 Voronoi Diagrams The Voronoi cell of p is the set of reverse nearest neighbors of p. The Voronoi diagram is dual to the Delaunay triangulation.
8 Voronoi Diagrams The Voronoi cell of p is the set of reverse nearest neighbors of p. The Voronoi diagram is dual to the Delaunay triangulation. Voronoi k-face Delaunay (d-k)-face
9 Voronoi Diagrams and Delaunay triangulations are used everywhere.
10 Voronoi Diagrams and Delaunay triangulations are used everywhere. Geographical Information Systems
11 Voronoi Diagrams and Delaunay triangulations are used everywhere. Geographical Information Systems Graphics
12 Voronoi Diagrams and Delaunay triangulations are used everywhere. Geographical Information Systems Graphics Topological Data Analysis
13 Voronoi Diagrams and Delaunay triangulations are used everywhere. Geographical Information Systems Graphics Topological Data Analysis Mesh Generation
14 Delaunay triangulations and Voronoi diagrams are projections of polyhedra.
15 Delaunay triangulations and Voronoi diagrams are projections of polyhedra. Parabolic lifting into d+1 dimensions. The Delaunay triangulation is the projection of lower hull. Other liftings yield weighted Delaunay triangulations. (dual to Power diagrams)
16 Delaunay triangulations and Voronoi diagrams are projections of polyhedra. Parabolic lifting into d+1 dimensions. The Delaunay triangulation is the projection of lower hull. Other liftings yield weighted Delaunay triangulations. (dual to Power diagrams)
17 Weighted Voronoi Diagrams (aka Power Diagrams)
18 Weighted Voronoi Diagrams (aka Power Diagrams) The diagrams remain piecewise linear.
19 Weighted Voronoi Diagrams (aka Power Diagrams) The diagrams remain piecewise linear. Some points disappear.
20 Weighted Voronoi Diagrams (aka Power Diagrams) The diagrams remain piecewise linear. Some points disappear. Circumballs are replaced by orthoballs.
21 Weighted Voronoi Diagrams (aka Power Diagrams) The diagrams remain piecewise linear. Some points disappear. Circumballs are replaced by orthoballs.
22 (Convex Hull) A brief history of Voronoi Diagram algorithms.
23 (Convex Hull) A brief history of Voronoi Diagram algorithms. Chazelle 93 O(n log n + n d/2 )
24 (Convex Hull) A brief history of Voronoi Diagram algorithms. Chazelle 93 Swart 85 Avis & Fukuda 92 O(n log n + n d/2 ) O(nf)
25 (Convex Hull) A brief history of Voronoi Diagram algorithms. Chazelle 93 Swart 85 Avis & Fukuda 92 O(n log n + n d/2 ) O(nf) Seidel 86 O(n 2 + f log n)
26 (Convex Hull) A brief history of Voronoi Diagram algorithms. Chazelle 93 Swart 85 Avis & Fukuda 92 O(n log n + n d/2 ) O(nf) Seidel 86 Matousek and Schwartzkopf 92 O(n 2 + f log n) O(n 2 2 d/2 +1 log O(1) n + f log n)
27 (Convex Hull) A brief history of Voronoi Diagram algorithms. Chazelle 93 Swart 85 Avis & Fukuda 92 O(n log n + n d/2 ) O(nf) Seidel 86 Matousek and Schwartzkopf 92 Chan 96 O(n 2 + f log n) O(n 2 2 d/2 +1 log O(1) n + f log n) O(n log f +(nf) 1 1 d/2 +1 log O(1) n)
28 (Convex Hull) A brief history of Voronoi Diagram algorithms. Chazelle 93 Swart 85 Avis & Fukuda 92 O(n log n + n d/2 ) O(nf) Seidel 86 Matousek and Schwartzkopf 92 Chan 96 Chan, Snoeyink, Yap 97 O(n 2 + f log n) O(n 2 2 d/2 +1 log O(1) n + f log n) O(n log f +(nf) 1 1 d/2 +1 log O(1) n) O((n +(nf) 1 1 d/2 + fn 1 2 d/2 )log O(1) n)
29 (Convex Hull) A brief history of Voronoi Diagram algorithms. Chazelle 93 Swart 85 Avis & Fukuda 92 O(n log n + n d/2 ) O(nf) Seidel 86 Matousek and Schwartzkopf 92 Chan 96 Chan, Snoeyink, Yap 97 O(n 2 + f log n) O(n 2 2 d/2 +1 log O(1) n + f log n) O(n log f +(nf) 1 1 d/2 +1 log O(1) n) O((n +(nf) 1 1 d/2 + fn 1 2 d/2 )log O(1) n) Miller and Sheehy (today s talk) O(f log n log )
30 Meshing Points Input: P R d Output: M P with a nice Voronoi diagram n = P,m= M
31 Meshing Points Input: P R d Output: M P with a nice Voronoi diagram n = P,m= M
32 Meshing Points Input: P R d Output: M P with a nice Voronoi diagram n = P,m= M
33 Meshing Points Input: P R d Output: M P with a nice Voronoi diagram n = P,m= M
34 Meshing Points Input: P R d Output: M P with a nice Voronoi diagram n = P,m= M Counterintuitive Fact about Meshing: It s sometimes easier to build the Voronoi/Delaunay of a superset of the input, than of the input alone.
35 Meshing Guarantees
36 Meshing Guarantees Aspect Ratio (quality): v R v r v τ r v R v
37 Meshing Guarantees Aspect Ratio (quality): R v r v Cell Sizing: τ lfs(x) :=d(x, P \{NN(x)}) 1 K lfs(v) R v Klfs(v) v r v R v
38 Meshing Guarantees Aspect Ratio (quality): R v r v Cell Sizing: τ Constant Local Complexity: v R v r v lfs(x) :=d(x, P \{NN(x)}) 1 K lfs(v) R v Klfs(v) Each cell has at most a constant number of faces.
39 Meshing Guarantees Aspect Ratio (quality): R v r v Cell Sizing: τ Constant Local Complexity: v R v r v lfs(x) :=d(x, P \{NN(x)}) 1 K lfs(v) R v Klfs(v) Each cell has at most a constant number of faces. Optimal Size: M =Θ( Optimal )
40 Meshing Guarantees Aspect Ratio (quality): R v r v Cell Sizing: τ Constant Local Complexity: v R v r v lfs(x) :=d(x, P \{NN(x)}) 1 K lfs(v) R v Klfs(v) Each cell has at most a constant number of faces. Optimal Size: M =Θ( Optimal ) Running time: O(n log n + M )
41 Mesh Generation in reverse?
42 Mesh Generation in reverse? Build a quality mesh.
43 Mesh Generation in reverse? Build a quality mesh. Increase the weights of the input points.
44 Mesh Generation in reverse? Build a quality mesh. Increase the weights of the input points. Update the structure for each local change.
45 Mesh Generation in reverse? Build a quality mesh. Increase the weights of the input points. Update the structure for each local change. Local changes are flips.
46 Mesh Generation in reverse? Build a quality mesh. Increase the weights of the input points. Update the structure for each local change. Local changes are flips.
47 Mesh Generation in reverse? Build a quality mesh. Increase the weights of the input points. Update the structure for each local change. Local changes are flips.
48 Mesh Generation in reverse? Build a quality mesh. Increase the weights of the input points. Update the structure for each local change. Local changes are flips.
49 Mesh Generation in reverse? Build a quality mesh. Increase the weights of the input points. Update the structure for each local change. Local changes are flips.
50 Mesh Generation in reverse? Build a quality mesh. Increase the weights of the input points. Update the structure for each local change. Local changes are flips.
51 Mesh Generation in reverse? Build a quality mesh. Increase the weights of the input points. Update the structure for each local change. Local changes are flips.
52 Mesh Generation in reverse? Build a quality mesh. Increase the weights of the input points. Update the structure for each local change. Local changes are flips.
53 Mesh Generation in reverse? Build a quality mesh. Increase the weights of the input points. Update the structure for each local change. Local changes are flips.
54 Mesh Generation in reverse? Build a quality mesh. Increase the weights of the input points. Update the structure for each local change. Local changes are flips.
55 Mesh Generation in reverse? Build a quality mesh. Increase the weights of the input points. Update the structure for each local change. Local changes are flips.
56 The Algorithm
57 The Algorithm Add a bounding box around the points.
58 The Algorithm Add a bounding box around the points. Build a quality mesh of the points.
59 The Algorithm Add a bounding box around the points. Build a quality mesh of the points. Keep potential flips on a heap ordered by flip time.
60 The Algorithm Add a bounding box around the points. Build a quality mesh of the points. Keep potential flips on a heap ordered by flip time. (flip time is the weight of the input points when the flip happens)
61 The Algorithm Add a bounding box around the points. Build a quality mesh of the points. Keep potential flips on a heap ordered by flip time. (flip time is the weight of the input points when the flip happens) Repeatedly pop a flip, attempt to do it, and update.
62 The Algorithm Add a bounding box around the points. Build a quality mesh of the points. Keep potential flips on a heap ordered by flip time. (flip time is the weight of the input points when the flip happens) Repeatedly pop a flip, attempt to do it, and update. (at most O(1) new potential flips are added to the heap)
63 The Algorithm Add a bounding box around the points. Build a quality mesh of the points. Keep potential flips on a heap ordered by flip time. (flip time is the weight of the input points when the flip happens) Repeatedly pop a flip, attempt to do it, and update. (at most O(1) new potential flips are added to the heap) When the heap is empty, remove the bounding box and all incident Delaunay faces.
64 Local changes are flips.
65 Local changes are flips.
66 Local changes are flips.
67 Local changes are flips.
68 Local changes are flips.
69 Local changes are flips.
70 Local changes are flips.
71 Local changes are flips. Flips correspond to intersections of the Voronoi diagram of the mesh and the Voronoi diagram of the input points.
72 There are only log(spread) flips per face.
73 There are only log(spread) flips per face.
74 There are only log(spread) flips per face.
75 A summary of the analysis.
76 A summary of the analysis. Full dimensional mesh cells intersect output faces at most log(spread) times.
77 A summary of the analysis. Full dimensional mesh cells intersect output faces at most log(spread) times. Since each mesh cell has only a constant number of faces, we only get O(f log(spread)) total flips.
78 A summary of the analysis. Full dimensional mesh cells intersect output faces at most log(spread) times. Since each mesh cell has only a constant number of faces, we only get O(f log(spread)) total flips. Each flip generates at most O(1) new flips on the heap.
79 A summary of the analysis. Full dimensional mesh cells intersect output faces at most log(spread) times. Since each mesh cell has only a constant number of faces, we only get O(f log(spread)) total flips. Each flip generates at most O(1) new flips on the heap. The heap operations require O(log n) time each.
80 A summary of the analysis. Full dimensional mesh cells intersect output faces at most log(spread) times. Since each mesh cell has only a constant number of faces, we only get O(f log(spread)) total flips. Each flip generates at most O(1) new flips on the heap. The heap operations require O(log n) time each. Total running time is O(f log n log (spread)).
81 Summary
82 Summary A new output-sensitive algorithm for Voronoi diagrams and Delaunay triangulations in d-dimensions.
83 Summary A new output-sensitive algorithm for Voronoi diagrams and Delaunay triangulations in d-dimensions. Start with a quality mesh and then remove the Steiner points.
84 Summary A new output-sensitive algorithm for Voronoi diagrams and Delaunay triangulations in d-dimensions. Start with a quality mesh and then remove the Steiner points. Use geometry to bound the combinatorial changes.
85 Summary A new output-sensitive algorithm for Voronoi diagrams and Delaunay triangulations in d-dimensions. Start with a quality mesh and then remove the Steiner points. Use geometry to bound the combinatorial changes. Running time: O(f log n log )
86 Summary A new output-sensitive algorithm for Voronoi diagrams and Delaunay triangulations in d-dimensions. Start with a quality mesh and then remove the Steiner points. Use geometry to bound the combinatorial changes. Running time: O(f log n log ) Thank you.
87
Other Voronoi/Delaunay Structures
Other Voronoi/Delaunay Structures Overview Alpha hulls (a subset of Delaunay graph) Extension of Voronoi Diagrams Convex Hull What is it good for? The bounding region of a point set Not so good for describing
More informationTopological Inference via Meshing
Topological Inference via Meshing Don Sheehy Theory Lunch Joint work with Benoit Hudson, Gary Miller, and Steve Oudot Computer Scientists want to know the shape of data. Clustering Principal Component
More informationComputational Geometry Lecture Duality of Points and Lines
Computational Geometry Lecture Duality of Points and Lines INSTITUTE FOR THEORETICAL INFORMATICS FACULTY OF INFORMATICS 11.1.2016 Duality Transforms We have seen duality for planar graphs and duality of
More informationDelaunay Triangulation
Delaunay Triangulation Steve Oudot slides courtesy of O. Devillers MST MST MST use Kruskal s algorithm with Del as input O(n log n) Last: lower bound for Delaunay Let x 1, x 2,..., x n R, to be sorted
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 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 informationTopological Inference via Meshing
Topological Inference via Meshing Benoit Hudson, Gary Miller, Steve Oudot and Don Sheehy SoCG 2010 Mesh Generation and Persistent Homology The Problem Input: Points in Euclidean space sampled from some
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 informationChapter 8. Voronoi Diagrams. 8.1 Post Oce Problem
Chapter 8 Voronoi Diagrams 8.1 Post Oce Problem Suppose there are n post oces p 1,... p n in a city. Someone who is located at a position q within the city would like to know which post oce is closest
More informationIntroduction to Voronoi Diagrams and Delaunay Triangulations
Introduction to Voronoi Diagrams and Delaunay Triangulations Solomon Boulos Introduction to Voronoi Diagrams and Delaunay Triangulations p.1 Voronoi Diagrams Voronoi region: V (p i ) = {x R n p i x p j
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 informationbe a polytope. has such a representation iff it contains the origin in its interior. For a generic, sort the inequalities so that
( Shelling (Bruggesser-Mani 1971) and Ranking Let be a polytope. has such a representation iff it contains the origin in its interior. For a generic, sort the inequalities so that. a ranking of vertices
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 informationAdvanced Algorithms Computational Geometry Prof. Karen Daniels. Fall, 2012
UMass Lowell Computer Science 91.504 Advanced Algorithms Computational Geometry Prof. Karen Daniels Fall, 2012 Voronoi Diagrams & Delaunay Triangulations O Rourke: Chapter 5 de Berg et al.: Chapters 7,
More informationVoronoi Diagrams. A Voronoi diagram records everything one would ever want to know about proximity to a set of points
Voronoi Diagrams Voronoi Diagrams A Voronoi diagram records everything one would ever want to know about proximity to a set of points Who is closest to whom? Who is furthest? We will start with a series
More informationVoronoi Diagrams in the Plane. Chapter 5 of O Rourke text Chapter 7 and 9 of course text
Voronoi Diagrams in the Plane Chapter 5 of O Rourke text Chapter 7 and 9 of course text Voronoi Diagrams As important as convex hulls Captures the neighborhood (proximity) information of geometric objects
More informationCS133 Computational Geometry
CS133 Computational Geometry Voronoi Diagram Delaunay Triangulation 5/17/2018 1 Nearest Neighbor Problem Given a set of points P and a query point q, find the closest point p P to q p, r P, dist p, q dist(r,
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 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 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 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 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 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 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 informationDynamic Mesh Refinement
Dynamic Mesh Refinement Benoît Hudson Joint work with Umut A. Acar, Gary Miller, Todd Phillips Why Mesh? Geometry is continuous Computers are discrete Graphics Scientific Computing Vision, AI,... Mesh
More informationComputational Geometry: Lecture 5
Computational Geometry: Lecture 5 Don Sheehy January 29, 2010 1 Degeneracy In many of the algorithms that we have discussed so far, we have run into problems when that input is somehow troublesome. For
More informationEstimating Geometry and Topology from Voronoi Diagrams
Estimating Geometry and Topology from Voronoi Diagrams Tamal K. Dey The Ohio State University Tamal Dey OSU Chicago 07 p.1/44 Voronoi diagrams Tamal Dey OSU Chicago 07 p.2/44 Voronoi diagrams Tamal Dey
More informationVoronoi Diagram. Xiao-Ming Fu
Voronoi Diagram Xiao-Ming Fu Outlines Introduction Post Office Problem Voronoi Diagram Duality: Delaunay triangulation Centroidal Voronoi tessellations (CVT) Definition Applications Algorithms Outlines
More informationCS 532: 3D Computer Vision 14 th Set of Notes
1 CS 532: 3D Computer Vision 14 th Set of Notes Instructor: Philippos Mordohai Webpage: www.cs.stevens.edu/~mordohai E-mail: Philippos.Mordohai@stevens.edu Office: Lieb 215 Lecture Outline Triangulating
More informationCMPS 3130/6130 Computational Geometry Spring Voronoi Diagrams. Carola Wenk. Based on: Computational Geometry: Algorithms and Applications
CMPS 3130/6130 Computational Geometry Spring 2015 Voronoi Diagrams Carola Wenk Based on: Computational Geometry: Algorithms and Applications 2/19/15 CMPS 3130/6130 Computational Geometry 1 Voronoi Diagram
More informationComputational Geometry. Definition, Application Areas, and Course Overview
Computational Geometry Definition, Application Areas, and Course Overview Computational Geometry is a subfield of the Design and Analysis of Algorithms Computational Geometry is a subfield of the Design
More informationHang Si. Weierstrass Institute for Applied Analysis and Stochastics Berlin, Germany. Tetrahedron II
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,
More informationWeek 8 Voronoi Diagrams
1 Week 8 Voronoi Diagrams 2 Voronoi Diagram Very important problem in Comp. Geo. Discussed back in 1850 by Dirichlet Published in a paper by Voronoi in 1908 3 Voronoi Diagram Fire observation towers: an
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 informationWolfgang Mulzer Institut für Informatik. Computational Geometry with Limited Work-Space: State of the Art and Challenges
Wolfgang Mulzer Institut für Informatik Computational Geometry with Limited Work-Space: State of the Art and Challenges Algorithms with Limited Work-Space Today s software is versatile, fast, and BIG.
More informationApproximate Nearest Neighbor Problem: Improving Query Time CS468, 10/9/2006
Approximate Nearest Neighbor Problem: Improving Query Time CS468, 10/9/2006 Outline Reducing the constant from O ( ɛ d) to O ( ɛ (d 1)/2) in uery time Need to know ɛ ahead of time Preprocessing time and
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 informationPoint Location in Delaunay Triangulations
Point Location in Delaunay Triangulations Inspiration: Graphics software wants to light a model and needs to know which face a light ray hits You moved the mouse and the windowing system would like to
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 informationVoronoi Diagrams and Delaunay Triangulation slides by Andy Mirzaian (a subset of the original slides are used here)
Voronoi Diagrams and Delaunay Triangulation slides by Andy Mirzaian (a subset of the original slides are used here) Voronoi Diagram & Delaunay Triangualtion Algorithms Divide-&-Conquer Plane Sweep Lifting
More informationLecture 2 Unstructured Mesh Generation
Lecture 2 Unstructured Mesh Generation MIT 16.930 Advanced Topics in Numerical Methods for Partial Differential Equations Per-Olof Persson (persson@mit.edu) February 13, 2006 1 Mesh Generation Given a
More informationLecture 16: Voronoi Diagrams and Fortune s Algorithm
contains q changes as a result of the ith insertion. Let P i denote this probability (where the probability is taken over random insertion orders, irrespective of the choice of q). Since q could fall through
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 informationCS 372: Computational Geometry Lecture 3 Line Segment Intersection
CS 372: Computational Geometry Lecture 3 Line Segment Intersection Antoine Vigneron King Abdullah University of Science and Technology September 9, 2012 Antoine Vigneron (KAUST) CS 372 Lecture 3 September
More informationMöbius Transformations in Scientific Computing. David Eppstein
Möbius Transformations in Scientific Computing David Eppstein Univ. of California, Irvine School of Information and Computer Science (including joint work with Marshall Bern from WADS 01 and SODA 03) Outline
More informationLifting Transform, Voronoi, Delaunay, Convex Hulls
Lifting Transform, Voronoi, Delaunay, Convex Hulls Subhash Suri Department of Computer Science University of California Santa Barbara, CA 93106 1 Lifting Transform (A combination of Pless notes and my
More informationarxiv: v1 [cs.cg] 8 Jan 2018
Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon Eunjin Oh Hee-Kap Ahn arxiv:1801.02292v1 [cs.cg] 8 Jan 2018 Abstract Given a set of sites in a simple polygon, a geodesic Voronoi diagram
More informationSublinear Geometric Algorithms
Sublinear Geometric Algorithms B. Chazelle, D. Liu, A. Magen Princeton University / University of Toronto STOC 2003 CS 468 Geometric Algorithms Seminar Winter 2005/2006 Overview What is this paper about?
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 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 informationKinetic Mesh Refinement in 2D
Kinetic Mesh Refinement in D Umut A. Acar Max Planck Institute for Software Systems Germany umut@mpi-sws.org Benoît Hudson Autodesk, Inc. Montréal, QC, Canada benoit.hudson@autodesk.com Duru Türkoğlu Dept.
More informationA Multicover Nerve for Geometric Inference. Don Sheehy INRIA Saclay, France
A Multicover Nerve for Geometric Inference Don Sheehy INRIA Saclay, France Computational geometers use topology to certify geometric constructions. Computational geometers use topology to certify geometric
More informationModule 4: Index Structures Lecture 16: Voronoi Diagrams and Tries. The Lecture Contains: Voronoi diagrams. Tries. Index structures
The Lecture Contains: Voronoi diagrams Tries Delaunay triangulation Algorithms Extensions Index structures 1-dimensional index structures Memory-based index structures Disk-based index structures Classification
More informationComputational Geometry
Lecture 12: Lecture 12: Motivation: Terrains by interpolation To build a model of the terrain surface, we can start with a number of sample points where we know the height. Lecture 12: Motivation: Terrains
More informationProblèmes de robustesse en géométrie algorithmique
Problèmes de robustesse en géométrie algorithmique Monique Teillaud ENS - 12 mars 2008 Computational geometry Solving geometric problems algorithms complexity analysis worst case, average, randomized implementation
More informationHigh-Dimensional Computational Geometry. Jingbo Shang University of Illinois at Urbana-Champaign Mar 5, 2018
High-Dimensional Computational Geometry Jingbo Shang University of Illinois at Urbana-Champaign Mar 5, 2018 Outline 3-D vector geometry High-D hyperplane intersections Convex hull & its extension to 3
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 informationTowards In-Place Geometric Algorithms and Data Structures
Towards In-Place Geometric Algorithms and Data Structures Hervé Brönnimann Timothy M. Chan Eric Y. Chen February 7, 2006 Abstract For many geometric problems, there are efficient algorithms that use surprisingly
More informationGeometric Computation: Introduction
: Introduction Piotr Indyk Welcome to 6.838! Overview and goals Course Information Syllabus 2D Convex hull Signup sheet Geometric computation occurs everywhere: Geographic Information Systems (GIS): nearest
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 informationImage Warping and Morphing. Alexey Tikhonov : Computational Photography Alexei Efros, CMU, Fall 2007
Image Warping and Morphing Alexey Tikhonov 15-463: Computational Photography Alexei Efros, CMU, Fall 2007 Image Warping in Biology D'Arcy Thompson http://www-groups.dcs.st-and.ac.uk/~history/miscellaneous/darcy.html
More informationIn what follows, we will focus on Voronoi diagrams in Euclidean space. Later, we will generalize to other distance spaces.
Voronoi Diagrams 4 A city builds a set of post offices, and now needs to determine which houses will be served by which office. It would be wasteful for a postman to go out of their way to make a delivery
More informationAPPLIED aspects of COMPUTATIONAL GEOMETRY. Dan Halperin School of Computer Science Tel Aviv University
APPLIED aspects of COMPUTATIONAL GEOMETRY Introduction Dan Halperin School of Computer Science Tel Aviv University Lesson overview Background The main topics Course mechanics Additional topics 2 Background
More information(Master Course) Mohammad Farshi Department of Computer Science, Yazd University. Yazd Univ. Computational Geometry.
1 / 17 (Master Course) Mohammad Farshi Department of Computer Science, Yazd University 1392-1 2 / 17 : Mark de Berg, Otfried Cheong, Marc van Kreveld, Mark Overmars, Algorithms and Applications, 3rd Edition,
More informationPersistent Homology and Nested Dissection
Persistent Homology and Nested Dissection Don Sheehy University of Connecticut joint work with Michael Kerber and Primoz Skraba A Topological Data Analysis Pipeline A Topological Data Analysis Pipeline
More informationPlanar Point Location in Sublogarithmic Time
Planar Point Location in Sublogarithmic Time Mihai Pătraşcu (MIT) Point Location in o(log n) Time, Voronoi Diagrams in o(n log n) Time, and Other Transdichotomous Results in Computational Geometry Timothy
More informationVoronoi Diagrams and Delaunay Triangulations. O Rourke, Chapter 5
Voronoi Diagrams and Delaunay Triangulations O Rourke, Chapter 5 Outline Preliminaries Properties and Applications Computing the Delaunay Triangulation Preliminaries Given a function f: R 2 R, the tangent
More informationGeometric Modeling. Bing-Yu Chen National Taiwan University The University of Tokyo
Geometric Modeling Bing-Yu Chen National Taiwan University The University of Tokyo Surface Simplification Motivation Basic Idea of LOD Discrete LOD Continuous LOD Simplification Problem Characteristics
More informationAn Efficient Query Structure for Mesh Refinement
An Efficient Query Structure for Mesh Refinement Benoît Hudson Duru Türkoğlu September 18, 2008 Abstract We are interested in the following mesh refinement problem: given an input set of points P in R
More informationNotes in Computational Geometry Voronoi Diagrams
Notes in Computational Geometry Voronoi Diagrams Prof. Sandeep Sen and Prof. Amit Kumar Indian Institute of Technology, Delhi Voronoi Diagrams In this lecture, we study Voronoi Diagrams, also known as
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 information2 Delaunay Triangulations
and the closed half-space H(b, a) containingb and with boundary the bisector hyperplane is the locus of all points such that (b 1 a 1 )x 1 + +(b m a m )x m (b 2 1 + + b 2 m)/2 (a 2 1 + + a 2 m)/2. The
More informationComputation of Voronoi Diagrams and Delaunay Triangulation via Parametric Linear Programming
Computation of Voronoi Diagrams and Delaunay Triangulation via Parametric Linear Programming Saša V. Raković, Pascal Grieder and Colin Jones September 14, 2004 Abstract This note illustrates how Voronoi
More informationApproximate Centerpoints with Proofs. Don Sheehy and Gary Miller Carnegie Mellon University
Approximate Centerpoints with Proofs Don Sheehy and Gary Miller Carnegie Mellon University Centerpoints Given a set S R d, a centerpoint is a point p R d such that every closed halfspace containing p contains
More informationDelaunay Triangulations. Presented by Glenn Eguchi Computational Geometry October 11, 2001
Delaunay Triangulations Presented by Glenn Eguchi 6.838 Computational Geometry October 11, 2001 Motivation: Terrains Set of data points A R 2 Height ƒ(p) defined at each point p in A How can we most naturally
More informationInsertions and Deletions in Delaunay Triangulations using Guided Point Location. Kevin Buchin TU Eindhoven
Insertions and Deletions in Delaunay Triangulations using Guided Point Location Kevin Buchin TU Eindhoven Heraklion, 21.1.2013 Guide - Example Construct Delaunay triangulation of convex polygon in linear
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 informationOptimal Partition Trees
Optimal Partition Trees Timothy Chan School of CS U. Waterloo Range Searching at the core of computational geometry orthogonal range search semialgebraic range search incidence problems e.g. Hopcroft s
More informationExact adaptive parallel algorithms for data depth problems. Vera Rosta Department of Mathematics and Statistics McGill University, Montreal
Exact adaptive parallel algorithms for data depth problems Vera Rosta Department of Mathematics and Statistics McGill University, Montreal joint work with Komei Fukuda School of Computer Science McGill
More informationComputational Geometry. Algorithm Design (10) Computational Geometry. Convex Hull. Areas in Computational Geometry
Computational Geometry Algorithm Design (10) Computational Geometry Graduate School of Engineering Takashi Chikayama Algorithms formulated as geometry problems Broad application areas Computer Graphics,
More informationBeating the Spread: Time-Optimal Point Meshing
Beating the Spread: Time-Optimal Point Meshing [Extended Abstract] Gary L. Miller Carnegie Mellon University 5000 Forbes Avenue Pittsburgh, PA 15217 glmiller@cs.cmu.edu Todd Phillips Google Inc. Pittsburgh,
More informationData Structures for Approximate Proximity and Range Searching
Data Structures for Approximate Proximity and Range Searching David M. Mount University of Maryland Joint work with: Sunil Arya (Hong Kong U. of Sci. and Tech) Charis Malamatos (Max Plank Inst.) 1 Introduction
More informationThe Farthest Point Delaunay Triangulation Minimizes Angles
The Farthest Point Delaunay Triangulation Minimizes Angles David Eppstein Department of Information and Computer Science UC Irvine, CA 92717 November 20, 1990 Abstract We show that the planar dual to the
More informationPower to the points: Local certificates for clustering
Power to the points: Local certificates for clustering Suresh Venkatasubramanian University of Utah Joint work with Parasaran Raman Data Mining Pipeline Modelling Data Cleaning Exploration Modelling Decision
More informationUTM Geo Map APP Quick Start (Version 1.2)
UTM Geo Map APP Quick Start (Version 1.2) Measure Points (Marker) You can measure points of coordinate base on GPS or position on the Maps and save marker into database for unlimited number using Real-time
More informationSimplicial Complexes: Second Lecture
Simplicial Complexes: Second Lecture 4 Nov, 2010 1 Overview Today we have two main goals: Prove that every continuous map between triangulable spaces can be approximated by a simplicial map. To do this,
More informationSolving problems with Cgal: an example using the 2D Apollonius package
GTS 2012, Chapel Hill, NC, United States, June 17 & 19, 2012 Solving problems with Cgal: an example using the 2D Apollonius package Menelaos I. Karavelas, 1 Introduction The Cgal project [3] is an open
More informationWeighted and Continuous Clustering
John (ARC/ICAM) Virginia Tech... Math/CS 4414: http://people.sc.fsu.edu/ jburkardt/presentations/ clustering weighted.pdf... ARC: Advanced Research Computing ICAM: Interdisciplinary Center for Applied
More informationComputational Geometry. EDU - Tutorial on Computational Geometry (9201)
Computational Geometry EDU - Tutorial on Computational Geometry (9201) Oswin Aichholzer / Thomas Hackl 20 th / 21 st June 2006, TU Graz Martin Peternell / Tibor Steiner 22 nd June 2006, TU Wien Thomas
More informationDelaunay Triangulations
Delaunay Triangulations (slides mostly by Glenn Eguchi) Motivation: Terrains Set of data points A R 2 Height ƒ(p) defined at each point p in A How can we most naturally approximate height of points not
More informationLecture 1: September 6, 2001
Lecture 1: September 6, 2001 Welcome to 6.838J, Geometric Computation! Introductions Overview and Goals General Information Syllabus 2D Convex Hull Signup sheets (return by end of class) MIT 6.838J/4.214J
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 informationSimulations of the quadrilateral-based localization
Simulations of the quadrilateral-based localization Cluster success rate v.s. node degree. Each plot represents a simulation run. 9/15/05 Jie Gao CSE590-fall05 1 Random deployment Poisson distribution
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 informationLecture 11 Combinatorial Planning: In the Plane
CS 460/560 Introduction to Computational Robotics Fall 2017, Rutgers University Lecture 11 Combinatorial Planning: In the Plane Instructor: Jingjin Yu Outline Convex shapes, revisited Combinatorial planning
More informationSurfaces: notes on Geometry & Topology
Surfaces: notes on Geometry & Topology 1 Surfaces A 2-dimensional region of 3D space A portion of space having length and breadth but no thickness 2 Defining Surfaces Analytically... Parametric surfaces
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 informationComputational Topology in Reconstruction, Mesh Generation, and Data Analysis
Computational Topology in Reconstruction, Mesh Generation, and Data Analysis Tamal K. Dey Department of Computer Science and Engineering The Ohio State University Dey (2014) Computational Topology CCCG
More informationAlgorithmische Geometrie Voronoi Diagram
Algorithmische Geometrie Voronoi Diagram Martin Held FB Computerwissenschaften Universität Salzburg A 5020 Salzburg, Austria May 28, 2008 Quit Full Screen Previous Page Next Page GoTo Page Go Forward Go
More informationROBOT MOTION USING DELAUNAY TRIANGULATION
ROBOT MOTION USING DELAUNAY TRIANGULATION by Ioana-Maria Ileană Abstract. Robot motion is nowadays studied from a lot of different perspectives. This paper is based on the assumption of a fully known environment,
More information