triangles leaves a smaller spiral polgon. Repeating this process covers S with at most dt=e lights. Generaliing the polgon shown in Fig. 1 establishes
|
|
- Gerald Turner
- 5 years ago
- Views:
Transcription
1 Verte -Lights for Monotone Mountains Joseph O'Rourke Abstract It is established that dt=e = dn=e?1 verte -lights suce to cover a monotone mountain polgon of t = n? triangles. A monotone mountain is a monotone polgon one of whose chains is a single segment, and a verte -light is a oodlight of aperture whose ape is a verte. Kewords. art galler theorems, oodlights, monotone polgons. 1 Introduction It was established in [ECOUX9] that for an <, there is a polgon that cannot be illuminated with an -oodlight at each verte. An -oodlight (or -light) is a light with aperture no more than. A verte -light is one whose ape is placed at a verte, aiming a cone of light of up to into the polgon. Each verte ma be assigned at most one light. The result of [ECOUX9] is then that n verte -lights do not alwas suce when <. Let a polgon P have t triangles in an triangulation, t = n? ; we will phrase bounds in terms of t. For =, an eas argument shows that t verte -lights alwas suce: place a light at an ear tip, cut o the ear, and recurse. This raises the question of nding a better upper bound. Urritia phrased the problem this wa [Urr97]: is there a c < 1 such that cn verte -lights alwas suce? The largest lower bound is c = via an eample of F. Santos. In this paper we pursue this question, but onl in special cases. In particular, we show that c = 1 for spirals and, more interestingl, for monotone mountains. A monotone mountain is a monotone polgon one of whose chains is a single segment. More precisel, a monotone chain is a polgonal chain whose Department of Computer Science, Smith College, Northampton, MA 0106, USA. orourke@cs.smith.edu. Supported b NSF grant CCR intersection with an vertical line is at most one point. A monotone mountain consists of one monotone chain, whose etreme (left and right) vertices are connected b a single segment. Note this base edge need not be horiontal. 1 Fig. shows a monotone mountain with base edge. Although this is a severel restricted class of polgons, it deserves attention for three reasons: the eamples establishing the results of [ECOUX9] (and [OX94]) are \nearl" monotone mountains; the problem is alread not completel trivial for monotone mountains; and there is some reason to hope similar techniques will appl to the unrestricted problem. We start with a result on spiral polgons, where the problem is trivial. Spiral Polgons A spiral polgon consists of two joined polgonal chains: a chain of ree vertices, and a chain of conve vertices. Theorem 1 A spiral polgon S of t = n? triangles ma be covered b dt=e = dn=e? 1 verte -lights; some spirals require this man. Proof: If S has no ree vertices, S is conve and can be covered with one verte -light at an verte. So assume S has at least one ree verte. Let,, and be three consecutive vertices of S, with ree, conve, and conve. Such a triple alwas eists, because an polgon has at least three conve vertices. The segment must be an internal diagonal of the polgon. Therefore at least two triangles are incident to in an triangulation of S. Placing a light at, as shown in Fig. 1, therefore covers at least two triangles; because is conve, the light covers the entire angle at. Removing the covered 1 This denition diers in this respect from that introduced in [OX94], which demanded a horiontal base edge. Page 1
2 triangles leaves a smaller spiral polgon. Repeating this process covers S with at most dt=e lights. Generaliing the polgon shown in Fig. 1 establishes that the bound is tight. Figure : A wrong orienting decision at can lead to suboptimal coverage. Figure 1: Placing a -light at covers at least two triangles. The light is shown as a full -light, although onl the angle interior to the polgon is relevant. Notice that the procedure implied b this proof places lights onl on conve vertices. One reason spiral polgons are so eas is that lights never need be placed on ree vertices, and so the potentiall dif- cult decision of how to orient a -light at a ree verte need not be confronted. 4 Worst Case It is clear that if the number of triangles incident to in Fig. from the left is k and from right is also k, then a lower bound of c = 1 is attained: t = k + 1, and k + 1 = dt=e lights are necessar, one at and k on the opposite ree chain. The same bound is acheived b the shape shown in Fig.. In this polgon, the etension of v 1 v meets v v 6 ; the etension of v v meets v 4 v ; and so on. 4 Non-Localit Monotone mountains are more dicult than spirals for two reasons: ree vertices cannot be avoided, and the decision of how of orient a light at ree verte cannot be made locall. Man art galler theorems can be proved inductivel as follows: cut o a small piece, illuminate that piece, and recurse on the remainder [O'R87]. The reason this paradigm works is that decisions can be made locall: what happens in the small piece is independent of the shape of the remainder of the polgon. This is not the case with the verte -light problem, even for monotone mountains. Consider the polgon shown in Fig., and imagine tring to decide whether to shine the light at left or right, basing the decision onl on the portion of the polgon to the left of. One can see that no c < 1 can be achieved without looking at the structure of the right portion: if the \wrong" decision is made at (as illustrated), then an arbitraril large fraction of all remaining vertices will need lights. Although the decision is obvious in this case, as it can be based on the number of triangles incident to, the eect might be more subtle. 0 6 Figure : dt=e lights are necessar: t = and d=e = are needed. We prove this simple fact for later reference: Lemma 1 The generaliation of the polgon M in Fig. requires dt=e = dn=e? 1 verte -lights. Proof: Each verte on the left chain can onl see two vertices on the right chain, and vice versa: v can see v and v, because the etensions of v 1 v and v v straddle v ; etc. Thus at most (in fact eactl) three triangles are incident to v in a triangulation of M. A -light at v can onl full cover two of these three triangles, because v is ree. So each light covers at most two triangles, and dt=e are needed overall. 1 Page
3 Dualit One wa to view the phenomenon illustrated in Fig. is as follows: the polgon naturall partitions into two monotone mountain subpolgons at. If at light is placed at and aimed left, then in the right subpolgon, placing a light at is forbidden (as that would place two lights at one verte). Moreover, that eample shows that a (sub)polgon with one verte forbidden a light could in fact require one light per triangle. However, there is an interesting \dualit" at pla here, in the following sense: if a polgon with one forbidden verte requires man lights, then placing a light at the forbidden verte permits it to be covered with few lights. In other words, there is no polgon structure that is both bad with a forbidden verte and bad without that verte forbidden. If M is a monotone mountain with etreme left and right vertices and, let L 10 (M) be the number of verte -lights needed to cover M when verte is assigned a light and is forbidden to have a light; and let L 01 (M) be the number needed when is assigned a light and is forbidden. Note that, in these denitions, not onl is one verte forbidden a light, but the other etreme verte must be assigned a light. The precise statement of dualit is captured in the following lemma: Lemma is the ke to the main theorem in the net section. We now prove it via induction. Proof: Let M be a monotone mountain of t triangles. The induction hpothesis is that L 10 (M 0 ) + L 01 (M 0 ) t for an monotone mountain M 0 of t 0 < t triangles. The base case is a single triangle T, t = 1, when L 10 (T ) = L 01 (T ) = 1, and so L 10 (T ) + L 01 (T ) = = t + 1. Let the base edge of M be, and let be the verte rst encountered b sweeping the line containing verticall; see Fig.. It must be the case that both and are internal diagonals. This provides a natural partition of M into three pieces: 4, a subpolgon A sharing diagonal, and a subpolgon B sharing diagonal. Note that it ma well be that either A or B is the empt polgon ;; if both are empt, t = 1 and we fall into the base case of the induction. A B Lemma For an monotone mountain M of t triangles, L 10 (M) + L 01 (M) t + 1. The generaliation of Fig. 4 establishes that the sum is sometimes as large as t+1: here L 10 (M) = 1 (v 0 assigned) and L 01 (M) = t (v 0 forbidden, as illustrated). Figure : Induction partition of M into A, B, and It is clear that A and B are monotone mountains. In particular, the angle at in A is conve, as is the angle at in B: for the monotone chain enters from the left and leaves it from the right (Fig. 6), as do the diagonals and respectivel. We prove the lemma in two cases. Case 1: Neither A nor B is empt. We compute a bound on L 10 (M), which places a light at but forbids a light at. Because the angle at in M is conve, the light at covers 4. This light also serves as a light at in A. It makes sense in this situation to place a light at and aim it into B. Doing this gives us an upper bound on L 10 (M), upper because this sensible light placement and orientation at might not optimal. This strateg ields Figure 4: Dualit: L 10 (M) + L 01 (M) = t + 1. L 10 (M) L 10 (A) + L 10 (B) : (1) Page
4 B Figure 6: The monotone chain enters each verte from the left halfplane and leaves in the right halfplane. Figure 7: A = ;. Analogous reasoning (again the light at (illustrated in Fig. ) covers 4) ields L 01 (M) L 01 (A) + L 01 (B) : () Adding Eqs. 1 and ields L 10 (M)+L 01 (M) [L 10 (A)+L 01 (A)]+[L 10 (B)+L 01 (B)] : Suppose A contains a triangles and B contains b triangles, so that t = a + b + 1. Then appling the induction hpothesis to each ields L 10 (M) + L 01 (M) [a + 1] + [b + 1] This is the claim to be proved. It onl remains to handle the case where one of A or B is empt. Case : A = ; but B is not empt. This case is illustrated in Fig. 7; the case with B = ; is smmetric and need not be considered. If a light is placed at, it serves to cover 4, and the reasoning is just as before: L 10 (M) 1 + L 10 (B) : If a light is placed at, then it covers 4 (as illustrated in Fig. 7), and there is no need to an additional light to cover the empt A: Adding ields L 01 (M) L 01 (B) : L 10 (M) + L 01 (M) 1 + [L 10 (B) + L 01 (B)] L 10 (M) + L 01 (M) 1 + [b + 1] 6 Main Result With Lemma in hand, the nal step is eas: Theorem A monotone mountain polgon M of t = n? triangles ma be covered b dt=e = dn=e?1 verte -lights; some monotone mountains require this man. Proof: We know from Lemma that Let L(M) = minfl 10 (M); L 01 (M)g : B the pigeonhole principle, L(M) b(t + 1)=c = dt=e : Lemma 1 established that this bound can be attained (Fig. ). The proofs of Lemma and Theorem impl a simple algorithm: compute a bound on L 10 (M) b placing lights at the left corners of A and of B and recursing, and compute a bound on L 01 (M) similarl. Use the light placement of whichever is smaller. The algorithm is easil seen to be O(n log n): spend linear time nding, and recursivel process the pieces. This leads to the familiar divide-and-conquer recurrence. An eample is shown in Fig. 8. Here M has t = 14 triangles, and L 10 (M) + L 01 (M) + 10 = t + 1. This eample illustrates a number of features of the light placements implied b the bound computation on L 10 and L 01 : 1. Ever verte that is not a local maimum is assigned a light in either the L 10 or L 01 computation. (Some vertices are assigned a light in both.). All the lights in the L 10 placement aim to the right; and all those in the L 01 placement aim to the left. Page 4
5 . The sum L 10 (M) + L 01 (M) achieved is alwas eactl t + 1, because blindl following the procedure places lights even if the might not be needed (e.g., when M is conve). 4. Lights at ree vertices are turned either full counterclockwise (in L 10 ) or clockwise (in L 10 ): intermediate positions are never needed. 7 Discussion Man of the features present in monotone mountains hold for the problem for general simple polgons as well: for eample, non-localit. For other features, it remains unclear: for eample, whether ever light ma be full turned (observation 4 above). In an case, I believe that a version of the dualit described in Lemma holds and will be a ke to solving Urrutia's problem. I conjecture c = is achievable. References [ECOUX9] V. Estivill-Castro, J. O'Rourke, J. Urrutia, and D. Xu. Illumination of polgons with verte oodlights. Inform. Process. Lett., 6:9{1, 199. [O'R87] J. O'Rourke. Art Galler Theorems and Algorithms. Oford Universit Press, New York, NY, [OX94] J. O'Rourke and D. Xu. Illumination of polgons with 90 verte lights. In Snapshots of Computational and Discrete Geometr, volume, pages 108{ 117. School Comput. Sci., McGill Univ., Montreal, PQ, Jul Technical Report SOCS [Urr97] J. Urrutia. Art galler and illumination problems. In J.-R. Sack and J. Urrutia, editors, Handbook on Computational Geometr. North-Holland, To appear. Figure 8: Eample: t = 14, L 10 = (top), L 01 = 10 (bottom). Page
y = f(x) x (x, f(x)) f(x) g(x) = f(x) + 2 (x, g(x)) 0 (0, 1) 1 3 (0, 3) 2 (2, 3) 3 5 (2, 5) 4 (4, 3) 3 5 (4, 5) 5 (5, 5) 5 7 (5, 7)
0 Relations and Functions.7 Transformations In this section, we stud how the graphs of functions change, or transform, when certain specialized modifications are made to their formulas. The transformations
More informationNONCONGRUENT EQUIDISSECTIONS OF THE PLANE
NONCONGRUENT EQUIDISSECTIONS OF THE PLANE D. FRETTLÖH Abstract. Nandakumar asked whether there is a tiling of the plane b pairwise non-congruent triangles of equal area and equal perimeter. Here a weaker
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 informationLecture 3: Art Gallery Problems and Polygon Triangulation
EECS 396/496: Computational Geometry Fall 2017 Lecture 3: Art Gallery Problems and Polygon Triangulation Lecturer: Huck Bennett In this lecture, we study the problem of guarding an art gallery (specified
More informationMa/CS 6b Class 26: Art Galleries and Politicians
Ma/CS 6b Class 26: Art Galleries and Politicians By Adam Sheffer The Art Gallery Problem Problem. We wish to place security cameras at a gallery, such that they cover it completely. Every camera can cover
More informationarxiv: v4 [cs.cg] 6 Sep 2018
1-Fan-Bundle-Planar Drawings of Graphs P. Angelini 1, M. A. Bekos 1, M. Kaufmann 1, P. Kindermann 2, and T. Schneck 1 1 Institut für Informatik, Universität Tübingen, German, {angelini,bekos,mk,schneck}@informatik.uni-tuebingen.de
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 information4.4. Concavity and Curve Sketching. Concavity
4.4 Concavit and Curve Sketching 267 4.4 Concavit and Curve Sketching f' decreases CONCAVE DOWN 3 f' increases 0 CONCAVE UP FIGURE 4.25 The graph of ƒsd = 3 is concave down on s - q, 0d and concave up
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 informationTranslations, Reflections, and Rotations
Translations, Reflections, and Rotations The Marching Cougars Lesson 9-1 Transformations Learning Targets: Perform transformations on and off the coordinate plane. Identif characteristics of transformations
More informationPolygon Triangulation
Polygon Triangulation The problem: Triangulate a given polygon. (output a set of diagonals that partition the polygon into triangles). Computational Geometry [csci 3250] Polygon Triangulation Laura Toma
More information4.2 Properties of Rational Functions. 188 CHAPTER 4 Polynomial and Rational Functions. Are You Prepared? Answers
88 CHAPTER 4 Polnomial and Rational Functions 5. Obtain a graph of the function for the values of a, b, and c in the following table. Conjecture a relation between the degree of a polnomial and the number
More informationM O T I O N A N D D R A W I N G
2 M O T I O N A N D D R A W I N G Now that ou know our wa around the interface, ou re read to use more of Scratch s programming tools. In this chapter, ou ll do the following: Eplore Scratch s motion and
More informationThe SUMO Speaker Series for Undergraduates. The Art Gallery Problem
The SUMO Speaker Series for Undergraduates (food from Pizza Chicago) Wednesday, April 21 4:40-5:30, room 380C The Art Gallery Problem Amy Pang Abstract: Imagine you are the curator of an art gallery with
More informationPre-Algebra Notes Unit 13: Angle Relationships and Transformations
Pre-Algebra Notes Unit 13: Angle Relationships and Transformations Angle Relationships Sllabus Objectives: (7.1) The student will identif measures of complementar, supplementar, and vertical angles. (7.2)
More informationSection 2.2: Absolute Value Functions, from College Algebra: Corrected Edition by Carl Stitz, Ph.D. and Jeff Zeager, Ph.D. is available under a
Section.: Absolute Value Functions, from College Algebra: Corrected Edition b Carl Stitz, Ph.D. and Jeff Zeager, Ph.D. is available under a Creative Commons Attribution-NonCommercial-ShareAlike.0 license.
More information0 COORDINATE GEOMETRY
0 COORDINATE GEOMETRY Coordinate Geometr 0-1 Equations of Lines 0- Parallel and Perpendicular Lines 0- Intersecting Lines 0- Midpoints, Distance Formula, Segment Lengths 0- Equations of Circles 0-6 Problem
More information2.2 Absolute Value Functions
. Absolute Value Functions 7. Absolute Value Functions There are a few was to describe what is meant b the absolute value of a real number. You ma have been taught that is the distance from the real number
More informationFour Ways to Represent a Function: We can describe a specific function in the following four ways: * verbally (by a description in words);
MA19, Activit 23: What is a Function? (Section 3.1, pp. 214-22) Date: Toda s Goal: Assignments: Perhaps the most useful mathematical idea for modeling the real world is the concept of a function. We eplore
More information[Me] Meisters, G. H., Polygons have ears, American Mathematical Monthly, June/July 1975, pp
4. Applications Meisters [Me] Two-Ears Theorem was motivated by the problem of triangulating a simple polygon. In fact Meisters suggests a greedy, but concise algorithm to achieve this goal, i.e., find
More informationCS 157: Assignment 6
CS 7: Assignment Douglas R. Lanman 8 Ma Problem : Evaluating Conve Polgons This write-up presents several simple algorithms for determining whether a given set of twodimensional points defines a conve
More informationANGLES See the Math Notes boxes in Lessons and for more information about angle relationships.
CC1 Basic Definitions Defense Practice ANGLES 2.1.1 2.1.5 Applications of geometr in everda settings often involve the measures of angles. In this chapter we begin our stud of angle measurement. After
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 informationToday s class. Geometric objects and transformations. Informationsteknologi. Wednesday, November 7, 2007 Computer Graphics - Class 5 1
Toda s class Geometric objects and transformations Wednesda, November 7, 27 Computer Graphics - Class 5 Vector operations Review of vector operations needed for working in computer graphics adding two
More informationDef.: a, b, and c are called the for the line L. x = y = z =
Bob Brown, CCBC Dundalk Math 253 Calculus 3, Chapter Section 5 Completed Lines in Space Eercise : Consider the vector v = Sketch and describe the following set: t v ta, tb, tc : t a, b, c. Let P =,,. Sketch
More information2.8 Distance and Midpoint Formulas; Circles
Section.8 Distance and Midpoint Formulas; Circles 9 Eercises 89 90 are based on the following cartoon. B.C. b permission of Johnn Hart and Creators Sndicate, Inc. 89. Assuming that there is no such thing
More informationSTRAND I: Geometry and Trigonometry. UNIT 37 Further Transformations: Student Text Contents. Section Reflections. 37.
MEP Jamaica: STRN I UNIT 7 Further Transformations: Student Tet ontents STRN I: Geometr and Trigonometr Unit 7 Further Transformations Student Tet ontents Section 7. Reflections 7. Rotations 7. Translations
More information3.2 Polynomial Functions of Higher Degree
71_00.qp 1/7/06 1: PM Page 6 Section. Polnomial Functions of Higher Degree 6. Polnomial Functions of Higher Degree What ou should learn Graphs of Polnomial Functions You should be able to sketch accurate
More informationChapter 2. Convex Hull. 2.1 Convexity. The following terminology should be familiar from linear algebra. Consider P R d. courses.
Chapter 2 Convex Hull 2.1 Convexity Consider P R d. courses. The following terminology should be familiar from linear algebra Linear hull. lin(p) := { q } q = λi p i 8 i : p i 2 P, λ i 2 R (smallest linear
More informationPolygon Triangulation
Polygon Triangulation Definition Simple Polygons 1. A polygon is the region of a plane bounded by a finite collection of line segments forming a simple closed curve. 2. Simple closed curve means a certain
More informationMatrix Representations
CONDENSED LESSON 6. Matri Representations In this lesson, ou Represent closed sstems with transition diagrams and transition matrices Use matrices to organize information Sandra works at a da-care center.
More informationBackbone Colouring of Graphs
Backbone Colouring of Graphs Arnoosh Golestanian Mathematics A thesis submitted in partial fulfilment of the requirements for the degree of Master of Science in Mathematics Facult of Mathematics and Science,
More informationPlot and connect the points in a coordinate plane to make a polygon. Name the polygon.
. Start Thinking Find at least two objects in each of the following categories: circle, square, triangle, and rectangle (nonsquare). Use a table to compare each object of the same categor in the following
More informationCS6100: Topics in Design and Analysis of Algorithms
CS6100: Topics in Design and Analysis of Algorithms Guarding and Triangulating Polygons John Augustine CS6100 (Even 2012): Guarding and Triangulating Polygons The Art Gallery Problem A simple polygon is
More informationGlossary alternate interior angles absolute value function Example alternate exterior angles Example angle of rotation Example
Glossar A absolute value function An absolute value function is a function that can be written in the form, where is an number or epression. alternate eterior angles alternate interior angles Alternate
More informationPolygon decomposition. Motivation: Art gallery problem
CG Lecture 3 Polygon decomposition 1. Polygon triangulation Triangulation theory Monotone polygon triangulation 2. Polygon decomposition into monotone pieces 3. Trapezoidal decomposition 4. Convex decomposition
More informationThe Graph Scale-Change Theorem
Lesson 3-5 Lesson 3-5 The Graph Scale-Change Theorem Vocabular horizontal and vertical scale change, scale factor size change BIG IDEA The graph of a function can be scaled horizontall, verticall, or in
More informationIntermediate Algebra. Gregg Waterman Oregon Institute of Technology
Intermediate Algebra Gregg Waterman Oregon Institute of Technolog c 2017 Gregg Waterman This work is licensed under the Creative Commons Attribution 4.0 International license. The essence of the license
More informationRoberto s Notes on Differential Calculus Chapter 8: Graphical analysis Section 5. Graph sketching
Roberto s Notes on Differential Calculus Chapter 8: Graphical analsis Section 5 Graph sketching What ou need to know alread: How to compute and interpret limits How to perform first and second derivative
More informationPolygon Partitioning. Lecture03
1 Polygon Partitioning Lecture03 2 History of Triangulation Algorithms 3 Outline Monotone polygon Triangulation of monotone polygon Trapezoidal decomposition Decomposition in monotone mountain Convex decomposition
More informationPartitions and Packings of Complete Geometric Graphs with Plane Spanning Double Stars and Paths
Partitions and Packings of Complete Geometric Graphs with Plane Spanning Double Stars and Paths Master Thesis Patrick Schnider July 25, 2015 Advisors: Prof. Dr. Emo Welzl, Manuel Wettstein Department of
More informationThe Art Gallery Problem: An Overview and Extension to Chromatic Coloring and Mobile Guards
The Art Gallery Problem: An Overview and Extension to Chromatic Coloring and Mobile Guards Nicole Chesnokov May 16, 2018 Contents 1 Introduction 2 2 The Art Gallery Problem 3 2.1 Proof..................................
More informationThe nonorientable genus of complete tripartite graphs
The nonorientable genus of complete tripartite graphs M. N. Ellingham Department of Mathematics, Stevenson Center Vanderbilt Universit, Nashville, TN 7, U. S. A. mne@math.vanderbilt.edu Chris Stephens
More information[8] that this cannot happen on the projective plane (cf. also [2]) and the results of Robertson, Seymour, and Thomas [5] on linkless embeddings of gra
Apex graphs with embeddings of face-width three Bojan Mohar Department of Mathematics University of Ljubljana Jadranska 19, 61111 Ljubljana Slovenia bojan.mohar@uni-lj.si Abstract Aa apex graph is a graph
More information[Ba] Bykat, A., Convex hull of a finite set of points in two dimensions, Info. Proc. Lett. 7 (1978),
[Ba] Bykat, A., Convex hull of a finite set of points in two dimensions, Info. Proc. Lett. 7 (1978), 296-298. [Ch] [CI] [EET] [ET] [FM] [GJPT] [Gr] [HM] [KKT] Chazelle, B., A theorem on polygon cutting
More informationLines and Their Slopes
8.2 Lines and Their Slopes Linear Equations in Two Variables In the previous chapter we studied linear equations in a single variable. The solution of such an equation is a real number. A linear equation
More informationName: Unit 8 Beaumont Middle School 8th Grade, Advanced Algebra I T Q R U
Unit 8 eaumont Middle School 8th Grade, 2015-2016 dvanced lgebra I Name: P T Q R U S I can define ke terms and identif tpes of angles and adjacent angles. I can identif vertical, supplementar and complementar
More informationTHE INVERSE GRAPH. Finding the equation of the inverse. What is a function? LESSON
LESSON THE INVERSE GRAPH The reflection of a graph in the line = will be the graph of its inverse. f() f () The line = is drawn as the dotted line. Imagine folding the page along the dotted line, the two
More informationof a set of n straight lines, have been considered. Among them are k-sets in higher dimensions or k-levels of curves in two dimensions and surfaces in
Point-sets with few k-sets Helmut Alt? Stefan Felsner Ferran Hurtado y Marc Noy y Abstract A k-set of a nite set S of points in the plane is a subset of cardinality k that can be separated from the rest
More informationOrthogonal art galleries with holes: a coloring proof of Aggarwal s Theorem
Orthogonal art galleries with holes: a coloring proof of Aggarwal s Theorem Pawe l Żyliński Institute of Mathematics University of Gdańsk, 8095 Gdańsk, Poland pz@math.univ.gda.pl Submitted: Sep 9, 005;
More informationUnit 5 Lesson 2 Investigation 1
Name: Investigation 1 Modeling Rigid Transformations CPMP-Tools Computer graphics enable designers to model two- and three-dimensional figures and to also easil manipulate those figures. For eample, interior
More informationImplicit differentiation
Roberto s Notes on Differential Calculus Chapter 4: Basic differentiation rules Section 5 Implicit differentiation What ou need to know alread: Basic rules of differentiation, including the chain rule.
More informationPolygon Triangulation
If triangles had a god, they would give him three sides. Charles Louis de Secondat Montesquie (1721) Down with Euclid! Death to triangles! Jean Dieudonné (1959) P Polygon Triangulation P.1 Introduction
More informationdt Acceleration is the derivative of velocity with respect to time. If a body's position at time t is S = f(t), the body's acceleration at time t is
APPLICATIN F DERIVATIVE INTRDUCTIN In this section we eamine some applications in which derivatives are used to represent and interpret the rates at which things change in the world around us. Let S be
More informationOn the Size of Higher-Dimensional Triangulations
Combinatorial and Computational Geometry MSRI Publications Volume 52, 2005 On the Size of Higher-Dimensional Triangulations PETER BRASS Abstract. I show that there are sets of n points in three dimensions,
More informationA notation for describing computations that focuses. Allows convenient denition and manipulation of
Introduction to -calculus A notation for describing computations that focuses on function denition and application. Allows convenient denition and manipulation of functions as \rst-class" values. Eample:
More informationA Constant-Factor Approximation Algorithm for Optimal Terrain Guarding
A Constant-Factor Approximation Algorithm for Optimal Terrain Guarding Boaz Ben-Moshe Matthew J. Katz Joseph S. B. Mitchell July 5, 2004 Abstract We present the first constant-factor approximation algorithm
More informationOn minimum secure dominating sets of graphs
On minimum secure dominating sets of graphs AP Burger, AP de Villiers & JH van Vuuren December 24, 2013 Abstract A subset X of the verte set of a graph G is a secure dominating set of G if X is a dominating
More informationPolygon Triangulation. (slides partially by Daniel Vlasic )
Polygon Triangulation (slides partially by Daniel Vlasic ) Triangulation: Definition Triangulation of a simple polygon P: decomposition of P into triangles by a maximal set of non-intersecting diagonals
More informationLine Arrangement. Chapter 6
Line Arrangement Chapter 6 Line Arrangement Problem: Given a set L of n lines in the plane, compute their arrangement which is a planar subdivision. Line Arrangements Problem: Given a set L of n lines
More informationSECTION 8.2 the hyperbola Wake created from shock wave. Portion of a hyperbola
SECTION 8. the hperola 6 9 7 learning OjeCTIveS In this section, ou will: Locate a hperola s vertices and foci. Write equations of hperolas in standard form. Graph hperolas centered at the origin. Graph
More informationGrade 6 Math Circles February 29, D Geometry
1 Universit of Waterloo Facult of Mathematics Centre for Education in Mathematics and Computing Grade 6 Math Circles Feruar 29, 2012 2D Geometr What is Geometr? Geometr is one of the oldest ranches in
More informationChain Pattern Scheduling for nested loops
Chain Pattern Scheduling for nested loops Florina Ciorba, Theodore Andronikos and George Papakonstantinou Computing Sstems Laborator, Computer Science Division, Department of Electrical and Computer Engineering,
More informationThink About. Unit 5 Lesson 3. Investigation. This Situation. Name: a Where do you think the origin of a coordinate system was placed in creating this
Think About This Situation Unit 5 Lesson 3 Investigation 1 Name: Eamine how the sequence of images changes from frame to frame. a Where do ou think the origin of a coordinate sstem was placed in creating
More informationChapter 9 Transformations
Section 9-1: Reflections SOL: G.2 The student will use pictorial representations, including computer software, constructions, and coordinate methods, to solve problems involving smmetr and transformation.
More informationSection 4.1: Maximum and Minimum Values
Section 4.: Maimum and Minimum Values In this chapter, we shall consider further applications of the derivative. The main application we shall consider is using derivatives to sketch accurate graphs of
More informationColoring 3-Colorable Graphs
Coloring -Colorable Graphs Charles Jin April, 015 1 Introduction Graph coloring in general is an etremely easy-to-understand yet powerful tool. It has wide-ranging applications from register allocation
More informationarxiv: v4 [cs.cg] 12 Jul 2007
Unfolding Orthogonal Terrains Joseph O Rourke arxiv:0707.060v4 [cs.cg] Jul 007 Jul, 007 Abstract It is shown that ever orthogonal terrain, i.e., an orthogonal (rightangled) polhedron based on a rectangle
More informationEngineering and Construction F3HV 11 Maths Craft 1 RIGHT ANGLED TRIANGLES : PYTHAGORAS' THEOREM
RIGHT NGLED TRINGLES : PYTHGORS' THEOREM ver important triangle, in terms of practical use, is the right-angled triangle. In the "real" world, the right-angled triangle is used etensivel. It is a shape
More informationSection 1.6: Graphs of Functions, from College Algebra: Corrected Edition by Carl Stitz, Ph.D. and Jeff Zeager, Ph.D. is available under a Creative
Section.6: Graphs of Functions, from College Algebra: Corrected Edition b Carl Stitz, Ph.D. and Jeff Zeager, Ph.D. is available under a Creative Commons Attribution-NonCommercial-ShareAlike.0 license.
More informationParameterized graph separation problems
Parameterized graph separation problems Dániel Marx Department of Computer Science and Information Theory, Budapest University of Technology and Economics Budapest, H-1521, Hungary, dmarx@cs.bme.hu Abstract.
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 informationMonotone Paths in Geometric Triangulations
Monotone Paths in Geometric Triangulations Adrian Dumitrescu Ritankar Mandal Csaba D. Tóth November 19, 2017 Abstract (I) We prove that the (maximum) number of monotone paths in a geometric triangulation
More informationAMS 345/CSE 355 Computational Geometry
AMS 345/CSE 355 Computational Geometry Lecture: Polygons, Guarding Joe Mitchell Do You Like Puzzles? Come to the new Stony Brook Puzzle Society Meets: Friday 1:05-2:30 pm at CSE 2120 Organizer: Pramod
More informationImage Metamorphosis By Affine Transformations
Image Metamorphosis B Affine Transformations Tim Mers and Peter Spiegel December 16, 2005 Abstract Among the man was to manipulate an image is a technique known as morphing. Image morphing is a special
More informationModule 2, Section 2 Graphs of Trigonometric Functions
Principles of Mathematics Section, Introduction 5 Module, Section Graphs of Trigonometric Functions Introduction You have studied trigonometric ratios since Grade 9 Mathematics. In this module ou will
More informationPolygon Triangulation. (slides partially by Daniel Vlasic )
Polygon Triangulation (slides partially by Daniel Vlasic ) Triangulation: Definition Triangulation of a simple polygon P: decomposition of P into triangles by a maximal set of non-intersecting diagonals
More informationPolynomials. Math 4800/6080 Project Course
Polnomials. Math 4800/6080 Project Course 2. The Plane. Boss, boss, ze plane, ze plane! Tattoo, Fantas Island The points of the plane R 2 are ordered pairs (x, ) of real numbers. We ll also use vector
More informationFOUR EDGE-INDEPENDENT SPANNING TREES 1
FOUR EDGE-INDEPENDENT SPANNING TREES 1 Alexander Hoyer and Robin Thomas School of Mathematics Georgia Institute of Technology Atlanta, Georgia 30332-0160, USA ABSTRACT We prove an ear-decomposition theorem
More information8.6 Three-Dimensional Cartesian Coordinate System
SECTION 8.6 Three-Dimensional Cartesian Coordinate Sstem 69 What ou ll learn about Three-Dimensional Cartesian Coordinates Distance and Midpoint Formulas Equation of a Sphere Planes and Other Surfaces
More informationGeometry. Origin of Analytic Geometry. Slide 1 / 202 Slide 2 / 202. Slide 4 / 202. Slide 3 / 202. Slide 5 / 202. Slide 6 / 202.
Slide 1 / Slide / Geometr Analtic Geometr 1-- www.njctl.org Slide 3 / Table of Contents Origin of Analtic Geometr The Distance Formula The Midpoint Formula Partitions of a Line Segment Slopes of Parallel
More informationUnfolding Face-Neighborhood Convex Patches: Counterexamples and Positive Results
CCCG 2013, Waterloo, Ontario, August 8 10, 2013 Unfolding Face-Neighborhood Convex Patches: Counterexamples and Positive Results Joseph O Rourke Abstract We address unsolved problems of unfolding polyhedra
More information2.5. Verifying Properties of Geometric Figures. LEARN ABOUT the Math. Proving a conjecture about a geometric figure
.5 Verifing Properties of Geometric Figures YOU WILL NEED grid paper and ruler, or dnamic geometr software P( 7, 9) Q(9, ) J - - M - R(9, ) - - - L - - S(, ) K GOAL Use analtic geometr to verif properties
More informationCoverage with k-transmitters in the Presence of Obstacles
Noname manuscript No. (will be inserted by the editor) Coverage with k-transmitters in the Presence of Obstacles Brad Ballinger Nadia Benbernou Prosenjit Bose Mirela Damian Erik D. Demaine Vida Dujmović
More information12.1. Angle Relationships. Identifying Complementary, Supplementary Angles. Goal: Classify special pairs of angles. Vocabulary. Complementary. angles.
. Angle Relationships Goal: Classif special pairs of angles. Vocabular Complementar angles: Supplementar angles: Vertical angles: Eample Identifing Complementar, Supplementar Angles In quadrilateral PQRS,
More informationA NOTE ON BLOCKING VISIBILITY BETWEEN POINTS
A NOTE ON BLOCKING VISIBILITY BETWEEN POINTS Adrian Dumitrescu János Pach Géza Tóth Abstract Given a finite point set P in the plane, let b(p) be the smallest number of points q 1,q 2,... not belonging
More informationWhen Can a Polygon. Fold to a Polytope? Anna Lubiw. Joseph O'Rourke y. Abstract
When Can a Polygon Fold to a Polytope? Anna Lubiw Joseph O'Rourke y June 24, 1996 Abstract We show that the decision question posed in the title can be answered with an algorithm of time and space complexity
More information5 and Parallel and Perpendicular Lines
Ch 3: Parallel and Perpendicular Lines 3 1 Properties of Parallel Lines 3 Proving Lines Parallel 3 3 Parallel and Perpendicular Lines 3 Parallel Lines and the Triangle Angles Sum Theorem 3 5 The Polgon
More informationA TIGHT BOUND ON THE LENGTH OF ODD CYCLES IN THE INCOMPATIBILITY GRAPH OF A NON-C1P MATRIX
A TIGHT BOUND ON THE LENGTH OF ODD CYCLES IN THE INCOMPATIBILITY GRAPH OF A NON-C1P MATRIX MEHRNOUSH MALEKESMAEILI, CEDRIC CHAUVE, AND TAMON STEPHEN Abstract. A binary matrix has the consecutive ones property
More informationarxiv: v1 [cs.cg] 1 Jul 2017
CCCG 2017, Ottawa, Ontario, July 26 28, 2017 Angle-monotone Paths in Non-obtuse Triangulations Anna Lubiw Joseph O Rourke arxiv:1707.00219v1 [cs.cg] 1 Jul 2017 Abstract We reprove a result of Dehkordi,
More informationP242 Sampling Considerations for Band-limited Fourier Reconstruction of Aliased Seismic Data
P242 Sampling Considerations for Band-limited Fourier Reconstruction of Aliased Seismic Data M. aghizadeh* (Universit of Alberta) & M. Sacchi (Universit of Alberta) SUMMARY The multidimensional discrete
More informationThe Irregularity and Total Irregularity of Eulerian Graphs
Iranian J. Math. Chem. 9 (2) June (2018) 101 111 Iranian Journal of Mathematical Chemistr Journal homepage: ijmc.kashanu.ac.ir The Irregularit and Total Irregularit of Eulerian Graphs R. NASIRI a,, H.
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 information4. Two Dimensional Transformations
4. Two Dimensional Transformations CS362 Introduction to Computer Graphics Helena Wong, 2 In man applications, changes in orientations, sizes, and shapes are accomplished with geometric transformations
More information14-1. Translations. Vocabulary. Lesson
Chapter 1 Lesson 1-1 Translations Vocabular slide, translation preimage translation image congruent figures Adding fied numbers to each of the coordinates of a figure has the effect of sliding or translating
More information2.4 Coordinate Proof Using Distance with Quadrilaterals
Name Class Date.4 Coordinate Proof Using Distance with Quadrilaterals Essential Question: How can ou use slope and the distance formula in coordinate proofs? Resource Locker Eplore Positioning a Quadrilateral
More information(0, 2) y = x 1 2. y = x (2, 2) y = 2x + 2
.5 Equations of Parallel and Perpendicular Lines COMMON CORE Learning Standards HSG-GPE.B.5 HSG-GPE.B. Essential Question How can ou write an equation of a line that is parallel or perpendicular to a given
More informationTheoretical Computer Science
Theoretical Computer Science 408 (2008) 129 142 Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs Drawing colored graphs on colored points
More informationIsometry: When the preimage and image are congruent. It is a motion that preserves the size and shape of the image as it is transformed.
Chapter Notes Notes #36: Translations and Smmetr (Sections.1,.) Transformation: A transformation of a geometric figure is a change in its position, shape or size. Preimage: The original figure. Image:
More informationArt Gallery Theorems and Algorithms
Art Gallery Art Gallery Theorems and Algorithms Daniel G. Aliaga Computer Science Department Purdue University Problem: determine the minimum number of guards sufficient to cover the interior of an n-wall
More information