Computational Geometry for the Tablet PC

Slides:



Advertisements
Similar presentations
Geometry Introduction
Advertisements

Computational Geometry
Computational Geometry
ADA: 15. Basic Math1 Objective o a reminder about dot product and cross product, and their use for analyzing line segments (e.g. do two segments.
2/9/06CS 3343 Analysis of Algorithms1 Convex Hull  Given a set of pins on a pinboard  And a rubber band around them  How does the rubber band look when.
1/13/15CMPS 3130/6130: Computational Geometry1 CMPS 3130/6130: Computational Geometry Spring 2015 Convex Hulls Carola Wenk.
Convex Hull obstacle start end Convex Hull Convex Hull
CS16: Introduction to Data Structures & Algorithms
What is Computational Geometry? Study of Data Structures and Algorithms for Geometric Problems 1970 ’ s: Need for Computational Geometry Recognized; Progress.
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.
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.
Computational Geometry
Advanced Algorithm Design and Analysis (Lecture 10) SW5 fall 2004 Simonas Šaltenis E1-215b
Computational Geometry for the Tablet PC
1 Today’s Material Computational Geometry Problems –Closest Pair Problem –Convex Hull Jarvis’s March, Graham’s scan –Farthest Point Problem.
5/17/2015 1:32 AMConvex Hull1 obstacle start end.
What does that mean? To get the taste we will just look only at some sample problems... [Adapted from S.Suri]
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.
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.
Convex Hulls Computational Geometry, WS 2006/07 Lecture 2 Prof. Dr. Thomas Ottmann Algorithmen & Datenstrukturen, Institut für Informatik Fakultät für.
Classroom Presenter Crystal Hoyer Craig Prince Jonathan Su Richard Anderson.
Computational Geometry Overview from Cormen, et al. Chapter 33
Closest Pair of Points Computational Geometry, WS 2006/07 Lecture 9, Part II Prof. Dr. Thomas Ottmann Khaireel A. Mohamed Algorithmen & Datenstrukturen,
Voronoi Diagrams.
Lection 1: Introduction Computational Geometry Prof.Dr.Th.Ottmann 1 History: Proof-based, algorithmic, axiomatic geometry, computational geometry today.
Brute-Force Triangulation
Computational Geometry
Advanced Algorithm Design and Analysis (Lecture 9) SW5 fall 2004 Simonas Šaltenis E1-215b
ACM Schedule… 2/23 Geometry problems 3/2 Lab problems (geometry!) 3/30 "Mock" competition and lab session (4:15) 3/9 Final algorithm discussion… 3/16 [Spring.
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.
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.
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 Klaus Sutner April 27, 2004 Computational Geometry.
Fundamental Data Structures and Algorithms Margaret Reid-Miller 27 April 2004 Computational Geometry.
Convex Hull. University of Manchester biologists used lasers to measure the minimum amount of skin required to wrap around the skeletons of modern-day.
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. Otherwise, it is called concave.
COMPUTATIONAL GEOMETRY AND MATRIX MULTIPLICATION Mohammed Zeeshan Farooqui Minhaj Uddin.
Lecture 15 Computational Geometry Geometry sweeping Geometric preliminaries Some basics geometry algorithms.
CS6234 Advanced Algorithms - Convex hull. Terminologies – ◦ Convex hull of a set Q of points is the smallest convex polygon P for which each point in.
Convex Hulls Guo Qi, Chen Zhenghai, Wang Guanhua, Shen Shiqi, Himeshi De Silva.
Data Structure & Algorithm 13 – Computational Geometry JJCAO.
Introduction to Spatial Computing CSE 555
Stroke Geometry CSE 490ra.
Fill Area Algorithms Jan
Convex Hull.
Query Processing in Databases Dr. M. Gavrilova
Algorithm design techniques Dr. M. Gavrilova
Convex Hull obstacle start end 11/21/2018 4:05 AM Convex Hull
Computational Geometry (35/33)
Geometry.
Convex Sets & Concave Sets
Convex Hull 1/1/ :28 AM Convex Hull obstacle start end.
Data Structures and Algorithms (AT70. 02) Comp. Sc. and Inf. Mgmt
CHAPTER 33 Computational Geometry
CMPS 3130/6130: Computational Geometry Spring 2017
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.
CMPS 3120: Computational Geometry Spring 2013
Convex Hull obstacle start end 4/30/2019 5:21 PM Convex Hull
Computational Geometry Algorithms
Geometry.
Algorithms and Data Structures Lecture XIV
Computational Geometry
Richard Anderson Lecture 13 Divide and Conquer
Presentation transcript:

Computational Geometry for the Tablet PC CSE 481b Lecture 17

Announcements Thursday, March 2 ABET Program review Give important feedback on the program Free Donuts!

Overview Computational Geometry on the Tablet PC Geometric primitives SUB: Ask for submission of a picture Computational Geometry on the Tablet PC Geometric primitives Intersections Polygons Convexity Voronoi Diagram

Tablet Geometry Basic structure – Stroke: sequence of points SUB: What is Points[6.4]? Basic structure – Stroke: sequence of points Himetric coordinates Sampled 150 times per second Coordinates stored in an array Points

Computational Geometry Algorithms for geometric computation Numerical issues with coordinates Importance of degenerate cases Examples of degenerate cases Three lines intersecting at a point Segments overlapping Three points co-linear

Basic geometry Point Line segment Distance Basic Test p (p1, p2) Dist(p1, p2) Basic Test LeftOf(p1, p2, p3) CCW(p1, p2, p3) p p1 p3 p2 p1

Counter Clockwise Test CCW(p1, p2, p3) public static bool CcwTest(Point p1, Point p2, Point p3){ int q1 = (p1.Y - p2.Y)*(p3.X - p1.X); int q2 = (p2.X - p1.X)*(p3.Y - p1.Y); return q1 + q2 < 0; } p2 ASIDE: Give derivation based on the determinant p1 p3

Segment intersection Find intersection of (p1,p2) and (p3,p4) Q = ap1 + (1-a)p2 Q = bp3 + (1-b)p4 Solve for a, b Two equations, two unknowns Intersect if 0 < a < 1 and 0 < b < 1 Derived points In general, try to avoid computing derived points in geometric algorithms

Problem SUB Tell students segments are not co-linear Determine if two line segments (p1, p2) and (p3,p4) intersect just using CCW Tests Student Submission

Making intersection test more efficient Take care of easy cases using coordinate comparisons Only use CCW tests if bounding boxes intersect

Computing intersections SUB Ignore degenerate cases How many self intersections can a single stroke with n points have? Student Submission

Segment intersection algorithm Run time O(nlog n + Klog n) for finding K intersections Sweepline Algorithm 3 6 5 1 2 7 4

Sweepline Algorithm Event queue Move sweepline to next event Start Segment (S2) End Segment (E2) Intersection (I2,4) Move sweepline to next event Maintain vertical order of segments as line sweeps across Start Segment Insert in list Check above and below for intersection End Segment Remove from list Check newly adjacent segments for intersection Intersection Reorder segments

Sweepline example 3 6 5 1 2 7 4

Activity: Identify when each of the intersections is detected B Student Submission

Polygons Sequence of points representing a closed path Simple polygon – closed path with no self intersections

Describe an algorithm to test if a point q is in a polygon P

Polygon inclusion test Is the point q inside the Polygon P?

Convexity Defn: Set S is convex if whenever p1, and p2 are in S, the segment (p1, p2) is contained in S

Convex polygons P = {p0, p1, . . . pn-1} P is convex if CCW(pi, pi+1, pi+2) for all i Interpret subscripts mod n Also holds for CW (depending on how points are ordered)

Problem: Test if a point q is inside a convex polygon P using CCW Tests Student Submission SUB: Describe an algorithm using CCW Tests

Convex hull Smallest enclosing convex figure Rubber band “algorithm”

Compute the Convex Hull SUB: Students draw the hull Compute the Convex Hull Student Submission

Algorithms Convex hull algorithms: O(nlog n) Insertion algorithm Illustrate insertion with diagram on right Algorithms Convex hull algorithms: O(nlog n) Related to sorting Insertion algorithm Gift Wrapping (Jarvis’s march) Divide and Conquer Graham Scan

Convex Hull Algorithms Gift wrapping

Divide and Conquer

Graham Scan Polar sort the points around a point inside the hull Scan points in CCW order Discard any point that causes a CW turn If CCW advance If !CCW, discard current point and back up

SUB: Students draw the hull Polar sort the red points around q (Start with p, number the points in CCW order) p q Student Submission SUB: Use the result for a first illustration of the algorithm

Graham Scan Algorithm Stack of vertices If CCW(x, y, z) Possible hull vertices z – next vertex y – top of stack x – next on stack If CCW(x, y, z) Push(z) If (! CCW(x, y, z)) Pop stack x y z x z y

GS Example to walk through

Student submission: Give order vertices are discarded in the scan p Student Submission

Voronoi Diagram Given a set of points: subdivide space into the regions closest to each point Instructor Note:

Compute the Voronoi Diagram Student Submission

Algorithms for Computing the Voronoi