Kansas State University Department of Computing and Information Sciences Friday, July 13, 2001 Mantena V. Raju Department of Computing and Information.

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.

Computational Geometry - Part II Mohammed Nadeem Ahmed Raghavendra Kyatham.

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.

Advanced Topics in Algorithms and Data Structures Lecture 7.2, page 1 Merging two upper hulls Suppose, UH ( S 2 ) has s points given in an array according.

Surface Reconstruction From Unorganized Point Sets

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

Proximity graphs: reconstruction of curves and surfaces

Computational Geometry II Brian Chen Rice University Computer Science.

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.

The Divide-and-Conquer Strategy

Convex Hulls in Two Dimensions Definitions Basic algorithms Gift Wrapping (algorithm of Jarvis ) Graham scan Divide and conquer Convex Hull for line intersections.

Convex Hulls May Shmuel Wimer Bar Ilan Univ., Eng. Faculty Technion, EE Faculty.

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.

Computational Geometry

Lecture 3: Reduce to known problem Convex Hull (section 33.3 of CLRS). Suppose we have a bunch of points in the plane, given by their x and y coordinates.

Convex Hull Problem Presented By Erion Lin. Outline Convex Hull Problem Voronoi Diagram Fermat Point.

1 Today’s Material Computational Geometry Problems –Closest Pair Problem –Convex Hull Jarvis’s March, Graham’s scan –Farthest Point Problem.

Algorithms and Data Structures Lecture 13. Agenda: Plane Geometry: algorithms on polygons - Verification if point belongs to a polygon - Convex hull.

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.

Computational Geometry -- Voronoi Diagram

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.

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.

Speaker: Tom Gur, Seminar on Voronoi Diagrams and Delaunay Triangulations Material: [AK] Sections 3.4, 4.1, 4.2,

Delaunay Triangulation on the GPU Dan Maljovec. CPU Delaunay Triangulation Randomized Incremental Algorithm 1.Construct Bounding triangle 2.Choose point.

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.

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

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.

Voronoi Diagrams and Delaunay Triangulations Generalized spaces and distances.

CS CS 175 – Week 3 Triangulating Point Clouds VD, DT, MA, MAT, Crust.

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.

CSE53111 Computational Geometry TOPICS q Preliminaries q Point in a Polygon q Polygon Construction q Convex Hulls Further Reading.

Stony Brook University

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.

Computational Geometry (35/33) Line Segments and cross-product Segment intersection and Sweep Line Convex Hull and Graham’s Scan, Jarvis’s march Divide-and-Conquer.

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

Computational Geometry Course Summary (First Half) Spring 2008 Pay special attention to: algorithm details (able to explain correctness and carry out a.

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.

Fundamental Data Structures and Algorithms Margaret Reid-Miller 27 April 2004 Computational Geometry.

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

Lecture 7 : Point Set Processing Acknowledgement : Prof. Amenta’s slides.

Convex Hull. University of Manchester biologists used lasers to measure the minimum amount of skin required to wrap around the skeletons of modern-day.

L8 - Delaunay triangulation L8 – Delaunay triangulation NGEN06(TEK230) – Algorithms in Geographical Information Systems.

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.

COMPUTATIONAL GEOMETRY AND MATRIX MULTIPLICATION Mohammed Zeeshan Farooqui Minhaj Uddin.

Coverage Problems in Wireless Ad-hoc Sensor Networks Seapahn Meguerdichian 1 Farinaz Koushanfar 2 Miodrag Potkonjak 1 Mani Srivastava 2 University of California,

Gradient Diagrams Geometry The diagram shows a straight line with the vert/horiz. distances marked on it. Straight line horizontal vertical In each of.

CDS 301 Fall, 2008 Domain-Modeling Techniques Chap. 8 November 04, 2008 Jie Zhang Copyright ©

Convex hulls in 3D Maciej Kot. Finding convex hull Given a set of points, find a convex hull that contains all of them and is minimal.

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

VORONOI DIAGRAMS BY KATHARINE TISCHER Coordinating Seminar Spring 2013.

Data Structure & Algorithm 13 – Computational Geometry JJCAO.

VORONOI DIAGRAMS FOR PARALLEL HALFLINES IN 3D

CSCE350 Algorithms and Data Structure

Algorithm design techniques Dr. M. Gavrilova

Localizing the Delaunay Triangulation and its Parallel Implementation

Computational Geometry (35/33)

Chapter 7 Voronoi Diagrams

CHAPTER 33 Computational Geometry

Convex Hulls Given a set of points (x1,y1),(x2,y2),…,(xn,yn), the convex hull is the smallest convex polygon containing all the points.

Convex Hull - most ubiquitous structure in computational geometry

Presentation transcript:

Kansas State University Department of Computing and Information Sciences Friday, July 13, 2001 Mantena V. Raju Department of Computing and Information Sciences, KSU A Parallel algorithm for Delaunay Triangulation Computational Geometry

Kansas State University Department of Computing and Information Sciences Basic Definitions Convex Hull Given k distinct points P 1,P 2,…….. P k in E d the set of points P = a 1 P 1 + a 2 P 2 + ………+ a k P k where a 1,a 2,…….. a k are all  0 and a 1 + a 2 + ……..+ a k = 1 is the convex set generated by P 1,P 2,… P k and P is a convex combination of P 1,P 2,…….. P k. Example If P 1, P 2 are two points in E d, the convex combination of P 1, P 2 is the line segment joining P 1, P 2 Given an arbitrary subset L of points in E d the convex hull conv(L) of L is the smallest convex set containing L.

Kansas State University Department of Computing and Information Sciences Convex Hull Convex Hull of the points shown in blue dots Some algorithms for calculating Convex Hull in 2 dimensions 1.Graham’s Scan O(n log n) worst case running time. 2.Jarvis March O(nh) where h is the number of vertices of the convex hull. The worst case running time is O(n 2 )

Kansas State University Department of Computing and Information Sciences Voronoi Diagram Distance between 2 points p, q denoted by dist(p,q) = sqrt((p x - q x ) 2 + (p y - q y ) 2 Voronoi Diagram Let P = { P 1,P 2,…….. P n } be a set of n distinct points in the plane. Voronoi diagram of P is defined as the subdivsion of the plane into n cells, one for each site in P, with the property that a point q lies in the cell corresponding to a site P i if and only if dist( P i,q) < dist( P j,q) for each P j  P

Kansas State University Department of Computing and Information Sciences Voronoi Diagram Some algorithms for calculating Voronoi in 2 dimensions 1.Fortunes’s Sweep line algorithm O(n log n) worst case running time using O(n) storage. 2.Guiba’s and Stolfi’s divide and conquer algorithm O(n log n) worst case running time. Animation of Fortune’s Sweep line Algorithm

Kansas State University Department of Computing and Information Sciences Delaunay Triangulation Delaunay Triangulation is the straight line dual of the Voronoi Diagram. Algorithm for calculating Delaunay in 2 dimensions R. A. Dwyer’s Divide and Conquer O(n log log n) average case running time O(n log n) worst case running time.

Kansas State University Department of Computing and Information Sciences Parallel Delaunay Triangulation