Lifting Transform, Voronoi, Delaunay, Convex Hulls

Similar documents
Chapter 8. Voronoi Diagrams. 8.1 Post Oce Problem

Computational Geometry

3. Voronoi Diagrams. 3.1 Definitions & Basic Properties. Examples :

Voronoi Diagrams and Delaunay Triangulations. O Rourke, Chapter 5

Voronoi Diagrams. A Voronoi diagram records everything one would ever want to know about proximity to a set of points

Voronoi diagrams Delaunay Triangulations. Pierre Alliez Inria

Computational Geometry

In what follows, we will focus on Voronoi diagrams in Euclidean space. Later, we will generalize to other distance spaces.

6.854J / J Advanced Algorithms Fall 2008

2 Delaunay Triangulations

Other Voronoi/Delaunay Structures

Voronoi Diagram. Xiao-Ming Fu

PS Computational Geometry Homework Assignment Sheet I (Due 16-March-2018)

Voronoi Diagrams in the Plane. Chapter 5 of O Rourke text Chapter 7 and 9 of course text

Midpoint Routing algorithms for Delaunay Triangulations

WHAT YOU SHOULD LEARN

Lecture 16: Voronoi Diagrams and Fortune s Algorithm

be a polytope. has such a representation iff it contains the origin in its interior. For a generic, sort the inequalities so that

Advanced Algorithms Computational Geometry Prof. Karen Daniels. Fall, 2012

High-Dimensional Computational Geometry. Jingbo Shang University of Illinois at Urbana-Champaign Mar 5, 2018

Computational Geometry: Lecture 5

CS 532: 3D Computer Vision 14 th Set of Notes

Search and Intersection. O Rourke, Chapter 7 de Berg et al., Chapter 11

Voronoi diagram and Delaunay triangulation

The Farthest Point Delaunay Triangulation Minimizes Angles

2 Geometry Solutions

EXTREME POINTS AND AFFINE EQUIVALENCE

CS S Lecture February 13, 2017

Planar Graphs. 1 Graphs and maps. 1.1 Planarity and duality

Lecture 3 Randomized Algorithms

CMPS 3130/6130 Computational Geometry Spring Voronoi Diagrams. Carola Wenk. Based on: Computational Geometry: Algorithms and Applications

CS133 Computational Geometry

Lecture 1 Discrete Geometric Structures

An Introduction to Computational Geometry: Arrangements and Duality

Computational Geometry Exercise Duality

7 Voronoi Diagrams. The Post Office Problem

Optimal Compression of a Polyline with Segments and Arcs

Preferred directions for resolving the non-uniqueness of Delaunay triangulations

Approximate Nearest Neighbor Problem: Improving Query Time CS468, 10/9/2006

Computational Geometry Lecture Duality of Points and Lines

G 6i try. On the Number of Minimal 1-Steiner Trees* Discrete Comput Geom 12:29-34 (1994)

Week 8 Voronoi Diagrams

Basic tool: orientation tests

2D Geometry. Pierre Alliez Inria Sophia Antipolis

Fortune s Algorithm. Notes from the book by de Berg, Van Krevald, Overmars, and Schwarzkpf

Notes in Computational Geometry Voronoi Diagrams

Dirichlet Voronoi Diagrams and Delaunay Triangulations

To graph the point (r, θ), simply go out r units along the initial ray, then rotate through the angle θ. The point (1, 5π 6. ) is graphed below:

Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes

Lectures 19: The Gauss-Bonnet Theorem I. Table of contents

1. Use the Trapezium Rule with five ordinates to find an approximate value for the integral

10. Line Arrangements Lecture on Monday 2 nd November, 2009 by Michael Homann

Line Arrangement. Chapter 6

Average case analysis of dynamic geometric optimization

Delaunay Triangulations

Simplicial Complexes: Second Lecture

Möbius Transformations in Scientific Computing. David Eppstein

Module 4: Index Structures Lecture 16: Voronoi Diagrams and Tries. The Lecture Contains: Voronoi diagrams. Tries. Index structures

Rubber bands. Chapter Rubber band representation

Tiling Three-Dimensional Space with Simplices. Shankar Krishnan AT&T Labs - Research

Intersection of planar figures. Intersection of a parallelogram and a triangle

HYPERPLANE SEPARABILITY AND CONVEXITY OF PROBABILISTIC POINT SETS

Restricted-Orientation Convexity in Higher-Dimensional Spaces

Chapter 10. Exploring Conic Sections

Course 16 Geometric Data Structures for Computer Graphics. Voronoi Diagrams

