Computational Geometry

Slides:



Advertisements
Similar presentations
Two Segments Intersect?
Advertisements

Polygon Triangulation
Spatial Information Systems (SIS) COMP Terrain modeling and geometric problems (part 2)
Computational Geometry
algorithms and data structures
Brute-Force Triangulation
2/3/15CMPS 3130/6130 Computational Geometry1 CMPS 3130/6130 Computational Geometry Spring 2015 Triangulations and Guarding Art Galleries II Carola Wenk.
Computing Convex Hulls CLRS 33.3
Convex Hull obstacle start end Convex Hull Convex Hull
CS16: Introduction to Data Structures & Algorithms
C o m p u t i n g C O N V E X H U L L S by Kok Lim Low 10 Nov 1998 COMP Presentation.
UNC Chapel Hill M. C. Lin Polygon Triangulation Chapter 3 of the Textbook Driving Applications –Guarding an Art Gallery –3D Morphing.
9/12/06CS 6463: AT Computational Geometry1 CS 6463: AT Computational Geometry Fall 2006 Triangulations and Guarding Art Galleries II Carola Wenk.
Convex Hulls in Two Dimensions Definitions Basic algorithms Gift Wrapping (algorithm of Jarvis ) Graham scan Divide and conquer Convex Hull for line intersections.
Convex Sets & Concave Sets A planar region R is called convex if and only if for any pair of points p, q in R, the line segment pq lies completely in R.
1 Convex Hull in Two Dimensions Jyun-Ming Chen Refs: deBerg et al. (Chap. 1) O’Rourke (Chap. 3)
Computational Geometry
ADA: 16. CG Topics1 Objective o an examination of four important CG topics o just a taster of a very large research area Algorithm Design and Analysis.
9/5/06CS 6463: AT Computational Geometry1 CS 6463: AT Computational Geometry Fall 2006 Plane Sweep Algorithms and Segment Intersection Carola Wenk.
Intersections. Intersection Problem 3 Intersection Detection: Given two geometric objects, do they intersect? Intersection detection (test) is frequently.
November 4, Algorithms and Data Structures Lecture XIV Simonas Šaltenis Nykredit Center for Database Research Aalborg University
Computational Geometry Piyush Kumar (Lecture 3: Convexity and Convex hulls) Welcome to CIS5930.
Query Processing in Databases Dr. M. Gavrilova.  Introduction  I/O algorithms for large databases  Complex geometric operations in graphical querying.
UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2010 Lecture 2 Polygon Partitioning Thursday,
Robert Pless, CS 546: Computational Geometry Lecture #3 Last Time: Convex Hulls Today: Plane Sweep Algorithms, Segment Intersection, + (Element Uniqueness,
17. Computational Geometry Chapter 7 Voronoi Diagrams.
Convex Hulls Computational Geometry, WS 2006/07 Lecture 2 Prof. Dr. Thomas Ottmann Algorithmen & Datenstrukturen, Institut für Informatik Fakultät für.
Lecture 12 : Special Case of Hidden-Line-Elimination Computational Geometry Prof. Dr. Th. Ottmann 1 Special Cases of the Hidden Line Elimination Problem.
Special Cases of the Hidden Line Elimination Problem Computational Geometry, WS 2007/08 Lecture 16 Prof. Dr. Thomas Ottmann Algorithmen & Datenstrukturen,
Hidden-Line Elimination Computational Geometry, WS 2006/07 Lecture 14 Prof. Dr. Thomas Ottmann Algorithmen & Datenstrukturen, Institut für Informatik Fakultät.
Point Location Computational Geometry, WS 2007/08 Lecture 5 Prof. Dr. Thomas Ottmann Algorithmen & Datenstrukturen, Institut für Informatik Fakultät für.
Lecture 6: Point Location Computational Geometry Prof. Dr. Th. Ottmann 1 Point Location 1.Trapezoidal decomposition. 2.A search structure. 3.Randomized,
Lection 1: Introduction Computational Geometry Prof.Dr.Th.Ottmann 1 History: Proof-based, algorithmic, axiomatic geometry, computational geometry today.
Lecture 2 Line Segment Intersection Computational Geometry Prof.Dr.Th.Ottmann 1 Line Segment Intersection Motivation: Computing the overlay of several.
Fundamental Data Structures and Algorithms Aleks Nanevski April 22, 2004 Computational Geometry.
Brute-Force Triangulation
Advanced Algorithm Design and Analysis (Lecture 9) SW5 fall 2004 Simonas Šaltenis E1-215b
CSE53111 Computational Geometry TOPICS q Preliminaries q Point in a Polygon q Polygon Construction q Convex Hulls Further Reading.
Computational Geometry Convex Hulls Robust Geometric Primitives Degeneracy and Stability Nick Pilkington.
1 Geometric Intersection Determining if there are intersections between graphical objects Finding all intersecting pairs Brute Force Algorithm Plane Sweep.
9/7/06CS 6463: AT Computational Geometry1 CS 6463: AT Computational Geometry Fall 2006 Triangulations and Guarding Art Galleries Carola Wenk.
UNC Chapel Hill M. C. Lin Point Location Reading: Chapter 6 of the Textbook Driving Applications –Knowing Where You Are in GIS Related Applications –Triangulation.
Convex Hull. What is the Convex Hull? Imagine a set of points on a board with a nail hammered into each point. Now stretch a rubber band over all the.
UNC Chapel Hill M. C. Lin Line Segment Intersection Chapter 2 of the Textbook Driving Applications –Map overlap problems –3D Polyhedral Morphing.
RA PRESENTATION Sublinear Geometric Algorithms B 張譽馨 B 汪牧君 B 李元翔.
C o m p u t i n g C O N V E X H U L L S. Presentation Outline 2D Convex Hulls –Definitions and Properties –Approaches: Brute Force Gift Wrapping QuickHull.
Computational Geometry Piyush Kumar (Lecture 10: Point Location) Welcome to CIS5930.
Fundamental Data Structures and Algorithms Klaus Sutner April 27, 2004 Computational Geometry.
CMPS 3130/6130 Computational Geometry Spring 2015
Computational Geometry: Intersection Search Joseph S. B. Mitchell Stony Brook University.
Computational Geometry 2D Convex Hulls
Lecture 15 Computational Geometry Geometry sweeping Geometric preliminaries Some basics geometry algorithms.
Convex Sets & Concave Sets A planar region R is called convex if and only if for any pair of points p, q in R, the line segment pq lies completely in R.
9/8/10CS 6463: AT Computational Geometry1 CS 6463: AT Computational Geometry Fall 2010 Triangulations and Guarding Art Galleries Carola Wenk.
Polygon Triangulation
CMPS 3130/6130 Computational Geometry Spring 2017
3. Polygon Triangulation
Computational Geometry
Introduction to Polygons
CMPS 3130/6130 Computational Geometry Spring 2017
Convex Hull.
Query Processing in Databases Dr. M. Gavrilova
Algorithm design techniques Dr. M. Gavrilova
Computational Geometry Capter:1-2.1
Convex Sets & Concave Sets
Computational Geometry for the Tablet PC
CHAPTER 33 Computational Geometry
Computational Geometry
Computational Geometry Algorithms
Algorithms and Data Structures Lecture XIV
Presentation transcript:

