Basic tool: orientation tests
|
|
- Maud Powell
- 6 years ago
- Views:
Transcription
1 Basic tool: orientation tests Vera Sacristán Computational Geometry Facultat d Informàtica de Barcelona Universitat Politècnica de Catalunya
2 Orientation test in R 2 Given 3 points p,, r in the plane, efficiently and robustely decide whether r lies to the left, to the right or on the oriented line p. r 1 r 3 p r 2
3 Orientation test in R 2 Given 3 points p,, r in the plane, efficiently and robustely decide whether r lies to the left, to the right or on the oriented line p. r 1 Consider the vectors p... p r 2 r 3
4 Orientation test in R 2 Given 3 points p,, r in the plane, efficiently and robustely decide whether r lies to the left, to the right or on the oriented line p. r 1 Consider the vectors p and pr. p r 2 r 3
5 Orientation test in R 2 Given 3 points p,, r in the plane, efficiently and robustely decide whether r lies to the left, to the right or on the oriented line p. r 1 Consider the vectors p and pr. p Point r lies on the line p x p x r x p x y p y r y p y = 0 Point r lies to the left of the oriented line p x p x y p y Point r lies to the right of the oriented line p x p x y p y r x p x r y p y r x p x r y p y > 0 r 3 r 2 < 0
6 Orientation test in R 2 Given 3 points p,, r in the plane, efficiently and robustely decide whether r lies to the left, to the right or on the oriented line p. Consider the vectors p and pr. p Point r lies on the line p x p x r x p x y p y r y p y = 0 Point r lies to the left of the oriented line p x p x r x p x y p y r y p y > 0 Point r lies to the right of the oriented line p x p x r x p x y p y r y p y < 0 Notation det(p,, r) = x p x r x p x y p y r y p y = p x x r x p y y r y r 1 r 2 r 3
7 Relative position point - line l: a line (through points p and ) r: a point Output: Relative position of r w.r.t. l. p r l
8 Relative position point - line l: a line (through points p and ) r: a point Output: Relative position of r w.r.t. l. p r l Intersection test line segment - line l: a line (through points p and ) s: a line segment (with endpoints a and b) Output: a Yes/No they intersect b p a b b l a
9 Intersection test line segment - halfline l: halfline (from p through ) s: a line segment (with endpoints a and b) Output: Yes/No they intersect b p a b a b l a
10 Intersection test line segment - halfline l: halfline (from p through ) s: a line segment (with endpoints a and b) Output: Yes/No they intersect b p a b a b l a Intersection test line segment - line segment s 1 : a line segment (with endpoints p and ) s 2 : a line segment (with endpoints a and b) Output: Yes/No they intersect p a b a a b b
11 Intersection test line - polygon l: a line (through p and ) P : a polygon (with vertices p 1, p 2,..., p m ) Yes/No they intersect. If they do, the edges of P intersecting l
12 Intersection test line - polygon l: a line (through p and ) P : a polygon (with vertices p 1, p 2,..., p m ) Yes/No they intersect. If they do, the edges of P intersecting l What if the polygon is convex?
13 Turn orientation A polygonal line p 1, p 2,..., p n Output: Left/right classification of its turns p 1
14 Turn orientation A polygonal line p 1, p 2,..., p n Output: Left/right classification of its turns p 1 Point in triangle test A triangle T with vertices p 1, p 2, p 3 A uery point Output: Relative position of w.r.t. T T
15 Point in polygon test A polygon p 1, p 2,..., p n A uery point Output: Yes/No P
16 Point in polygon test A polygon p 1, p 2,..., p n A uery point Output: Yes/No P What if the polygon is convex?
17 Supporting lines point - polygon A polygon P with vertices p 1, p 2,..., p n A point not belonging to the convex hull of P Output: Lines through and P that leave all of P to one side P
18 Supporting lines point - polygon A polygon P with vertices p 1, p 2,..., p n A point not belonging to the convex hull of P Output: Lines through and P that leave all of P to one side P
19 Supporting lines point - polygon A polygon P with vertices p 1, p 2,..., p n A point not belonging to the convex hull of P Output: Lines through and P that leave all of P to one side What if the polygon is convex? P
20 What happens in R 3?
21 Oriented area of a triangle p r Oriented area (p,, r) = 1 2 p x x r x p y y r y Discrete and Algorithmic Geometry, Facultat de Matemàtiues i Estadística, UPC
22 Oriented area of a triangle p r Oriented area (p,, r) = 1 2 p x x r x p y y r y Oriented volume of a tetrahedron a d c b Oriented volume (a, b, c, d) = 1 6 a x b x c x d x a y b y c y d y a z b z c z d z Discrete and Algorithmic Geometry, Facultat de Matemàtiues i Estadística, UPC
23 Relative position point-plane If a, b, and c are not aligned, they define a plane π. c π a b Discrete and Algorithmic Geometry, Facultat de Matemàtiues i Estadística, UPC
24 Relative position point-plane If a, b, and c are not aligned, they define a plane π. π a b c Point x lies in the halfspace π + det(x, a, b, c) > 0. Point x lies in the plane π det(x, a, b, c) = 0. Point x lies in the halfspace π det(x, a, b, c) < 0. Discrete and Algorithmic Geometry, Facultat de Matemàtiues i Estadística, UPC
25 2D application: Relative position point-circle Proposition 1 The intersection of the paraboloid whose euation is z = x 2 + y 2 with a non vertical plane is a curve that projects orthogonally onto a circle in the plane z = 0. Discrete and Algorithmic Geometry, Facultat de Matemàtiues i Estadística, UPC
26 2D application: Relative position point-circle Proposition 1 The intersection of the paraboloid whose euation is z = x 2 + y 2 with a non vertical plane is a curve that projects orthogonally onto a circle in the plane z = 0. Proof: } } } z = x 2 + y 2 x 2 + y 2 = 2ax + 2by + c (x a) 2 + (y b) 2 = c + a 2 + b 2 z = 2ax + 2by + c z = 0 z = 0 If c < a 2 b 2, the intersection is empty. If c = a 2 b 2, the intersection is the point (a, b, a 2 + b 2 ). If c > a 2 b 2, the intersection is a curve (in fact, an ellipse) that projects onto the circle of the plane z = 0 whose center is (a, b) and whose radius is r = c + a 2 + b 2. Discrete and Algorithmic Geometry, Facultat de Matemàtiues i Estadística, UPC
27 2D application: Relative position point-circle Proposition 2 Let x, a, b, c be four points in the plane z = 0, and let x, a, b, c respectively be their vertical projections onto the paraboloid z = x 2 + y 2. If a, b, c are not aligned, let C be the circle through a, b, c, and let π be the plane through a, b, c. Then: The point x lies in the circle C if and only if x lies in the plane π. The point x lies in the interior of the circle C if and only if x lies in the lower half-space determined by π. The point x lies in the exterior of the circle C if and only if x lies in the upper half-space determined by π. Discrete and Algorithmic Geometry, Facultat de Matemàtiues i Estadística, UPC
28 2D application: Relative position point-circle Proposition 2 Let x, a, b, c be four points in the plane z = 0, and let x, a, b, c respectively be their vertical projections onto the paraboloid z = x 2 + y 2. If a, b, c are not aligned, let C be the circle through a, b, c, and let π be the plane through a, b, c. Then: The point x lies in the circle C if and only if x lies in the plane π. The point x lies in the interior of the circle C if and only if x lies in the lower half-space determined by π. The point x lies in the exterior of the circle C if and only if x lies in the upper half-space determined by π. Proof: Due to Proposition 1 and the convexity of the paraboloid. Discrete and Algorithmic Geometry, Facultat de Matemàtiues i Estadística, UPC
29 2D application: Relative position point-circle Corollary Let a, b and c be three non aligned points in the plane, that appear angularly sorted in counterclockwise order in the circle C that they determine. Let x be any point in the plane. Then: The point x lies in the circle C if and only if det(x, a, b, c ) = 0. The point x lies in the interior of C if and only if det(x, a, b, c ) < 0. The point x lies in the exterior of C if and only if det(x, a, b, c ) > 0. Discrete and Algorithmic Geometry, Facultat de Matemàtiues i Estadística, UPC
30 2D application: Relative position point-circle Observation In order to compute the determinant of the previous corollary, it is convenient to do the calculations in terms of the differences between the values of the coordinates of the points involved, and to avoid making calculations (specially, products) in terms of the coordinate values, if possible: x 1 x 2 x x a 1 a 2 a a b 1 b 2 b b c 1 c 2 c c = b 1 a 1 b 2 a 2 (b 1 a 1 )(b 1 + a 1 ) + (b 2 a 2 )(b 2 + a 2 ) c 1 a 1 c 2 a 2 (c 1 a 1 )(c 1 + a 1 ) + (c 2 a 2 )(c 2 + a 2 ) x 1 a 1 x 2 a 2 (x 1 a 1 )(x 1 + a 1 ) + (x 2 a 2 )(x 2 + a 2 ) Discrete and Algorithmic Geometry, Facultat de Matemàtiues i Estadística, UPC
31 A BASIC TOOL: ORIENTATION TESTS FURTHER READING J. O Rourke Computational Geometry in C Cambridge University Press, 1994 (2nd ed. 1998), pp F. P. Preparata and M. I. Shamos Computational Geometry: An Introduction Springer-Verlag, 1985, pp
Computational Geometry. Free Lab Exercises. Year Q1
Computational Geometry Free Lab Exercises Year 2016-17 Q1 Vera Sacristán Departament de Matemàtiques Facultat d Informàtica de Barcelona Universitat Politècnica de Catalunya Computational Geometry - Free
More informationReconstructing Orthogonal Polyhedra from Putative Vertex Sets
Reconstructing Orthogonal Polyhedra from Putative Vertex Sets Therese Biedl 1 and Burkay Genc 1 David R. Cheriton School of Computer Science, University of Waterloo, Waterloo ON N2L 3G1, Canada biedl@uwaterloo.ca,
More informationLifting Transform, Voronoi, Delaunay, Convex Hulls
Lifting Transform, Voronoi, Delaunay, Convex Hulls Subhash Suri Department of Computer Science University of California Santa Barbara, CA 93106 1 Lifting Transform (A combination of Pless notes and my
More informationVoronoi Diagrams and Delaunay Triangulations. O Rourke, Chapter 5
Voronoi Diagrams and Delaunay Triangulations O Rourke, Chapter 5 Outline Preliminaries Properties and Applications Computing the Delaunay Triangulation Preliminaries Given a function f: R 2 R, the tangent
More informationChapter 8. Voronoi Diagrams. 8.1 Post Oce Problem
Chapter 8 Voronoi Diagrams 8.1 Post Oce Problem Suppose there are n post oces p 1,... p n in a city. Someone who is located at a position q within the city would like to know which post oce is closest
More informationComputational Geometry
Computational Geometry 600.658 Convexity A set S is convex if for any two points p, q S the line segment pq S. S p S q Not convex Convex? Convexity A set S is convex if it is the intersection of (possibly
More informationVoronoi diagrams Delaunay Triangulations. Pierre Alliez Inria
Voronoi diagrams Delaunay Triangulations Pierre Alliez Inria Voronoi Diagram Voronoi Diagram Voronoi Diagram The collection of the non-empty Voronoi regions and their faces, together with their incidence
More informationRestricted-Orientation Convexity in Higher-Dimensional Spaces
Restricted-Orientation Convexity in Higher-Dimensional Spaces ABSTRACT Eugene Fink Derick Wood University of Waterloo, Waterloo, Ont, Canada N2L3G1 {efink, dwood}@violetwaterlooedu A restricted-oriented
More informationUNIVERSITI TEKNOLOGI MALAYSIA SSE 1893 ENGINEERING MATHEMATICS TUTORIAL 5
UNIVERSITI TEKNOLOGI MALAYSIA SSE 189 ENGINEERING MATHEMATIS TUTORIAL 5 1. Evaluate the following surface integrals (i) (x + y) ds, : part of the surface 2x+y+z = 6 in the first octant. (ii) (iii) (iv)
More informationComputational Geometry
Lecture 1: Introduction and convex hulls Geometry: points, lines,... Geometric objects Geometric relations Combinatorial complexity Computational geometry Plane (two-dimensional), R 2 Space (three-dimensional),
More information1/25 Warm Up Find the value of the indicated measure
1/25 Warm Up Find the value of the indicated measure. 1. 2. 3. 4. Lesson 7.1(2 Days) Angles of Polygons Essential Question: What is the sum of the measures of the interior angles of a polygon? What you
More informationLectures 19: The Gauss-Bonnet Theorem I. Table of contents
Math 348 Fall 07 Lectures 9: The Gauss-Bonnet Theorem I Disclaimer. As we have a textbook, this lecture note is for guidance and supplement only. It should not be relied on when preparing for exams. In
More information3. Voronoi Diagrams. 3.1 Definitions & Basic Properties. Examples :
3. Voronoi Diagrams Examples : 1. Fire Observation Towers Imagine a vast forest containing a number of fire observation towers. Each ranger is responsible for extinguishing any fire closer to her tower
More informationCS4733 Class Notes. 1 2-D Robot Motion Planning Algorithm Using Grown Obstacles
CS4733 Class Notes 1 2-D Robot Motion Planning Algorithm Using Grown Obstacles Reference: An Algorithm for Planning Collision Free Paths Among Poyhedral Obstacles by T. Lozano-Perez and M. Wesley. This
More informationMinimum-Area Rectangle Containing a Set of Points
Minimum-Area Rectangle Containing a Set of Points David Eberly, Geometric Tools, Redmond WA 98052 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution 4.0 International
More informationWe have set up our axioms to deal with the geometry of space but have not yet developed these ideas much. Let s redress that imbalance.
Solid geometry We have set up our axioms to deal with the geometry of space but have not yet developed these ideas much. Let s redress that imbalance. First, note that everything we have proven for the
More informationEXTREME POINTS AND AFFINE EQUIVALENCE
EXTREME POINTS AND AFFINE EQUIVALENCE The purpose of this note is to use the notions of extreme points and affine transformations which are studied in the file affine-convex.pdf to prove that certain standard
More informationStraight Line motion with rigid sets
Straight ine motion with rigid sets arxiv:40.4743v [math.mg] 9 Jan 04 Robert Connelly and uis Montejano January 7, 08 Abstract If one is given a rigid triangle in the plane or space, we show that the only
More informationElementary Planar Geometry
Elementary Planar Geometry What is a geometric solid? It is the part of space occupied by a physical object. A geometric solid is separated from the surrounding space by a surface. A part of the surface
More informationPacking Two Disks into a Polygonal Environment
Packing Two Disks into a Polygonal Environment Prosenjit Bose, School of Computer Science, Carleton University. E-mail: jit@cs.carleton.ca Pat Morin, School of Computer Science, Carleton University. E-mail:
More informationOrthogonal Ham-Sandwich Theorem in R 3
Orthogonal Ham-Sandwich Theorem in R 3 Downloaded 11/24/17 to 37.44.201.8. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojsa.php Abstract The ham-sandwich theorem
More informationLesson 7.1. Angles of Polygons
Lesson 7.1 Angles of Polygons Essential Question: How can I find the sum of the measures of the interior angles of a polygon? Polygon A plane figure made of three or more segments (sides). Each side intersects
More information1/60. Geometric Algorithms. Lecture 1: Introduction. Convex Hulls
1/60 Geometric Algorithms Lecture 1: Introduction Convex Hulls Geometric algorithms scope 2/60 Geometry algorithms (practice): Study of geometric problems that arise in various applications and how algorithms
More informationMISCELLANEOUS SHAPES
MISCELLANEOUS SHAPES 4.1. INTRODUCTION Five generic shapes of polygons have been usefully distinguished in the literature: convex, orthogonal, star, spiral, and monotone. 1 Convex polygons obviously do
More informationGardener s spline curve
Annales Mathematicae et Informaticae 47 (017) pp. 109 118 http://ami.uni-eszterhazy.hu Gardener s spline curve Imre Juhász Department of Descriptive Geometry University of Miskolc agtji@uni-miskolc.hu
More informationOutline of the presentation
Surface Reconstruction Petra Surynková Charles University in Prague Faculty of Mathematics and Physics petra.surynkova@mff.cuni.cz Outline of the presentation My work up to now Surfaces of Building Practice
More informationCOMP331/557. Chapter 2: The Geometry of Linear Programming. (Bertsimas & Tsitsiklis, Chapter 2)
COMP331/557 Chapter 2: The Geometry of Linear Programming (Bertsimas & Tsitsiklis, Chapter 2) 49 Polyhedra and Polytopes Definition 2.1. Let A 2 R m n and b 2 R m. a set {x 2 R n A x b} is called polyhedron
More informationPolygons and Convexity
Geometry Week 4 Sec 2.5 to ch. 2 test Polygons and Convexity section 2.5 convex set has the property that any two of its points determine a segment contained in the set concave set a set that is not convex
More informationPreferred directions for resolving the non-uniqueness of Delaunay triangulations
Preferred directions for resolving the non-uniqueness of Delaunay triangulations Christopher Dyken and Michael S. Floater Abstract: This note proposes a simple rule to determine a unique triangulation
More informationACT Math and Science - Problem Drill 11: Plane Geometry
ACT Math and Science - Problem Drill 11: Plane Geometry No. 1 of 10 1. Which geometric object has no dimensions, no length, width or thickness? (A) Angle (B) Line (C) Plane (D) Point (E) Polygon An angle
More informationIntersecting Simple Surfaces. Dr. Scott Schaefer
Intersecting Simple Surfaces Dr. Scott Schaefer 1 Types of Surfaces Infinite Planes Polygons Convex Ray Shooting Winding Number Spheres Cylinders 2/66 Infinite Planes Defined by a unit normal n and a point
More informationComputing a visibility polygon using few variables
Computing a visibility polygon using few variables Luis Barba 1, Matias Korman 2, Stefan Langerman 2, and Rodrigo I. Silveira 3 1 Universidad Nacional Autónoma de México (UNAM), Mexico D.F., Mexico. l.barba@uxmcc2.iimas.unam.mx
More informationThe conjecture is unresolved even for the case d = (d - 1) + 1. When dt =
Geometriae Dedicata 54: 307-312, 1995. 307 O 1995 KluwerAcademic Publishers. Printed in the Netherlands. Cutting a Polytope WILLIAM JOCKUSCH 1 and NAGABHUSHANA PRABHU 2 1 University of Michigan, Ann Arbor,
More informationComputational Geometry Algorithmische Geometrie
Algorithmische Geometrie Panos Giannopoulos Wolfgang Mulzer Lena Schlipf AG TI SS 2013 !! Register in Campus Management!! Outline What you need to know (before taking this course) What is the course about?
More informationPlanar Graphs. 1 Graphs and maps. 1.1 Planarity and duality
Planar Graphs In the first half of this book, we consider mostly planar graphs and their geometric representations, mostly in the plane. We start with a survey of basic results on planar graphs. This chapter
More informationJanuary Regional Geometry Team: Question #1. January Regional Geometry Team: Question #2
January Regional Geometry Team: Question #1 Points P, Q, R, S, and T lie in the plane with S on and R on. If PQ = 5, PS = 3, PR = 5, QS = 3, and RT = 4, what is ST? 3 January Regional Geometry Team: Question
More information4. Conclusion. 5. Acknowledgment. 6. References
[10] F. P. Preparata and S. J. Hong, Convex hulls of finite sets of points in two and three dimensions, Communications of the ACM, vol. 20, pp. 87-93, 1977. [11] K. Ichida and T. Kiyono, Segmentation of
More informationAlgorithms for the Construction of Digital Convex Fuzzy Hulls
lgorithms for the Construction of Digital Convex Fuzzy Hulls Nebojša M. Ralević Faculty of Engineering, University of Novi Sad Trg Dositeja Obradovića 6, 000 Novi Sad, Serbia nralevic@uns.ns.ac.yu Lidija
More informationA Point in Non-Convex Polygon Location Problem Using the Polar Space Subdivision in E 2
A Point in Non-Convex Polygon Location Problem Using the Polar Space Subdivision in E 2 Vaclav Skala 1, Michal Smolik 1 1 Faculty of Applied Sciences, University of West Bohemia, Univerzitni 8, CZ 30614
More informationPebble Sets in Convex Polygons
2 1 Pebble Sets in Convex Polygons Kevin Iga, Randall Maddox June 15, 2005 Abstract Lukács and András posed the problem of showing the existence of a set of n 2 points in the interior of a convex n-gon
More informationCrossing Families. Abstract
Crossing Families Boris Aronov 1, Paul Erdős 2, Wayne Goddard 3, Daniel J. Kleitman 3, Michael Klugerman 3, János Pach 2,4, Leonard J. Schulman 3 Abstract Given a set of points in the plane, a crossing
More informationVORONOI DIAGRAM PETR FELKEL. FEL CTU PRAGUE Based on [Berg] and [Mount]
VORONOI DIAGRAM PETR FELKEL FEL CTU PRAGUE felkel@fel.cvut.cz https://cw.felk.cvut.cz/doku.php/courses/a4m39vg/start Based on [Berg] and [Mount] Version from 9.11.2017 Talk overview Definition and examples
More informationLinear Programming in Small Dimensions
Linear Programming in Small Dimensions Lekcija 7 sergio.cabello@fmf.uni-lj.si FMF Univerza v Ljubljani Edited from slides by Antoine Vigneron Outline linear programming, motivation and definition one dimensional
More informationAdvanced Algorithms Computational Geometry Prof. Karen Daniels. Fall, 2012
UMass Lowell Computer Science 91.504 Advanced Algorithms Computational Geometry Prof. Karen Daniels Fall, 2012 Voronoi Diagrams & Delaunay Triangulations O Rourke: Chapter 5 de Berg et al.: Chapters 7,
More information6.854J / J Advanced Algorithms Fall 2008
MIT OpenCourseWare http://ocw.mit.edu 6.854J / 18.415J Advanced Algorithms Fall 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advanced
More informationMotion Planning. O Rourke, Chapter 8
O Rourke, Chapter 8 Outline Translating a polygon Moving a ladder Shortest Path (Point-to-Point) Goal: Given disjoint polygons in the plane, and given positions s and t, find the shortest path from s to
More information2D Geometry. Pierre Alliez Inria Sophia Antipolis
2D Geometry Pierre Alliez Inria Sophia Antipolis Outline Sample problems Polygons Graphs Convex hull Voronoi diagram Delaunay triangulation Sample Problems Line Segment Intersection Theorem: Segments (p
More informationPick s Theorem and Lattice Point Geometry
Pick s Theorem and Lattice Point Geometry 1 Lattice Polygon Area Calculations Lattice points are points with integer coordinates in the x, y-plane. A lattice line segment is a line segment that has 2 distinct
More informationNotes on Spherical Geometry
Notes on Spherical Geometry Abhijit Champanerkar College of Staten Island & The Graduate Center, CUNY Spring 2018 1. Vectors and planes in R 3 To review vector, dot and cross products, lines and planes
More informationGeometric Transformations: Translation:
Geometric Transformations: Translation: slide Reflection: Rotation: Dialation: mirror turn enlarge or reduce Notation: Pre-Image: original figure Image: after transformation. Use prime notation C A B C
More informationpine cone Ratio = 13:8 or 8:5
Chapter 10: Introducing Geometry 10.1 Basic Ideas of Geometry Geometry is everywhere o Road signs o Carpentry o Architecture o Interior design o Advertising o Art o Science Understanding and appreciating
More informationA technique for adding range restrictions to. August 30, Abstract. In a generalized searching problem, a set S of n colored geometric objects
A technique for adding range restrictions to generalized searching problems Prosenjit Gupta Ravi Janardan y Michiel Smid z August 30, 1996 Abstract In a generalized searching problem, a set S of n colored
More informationPractical Linear Algebra: A Geometry Toolbox
Practical Linear Algebra: A Geometry Toolbox Third edition Chapter 18: Putting Lines Together: Polylines and Polygons Gerald Farin & Dianne Hansford CRC Press, Taylor & Francis Group, An A K Peters Book
More informationComputational Geometry. Geometry Cross Product Convex Hull Problem Sweep Line Algorithm
GEOMETRY COMP 321 McGill University These slides are mainly compiled from the following resources. - Professor Jaehyun Park slides CS 97SI - Top-coder tutorials. - Programming Challenges books. Computational
More informationAnswer Key: Three-Dimensional Cross Sections
Geometry A Unit Answer Key: Three-Dimensional Cross Sections Name Date Objectives In this lesson, you will: visualize three-dimensional objects from different perspectives be able to create a projection
More informationLines That Intersect Circles
LESSON 11-1 Lines That Intersect Circles Lesson Objectives (p. 746): Vocabulary 1. Interior of a circle (p. 746): 2. Exterior of a circle (p. 746): 3. Chord (p. 746): 4. Secant (p. 746): 5. Tangent of
More informationDifferential Geometry: Circle Patterns (Part 1) [Discrete Conformal Mappinngs via Circle Patterns. Kharevych, Springborn and Schröder]
Differential Geometry: Circle Patterns (Part 1) [Discrete Conformal Mappinngs via Circle Patterns. Kharevych, Springborn and Schröder] Preliminaries Recall: Given a smooth function f:r R, the function
More informationDirichlet Voronoi Diagrams and Delaunay Triangulations
Chapter 9 Dirichlet Voronoi Diagrams and Delaunay Triangulations 9.1 Dirichlet Voronoi Diagrams In this chapter we present very briefly the concepts of a Voronoi diagram and of a Delaunay triangulation.
More informationOther Voronoi/Delaunay Structures
Other Voronoi/Delaunay Structures Overview Alpha hulls (a subset of Delaunay graph) Extension of Voronoi Diagrams Convex Hull What is it good for? The bounding region of a point set Not so good for describing
More informationComputational Geometry
Motivation Motivation Polygons and visibility Visibility in polygons Triangulation Proof of the Art gallery theorem Two points in a simple polygon can see each other if their connecting line segment is
More informationGeneralized kernels of polygons under rotation
Generalized kernels of polygons under rotation David Orden 1, Leonidas Palios 2, Carlos Seara 3, and Paweł Żyliński 4 1 Departamento de Física y Matemáticas, Universidad de Alcalá, Spain david.orden@uah.es
More informationThe Geometry of Carpentry and Joinery
The Geometry of Carpentry and Joinery Pat Morin and Jason Morrison School of Computer Science, Carleton University, 115 Colonel By Drive Ottawa, Ontario, CANADA K1S 5B6 Abstract In this paper we propose
More informationCS 532: 3D Computer Vision 14 th Set of Notes
1 CS 532: 3D Computer Vision 14 th Set of Notes Instructor: Philippos Mordohai Webpage: www.cs.stevens.edu/~mordohai E-mail: Philippos.Mordohai@stevens.edu Office: Lieb 215 Lecture Outline Triangulating
More informationPlanar graphs. Chapter 8
Chapter 8 Planar graphs Definition 8.1. A graph is called planar if it can be drawn in the plane so that edges intersect only at vertices to which they are incident. Example 8.2. Different representations
More informationStabbers of line segments in the plane
Stabbers of line segments in the plane M. Claverol D. Garijo C. I. Grima A. Márquez C. Seara August 3, 2010 Abstract The problem of computing a representation of the stabbing lines of a set S of segments
More information2-1 Transformations and Rigid Motions. ENGAGE 1 ~ Introducing Transformations REFLECT
2-1 Transformations and Rigid Motions Essential question: How do you identify transformations that are rigid motions? ENGAGE 1 ~ Introducing Transformations A transformation is a function that changes
More informationGeometry Unit 6 Properties of Quadrilaterals Classifying Polygons Review
Geometry Unit 6 Properties of Quadrilaterals Classifying Polygons Review Polygon a closed plane figure with at least 3 sides that are segments -the sides do not intersect except at the vertices N-gon -
More informationGenerating Tool Paths for Free-Form Pocket Machining Using z-buffer-based Voronoi Diagrams
Int J Adv Manuf Technol (1999) 15:182 187 1999 Springer-Verlag London Limited Generating Tool Paths for Free-Form Pocket Machining Using z-buffer-based Voronoi Diagrams Jaehun Jeong and Kwangsoo Kim Department
More informationHigh School Geometry. Correlation of the ALEKS course High School Geometry to the ACT College Readiness Standards for Mathematics
High School Geometry Correlation of the ALEKS course High School Geometry to the ACT College Readiness Standards for Mathematics Standard 5 : Graphical Representations = ALEKS course topic that addresses
More information6.7 Regular Polygons
6.7 Regular Polygons Dec 13 3:08 PM 1 Recall, what is a polygon? A union of segments in the same plane such that each segment intersects two others, one at each of its endpoints Dec 13 3:13 PM 2 Define
More informationGeometry/Trigonometry Unit 5: Polygon Notes Period:
Geometry/Trigonometry Unit 5: Polygon Notes Name: Date: Period: # (1) Page 270 271 #8 14 Even, #15 20, #27-32 (2) Page 276 1 10, #11 25 Odd (3) Page 276 277 #12 30 Even (4) Page 283 #1-14 All (5) Page
More informationLagrange multipliers October 2013
Lagrange multipliers 14.8 14 October 2013 Example: Optimization with constraint. Example: Find the extreme values of f (x, y) = x + 2y on the ellipse 3x 2 + 4y 2 = 3. 3/2 1 1 3/2 Example: Optimization
More informationGlossary of dictionary terms in the AP geometry units
Glossary of dictionary terms in the AP geometry units affine linear equation: an equation in which both sides are sums of terms that are either a number times y or a number times x or just a number [SlL2-D5]
More informationVoronoi diagram and Delaunay triangulation
Voronoi diagram and Delaunay triangulation Ioannis Emiris & Vissarion Fisikopoulos Dept. of Informatics & Telecommunications, University of Athens Computational Geometry, spring 2015 Outline 1 Voronoi
More informationVoronoi Diagrams in the Plane. Chapter 5 of O Rourke text Chapter 7 and 9 of course text
Voronoi Diagrams in the Plane Chapter 5 of O Rourke text Chapter 7 and 9 of course text Voronoi Diagrams As important as convex hulls Captures the neighborhood (proximity) information of geometric objects
More informationON THE STRETCH FACTOR OF CONVEX POLYHEDRA WHOSE VERTICES ARE (ALMOST) ON A SPHERE
ON THE STRETCH FACTOR OF CONVEX POLYHEDRA WHOSE VERTICES ARE (ALMOST) ON A SPHERE Prosenjit Bose, Paz Carmi, Mirela Damian, Jean-Lou De Caroufel, Darryl Hill, Anil Maheshwari, Yuyang Liu, and Michiel Smid
More informationGeometry Reasons for Proofs Chapter 1
Geometry Reasons for Proofs Chapter 1 Lesson 1.1 Defined Terms: Undefined Terms: Point: Line: Plane: Space: Postulate 1: Postulate : terms that are explained using undefined and/or other defined terms
More information7. The Gauss-Bonnet theorem
7. The Gauss-Bonnet theorem 7.1 Hyperbolic polygons In Euclidean geometry, an n-sided polygon is a subset of the Euclidean plane bounded by n straight lines. Thus the edges of a Euclidean polygon are formed
More informationGeometry Definitions and Theorems. Chapter 9. Definitions and Important Terms & Facts
Geometry Definitions and Theorems Chapter 9 Definitions and Important Terms & Facts A circle is the set of points in a plane at a given distance from a given point in that plane. The given point is the
More informationIn what follows, we will focus on Voronoi diagrams in Euclidean space. Later, we will generalize to other distance spaces.
Voronoi Diagrams 4 A city builds a set of post offices, and now needs to determine which houses will be served by which office. It would be wasteful for a postman to go out of their way to make a delivery
More informationThe equal tangents property
The equal tangents property J. Jerónimo-Castro, G. Ruiz-Hernández and S. Tabachnikov April 29, 2012 Abstract Let M be a C 2 -smooth strictly convex closed surface in R 3 and denote by H the set of points
More informationLagrange multipliers 14.8
Lagrange multipliers 14.8 14 October 2013 Example: Optimization with constraint. Example: Find the extreme values of f (x, y) = x + 2y on the ellipse 3x 2 + 4y 2 = 3. 3/2 Maximum? 1 1 Minimum? 3/2 Idea:
More informationFACES OF CONVEX SETS
FACES OF CONVEX SETS VERA ROSHCHINA Abstract. We remind the basic definitions of faces of convex sets and their basic properties. For more details see the classic references [1, 2] and [4] for polytopes.
More informationCHAPTER 2 REVIEW COORDINATE GEOMETRY MATH Warm-Up: See Solved Homework questions. 2.2 Cartesian coordinate system
CHAPTER 2 REVIEW COORDINATE GEOMETRY MATH6 2.1 Warm-Up: See Solved Homework questions 2.2 Cartesian coordinate system Coordinate axes: Two perpendicular lines that intersect at the origin O on each line.
More informationGeometric Streaming Algorithms with a Sorting Primitive (TR CS )
Geometric Streaming Algorithms with a Sorting Primitive (TR CS-2007-17) Eric Y. Chen School of Computer Science University of Waterloo Waterloo, ON N2L 3G1, Canada, y28chen@cs.uwaterloo.ca Abstract. We
More informationGeometric Algorithms in Three Dimensions Tutorial. FSP Seminar, Strobl,
Geometric Algorithms in Three Dimensions Tutorial FSP Seminar, Strobl, 22.06.2006 Why Algorithms in Three and Higher Dimensions Which algorithms (convex hulls, triangulations etc.) can be generalized to
More information(Master Course) Mohammad Farshi Department of Computer Science, Yazd University. Yazd Univ. Computational Geometry.
1 / 17 (Master Course) Mohammad Farshi Department of Computer Science, Yazd University 1392-1 2 / 17 : Mark de Berg, Otfried Cheong, Marc van Kreveld, Mark Overmars, Algorithms and Applications, 3rd Edition,
More informationheptagon; not regular; hexagon; not regular; quadrilateral; convex concave regular; convex
10 1 Naming Polygons A polygon is a plane figure formed by a finite number of segments. In a convex polygon, all of the diagonals lie in the interior. A regular polygon is a convex polygon that is both
More informationAngles of Polygons. Essential Question What is the sum of the measures of the interior angles of a polygon?
7.1 Angles of Polygons Essential Question What is the sum of the measures of the interior angles of a polygon? The Sum of the Angle Measures of a Polygon Work with a partner. Use dynamic geometry software.
More informationComputational Geometry [csci 3250]
Computational Geometry [csci 3250] Laura Toma Bowdoin College Polygon Triangulation Polygon Triangulation The problem: Triangulate a given polygon. (output a set of diagonals that partition the polygon
More informationGENERALIZED HALFSPACES IN RESTRICTED-ORIENTATION CONVEXITY
GENERALIZED HALFSPACES IN RESTRICTED-ORIENTATION CONVEXITY Eugene Fink and Derick Wood Restricted-orientation convexity, also called O-convexity, is the study of geometric objects whose intersection with
More informationPartitioning Orthogonal Polygons by Extension of All Edges Incident to Reflex Vertices: lower and upper bounds on the number of pieces
Partitioning Orthogonal Polygons by Extension of All Edges Incident to Reflex Vertices: lower and upper bounds on the number of pieces António Leslie Bajuelos 1, Ana Paula Tomás and Fábio Marques 3 1 Dept.
More informationMath 5593 Linear Programming Lecture Notes
Math 5593 Linear Programming Lecture Notes Unit II: Theory & Foundations (Convex Analysis) University of Colorado Denver, Fall 2013 Topics 1 Convex Sets 1 1.1 Basic Properties (Luenberger-Ye Appendix B.1).........................
More informationSuggested List of Mathematical Language. Geometry
Suggested List of Mathematical Language Geometry Problem Solving A additive property of equality algorithm apply constraints construct discover explore generalization inductive reasoning parameters reason
More informationInternational Journal of Computational Geometry & Applications c World Scientific Publishing Company
International Journal of Computational Geometry & Applications c World Scientific Publishing Company ON COMPUTING ENCLOSING ISOSCELES TRIANGLES AND RELATED PROBLEMS PROSENJIT BOSE School of Computer Science,
More informationVoronoi Diagrams. A Voronoi diagram records everything one would ever want to know about proximity to a set of points
Voronoi Diagrams Voronoi Diagrams A Voronoi diagram records everything one would ever want to know about proximity to a set of points Who is closest to whom? Who is furthest? We will start with a series
More informationLesson Plan #39. 2) Students will be able to find the sum of the measures of the exterior angles of a triangle.
Lesson Plan #39 Class: Geometry Date: Tuesday December 11 th, 2018 Topic: Sum of the measures of the interior angles of a polygon Objectives: Aim: What is the sum of the measures of the interior angles
More informationGeometric Algorithms. 1. Objects
Geometric Algorithms 1. Definitions 2. Line-Segment properties 3. Inner Points of polygons 4. Simple polygons 5. Convex hulls 6. Closest pair of points 7. Diameter of a point set 1. Objects 2-dimensional
More information274 Curves on Surfaces, Lecture 5
274 Curves on Surfaces, Lecture 5 Dylan Thurston Notes by Qiaochu Yuan Fall 2012 5 Ideal polygons Previously we discussed three models of the hyperbolic plane: the Poincaré disk, the upper half-plane,
More informationMath 208/310 HWK 4 Solutions Section 1.6
Math 208/310 HWK 4 Solutions Problem 1, 1.6, p35. Prove that the neighborhood z z 0 < ρ is an open set. [Hint: Show that if z 1 belongs to the neighborhood, then so do all points z that satisfy z z + 1
More information