Computational Geometry II Brian Chen Rice University Computer Science.

Slides:



Advertisements
Similar presentations
Order-k Voronoi Diagram in the Plane
Advertisements

Alpha Shapes. Used for Shape Modelling Creates shapes out of point sets Gives a hierarchy of shapes. Has been used for detecting pockets in proteins.
Comments We consider in this topic a large class of related problems that deal with proximity of points in the plane. We will: 1.Define some proximity.
 Distance Problems: › Post Office Problem › Nearest Neighbors and Closest Pair › Largest Empty and Smallest Enclosing Circle  Sub graphs of Delaunay.
Applications of Euler’s Formula for Graphs Hannah Stevens.
Proximity graphs: reconstruction of curves and surfaces
Projective Geometry Ernest Davis Csplash April 26, 2014.
Morphing CSE 590 Computational Photography Tamara Berg.
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.
What does that mean? To get the taste we will just look only at some sample problems... [Adapted from S.Suri]
3/5/15CMPS 3130/6130 Computational Geometry1 CMPS 3130/6130 Computational Geometry Spring 2015 Delaunay Triangulations II Carola Wenk Based on: Computational.
Discrete Geometry Tutorial 2 1
CHAPTER 5: CONVEX POLYTOPES Anastasiya Yeremenko 1.
1st Meeting Industrial Geometry Computational Geometry ---- Some Basic Structures 1st IG-Meeting.
Dual Marching Cubes: An Overview
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.
Delaunay Triangulation Computational Geometry, WS 2006/07 Lecture 11 Prof. Dr. Thomas Ottmann Algorithmen & Datenstrukturen, Institut für Informatik Fakultät.
1 Lecture 8: Voronoi Diagram Computational Geometry Prof. Dr. Th. Ottmann Voronoi Diagrams Definition Characteristics Size and Storage Construction Use.
By Eyal Dushkin [Ed] Chapter 1. I. Introduction Reminder – Voronoi Diagrams  Let S be a set of sites in the plane.  Each point in the plane.
Delaunay Triangulation on the GPU Dan Maljovec. CPU Delaunay Triangulation Randomized Incremental Algorithm 1.Construct Bounding triangle 2.Choose point.
Graph Drawing Introduction 2005/2006. Graph Drawing: Introduction2 Contents Applications of graph drawing Planar graphs: some theory Different types of.
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,
Duality and Arrangements Computational Geometry, WS 2007/08 Lecture 6 Prof. Dr. Thomas Ottmann Algorithmen & Datenstrukturen, Institut für Informatik Fakultät.
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.
Center for Graphics and Geometric Computing, Technion 1 Computational Geometry Chapter 9 Delaunay Triangulation.
Image Morphing : Rendering and Image Processing Alexei Efros.
CS CS 175 – Week 3 Triangulating Point Clouds VD, DT, MA, MAT, Crust.
Lecture 8 : Arrangements and Duality Computational Geometry Prof. Dr. Th. Ottmann 1 Duality and Arrangements Duality between lines and points Computing.
UNC Chapel Hill M. C. Lin Overview of Last Lecture About Final Course Project –presentation, demo, write-up More geometric data structures –Binary Space.
Image Morphing : Computational Photography Alexei Efros, CMU, Fall 2005 © Alexey Tikhonov.
Computing the Delaunay Triangulation By Nacha Chavez Math 870 Computational Geometry; Ch.9; de Berg, van Kreveld, Overmars, Schwarzkopf By Nacha Chavez.
Voronoi Diagrams.
Image Morphing, Triangulation CSE399b, Spring 07 Computer Vision.
Duality and Arrangements Computational Geometry, WS 2006/07 Lecture 7 Prof. Dr. Thomas Ottmann Algorithmen & Datenstrukturen, Institut für Informatik Fakultät.
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.
ADA: 14. Intro to CG1 Objective o give a non-technical overview of Computational geometry, concentrating on its main application areas Algorithm.
PRE-TRIANGULATIONS Generalized Delaunay Triangulations and Flips Franz Aurenhammer Institute for Theoretical Computer Science Graz University of Technology,
Introduction to Computational Geometry Hackson
Center for Graphics and Geometric Computing, Technion 1 Computational Geometry Chapter 8 Arrangements and Duality.
Geometric Concepts and Terms LT 1A: I can explain the difference between undefined concepts (point, line, and plane) and terms (angle, circle, perpendicular.
Order-k Voronoi diagram in the plane Dominique Schmitt Université de Haute-Alsace.
Center for Graphics and Geometric Computing, Technion 1 Computational Geometry Chapter 8 Arrangements and Duality.
Arrangements and Duality Sanjay Sthapit Comp290 10/6/98.
Arrangements and Duality Motivation: Ray-Tracing Fall 2001, Lecture 9 Presented by Darius Jazayeri 10/4/01.
Kansas State University Department of Computing and Information Sciences Friday, July 13, 2001 Mantena V. Raju Department of Computing and Information.
L8 - Delaunay triangulation L8 – Delaunay triangulation NGEN06(TEK230) – Algorithms in Geographical Information Systems.
1 11. Polygons Polygons 2D polygons ( 다각형 ) –Polygon sides are all straight lines lying in the same plane 3D polyhedra ( 다면체 )  chap. 12 –Polyhedra.
Delaunay Triangulation on the GPU
UNC Chapel Hill M. C. Lin Delaunay Triangulations Reading: Chapter 9 of the Textbook Driving Applications –Height Interpolation –Constrained Triangulation.
Multimedia Programming 10: Image Morphing
3/3/15CMPS 3130/6130 Computational Geometry1 CMPS 3130/6130 Computational Geometry Spring 2015 Delaunay Triangulations I Carola Wenk Based on: Computational.
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.
CMPS 3130/6130 Computational Geometry Spring 2017
Introduction to Spatial Computing CSE 555
Image Morphing © Zooface Many slides from Alexei Efros, Berkeley.
Grids Geometry Computational Geometry
Grids Geometry Computational Geometry
Grids Geometry Computational Geometry
Computational Geometry
Convex Hull - most ubiquitous structure in computational geometry
Presentation transcript:

Computational Geometry II Brian Chen Rice University Computer Science

uhh... Recap, Please? n Arrangements are sets of Lines in the plane, in general position n Each pair intersects in exactly one point n Can be described by Euclidean Coordinates (y = mx + b and all that)

Purposes and Topics n Present a mathematical framework for discussing the topics in the remainder of the course n Duality, Convex Hulls, Envelopes, Voronoi Diagrams, and Delauney Triangulations

Duals, duality and dual spaces n Lines can be uniquely designated by the equations which describe them n Example: y = 3x + 4 is uniquely described by the values 3 and 4. n Points can be uniquely designated by their coordinates on the plane n Example: (3, 4) is obviously the only point at x = 3, y = 4.

Who cares, Brian? n Since lines and points are uniquely determined by two values, that means that there exists a bijection between them. n A Bijection is a mapping which correlates one member of one set with exactly one member of the other set, and also correlates one member of the other set with one of the first.

A new point of view n This bijection means that we can now transform problems about points in space into problems about lines, and vice versa. n It also leads to some very interesting properties on the plane and the dual plane: n definitions: dual of an arrangement, dual of a constellation, dual space.

Duality Mappings n There isnt just one mapping between points and lines. n As long as the mapping is one-one and onto (e.g. a bijection) then the mapping is a duality mapping. (Examples) n (note: we ignore pairs with identical x-values, because this results in parallel lines)

What about sets of points? n Sets of points in dual space are very interesting: n a Segment is a set of points along a line. Since the segment doesn’t have infinite slope, all the points have lines in the dual space which intersect. In fact; they all intersect at the same point. (Proof)

What about more than just 2 points? n A line segment is composed of an infinite number of collinear points n In the dual space, it looks like two wedges

Convex Hulls n An object which is Convex is an object where for any pair of points p and q inside the object, the line segment pq is entirely contained within the object. n The Convex Hull of a set A of points is the smallest convex set of points which contain all the points in A.

Pictures: (on board)

Why do we want to know? n Knowing that we are operating on convex sets lets us write fast collision detection algorithms, and we can use a convex shape to approximate many complicated objects n Convex Hulls also let us do fast visibility calculations (draw pic)

Interesting Duality: Envelopes n The Upper Envelope is the intersection of all upper half planes of an arrangement of lines. n The Lower Envelope is the intersection of all lower half planes of the lines.

3d Generalization n Points in 3d turn into planes in the dual space n segments in 3d turn into X-prisms in the dual space (drawing)

Putting ideas together n Now we can exactly correlate constellations of points with arrangements of lines n Constellations have the interesting property of Convex Hulls n Lines have the interesting property of Envelopes n *cough*CORRELATION*cough*

Are Hulls and Envelopes related? n We have a notion of boxing in points n We have a notion of boxing in lines n Because of duals, EVERY point is a line in dual space, and every line in dual space is a point.

The dual of an arrangement n Is a set of points in cartesian space. n Doesn’t APPEAR to have anything to do with the set of lines. (hint: I’m lying)

Tell us already! n Upper Convex Hulls Correspond to lower Envelopes, and Lower Convex Hulls Correspond to upper Envelopes.

Section II: Voronoi Diagrams n What are Voronoi Diagrams? n A Voronoi Diagram Is a partition of a space defined for an individual constellation of points in the space.

Defintion n The space is partitioned into cells, such that a point on the plane is in a cell iff the constellation point in the cell is the closest constellation point. n A point is on a “Boundary” if the point is equidistant between two or more contellation points.

Pictures, Pictures, Pictures n Simple picture with 2 points n More complicated picture with 3 points n Definition of general position (no three on a line, no four on a circle ) n General picture

Interesting Properties n definition: Voronoi vertex, Voronoi edge, Voronoi boundary. n A point p is a Voronoi vertex iff the largest empty circle C(p) around p contains at least three Voronoi sites. n A point p is on the Voronoi boundary iff the largest empty circle surrounding it contains exactly two sites.

Delaunay Triangulations n Are the border connectivity graphs of Voronoi diagrams n Picture

Properties n Delaunay Graphs are always planar. n If T is a triangulation of points P, then T is Delaunay iff the circumcircle of any triangle contains no other point of P. n Definition of “Legal Triangulation” (see next slide)

General Triangulation n aribitrarily making triangles everywhere. n Triangulations used to describe height maps from point samples. n Need triangulations which don’t do stupid things

Last Property n Delauney Triangulations are the only legal triangulation n If a Triangulation T is Delaunay iff it is legal. n Delauney Triangulations are the “best” Triangulations

Next Topic: Collision detection n Begin using the structures described this week and last week.