Computational Geometry Piyush Kumar (Lecture 3: Convexity and Convex hulls) Welcome to CIS5930

Convexity A set S is convex if for any pair of points p,q  S we have pq  S. p q non-convex convex

Convex Hulls : Equivalent definitions The intersection of all covex sets that contains P The intersection of all halfspaces that contains P. The union of all triangles determined by points in P. All convex combinations of points in P. P here is a set of input points

Convex Hulls Applications Collision Detection Fitting shapes Shape Approximation NN-Searching Useful as a preprocessing step to many other algorithms in computational geometry. The most ubiquitous structure in computational geometry.

Convex hulls p6 p9 p5 p12 p7 p4 p11 p1 p8 p2 p0 Extreme point Int angle < pi p6 p9 p5 p12 p7 p4 p11 p1 p8 p2 p0 Extreme edge Supports the point set

Convex hull : Representation We will represent the convex hull by an enumeration of the vertices of the CH(P) in counterclockwise order. Naïve Algorithm to compute convex hulls can be implemented in O(n3) in the plane (How?) Anyone with an O(n2) algorithm?

Convex hull has a lower bound equivalent to sorting has many similar algorithms to sorting. We will see today Graham Scan Incremental (one point at a time) D&C Qhull ( similar to Quick Sort) Jarvis March Chan’s Algorithm

Assignments for next week Notes of Dr. Mount: Lec 1-4, 6 Assignment2.cpp and ch_2.cpp Will talk more about it towards the end of class.

Today (Jan 16th) Line Segment intersection Homeworks / Projects

Line Segment Intersection Applications VLSI (Intel uses it a lot) Map Overlay Clipping in Graphics CSG Problem : Given a set of line segments in the plane, compute all the intersection point. © Klaas Holwerda: Boolean

Line Segment Intersection : GIS © DeBerg et.al. Cities, rivers, railroads and their overlay in western Canada.

Line Segment Intersection Lower Bound from EU EU : Given a list of n numbers, are all these numbers unique? [Y / N]? Lower bound is Ω(nlogn) How do we use this fact to prove a Ω(nlogn) on Line segment intersection problem? Does this imply a lower bound of Ω(nlogn+k)? Tell me a naïve algorithm to solve this problem.