Basic Euclidean Geometry

Inversive Plane Geometry

Voronoi diagrams and applications

Numerical Optimization

Quadric Surfaces. Six basic types of quadric surfaces: ellipsoid. cone. elliptic paraboloid. hyperboloid of one sheet. hyperboloid of two sheets

Final Exam 1:15-3:15 pm Thursday, December 13, 2018

CMSC 425: Lecture 9 Geometric Data Structures for Games: Geometric Graphs Thursday, Feb 21, 2013

Tangents of Parametric Curves

Math 414 Lecture 2 Everyone have a laptop?

Chapter 23. Linear Motion Motion of a Bug

On the number of distinct directions of planes determined by n points in R 3

Visualizing Triangle Centers Using Geogebra

Lecture 3: Convex sets

CMSC 754 Computational Geometry 1

Lecture 15: The subspace topology, Closed sets

Differential Geometry: Circle Patterns (Part 1) [Discrete Conformal Mappinngs via Circle Patterns. Kharevych, Springborn and Schröder]

Packing Two Disks into a Polygonal Environment

of a set of n straight lines, have been considered. Among them are k-sets in higher dimensions or k-levels of curves in two dimensions and surfaces in

The Helly Number of the Prime-coordinate Point Set

Convex 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.

Voronoi Diagrams, Delaunay Triangulations and Polytopes

Improved Results on Geometric Hitting Set Problems

Three-Dimensional Coordinate Systems

10-2 Circles. Warm Up Lesson Presentation Lesson Quiz. Holt Algebra2 2

5. y 2 + z 2 + 4z = 0 correct. 6. z 2 + x 2 + 2x = a b = 4 π

arxiv: v2 [math.mg] 24 Jul 2013

MAT 3271: Selected Solutions to the Assignment 6

To graph the point (r, θ), simply go out r units along the initial ray, then rotate through the angle θ. The point (1, 5π 6

About Graphing Lines

Each point P in the xy-plane corresponds to an ordered pair (x, y) of real numbers called the coordinates of P.

Simplicial Cells in Arrangements of Hyperplanes

CS-9645 Introduction to Computer Vision Techniques Winter 2019

2018 AMC 12B. Problem 1

274 Curves on Surfaces, Lecture 5

Voronoi Diagrams and Delaunay Triangulation slides by Andy Mirzaian (a subset of the original slides are used here)

Transcription:

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 own.) There is a fascinating relationship between Delaunay triangulations, Voronoi diagrams for two-dimensional points the convex hull of a particular set of 3- dimensional points. At first, Delaunay triangulations (or Voronoi diagrams) and convex hulls appear to be quite different structures: the former uses metric properties (distances) while the latter depends on affine properties (collinearity, coplanarity). The connection between the two is through a Lifting Transform, which maps a set of d-dim points to a set of objects (points or hyperplanes) in dimension d + 1. We will demonstrate the connection in dimension 2. The basis of the transform is the paraboloid z = x 2 + y 2. This equation defines a surface whose vertical cross sections (constant x or constant y) are parabolas, and whose horizontal cross sections (constant z) are circles. For each point in the plane, (x, y), the vertical projection of this point onto this paraboloid is (x, y, x 2 + y 2 ) in 3 space. Given a set of points S in the plane, let S 0 denote the projection of the points in S onto this paraboloid. Now, consider the lower convex hull of S 0. This is the portion of the convex hull of S 0 which is visible to a viewer standing at z = 1. We claim that if we take the lower convex hull of S 0, and project it back onto the plane, then we get the Delaunay triangulation 1

of S. In particular, let (p, q, r) be elements of S, and let p 0, q 0, r 0 denote the projections of these points onto the paraboloid. Then p 0 q 0 r 0 define a face of the lower convex hull of S 0 if and only if pqr is a triangle of the Delaunay triangulation of S. The process is illustrated in the following figure. 2 Delaunay Triangulation The question is, why does this work? To see why, we need to establish the connection between the triangles of the Delaunay triangulation and the faces of the convex hull of transformed points. In particular, recall that [Delaunay condition:] Three points p, q, r, in S form a Delaunay triangle if and only if the circumcircle of these points contains no other point of S. [Convex hull condition:] Three points p 0, q 0, r 0 in S 0 form a face of the convex hull of S 0 if and only if the plane passing through p 0, q 0, and r 0 has all the points of S 0 lying to one side. Clearly, the connection we need to establish is between the emptiness of circumcircles in the plane and the emptiness of halfspaces in 3 space. We will prove the following claim. Lemma 1. Consider 4 distinct points p, q, r, s in the plane, and let p 0, q 0, r 0, s 0 be their respective projections onto the paraboloid, z = x 2 + y 2. The point s lies within the circumcircle of p, q, r if and only if s 0 lies on the lower side of the plane passing through p 0, q 0, r 0. 2

