Reducing the degree of Apollonius Diagram Predicates David Millman Advisors: Sylvain Pion and Christophe Delage July 6th 2006.

Slides:

Advertisements

Similar presentations

Order-k Voronoi Diagram in the Plane

Advertisements

1. Find the cost of each of the following using the Nearest Neighbor Algorithm. a)Start at Vertex M.

Every edge is in a red ellipse (the bags). The bags are connected in a tree. The bags an original vertex is part of are connected.

Voronoi Diagram – Fortune ’ s Algorithm Reporter: GI1 11 號蔡逸凡 Date: 2004/10/28 Reference: Computational Geometry ch7 ISBN:

Surface Reconstruction From Unorganized Point Sets

CSE 681 Bounding Volumes. CSE 681 Bounding Volumes Use simple volume enclose object(s) tradeoff for rays where there is extra intersection test for object.

 Distance Problems: › Post Office Problem › Nearest Neighbors and Closest Pair › Largest Empty and Smallest Enclosing Circle  Sub graphs of Delaunay.

Bounded-Degree Polyhedronization of Point Sets Andrew Winslow with Gill Barequet, Nadia Benbernou, David Charlton, Erik Demaine, Martin Demaine, Mashhood.

Proximity graphs: reconstruction of curves and surfaces

Computational Geometry II Brian Chen Rice University Computer Science.

1 Voronoi Diagrams. 2 Voronoi Diagram Input: A set of points locations (sites) in the plane.Input: A set of points locations (sites) in the plane. Output:

The Divide-and-Conquer Strategy

By Groysman Maxim. Let S be a set of sites in the plane. Each point in the plane is influenced by each point of S. We would like to decompose the plane.

Convex Hulls in 3-space Jason C. Yang.

Andrew's Monotone Chain Convex Hull Algorithm. Andrew's Monotone Chain Scan A left-to-right variant of Graham's scan Discovered by Andrew in 1979 Using.

The Voronoi diagram of convex objects in the plane Menelaos Karavelas & Mariette Yvinec Dagsthul Workshop, march 2003.

1st Meeting Industrial Geometry Computational Geometry ---- Some Basic Structures 1st IG-Meeting.

A Fast Algorithm for Incremental Distance Calculation Paper by Ming C. Ling and John F. Canny Presented by Denise Jones.

Lecture 7: Voronoi Diagrams Presented by Allen Miu Computational Geometry September 27, 2001.

Computational Geometry -- Voronoi Diagram

17. Computational Geometry Chapter 7 Voronoi Diagrams.

2. Voronoi Diagram 2.1 Definiton Given a finite set S of points in the plane , each point X of  defines a subset S X of S consisting of the points of.

3. Delaunay triangulation

1cs542g-term Notes. 2 Meshing goals  Robust: doesn’t fail on reasonable geometry  Efficient: as few triangles as possible Easy to refine later.

1 Lecture 8: Voronoi Diagram Computational Geometry Prof. Dr. Th. Ottmann Voronoi Diagrams Definition Characteristics Size and Storage Construction Use.

Jack Snoeyink FWCG08 Oct 31, 2008 David L. Millman University of North Carolina - Chapel Hill.

UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2001 Lecture 4 Chapter 6: Arrangements Monday,

By Dor Lahav. Overview Straight Skeletons Convex Polygons Constrained Voronoi diagrams and Delauney triangulations.

UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2007 Chapter 5: Voronoi Diagrams Wednesday,

Voronoi Diagrams Computational Geometry, WS 2006/07 Lecture 10 Prof. Dr. Thomas Ottmann Algorithmen & Datenstrukturen, Institut für Informatik Fakultät.

Half-Space Intersections

UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2004 Chapter 5: Voronoi Diagrams Monday, 2/23/04.

Lecture 10 : Delaunay Triangulation Computational Geometry Prof. Dr. Th. Ottmann 1 Overview Motivation. Triangulation of Planar Point Sets. Definition.

1 Dr. Scott Schaefer The Bernstein Basis and Bezier Curves.

A Parallel Delaunay algorithm for CGAL

Center for Graphics and Geometric Computing, Technion 1 Computational Geometry Chapter 9 Delaunay Triangulation.

Computing the Delaunay Triangulation By Nacha Chavez Math 870 Computational Geometry; Ch.9; de Berg, van Kreveld, Overmars, Schwarzkopf By Nacha Chavez.

Voronoi Diagrams.

A Study of the Relationship between SVM and Gabriel Graph ZHANG Wan and Irwin King, Multimedia Information Processing Laboratory, Department of Computer.

UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2001 Lecture 3 Chapter 4: 3D Convex Hulls Chapter.

