points are stationed arbitrarily close to one corner of the square ( n+1
|
|
- Neil Bruce
- 5 years ago
- Views:
Transcription
1 1 Intro We ve seen previously that we can construct networks based on the regular triangular, rectangular and hexagonal lattices where the total network length is linear in n and the R-statistic for the network is, respectively,... The question naturally arises how well we can do for any fixed r > 1 in particular whether, fixing r, we can always find a network N such that R(N) r and length(n) O(n). (Alternatively, if we look at the length of network per city, we are interested in networks where the normalized length is constant.) Note that for r = 1 this is not possible, since the only network that achieves this R-statistic is the complete graph on n points. If n points are stationed arbitrarily close to one corner of the square ( n+1 for n odd) and in the opposite corner, we have for any pair of points (x, y) where x and n y are in opposite corners: dist(x, y) n. There are ( n )( n ) = n 4 such points, so: n n length(n) O(n 5 ) 4 It thus makes sense to ask, given that we cannot find a construction for r=1, whether we can find one for r arbitrarily close to 1. In what follows we give a such a construction and study its length. Construction The basic idea is to construct a network that works for any two points within a certain angle of each other (defined below), then superimpose a finite number of rotated copies of this network, so that each pair of points is captured by at least one copy of the original construction. To this end we will construct a network that, for any good pair of points, contains a path which only navigates around a certain (fixed) wide angle. Making this angle wide enough, we ensure that the ratio of shortest path to Euclidean distance is sufficiently small. Any fixed r > 0 determines such a wide angle θ r, which we call the major angle of our network. Intuitively, we would like θ r to be just wide enough so that paths which navigate only around this angle have path ratios less than or equal to r. How wide does θ r have to be? The worst path ratio for a path navigating around a single angle is achieved when the starting and ending points of the path are at equal distance from the vertex of the angle (see figure 1). Letting a be the distance between each point and the 1
2 vertex, b be the distance between points, and noting that the path ratio p r = a b, we have or simply = a b sin( θ b r ) = a = 1 p r θ r = sin 1 ( 1 p r ) Figure 1. We let ψ r = π θr be the minor angle of our construction, and build a lattice as follows. Moving along one of the vertical edges of our area-n square, we mark off points at distance y (as yet undefined) from one another. From each of these points we draw two lines, forming ψ r and ψ r degree angles with the horizontal, respectively. Note that the horizontal lines (dashed in figure below) are not themselves part of the lattice.
3 Figure. Lattice roads. The lines of our lattice intersect to form diamond-shaped cells, where the obtuse angle is θ r (this was the point of constructing the lattice in this way). Each of our n points (or cities) inhabits exactly one of these cells and we now draw two access roads parallel to the edges of the cell in the way pictured below. The distance y is constrained by two requirements: First, we would like the construction to form a network that is for the lines of the construction to intersect. If we let y be too large the lines will not intersect for small enough n (this problem applies only to small n, and is dealt with quite easily). Second (and this is the more important point) we require that y be constant. The reason, in short, is that when y grows with, say, n the total length of access road grows with n 3/ and the normalized network length is no longer constant (more on this below, where we analyze total network length). For any points in the square, x 1 and x, draw a line between them and let φ x,y be the angle at which this line intersects the horizontal. We would like to show that the network we have constructed provides a sufficiently 3
4 short path for all points x 1 and x, such that 0 φ x,y ψ r. Consider in particular: Provisional Claim 1: For any points x 1 and x, such that 0 φ x,y ψ r, the ratio of shortest path distance to Euclidean distance along lines of the network is no greater than r. Let the region between two upward-pointing parallel lines be called a bar (highlighted in pink in figure ). Looking at figure 3, it turns out the claim is true in the following two cases: (i) the two points belong to the same cell (as d and e) (ii) the two points are in different bars (as b and c) But is not true in the case, (iii) the two points belong to the same bar, but are separated by some number k > 1 of cells (as a and b) Figure 3. Points in the network. The worst scenario in case (iii) is when the points are separated by one empty cell, and are each placed arbitrarily close to the midpoint of opposite edges (again, as a and b). To correct this, we need to add interior roads through the center of each cell and parallel to the NE-SW pair of edges (see figure 3). When we do this the worst situation in our new network is when the two points are a quarter of the way along opposite edges. Here the path 4
5 ratio is z 4 +z+ z 4 z = 3, where z is the length of the edge of a single cell. Consider next the network formed by adding two lines within each cell parallel to the NE-SW edges and equally spaced apart. Here the worst situation is where the two points are 1 6 of the way along opposite edges of the cell and the new path ratio is z 6 +z+ z 6 z = 4 3 The idea is that if we do this some finite number of times, we will eventually produce a short enough path between all such points. Indeed, if we partition each cell with n equally spaced lines our new z n+1 +z+ z n+1 z = n+ n+1 worst situation path ratio is path ratio is smaller than r we pick n large enough so that n+ n+1 n r r 1. In order to ensure that our r or simply Figure 4. Partitioning each cell 0, 1, and 3 times. Claim 1: In the network obtained by adding n = r r 1 interior roads to each cell, the path ratio for all points x 1, x such that 0 φ x,y θ r is at most r. Proof. We divide the proof into cases (i) and (ii) listed above (case (iii) is proved in the discussion of interior roads). In case (i) the two points, x 1, x belong to the same cell. The lattice roads of such points intersect in one of two ways, exhibited in Figure 3 by the pairs {e, f}and{e, f }. The path along access roads from e to f is short while the path from e to f is long. We need to show that all pairs of points x 1, x with 0 φ x,y θ r have access roads that intersect like those of e and f. (WLOG) Let x 1 be the leftmost point. Consider the NE access road through x 1 and the NW access road through x. Clearly these roads intersect (at point x 3, say). Moreover, x must lie below the NE access road for x 1, since 0 φ x,y θ r. Take the path from x 1 to x 3 to x. This path navigates around a single θ r -degree angle. So the path ratio is at most r. In case (ii) the two points x 1, x belong to different bars. Again, let x 1 be 5
6 the leftmost point. Draw a straight line between x 1 and x and label points (starting from x 1 and traveling to x ) where this line intersects successive bars as y 1, y,..., y n. We show there is a short path between y i and y i+1 for any i. Concatenating paths, we get a short path from x 1 to x. Fix i, and note that y i and y i+1 are points on the boundary of the same bar, but that y i lies on the upper boundary (call this line b 1 ) and that y i+1 lies on the lower boundary (call this line b ). (We know that the first is on the upper, the second on the lower and not vice versa, precisely because 0 φ x,y θ r.) In general y i+1 is between two cuts, and each of these cuts clearly intersects both b 1 and b. Thus we can travel from y i along the line b 1 to the point where it meets the first (leftmost) cut, then follow the cut down to where it intersects line x 1 x. This is the first segment of our path. The second continues along the cut until it intersects with b and then travels along b to the point y i+1. Both segments negotiate a single ψ r -degree angle, so the concatenated path from y 1 to y i+1 has path ratio no worse than r. (We are implicitly appealing to the lemma stated at the beginning of the previous section, that when we concatenate paths between colinear points, the total path ratio is no worse than the path ratio for the subsidiary paths. Here the y i s are all colinear, since they lie on the line from x 1 to x.) Figure 5. Path segment from y i to y i+1. We have constructed (by concatenating all segments y i to y i+1 for 1 i n 1) a path from y 1 to y n. We need to now show that there is a short path connecting x 1 to y 1 and another short path connecting x to y i+1. But this is easy, because we have an access road starting from x 1 that intersects b 1. Traveling down the access road and then in the direction of x on b 1 (i.e. rightward), we negotiate a single θ r -degree angle, so the path ratio of this segment is no worse than r. The same applies to the segment from x to y i+1, completing the proof. (Note that in the path we ve constructed we always travel down and rightward, or alternatively, up and leftward. This ensures that we are using only the major angle of the network and not 6
7 the minor one, which would give a poor path ratio.) To complete the construction, we need to ensure that pairs of points x 1, x for which 0 φ x,y ψ r does not hold are captured by a copy of our original construction. Since ψ r is constant, we can simply rotate the lattice (not including access roads) some finite number of times, m = π ψr, through the angle ψ r and for each of these lattice copies draw the corresponding access roads. The kth copy captures all pairs of points (x,y) such that (k 1)ψ r φ x,y kψ r. Moreover, since we have m copies of the original construction, the total network length is simply m times the original network length, which is clearly still linear in n. 3 Network Length We show that the normalized length of the network we ve constructed, when optimizing over y, is: π ψ r tan(ψ r )( r r 1 + ) sin(ψ r ) In analyzing the total network length it is useful to think separately about the lattice, access roads and the number of rotations of the entire construction. Letting x be the length of a full line in our lattice (one that extends from one edge of the square to the opposite edge), we have cos(ψ r ) = n x and therefore, x = n. The number of lines in our construction is cos(ψ r) n y. Multiplying the two gives total lattice length (not exact) (p r + ) prior to taking copies of the construction (not exact), (p r + ) n y cos(ψ r ) We saw above that p r = r r 1, which gives ( r r 1 + ) n y cos(ψ r ) (1) Letting z be the length of one edge of a single cell we have, sin(ψ r ) = y z y or simply, z = sin(ψ r). The length of access road per point is z which gives total access road length: yn () sin(ψ r ) 7
8 (We now see why we required that y be constant. If y grows with n or even n the total access road length is not linear in n.) Thus the total length of a single copy of the network is (not exact) Optimizing for y we set: which gives ( r r 1 + ) n + yn y cos(ψ r ) sin(ψ r ) ( r r 1 + ) n + yn y cos(ψ r ) sin(ψ r ) = 0 y = tan(ψ r )( r r 1 + ) Therefore total optimized network length for a single copy is ( r r 1 + ) n tan(ψ r )( r r 1 + ) n + tan(ψ r )( r r 1 + ) cos(ψ sin(ψ r) r ) and normalized network length for a single copy is which is just ( r r 1 + ) + tan(ψ r )( r r 1 + ) cos(ψ r) tan(ψ r )( r r 1 + ) sin(ψ r ) tan(ψ r )( r r 1 + ) sin(ψ r ) since the two terms in the previous formula are equal. Finally, to cover all pairs of points we need m = π ψ r copies of the original network. Thus the final (normalized) network length is: π ψ r tan(ψ r )( r r 1 + ) (4) sin(ψ r ) (3) Noting that, ψ r = π sin 1 ( 1 r ) 8
9 we plot the normalized network length against r: 9
10 Figure 6. Graph of normalized network length for 1.1 r 3 (top) and 1 < r 3 (bottom). In particular, for values r = 1.5, we get roughly and 1.89 respectively. 10
2 Geometry Solutions
2 Geometry Solutions jacques@ucsd.edu Here is give problems and solutions in increasing order of difficulty. 2.1 Easier problems Problem 1. What is the minimum number of hyperplanar slices to make a d-dimensional
More informationAn angle that has a measure less than a right angle.
Unit 1 Study Strategies: Two-Dimensional Figures Lesson Vocab Word Definition Example Formed by two rays or line segments that have the same 1 Angle endpoint. The shared endpoint is called the vertex.
More informationBoardworks Ltd KS3 Mathematics. S1 Lines and Angles
1 KS3 Mathematics S1 Lines and Angles 2 Contents S1 Lines and angles S1.1 Labelling lines and angles S1.2 Parallel and perpendicular lines S1.3 Calculating angles S1.4 Angles in polygons 3 Lines In Mathematics,
More informationSection 10.1 Polar Coordinates
Section 10.1 Polar Coordinates Up until now, we have always graphed using the rectangular coordinate system (also called the Cartesian coordinate system). In this section we will learn about another system,
More informationPoints, lines, angles
Points, lines, angles Point Line Line segment Parallel Lines Perpendicular lines Vertex Angle Full Turn An exact location. A point does not have any parts. A straight length that extends infinitely in
More informationTechnische Universität München Zentrum Mathematik
Technische Universität München Zentrum Mathematik Prof. Dr. Dr. Jürgen Richter-Gebert, Bernhard Werner Projective Geometry SS 208 https://www-m0.ma.tum.de/bin/view/lehre/ss8/pgss8/webhome Solutions for
More informationHW Graph Theory Name (andrewid) - X. 1: Draw K 7 on a torus with no edge crossings.
1: Draw K 7 on a torus with no edge crossings. A quick calculation reveals that an embedding of K 7 on the torus is a -cell embedding. At that point, it is hard to go wrong if you start drawing C 3 faces,
More informationGeometry R. Unit 12 Coordinate Geometry. Day Classwork Day Homework Wednesday 3/7 Thursday 3/8 Friday 3/9
Geometry R Unit 12 Coordinate Geometry Day Classwork Day Homework Wednesday 3/7 Thursday 3/8 Friday 3/9 Unit 11 Test Review Equations of Lines 1 HW 12.1 Perimeter and Area of Triangles in the Coordinate
More informationTechnische Universität München Zentrum Mathematik
Question 1. Incidence matrix with gaps Technische Universität München Zentrum Mathematik Prof. Dr. Dr. Jürgen Richter-Gebert, Bernhard Werner Projective Geometry SS 2016 www-m10.ma.tum.de/projektivegeometriess16
More informationMathematics Curriculum
6 G R A D E Mathematics Curriculum GRADE 6 5 Table of Contents 1... 1 Topic A: Area of Triangles, Quadrilaterals, and Polygons (6.G.A.1)... 11 Lesson 1: The Area of Parallelograms Through Rectangle Facts...
More informationUnit 1, Lesson 1: Moving in the Plane
Unit 1, Lesson 1: Moving in the Plane Let s describe ways figures can move in the plane. 1.1: Which One Doesn t Belong: Diagrams Which one doesn t belong? 1.2: Triangle Square Dance m.openup.org/1/8-1-1-2
More informationIdentify parallel lines, skew lines and perpendicular lines.
Learning Objectives Identify parallel lines, skew lines and perpendicular lines. Parallel Lines and Planes Parallel lines are coplanar (they lie in the same plane) and never intersect. Below is an example
More informationGeometry - Chapter 1 - Corrective #1
Class: Date: Geometry - Chapter 1 - Corrective #1 Short Answer 1. Sketch a figure that shows two coplanar lines that do not intersect, but one of the lines is the intersection of two planes. 2. Name two
More informationAngle, symmetry and transformation
Terms Illustrations Definition Acute angle An angle greater than 0 and less than 90. Alternate angles Where two straight lines are cut by a third, as in the diagrams, the angles d and f (also c and e)
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 informationMesh Quality Tutorial
Mesh Quality Tutorial Figure 1: The MeshQuality model. See Figure 2 for close-up of bottom-right area This tutorial will illustrate the importance of Mesh Quality in PHASE 2. This tutorial will also show
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 informationMTH 362 Study Guide Exam 1 System of Euclidean Geometry 1. Describe the building blocks of Euclidean geometry. a. Point, line, and plane - undefined
MTH 362 Study Guide Exam 1 System of Euclidean Geometry 1. Describe the building blocks of Euclidean geometry. a. Point, line, and plane - undefined terms used to create definitions. Definitions are used
More information6.2 Classification of Closed Surfaces
Table 6.1: A polygon diagram 6.1.2 Second Proof: Compactifying Teichmuller Space 6.2 Classification of Closed Surfaces We saw that each surface has a triangulation. Compact surfaces have finite triangulations.
More informationDefinition 1 (Hand-shake model). A hand shake model is an incidence geometry for which every line has exactly two points.
Math 3181 Dr. Franz Rothe Name: All3181\3181_spr13t1.tex 1 Solution of Test I Definition 1 (Hand-shake model). A hand shake model is an incidence geometry for which every line has exactly two points. Definition
More informationACT Math test Plane Geometry Review
Plane geometry problems account for 14 questions on the ACT Math Test that s almost a quarter of the questions on the Subject Test. If you ve taken high school geometry, you ve probably covered all of
More informationBasics of Computational Geometry
Basics of Computational Geometry Nadeem Mohsin October 12, 2013 1 Contents This handout covers the basic concepts of computational geometry. Rather than exhaustively covering all the algorithms, it deals
More informationTo graph the point (r, θ), simply go out r units along the initial ray, then rotate through the angle θ. The point (1, 5π 6. ) is graphed below:
Polar Coordinates Any point in the plane can be described by the Cartesian coordinates (x, y), where x and y are measured along the corresponding axes. However, this is not the only way to represent points
More informationACT SparkNotes Test Prep: Plane Geometry
ACT SparkNotes Test Prep: Plane Geometry Plane Geometry Plane geometry problems account for 14 questions on the ACT Math Test that s almost a quarter of the questions on the Subject Test If you ve taken
More informationTilings of the Euclidean plane
Tilings of the Euclidean plane Yan Der, Robin, Cécile January 9, 2017 Abstract This document gives a quick overview of a eld of mathematics which lies in the intersection of geometry and algebra : tilings.
More information6 Mathematics Curriculum
New York State Common Core 6 Mathematics Curriculum GRADE GRADE 6 MODULE 5 Table of Contents 1 Area, Surface Area, and Volume Problems... 3 Topic A: Area of Triangles, Quadrilaterals, and Polygons (6.G.A.1)...
More informationMathematics in Art and Architecture GEK1518
Mathematics in Art and Architecture GEK1518 Helmer Aslaksen Department of Mathematics National University of Singapore aslaksen@math.nus.edu.sg www.math.nus.edu.sg/aslaksen/ Symmetry and Patterns Introduction
More informationTo graph the point (r, θ), simply go out r units along the initial ray, then rotate through the angle θ. The point (1, 5π 6
Polar Coordinates Any point in the plane can be described by the Cartesian coordinates (x, y), where x and y are measured along the corresponding axes. However, this is not the only way to represent points
More informationThe Straight Line. m is undefined. Use. Show that mab
The Straight Line What is the gradient of a horizontal line? What is the equation of a horizontal line? So the equation of the x-axis is? What is the gradient of a vertical line? What is the equation of
More informationDescribe Plane Shapes
Lesson 12.1 Describe Plane Shapes You can use math words to describe plane shapes. point an exact position or location line endpoints line segment ray a straight path that goes in two directions without
More informationConvex polygon - a polygon such that no line containing a side of the polygon will contain a point in the interior of the polygon.
Chapter 7 Polygons A polygon can be described by two conditions: 1. No two segments with a common endpoint are collinear. 2. Each segment intersects exactly two other segments, but only on the endpoints.
More informationTHE DNA INEQUALITY POWER ROUND
THE DNA INEQUALITY POWER ROUND Instructions Write/draw all solutions neatly, with at most one question per page, clearly numbered. Turn in the solutions in numerical order, with your team name at the upper
More informationModule Four: Connecting Algebra and Geometry Through Coordinates
NAME: Period: Module Four: Connecting Algebra and Geometry Through Coordinates Topic A: Rectangular and Triangular Regions Defined by Inequalities Lesson 1: Searching a Region in the Plane Lesson 2: Finding
More informationAcute Triangulations of Polygons
Europ. J. Combinatorics (2002) 23, 45 55 doi:10.1006/eujc.2001.0531 Available online at http://www.idealibrary.com on Acute Triangulations of Polygons H. MAEHARA We prove that every n-gon can be triangulated
More informationChapter 9 Topics in Analytic Geometry
Chapter 9 Topics in Analytic Geometry What You ll Learn: 9.1 Introduction to Conics: Parabolas 9.2 Ellipses 9.3 Hyperbolas 9.5 Parametric Equations 9.6 Polar Coordinates 9.7 Graphs of Polar Equations 9.1
More information3 Identify shapes as two-dimensional (lying in a plane, flat ) or three-dimensional ( solid ).
Geometry Kindergarten Identify and describe shapes (squares, circles, triangles, rectangles, hexagons, cubes, cones, cylinders, and spheres). 1 Describe objects in the environment using names of shapes,
More informationMath 462: Review questions
Math 462: Review questions Paul Hacking 4/22/10 (1) What is the angle between two interior diagonals of a cube joining opposite vertices? [Hint: It is probably quickest to use a description of the cube
More informationSubstituting a 2 b 2 for c 2 and using a little algebra, we can then derive the standard equation for an ellipse centred at the origin,
Conics onic sections are the curves which result from the intersection of a plane with a cone. These curves were studied and revered by the ancient Greeks, and were written about extensively by both Euclid
More informationLecture 5: More Examples/Applications of Quasirandom Graphs
Random and Quasirandom Graphs Instructor: Padraic Bartlett Lecture 5: More Examples/Applications of Quasirandom Graphs Week 4 Mathcamp 2012 In our last class, we saw that the Paley graphs were an example
More informationMA 154 Lesson 1 Delworth
DEFINITIONS: An angle is defined as the set of points determined by two rays, or half-lines, l 1 and l having the same end point O. An angle can also be considered as two finite line segments with a common
More informationNumber/Computation. addend Any number being added. digit Any one of the ten symbols: 0, 1, 2, 3, 4, 5, 6, 7, 8, or 9
14 Number/Computation addend Any number being added algorithm A step-by-step method for computing array A picture that shows a number of items arranged in rows and columns to form a rectangle associative
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 informationTHE FOURTH DIMENSION (AND MORE!)
THE FOURTH DIMENSION (AND MORE!) The text leads us from zero dimensions (a point), to one dimension (a line), to two dimensions (a plane), to three dimensions (our familiar space), and then to four dimensions
More information2017 SOLUTIONS (PRELIMINARY VERSION)
SIMON MARAIS MATHEMATICS COMPETITION 07 SOLUTIONS (PRELIMINARY VERSION) This document will be updated to include alternative solutions provided by contestants, after the competition has been mared. Problem
More informationMath 221 Final Exam Review
Math 221 Final Exam Review Preliminary comment: Some of these problems a formulated using language and structures from graph theory. However they are generally self contained; no theorems from graph theory
More information7th Bay Area Mathematical Olympiad
7th Bay Area Mathematical Olympiad February 22, 2005 Problems and Solutions 1 An integer is called formidable if it can be written as a sum of distinct powers of 4, and successful if it can be written
More informationBackground for Surface Integration
Background for urface Integration 1 urface Integrals We have seen in previous work how to define and compute line integrals in R 2. You should remember the basic surface integrals that we will need to
More informationReteach. Chapter 14. Grade 4
Reteach Chapter 14 Grade 4 Lesson 1 Reteach Draw Points, Lines, and Rays A point is an exact location that is represented by a dot. Example: point R R A line goes on forever in both directions. Example:
More informationClassification of Extremal Curves with 6 Double Points and of Tree-like Curves with 6 Double Points and I! 5
Classification of Extremal Curves with 6 Double Points and of Tree-like Curves with 6 Double Points and I! 5 Tim Ritter Bethel College Mishawaka, IN timritter@juno.com Advisor: Juha Pohjanpelto Oregon
More informationNaming Angles. One complete rotation measures 360º. Half a rotation would then measure 180º. A quarter rotation would measure 90º.
Naming Angles What s the secret for doing well in geometry? Knowing all the angles. An angle can be seen as a rotation of a line about a fixed point. In other words, if I were mark a point on a paper,
More informationAPPROXIMATING THE MAXMIN AND MINMAX AREA TRIANGULATIONS USING ANGULAR CONSTRAINTS. J. Mark Keil, Tzvetalin S. Vassilev
Serdica J. Computing 4 00, 3 334 APPROXIMATING THE MAXMIN AND MINMAX AREA TRIANGULATIONS USING ANGULAR CONSTRAINTS J. Mark Keil, Tzvetalin S. Vassilev Abstract. We consider sets of points in the two-dimensional
More informationSection 4.1: Introduction to Trigonometry
Section 4.1: Introduction to Trigonometry Review of Triangles Recall that the sum of all angles in any triangle is 180. Let s look at what this means for a right triangle: A right angle is an angle which
More informationMatching and Planarity
Matching and Planarity Po-Shen Loh June 010 1 Warm-up 1. (Bondy 1.5.9.) There are n points in the plane such that every pair of points has distance 1. Show that there are at most n (unordered) pairs of
More informationPantographs and cyclicity
35 antographs and cyclicity John Boris Miller Abstract Every parallelogram Λ generates a doubly-infinite family of quadrilaterals called its pantograph. The types of quadrilaterals so arising can be characterised
More informationRight Angle Triangle. Square. Opposite sides are parallel
Triangles 3 sides ngles add up to 18⁰ Right ngle Triangle Equilateral Triangle ll sides are the same length ll angles are 6⁰ Scalene Triangle ll sides are different lengths ll angles are different Isosceles
More informationReview of Trigonometry
Worksheet 8 Properties of Trigonometric Functions Section Review of Trigonometry This section reviews some of the material covered in Worksheets 8, and The reader should be familiar with the trig ratios,
More informationEULER S FORMULA AND THE FIVE COLOR THEOREM
EULER S FORMULA AND THE FIVE COLOR THEOREM MIN JAE SONG Abstract. In this paper, we will define the necessary concepts to formulate map coloring problems. Then, we will prove Euler s formula and apply
More informationform are graphed in Cartesian coordinates, and are graphed in Cartesian coordinates.
Plot 3D Introduction Plot 3D graphs objects in three dimensions. It has five basic modes: 1. Cartesian mode, where surfaces defined by equations of the form are graphed in Cartesian coordinates, 2. cylindrical
More informationMATH 113 Section 8.2: Two-Dimensional Figures
MATH 113 Section 8.2: Two-Dimensional Figures Prof. Jonathan Duncan Walla Walla University Winter Quarter, 2008 Outline 1 Classifying Two-Dimensional Shapes 2 Polygons Triangles Quadrilaterals 3 Other
More informationGeometry. Zachary Friggstad. Programming Club Meeting
Geometry Zachary Friggstad Programming Club Meeting Points #i n c l u d e typedef complex p o i n t ; p o i n t p ( 1. 0, 5. 7 ) ; p. r e a l ( ) ; // x component p. imag ( ) ; // y component
More informationGeometry Unit 5 Geometric and Algebraic Connections. Table of Contents
Geometry Unit 5 Geometric and Algebraic Connections Table of Contents Lesson 5 1 Lesson 5 2 Distance.p. 2-3 Midpoint p. 3-4 Partitioning a Directed Line. p. 5-6 Slope. p.7-8 Lesson 5 3 Revisit: Graphing
More information2D rendering takes a photo of the 2D scene with a virtual camera that selects an axis aligned rectangle from the scene. The photograph is placed into
2D rendering takes a photo of the 2D scene with a virtual camera that selects an axis aligned rectangle from the scene. The photograph is placed into the viewport of the current application window. A pixel
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 informationMath 6, Unit 8 Notes: Geometric Relationships
Math 6, Unit 8 Notes: Geometric Relationships Points, Lines and Planes; Line Segments and Rays As we begin any new topic, we have to familiarize ourselves with the language and notation to be successful.
More informationGEO 154 CARTOGRAPHY II- PLOTTING USING AUTOCAD- ASSIGMENT HELP
GEO 154 CARTOGRAPHY II- PLOTTING USING AUTOCAD- ASSIGMENT HELP DOCUMENT. For one to two reasons data may not be in a format that can be integrated into AutoCAD software, but coordinates may be separated
More informationGSAC TALK: THE WORD PROBLEM. 1. The 8-8 Tessellation. Consider the following infinite tessellation of the open unit disc. Actually, we want to think
GSAC TALK: THE WORD PROBLEM 1. The 8-8 Tessellation Consider the following infinite tessellation of the open unit disc. Actually, we want to think of the disc as a model for R 2 and we can do that using
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 informationLesson 1. Unit 2 Practice Problems. Problem 2. Problem 1. Solution 1, 4, 5. Solution. Problem 3
Unit 2 Practice Problems Lesson 1 Problem 1 Rectangle measures 12 cm by 3 cm. Rectangle is a scaled copy of Rectangle. Select all of the measurement pairs that could be the dimensions of Rectangle. 1.
More information(Refer Slide Time: 00:02:00)
Computer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 18 Polyfill - Scan Conversion of a Polygon Today we will discuss the concepts
More informationTILING RECTANGLES SIMON RUBINSTEIN-SALZEDO
TILING RECTANGLES SIMON RUBINSTEIN-SALZEDO. A classic tiling problem Question.. Suppose we tile a (large) rectangle with small rectangles, so that each small rectangle has at least one pair of sides with
More informationThe Cut Locus and the Jordan Curve Theorem
The Cut Locus and the Jordan Curve Theorem Rich Schwartz November 19, 2015 1 Introduction A Jordan curve is a subset of R 2 which is homeomorphic to the circle, S 1. The famous Jordan Curve Theorem says
More informationLet s use a more formal definition. An angle is the union of two rays with a common end point.
hapter 2 ngles What s the secret for doing well in geometry? Knowing all the angles. s we did in the last chapter, we will introduce new terms and new notations, the building blocks for our success. gain,
More information1. Be sure to complete the exploration before working on the rest of this worksheet.
PreCalculus Worksheet 4.1 1. Be sure to complete the exploration before working on the rest of this worksheet.. The following angles are given to you in radian measure. Without converting to degrees, draw
More informationThe Game of Criss-Cross
Chapter 5 The Game of Criss-Cross Euler Characteristic ( ) Overview. The regions on a map and the faces of a cube both illustrate a very natural sort of situation: they are each examples of regions that
More informationSimplicial Complexes: Second Lecture
Simplicial Complexes: Second Lecture 4 Nov, 2010 1 Overview Today we have two main goals: Prove that every continuous map between triangulable spaces can be approximated by a simplicial map. To do this,
More informationNOTES: TRANSFORMATIONS
TABLE OF CONTENT Plotting Points On A Coordinate Plane. Transformations. Translation. Reflections. Rotations Dilations. Congruence And Similarity.. Multiple Transformations In A Coordinate Plane. Parallel
More informationLines, Rays, and Angles
Lesson 10.1 Lines, Rays, and Angles Name What it looks like Think point D D A point names a location in space. line AB; _ AB line BA; _ BA A B A line extends without end in opposite directions. line segment
More informationGeometry. (1) Complete the following:
(1) omplete the following: 1) The area of the triangle whose base length 10cm and height 6cm equals cm 2. 2) Two triangles which have the same base and their vertices opposite to this base on a straight
More informationCrystal Structure. A(r) = A(r + T), (1)
Crystal Structure In general, by solid we mean an equilibrium state with broken translational symmetry. That is a state for which there exist observables say, densities of particles with spatially dependent
More informationAlgorithms for Euclidean TSP
This week, paper [2] by Arora. See the slides for figures. See also http://www.cs.princeton.edu/~arora/pubs/arorageo.ps Algorithms for Introduction This lecture is about the polynomial time approximation
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 informationMath 2 Coordinate Geometry Part 3 Inequalities & Quadratics
Math 2 Coordinate Geometry Part 3 Inequalities & Quadratics 1 DISTANCE BETWEEN TWO POINTS - REVIEW To find the distance between two points, use the Pythagorean theorem. The difference between x 1 and x
More informationPantographic polygons
203 Pantographic polygons John Miller and Emanuel Strzelecki Abstract Necessary and sufficient conditions are given for a polygon to be pantographic. The property is held by all regular polygons and by
More information12 - THREE DIMENSIONAL GEOMETRY Page 1 ( Answers at the end of all questions ) = 2. ( d ) - 3. ^i - 2. ^j c 3. ( d )
- THREE DIMENSIONAL GEOMETRY Page ( ) If the angle θ between the line x - y + x + y - z - and the plane λ x + 4 0 is such that sin θ, then the value of λ is - 4-4 [ AIEEE 00 ] ( ) If the plane ax - ay
More informationTopology Homework 3. Section Section 3.3. Samuel Otten
Topology Homework 3 Section 3.1 - Section 3.3 Samuel Otten 3.1 (1) Proposition. The intersection of finitely many open sets is open and the union of finitely many closed sets is closed. Proof. Note that
More informationSECTION 4.5: GRAPHS OF SINE AND COSINE FUNCTIONS
SECTION 4.5: GRAPHS OF SINE AND COSINE FUNCTIONS 4.33 PART A : GRAPH f ( θ ) = sinθ Note: We will use θ and f ( θ) for now, because we would like to reserve x and y for discussions regarding the Unit Circle.
More informationOXFORD MASTERCLASSES IN GEOMETRY Part 2: Lectures on Penrose Tilings, Prof. Alexander F. Ritter.
OXFORD MASTERCLASSES IN GEOMETRY 2014. Part 2: Lectures on Penrose Tilings, Prof. Alexander F. Ritter. Comments and corrections are welcome: ritter@maths.ox.ac.uk Date: This version of the notes was created
More informationGrids Geometry Computational Geometry
Grids Geometry Computational Geometry Grids You will encounter many problems whose solutions need grid representation map VLSI layout the most natural way to carve space into regions regular pattern rectangular
More informationMath 231E, Lecture 34. Polar Coordinates and Polar Parametric Equations
Math 231E, Lecture 34. Polar Coordinates and Polar Parametric Equations 1 Definition of polar coordinates Let us first recall the definition of Cartesian coordinates: to each point in the plane we can
More information8.B. The result of Regiomontanus on tetrahedra
8.B. The result of Regiomontanus on tetrahedra We have already mentioned that Plato s theory that the five regular polyhedra represent the fundamental elements of nature, and in supplement (3.D) to the
More informationMaintaining Mathematical Proficiency
Name Date Chapter 1 Maintaining Mathematical Proficiency Simplify the expression. 1. 3 + ( 1) = 2. 10 11 = 3. 6 + 8 = 4. 9 ( 1) = 5. 12 ( 8) = 6. 15 7 = + = 8. 5 ( 15) 7. 12 3 + = 9. 1 12 = Find the area
More informationProblem Set 6 Solutions
Introduction to Algorithms October 29, 2001 Massachusetts Institute of Technology 6.046J/18.410J Singapore-MIT Alliance SMA5503 Professors Erik Demaine, Lee Wee Sun, and Charles E. Leiserson Handout 24
More informationMAT 145: PROBLEM SET 6
MAT 145: PROBLEM SET 6 DUE TO FRIDAY MAR 8 Abstract. This problem set corresponds to the eighth week of the Combinatorics Course in the Winter Quarter 2019. It was posted online on Friday Mar 1 and is
More information9 Bounds for the Knapsack Problem (March 6)
9 Bounds for the Knapsack Problem (March 6) In this lecture, I ll develop both upper and lower bounds in the linear decision tree model for the following version of the (NP-complete) Knapsack 1 problem:
More informationLesson 1. Rigid Transformations and Congruence. Problem 1. Problem 2. Problem 3. Solution. Solution
Rigid Transformations and Congruence Lesson 1 The six frames show a shape's di erent positions. Describe how the shape moves to get from its position in each frame to the next. To get from Position 1 to
More informationGeometric structures on manifolds
CHAPTER 3 Geometric structures on manifolds In this chapter, we give our first examples of hyperbolic manifolds, combining ideas from the previous two chapters. 3.1. Geometric structures 3.1.1. Introductory
More informationBirkdale High School - Higher Scheme of Work
Birkdale High School - Higher Scheme of Work Module 1 - Integers and Decimals Understand and order integers (assumed) Use brackets and hierarchy of operations (BODMAS) Add, subtract, multiply and divide
More informationMidpoint and Distance Formulas
CP1 Math Unit 5: Coordinate Geometry: Day Name Midpoint Formula: Midpoint and Distance Formulas The midpoint of the line segment between any two points (x!, y! ) to (x!, y! ) is given by: In your groups,
More information2 and 6 4 and 8 1 and 5 3 and 7
Geo Ch 3 Angles formed by Lines Parallel lines are two coplanar lines that do not intersect. Skew lines are that are not coplanar and do not intersect. Transversal is a line that two or more lines at different
More informationOn the Number of Tilings of a Square by Rectangles
University of Tennessee, Knoxville Trace: Tennessee Research and Creative Exchange University of Tennessee Honors Thesis Projects University of Tennessee Honors Program 5-2012 On the Number of Tilings
More information