To prove the lemma, first consider an arbitrary (nonvertical) plane in 3 space, which we assume is tangent to the paraboloid above some point (a, b) in the plane. What is the equation of this tangent plane? We determine the slopes of the plane by taking the derivatives of z = x 2 + y 2 with respect to x and y, namely, dz/dx = 2x and dz/dy = 2y, and evaluating them at the point (a, b, a 2 + b 2 ). These evaluate to 2a and 2b. Therefore, the plane passing through these point has the form z = 2ax + 2by + k. To solve for k we use the fact that the plane passes through (a, b, a 2 + b 2 ), and so we can eliminate z by setting: a 2 + b 2 = 2a 2 + 2b 2 + k, which gives k = (a 2 + b 2 ). Thus the plane equation is: z = 2ax + 2by (a 2 + b 2 ) Next, if we shift the plane upwards by some positive amount ρ 2 we get the plane z = 2ax + 2by (a 2 + b 2 ) + ρ 2 How does this plane intersect the paraboloid? Since the paraboloid is defined by: z = x 2 + y 2, we can eliminate z, giving x 2 + y 2 = 2ax + 2by (a 2 + b 2 ) + ρ 2 which after some simple rearrangements is equal to (x a) 2 + (y b) 2 = ρ 2 This is just a circle. Thus, the intersection of a plane with the paraboloid produces a space curve (which turns out to be an ellipse), which when projected back onto the (x, y) coordinate plane is a circle centered at (a, b). Furthermore, the squared radius of the circle equals the vertical distance between the projection of the (a, b) onto the paraboloid and its projection onto the plane. 3

Thus, we conclude that the intersection of an arbitrary lower halfspace with the paraboloid, when projected onto the (x, y) plane is the interior of a circle. Going back to the lemma, when we project the points p, q, r onto the paraboloid, the projected points p 0, q 0, r 0 define a plane. Since p 0, q 0, r 0, lie at the intersection of the plane and paraboloid, the original points p, q, r lie on the projected circle. Thus this circle is the (unique) circumcircle passing through these p, q, r. The point s lies within this circumcircle, if and only if its projection s 0 onto the paraboloid lies within the lower halfspace of the plane passing through. 3 Voronoi Diagram Given a point p = (a, b), the hyperplane H(p) that is tangent to p s lifting, namely, (a, b, a 2 + b 2 ), has the equation z = 2ax + 2by (a 2 + b 2 ) Now, consider an arbitrary point q = (α, β) in the plane. What is the vertical distance from q to the paraboloid? Just (α 2 + β 2 ). What is the vertical distance from q to plane H(p)? It is 2aα + 2bβ (a 2 + b 2 ). Let (p, q) denote the difference between these two vertical distance, namely, the additional distance that q projection on H(p) has to travel to reach the paraboloid. We get (p, q) = α 2 + β 2 2(aα + bβ) + a 2 + b 2 = (a α) 2 + (b β) 2 4

That is, (p, q) equals precisely the two-dimensional distance between p and q in their ambient space. Now, consider two points p 1 and p 2 in the plane z = 0. We claim that q is closer to p 1 if and only if at the position q = (α, β), the plane H(p 1 ) lies above (closer to the paraboloid) than H(p 2 ). It simply follows from the vertical distance formula. We, therefore, have the following lemma. Lemma 2. Let p 1, p 2,..., p n be a set of points in the plane z = 0. Then, a point q belongs to the Voronoi cell of the point p i if and only if H(p i ) is the highest plane (seen from z = + ) at q. Therefore, the Voronoi diagram of p 1, p 2,..., p n is simply the vertical projection, down to plane z = 0, of the point-wise maxima of the downward facings halfspaces H(p i ). Or, equivalently, is the uppermost face of the arrangement defined by these planes. 4 Order k Voronoi Diagrams We can define order k Voronoi diagram as a partition of the plane into convex regions where each region has the same set of k nearest neighbors. The ordinary Voronoi diagram is the order 1. (The relative order of neighbors may change, but the set is the same.) By the vertical distance argument it is also clear that if we consider the kthe level in the arrangement formed by the hyperplanes H(p i ), where the topmost level is level 1, then we have the property that for any point on the level k, the same k planes lie above (and thus are closest to) the point on the projected space. 5