Anisotropic Voronoi Diagrams and Guaranteed-Quality Anisotropic Mesh Generation François Labelle Jonathan Richard Shewchuk Computer Science Division University.

UNC Chapel Hill M. C. Lin Point Location Chapter 6 of the Textbook –Review –Algorithm Analysis –Dealing with Degeneracies.

Delaunay Triangulations Presented by Glenn Eguchi Computational Geometry October 11, 2001.

Stony Brook University

A brief and sketchy intro to 3D Convex Hulls Rodrigo Silveira GEOC 2010/11 - Q2.

Line Arrangement Chapter 6. Line Arrangement Problem: Given a set L of n lines in the plane, compute their arrangement which is a planar subdivision.

5 -1 Chapter 5 The Divide-and-Conquer Strategy A simple example finding the maximum of a set S of n numbers.

3D Triangulations in Pierre Alliez.

David Claus and Christoph F. Eick: Nearest Neighbor Editing and Condensing Techniques Nearest Neighbor Editing and Condensing Techniques 1.Nearest Neighbor.

Order-k Voronoi diagram in the plane Dominique Schmitt Université de Haute-Alsace.

Voronoi Diagram (Supplemental)

Warm-Up 1) Draw a polygon that is not convex. 2) Find the measure of an exterior angle of a regular decagon. 3) Find the circumference and area of a circle.

1 Dr. Scott Schaefer Intersecting Simple Surfaces.

1 / 41 Convex Hulls in 3-space Jason C. Yang. 2 / 41 Problem Statement Given P: set of n points in 3-space Return: –Convex hull of P: CH (P) –Smallest.

UNC Chapel Hill M. C. Lin Delaunay Triangulations Reading: Chapter 9 of the Textbook Driving Applications –Height Interpolation –Constrained Triangulation.

Lecture 19 Minimal Spanning Trees CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.

CENG 789 – Digital Geometry Processing 03- Point Sets Asst. Prof. Yusuf Sahillioğlu Computer Eng. Dept,, Turkey.

An Introduction to Computational Geometry: Arrangements and Duality Joseph S. B. Mitchell Stony Brook University Some images from [O’Rourke, Computational.

Bigyan Ankur Mukherjee University of Utah. Given a set of Points P sampled from a surface Σ,  Find a Surface Σ * that “approximates” Σ  Σ * is generally.

CMPS 3130/6130 Computational Geometry Spring 2017

Andrew's Monotone Chain Convex Hull Algorithm

Intersecting Simple Surfaces

VORONOI DIAGRAMS FOR PARALLEL HALFLINES IN 3D

Localizing the Delaunay Triangulation and its Parallel Implementation

Craig Schroeder October 26, 2004

Max-Cut a b Edges cut: 8 w c d e 1.

Chapter 7 Voronoi Diagrams

A path that uses every vertex of the graph exactly once.

Presentation transcript:

Reducing the degree of Apollonius Diagram Predicates David Millman Advisors: Sylvain Pion and Christophe Delage July 6th 2006

Background o Voronoi Diagram o Apollonius Diagram o Power Diagram o Incremental Algorithm o Invert and project

Voronoi Diagram

Apollonius Diagram Weighed point or Site s i is defined by p i, the point and w i the weight

Apollonius Graph Dual of Apollonius Diagram Vertex is a Site Edge two sites whose AW-Voronoi Cell share a face

Power Diagram

Incremental Algorithm The Three basic steps 1. Locate nearest neighbor 2. Check if new site is trivial 3. Update Vertex Conflict Edge Conflict

Vertex Conflict

Edge Conflict

Invert and Project

Invert and Project Convex Hull

Predicates Vertex Conflict, Edge Conflict Sub Predicates Orientation, Radical Side, Radical Intersection, Power Test, Order On a Line

Orientation

Radical Side

Radical Intersection

Vertex Conflict (revisited) There are 6 cases, and we have vertex conflict when: O-, RI-, RS{+|-} O+, RI+, RS+ O-, RI+, RS+

Vertex Conflict (degeneracies) When Orientation is 0 When Radical Intersection is 0

Pertubations Consistent ordering 1. Max Radius 2. Lexigraphically

Edge Conflict (revisited) We are looking for the case of q breaking 2 into multiple sections, when inverted and projection onto the unit sphere.

Numerical Results 66% speedup for vertex conflict 4 finite sites 39% speedup for vertex conflict 3 finite and 1 infinite site 10-20% lessfilter failures in nearly degenerate cases

Further Work Optimize Edge Conflict Optimizations of the Incremental Algorithm Degeneracies in 3D Reduction of Exact Computations

Reducing the degree of Apollonius Diagram Predicates Merci!!!