Line Segment intersection Naïve O(n^2) Bentley Ottman sweep O((n+k)log n): 1979. Edelsbrunner Chazelle 92 O(nlogn +k) : Supercomplicated O(nlogn) space Clarkson and Shor O(nlogn +k) Randmized O(n) space Balaban : Deterministic O(nlogn + k) in O(n space. Solved a long open problem.

Segment Intersection How do we intersect two segments? How do we implement such a primitive? CG FAQ 1.3 Any special cases? © DeBerg Et.al.

Do two segments intersect? Why not compute the sign of the Area2()’ s multiplied together? © Joseph O’ Rourke.

Intersection point? Solve for s, t. Beware of degenerate cases. © David Mount. Solve for s, t. Beware of degenerate cases. Compute_intersection_point primitive is one of the most time consuming parts of segment intersection algorithms. For speed: Floating point filters on rational arithmetic is used.

Point inside Simplex?

Today ( Jan 20th) Line Segment intersection Algorithm Project discussion Polygons

Line Segment intersection Sweep line paradigm Main idea is to sweep the entire plane with a line and compute what we want to , as we sweep past the input. Event scheduling and updates Carefully schedule the computation so that it does not take too much time to compute the output.

Line Segment Intersection A Sorted sequence data structure Insert Delete Successor/Predecessor All in O(log n) X-structure (or the event queue) Y-structure (or the sweep line)

Plane Sweep Paradigm Initialization: Add all segment endpoints to the X-structure or event queue (O(n log n)). Sweep line status is empty. Algorithm proceeds by inserting and deleting discrete events from the queue until it is empty.

Plane Sweep © Mount.

Pretend these never happened! No line segment is vertical If two segments intersect, then they intersect in a single point (that is, they are not collinear). No three line segments intersect in a common point. © Jeff Erickson.

Useful lemma Given si,sj intersecting in p, there is a placement of the sweepline prior to this event such that si,sj are adjacent along the sweepline. Just before an intersection occurs, the two relevant segments are adjacent to each other in the sweep line status.

Proof of Lemma © Mount

Plane Sweep Event A: Segment left endpoint Insert segment in sweep line or the Y-structure. Test for intersection to the right of the sweep line with the segments immediately above and below it. Insert intersection points (if found) into X-structure or event queue. Complexity: ? Worst case?

Plane Sweep : Left Endpoint

Plane Sweep – Algorithm Event B: Segment right endpoint Delete segment from sweep line status. Test for intersection to the right of the sweep line between the segments immediately above and below. (can you do any optimization for this case? ) Insert point (if found) into event queue. Complexity: ?

Plane Sweet: Right endpoint

A simple optimization: Right endpoints © Mehlhorn When s is deleted, p gets recomputed. Avoid it using a hash?

Plane Sweep – Algorithm Event C: Intersection point Report the point. Swap the two line relevant segments in the sweep line status. For the new upper segment – test it against its predecessor for an intersection. Insert point (if found) into event queue. Similar for new lower segment (with successor). Complexity: O(klogn)

Plane sweep : Degenerate cases. Source: http://www.ti.inf.ethz.ch/ew/courses/CG08/materials/v3.pdf Copyright : Michael Hoffman.

The Simplified Algorithm Construct the X-structure scan thru the X-structure (or the event queue) from left to right processing: Segment Left endpoint Segment right endpoint Intersection points

Handling Degeneracies LEDA

Polygon: Definition In geometry a polygon is traditionally a plane figure that is bounded by a closed path or circuit, composed of a finite sequence of straight line segments (i.e., by a closed polygonal chain). These segments are called its edges or sides, and the points where two edges meet are the polygon's vertices or corners.

Point in polygon test?

Polygons Point containment in simple polygon Area of a simple polygon Convex hull of a simple polygon Triangulation of a simple polygon Fast preprocessing of a convex polygon to do in/out queries.

Area of a convex polygon

Area of a polygon

Area of a polygon

From a distance © Rourke

Area of a polyon Darker triangles have negative area.

Volume in higher dimensions

Volume in 3D © David Eppstein

Convex hull of poygons Melkman’s Algorithm. Uses a deque:  head-tail linked list, for which elements can be added to or removed from the front (head) or back (tail). Considered to be the best CH algorithm for simple polygons. http://cgm.cs.mcgill.ca/~athens/cs601/Melkman.html

Melkman’s algorithm Start with CH of 3 vertices = Triangle http://cgm.cs.mcgill.ca/~athens/cs601/Melkman.html

Partition plane in 4 colors Source: http://photon.poly.edu/~hbr/publi/inplace-ch2dpoly/cgta.06.pdf Points in the deque are circled in blue. The point N is special point stored separately. F and B are front and back vertices of deque.

Partition plane in 4 colors Next point on the polygon can only lie in the colored regions. Invariant : N followed by the vertices in the deque (front to back) form a convex polygon.

Partition plane in 4 colors If p falls into region I, push N onto the front of the deque, then overwrite N by p. To restore the invariant, backtrack/delete vertices from the front of the deque until a convex turn is encountered.

Partition plane in 4 colors If p falls into region II, push N onto the back of the deque, then overwrite N by p. Restore the invariant by backtracking/deleting vertices from the back of the deque until a convex turn is encountered.

Partition plane in 4 colors If p falls into region III, simply overwrite N by p, and restore the invariants as in both cases I and II.

Partition plane in 4 colors If p falls into region IV , ignore this and all following vertices until one emerges into another region.

Melkman’s algorithm An example of online algorithm: meaning that points can be added in a streaming fashion. Very simple to code. Practical. Implemented in CGAL. http://softsurfer.com/Archive/algorithm_0203/algorithm_0203.htm