1.2 Convex polygons (continued)
|
|
- Adela Neal
- 7 years ago
- Views:
Transcription
1 Geometric methods in shape and pattern recognition Lecture: 3 Date: Lecturer: Prof. dr. H. Alt Location: UU Utrecht Recorder: Mark Bouts Convex polygons (continued) Additional remark A convex polygon can be defined as being a simple, closed polygonal chain, which interior is convex. Confusion may rise whether the convex polygon are just the points at the boundary or that the points in the interior also are included. In the definition stated last week it has been defined that next to the boundary, the interior points are being included in the convex polygon. This leads to two important characterisations of the convex polygon. The convex polygon is always a convex hull of a finite set of points; an intersection of finitely many half planes. Where half-planes are planes that separate planes in two halves in which every point of the former whole plane lies on one side of a straight line. In figure 1.1 an example of a Figure 1.1 P convex hull is given with P in the convex hull. In figure 1. it is shown that the intersection of three different half planes can result in the creation of a convex polygon. Therefore Q lies at the intersection of the half-planes and is thus a convex polygon. Half plane II Q Half plane I Figure 1.a Convex polygon Half plane III Now that we know that a convex polygon can be defined by the intersection of finitely many half planes, is it also true to claim that infinitely many half planes form a convex polygon? This does however not hold! Consider an example in which two parallel lines are being used, no convex polygon can be created from that. (Except when it is supposed that the parallel straight lines touch in infinity). (Fig 1.3b) From this an empty set of just 1 line segments need not to be included for they don t add any value to the this subject. Q Half plane II Half plane III Half plane I Figure 1.b Non convex polygon
2 1.3 Planar graphs and voronoi diagrams Planar graphs In this paragraph insight is gained on planar graphs, with examples and definitions the concept of planar graphs is explained. Definition: A graph is planar exactly if it can be embedded ( drawn ) in the plane so that no two edges intersect. Formally embedding map: V points in the plane E curves, so that the end points are at the respective vertices Figure 1.3 Planar graph Examples of graphs, with n vertices. Kn is a complete graph in which all vertices and all pairs form an edge. K 1 K 3 K K 4 Figure 1.4 Planar graph More nice How about K 5? Is there a planar graph possible in K 5? No! As an example figure 1.5 Missing, so not planar Figure 1.5 non planar graph
3 A cube is a classical example of a polyhedron, a three-dimensional shape that is made up of a finite number of polygonal faces which are parts of planes, the faces meet in edges which are straight-line segments, and the edges meet in points called vertices. These structures are always planar! The different polyhedra can be best viewed in 3D. Figure 1.6 shows some 3D version of different polyhedra. Figure 1.6 Polyhedra Non planar A graph is normally not planar when it contains substructures of a K 3,3 or a K 5 graph. As an example figure 1.7 is given. Where it is also shown what k n:m graphs mean. Not possible n m K 3,3 Not planar K n,m Not planar Figure 1.7 K 3,3 The Polish mathematician Kazimierz Kuratowski (1930) provided a characterization of planar graphs, now known as Kuratowski's theorem: Theorem: A finite graph is planar if and only if it does not contain a subdivision that is an expansion of K 5 (the complete graph on five vertices) or K 3,3 (complete bipartite graph on six vertices, three of which connect to each of the other three).
4 The questions that one can ask from this, is whether a planar graph can be presented by straight line segments. From the next theorem presented by Fáy in 1948, it can be concluded that this is possible. Theorem: Any planar graph has a straight line embedding. I.e. edges are represented by line segments. Facets Definition The embedding of a planar graph into connected regions are called facets. As an example the next two figures can be given: Graph G 4 vertices 6 edges 4 facets Dual Graph G* 4 vertices 6 edges 4 facets Figure 1.8 Facets / Dual Graph Dual graph Definition Let G = (V,E) be a planar graph, embedded the dual graph G* has the facets of G as vertices, the edges of G as edges connecting the two vertices in G*, which are the facets of G separated by the edge. To make this definition a bit more clear figure 1.8 and figure 1.9 give an example of the graph G and the dual graph G*. The dual graph G* is constructed as follows: we choose one vertex in each face of G (including the outer face) and for each edge e in G we introduce a new edge in G* connecting the two vertices in G* corresponding to the two faces in G that meet at e. Furthermore, this edge is drawn so that it crosses e exactly once and that no other edge of G or G* is intersected. Then G* is again the embedding of a planar graph.
5 Graph G 8 vertices 1 edges 6 facets Figure 1.9 Facets / Dual Graph Dual graph G * 6 vertices 1 edges 8 facets The figures 1.8 and 1.9 clearly show the interrelationship between the dual graph and the graph itself (shown by the arrows). The numbers in the figures show the facets that can be discerned either the graph or its corresponding dual graph. From these some remarks need to be made in order to stress the interrelationship between the Dual graph and the normal planar graph. The only graph which has the same K value for both the Graph and its corresponding dual graph is K 4 ; G ** = G. In other words the dual graph of the dual graph is the graph itself ; Since the graph and the dual graph are interrelated it is not difficult to derive that the both the graph as the corresponding dual graph are both planar. I e. G is planar G * is planar. The second picture in figure 1.9 can be better translated to a 3D model and then we see that this figure is also known as an octahedron. Figure 1.10 Octahedron
6 Now we know what dual graphs are and what their relation is with the original graph, we can start looking at the relation between the number of facets, vertices and edges. In order to define that relationship Euler s formula is given. Euler s formula Euler's formula states that if a finite connected planar graph is drawn in the plane without any edge intersections, and v is the number of vertices, e is the number of edges and f is the number of faces (regions bounded by edges, including the outer infinitely large region), then v e + f =, i.e. the Euler characteristic is. Euler's formula can be proven as follows: if the graph isn't a tree, then remove an edge which completes a cycle. This lowers both e and f by one, leaving v e + f constant. Repeat until you arrive at a tree; trees have v = e + 1 and f = 1, yielding v - e + f =. In other words Euler s formula can be proven by induction. From this it follows that: 1 3 e 3n 6 f n 4 n f 4 From these it can be the derived that the and 3 show the relation between the G and G * and their relation ship as has been shown above. We can ask ourselves now the question how many edges there are for a non planar graph. n 1 From e 3n 6 this can normally be e 3n 6 = n ( n 1) = (n ) For planar graphs this is (n). A simple graph is called maximal planar if it is planar but adding any edge would destroy that property. All faces (even the outer one) are then bounded by three edges 3e, explaining the alternative term triangular for these graphs. If a triangular graph has v vertices with v >, then it has precisely 3v-6 edges and v-4 faces.
7 1.3. Voronoi Diagrams In the this paragraph the concept of voronoi diagrams is explained. Definition s R in which R is a finite set and in which p S Voronoi cell The voronoi cell of p (VC(p)) is the set of all points closer to P than any other point in S, in which closer is the shortest normal Euclidian distance. As an example of voronoi cells, we can think of emergency districts in which the ambulance needs to travel distance to a certain emergency site. By dividing the are in several districts in which the Euclidian distance is shortest from the centre point, it is guaranteed that the ambulance will travel the shortest distance to a certain emergency site. The voronoi is cell is finite when all the points lie inside the convex hull and a voronoi cell is of course infinite set of points when the points are not in the convex hull. The division of the points in a voronoi diagram can be done O(log n), provided that the points are pre-processed. S = {p 1,,p n } in which P i P j for i + j. VC(p i ) = {P p p i < p p j for j+i} is the intersection of half planes or in other terms {{P p p i < p p j } which is always a half plane. In a figure this looks like: j i Bisector Bisector P k P l P i Pj Bisector Figure 1.11 Halfplane bisection The planes are bisected by the half planes which can be called bisectors this context.
8 From this definition we can introduce some new terms to explain something more of voronoi diagrams. So a voronoi cell is a convex polygon or unbounded (you cannot draw a box around it), but its boundary consists of line segments, rays or lines. These are called voronoi edges (1 D) of S and their end points are called voronoi vertices (0 D). p i v e Characterization: Each point on a voronoi edge has: equal distance and is closest to a certain point and point P lies on a voronoi edge exactly if: there are at least nearest sites. Voronoi edges (see the figure) are part of bisectors between sites with n = θ( n ) Figure 1.1 Halfplane bisection n. 3 As can be seen in the next figure 1.1. With 3 = θ( n ) A Voronoi vertex is the center of an empty circle touching 3 or more sites. Both are linear, but are rough estimates. Instead we better can consider voronoi diagrams as a planar graph with one artificial end point at infinity where all unbounded points end. Drawing a voronoi diagram Figure 1.13 Drawing voronoi diagrams For drawing a voronoi diagram the next algorithm can be observed: 1. Draw a point in the plane;. Draw a bisector between any points; 3. Draw a new point and cut any non participating bisectors; 4. If not finished with all points go back to point 1; Figure 1.13 shows the three first steps of this process. This results in a running time of O(n log n).
9 The graph has n facets therefore: 3n 6 edges and n 4 vertices in which the n of the first equation is the n that applies on G* and the n of the second equation applies on the n used in voronoi diagrams
Arrangements And Duality
Arrangements And Duality 3.1 Introduction 3 Point configurations are tbe most basic structure we study in computational geometry. But what about configurations of more complicated shapes? For example,
More informationGeometry Chapter 1. 1.1 Point (pt) 1.1 Coplanar (1.1) 1.1 Space (1.1) 1.2 Line Segment (seg) 1.2 Measure of a Segment
Geometry Chapter 1 Section Term 1.1 Point (pt) Definition A location. It is drawn as a dot, and named with a capital letter. It has no shape or size. undefined term 1.1 Line A line is made up of points
More informationThe Graphical Method: An Example
The Graphical Method: An Example Consider the following linear program: Maximize 4x 1 +3x 2 Subject to: 2x 1 +3x 2 6 (1) 3x 1 +2x 2 3 (2) 2x 2 5 (3) 2x 1 +x 2 4 (4) x 1, x 2 0, where, for ease of reference,
More informationComputational Geometry. Lecture 1: Introduction and Convex Hulls
Lecture 1: Introduction and convex hulls 1 Geometry: points, lines,... Plane (two-dimensional), R 2 Space (three-dimensional), R 3 Space (higher-dimensional), R d A point in the plane, 3-dimensional space,
More informationApproximation of an Open Polygonal Curve with a Minimum Number of Circular Arcs and Biarcs
Approximation of an Open Polygonal Curve with a Minimum Number of Circular Arcs and Biarcs R. L. Scot Drysdale a Günter Rote b,1 Astrid Sturm b,1 a Department of Computer Science, Dartmouth College b Institut
More informationSeminar. Path planning using Voronoi diagrams and B-Splines. Stefano Martina stefano.martina@stud.unifi.it
Seminar Path planning using Voronoi diagrams and B-Splines Stefano Martina stefano.martina@stud.unifi.it 23 may 2016 This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International
More informationGraph Theory Lecture 3: Sum of Degrees Formulas, Planar Graphs, and Euler s Theorem Spring 2014 Morgan Schreffler Office: POT 902
Graph Theory Lecture 3: Sum of Degrees Formulas, Planar Graphs, and Euler s Theorem Spring 2014 Morgan Schreffler Office: POT 902 http://www.ms.uky.edu/~mschreffler Different Graphs, Similar Properties
More informationAngles that are between parallel lines, but on opposite sides of a transversal.
GLOSSARY Appendix A Appendix A: Glossary Acute Angle An angle that measures less than 90. Acute Triangle Alternate Angles A triangle that has three acute angles. Angles that are between parallel lines,
More informationSolving Geometric Problems with the Rotating Calipers *
Solving Geometric Problems with the Rotating Calipers * Godfried Toussaint School of Computer Science McGill University Montreal, Quebec, Canada ABSTRACT Shamos [1] recently showed that the diameter of
More informationFast approximation of the maximum area convex. subset for star-shaped polygons
Fast approximation of the maximum area convex subset for star-shaped polygons D. Coeurjolly 1 and J.-M. Chassery 2 1 Laboratoire LIRIS, CNRS FRE 2672 Université Claude Bernard Lyon 1, 43, Bd du 11 novembre
More informationSum of Degrees of Vertices Theorem
Sum of Degrees of Vertices Theorem Theorem (Sum of Degrees of Vertices Theorem) Suppose a graph has n vertices with degrees d 1, d 2, d 3,...,d n. Add together all degrees to get a new number d 1 + d 2
More informationLargest Fixed-Aspect, Axis-Aligned Rectangle
Largest Fixed-Aspect, Axis-Aligned Rectangle David Eberly Geometric Tools, LLC http://www.geometrictools.com/ Copyright c 1998-2016. All Rights Reserved. Created: February 21, 2004 Last Modified: February
More informationGrade 7 & 8 Math Circles Circles, Circles, Circles March 19/20, 2013
Faculty of Mathematics Waterloo, Ontario N2L 3G Introduction Grade 7 & 8 Math Circles Circles, Circles, Circles March 9/20, 203 The circle is a very important shape. In fact of all shapes, the circle is
More informationTopological Treatment of Platonic, Archimedean, and Related Polyhedra
Forum Geometricorum Volume 15 (015) 43 51. FORUM GEOM ISSN 1534-1178 Topological Treatment of Platonic, Archimedean, and Related Polyhedra Tom M. Apostol and Mamikon A. Mnatsakanian Abstract. Platonic
More informationFinal Review Geometry A Fall Semester
Final Review Geometry Fall Semester Multiple Response Identify one or more choices that best complete the statement or answer the question. 1. Which graph shows a triangle and its reflection image over
More informationAngle - a figure formed by two rays or two line segments with a common endpoint called the vertex of the angle; angles are measured in degrees
Angle - a figure formed by two rays or two line segments with a common endpoint called the vertex of the angle; angles are measured in degrees Apex in a pyramid or cone, the vertex opposite the base; in
More informationDuplicating Segments and Angles
CONDENSED LESSON 3.1 Duplicating Segments and ngles In this lesson, you Learn what it means to create a geometric construction Duplicate a segment by using a straightedge and a compass and by using patty
More informationGEOMETRY. Constructions OBJECTIVE #: G.CO.12
GEOMETRY Constructions OBJECTIVE #: G.CO.12 OBJECTIVE Make formal geometric constructions with a variety of tools and methods (compass and straightedge, string, reflective devices, paper folding, dynamic
More informationIntersection of a Line and a Convex. Hull of Points Cloud
Applied Mathematical Sciences, Vol. 7, 213, no. 13, 5139-5149 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/1.12988/ams.213.37372 Intersection of a Line and a Convex Hull of Points Cloud R. P. Koptelov
More informationActually Doing It! 6. Prove that the regular unit cube (say 1cm=unit) of sufficiently high dimension can fit inside it the whole city of New York.
1: 1. Compute a random 4-dimensional polytope P as the convex hull of 10 random points using rand sphere(4,10). Run VISUAL to see a Schlegel diagram. How many 3-dimensional polytopes do you see? How many
More information. P. 4.3 Basic feasible solutions and vertices of polyhedra. x 1. x 2
4. Basic feasible solutions and vertices of polyhedra Due to the fundamental theorem of Linear Programming, to solve any LP it suffices to consider the vertices (finitely many) of the polyhedron P of the
More informationCS311H. Prof: Peter Stone. Department of Computer Science The University of Texas at Austin
CS311H Prof: Department of Computer Science The University of Texas at Austin Good Morning, Colleagues Good Morning, Colleagues Are there any questions? Logistics Class survey Logistics Class survey Homework
More informationChapter 3.1 Angles. Geometry. Objectives: Define what an angle is. Define the parts of an angle.
Chapter 3.1 Angles Define what an angle is. Define the parts of an angle. Recall our definition for a ray. A ray is a line segment with a definite starting point and extends into infinity in only one direction.
More informationDiscovering Math: Exploring Geometry Teacher s Guide
Teacher s Guide Grade Level: 6 8 Curriculum Focus: Mathematics Lesson Duration: Three class periods Program Description Discovering Math: Exploring Geometry From methods of geometric construction and threedimensional
More informationSelected practice exam solutions (part 5, item 2) (MAT 360)
Selected practice exam solutions (part 5, item ) (MAT 360) Harder 8,91,9,94(smaller should be replaced by greater )95,103,109,140,160,(178,179,180,181 this is really one problem),188,193,194,195 8. On
More informationShortest Path Algorithms
Shortest Path Algorithms Jaehyun Park CS 97SI Stanford University June 29, 2015 Outline Cross Product Convex Hull Problem Sweep Line Algorithm Intersecting Half-planes Notes on Binary/Ternary Search Cross
More informationMA 323 Geometric Modelling Course Notes: Day 02 Model Construction Problem
MA 323 Geometric Modelling Course Notes: Day 02 Model Construction Problem David L. Finn November 30th, 2004 In the next few days, we will introduce some of the basic problems in geometric modelling, and
More informationQuestions. Strategies August/September Number Theory. What is meant by a number being evenly divisible by another number?
Content Skills Essential August/September Number Theory Identify factors List multiples of whole numbers Classify prime and composite numbers Analyze the rules of divisibility What is meant by a number
More informationalternate interior angles
alternate interior angles two non-adjacent angles that lie on the opposite sides of a transversal between two lines that the transversal intersects (a description of the location of the angles); alternate
More information1. A student followed the given steps below to complete a construction. Which type of construction is best represented by the steps given above?
1. A student followed the given steps below to complete a construction. Step 1: Place the compass on one endpoint of the line segment. Step 2: Extend the compass from the chosen endpoint so that the width
More informationChapter 6 Notes: Circles
Chapter 6 Notes: Circles IMPORTANT TERMS AND DEFINITIONS A circle is the set of all points in a plane that are at a fixed distance from a given point known as the center of the circle. Any line segment
More informationShape Dictionary YR to Y6
Shape Dictionary YR to Y6 Guidance Notes The terms in this dictionary are taken from the booklet Mathematical Vocabulary produced by the National Numeracy Strategy. Children need to understand and use
More informationShortest Inspection-Path. Queries in Simple Polygons
Shortest Inspection-Path Queries in Simple Polygons Christian Knauer, Günter Rote B 05-05 April 2005 Shortest Inspection-Path Queries in Simple Polygons Christian Knauer, Günter Rote Institut für Informatik,
More informationOn planar regular graphs degree three without Hamiltonian cycles 1
On planar regular graphs degree three without Hamiltonian cycles 1 E. Grinbergs Computing Centre of Latvian State University Abstract. Necessary condition to have Hamiltonian cycle in planar graph is given.
More informationCircle Name: Radius: Diameter: Chord: Secant:
12.1: Tangent Lines Congruent Circles: circles that have the same radius length Diagram of Examples Center of Circle: Circle Name: Radius: Diameter: Chord: Secant: Tangent to A Circle: a line in the plane
More informationShortcut sets for plane Euclidean networks (Extended abstract) 1
Shortcut sets for plane Euclidean networks (Extended abstract) 1 J. Cáceres a D. Garijo b A. González b A. Márquez b M. L. Puertas a P. Ribeiro c a Departamento de Matemáticas, Universidad de Almería,
More informationIntroduction to Graph Theory
Introduction to Graph Theory Allen Dickson October 2006 1 The Königsberg Bridge Problem The city of Königsberg was located on the Pregel river in Prussia. The river divided the city into four separate
More informationChapters 6 and 7 Notes: Circles, Locus and Concurrence
Chapters 6 and 7 Notes: Circles, Locus and Concurrence IMPORTANT TERMS AND DEFINITIONS A circle is the set of all points in a plane that are at a fixed distance from a given point known as the center of
More informationThe minimum number of distinct areas of triangles determined by a set of n points in the plane
The minimum number of distinct areas of triangles determined by a set of n points in the plane Rom Pinchasi Israel Institute of Technology, Technion 1 August 6, 007 Abstract We prove a conjecture of Erdős,
More informationNew York State Student Learning Objective: Regents Geometry
New York State Student Learning Objective: Regents Geometry All SLOs MUST include the following basic components: Population These are the students assigned to the course section(s) in this SLO all students
More information2.1. Inductive Reasoning EXAMPLE A
CONDENSED LESSON 2.1 Inductive Reasoning In this lesson you will Learn how inductive reasoning is used in science and mathematics Use inductive reasoning to make conjectures about sequences of numbers
More informationThis is a tentative schedule, date may change. Please be sure to write down homework assignments daily.
Mon Tue Wed Thu Fri Aug 26 Aug 27 Aug 28 Aug 29 Aug 30 Introductions, Expectations, Course Outline and Carnegie Review summer packet Topic: (1-1) Points, Lines, & Planes Topic: (1-2) Segment Measure Quiz
More informationQuestion 2: How do you solve a linear programming problem with a graph?
Question 2: How do you solve a linear programming problem with a graph? Now that we have several linear programming problems, let s look at how we can solve them using the graph of the system of inequalities.
More informationGeometry Review Flash Cards
point is like a star in the night sky. However, unlike stars, geometric points have no size. Think of them as being so small that they take up zero amount of space. point may be represented by a dot on
More informationModule1. x 1000. y 800.
Module1 1 Welcome to the first module of the course. It is indeed an exciting event to share with you the subject that has lot to offer both from theoretical side and practical aspects. To begin with,
More information39 Symmetry of Plane Figures
39 Symmetry of Plane Figures In this section, we are interested in the symmetric properties of plane figures. By a symmetry of a plane figure we mean a motion of the plane that moves the figure so that
More informationThe Clar Structure of Fullerenes
The Clar Structure of Fullerenes Liz Hartung Massachusetts College of Liberal Arts June 12, 2013 Liz Hartung (Massachusetts College of Liberal Arts) The Clar Structure of Fullerenes June 12, 2013 1 / 25
More informationH.Calculating Normal Vectors
Appendix H H.Calculating Normal Vectors This appendix describes how to calculate normal vectors for surfaces. You need to define normals to use the OpenGL lighting facility, which is described in Chapter
More informationGraph Theory Problems and Solutions
raph Theory Problems and Solutions Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles November, 005 Problems. Prove that the sum of the degrees of the vertices of any finite graph is
More informationCIRCLE COORDINATE GEOMETRY
CIRCLE COORDINATE GEOMETRY (EXAM QUESTIONS) Question 1 (**) A circle has equation x + y = 2x + 8 Determine the radius and the coordinates of the centre of the circle. r = 3, ( 1,0 ) Question 2 (**) A circle
More informationLesson 1: Introducing Circles
IRLES N VOLUME Lesson 1: Introducing ircles ommon ore Georgia Performance Standards M9 12.G..1 M9 12.G..2 Essential Questions 1. Why are all circles similar? 2. What are the relationships among inscribed
More informationCurriculum Map by Block Geometry Mapping for Math Block Testing 2007-2008. August 20 to August 24 Review concepts from previous grades.
Curriculum Map by Geometry Mapping for Math Testing 2007-2008 Pre- s 1 August 20 to August 24 Review concepts from previous grades. August 27 to September 28 (Assessment to be completed by September 28)
More information3. Linear Programming and Polyhedral Combinatorics
Massachusetts Institute of Technology Handout 6 18.433: Combinatorial Optimization February 20th, 2009 Michel X. Goemans 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the
More informationDEFINITIONS. Perpendicular Two lines are called perpendicular if they form a right angle.
DEFINITIONS Degree A degree is the 1 th part of a straight angle. 180 Right Angle A 90 angle is called a right angle. Perpendicular Two lines are called perpendicular if they form a right angle. Congruent
More information28 Closest-Point Problems -------------------------------------------------------------------
28 Closest-Point Problems ------------------------------------------------------------------- Geometric problems involving points on the plane usually involve implicit or explicit treatment of distances
More informationReflection and Refraction
Equipment Reflection and Refraction Acrylic block set, plane-concave-convex universal mirror, cork board, cork board stand, pins, flashlight, protractor, ruler, mirror worksheet, rectangular block worksheet,
More informationMathematics Geometry Unit 1 (SAMPLE)
Review the Geometry sample year-long scope and sequence associated with this unit plan. Mathematics Possible time frame: Unit 1: Introduction to Geometric Concepts, Construction, and Proof 14 days This
More informationLinear Programming. Solving LP Models Using MS Excel, 18
SUPPLEMENT TO CHAPTER SIX Linear Programming SUPPLEMENT OUTLINE Introduction, 2 Linear Programming Models, 2 Model Formulation, 4 Graphical Linear Programming, 5 Outline of Graphical Procedure, 5 Plotting
More informationMECHANICS OF SOLIDS - BEAMS TUTORIAL TUTORIAL 4 - COMPLEMENTARY SHEAR STRESS
MECHANICS OF SOLIDS - BEAMS TUTORIAL TUTORIAL 4 - COMPLEMENTARY SHEAR STRESS This the fourth and final tutorial on bending of beams. You should judge our progress b completing the self assessment exercises.
More information4 The Rhumb Line and the Great Circle in Navigation
4 The Rhumb Line and the Great Circle in Navigation 4.1 Details on Great Circles In fig. GN 4.1 two Great Circle/Rhumb Line cases are shown, one in each hemisphere. In each case the shorter distance between
More informationGeometry Course Summary Department: Math. Semester 1
Geometry Course Summary Department: Math Semester 1 Learning Objective #1 Geometry Basics Targets to Meet Learning Objective #1 Use inductive reasoning to make conclusions about mathematical patterns Give
More informationTriangulation by Ear Clipping
Triangulation by Ear Clipping David Eberly Geometric Tools, LLC http://www.geometrictools.com/ Copyright c 1998-2016. All Rights Reserved. Created: November 18, 2002 Last Modified: August 16, 2015 Contents
More informationDisjoint Compatible Geometric Matchings
Disjoint Compatible Geometric Matchings Mashhood Ishaque Diane L. Souvaine Csaba D. Tóth Abstract We prove that for every even set of n pairwise disjoint line segments in the plane in general position,
More information56 questions (multiple choice, check all that apply, and fill in the blank) The exam is worth 224 points.
6.1.1 Review: Semester Review Study Sheet Geometry Core Sem 2 (S2495808) Semester Exam Preparation Look back at the unit quizzes and diagnostics. Use the unit quizzes and diagnostics to determine which
More informationConjectures. Chapter 2. Chapter 3
Conjectures Chapter 2 C-1 Linear Pair Conjecture If two angles form a linear pair, then the measures of the angles add up to 180. (Lesson 2.5) C-2 Vertical Angles Conjecture If two angles are vertical
More informationINCIDENCE-BETWEENNESS GEOMETRY
INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full
More informationMax-Min Representation of Piecewise Linear Functions
Beiträge zur Algebra und Geometrie Contributions to Algebra and Geometry Volume 43 (2002), No. 1, 297-302. Max-Min Representation of Piecewise Linear Functions Sergei Ovchinnikov Mathematics Department,
More informationDefinitions, Postulates and Theorems
Definitions, s and s Name: Definitions Complementary Angles Two angles whose measures have a sum of 90 o Supplementary Angles Two angles whose measures have a sum of 180 o A statement that can be proven
More informationGeometry: Unit 1 Vocabulary TERM DEFINITION GEOMETRIC FIGURE. Cannot be defined by using other figures.
Geometry: Unit 1 Vocabulary 1.1 Undefined terms Cannot be defined by using other figures. Point A specific location. It has no dimension and is represented by a dot. Line Plane A connected straight path.
More information5.1 Midsegment Theorem and Coordinate Proof
5.1 Midsegment Theorem and Coordinate Proof Obj.: Use properties of midsegments and write coordinate proofs. Key Vocabulary Midsegment of a triangle - A midsegment of a triangle is a segment that connects
More informationCommon Core Unit Summary Grades 6 to 8
Common Core Unit Summary Grades 6 to 8 Grade 8: Unit 1: Congruence and Similarity- 8G1-8G5 rotations reflections and translations,( RRT=congruence) understand congruence of 2 d figures after RRT Dilations
More informationVisualizing Triangle Centers Using Geogebra
Visualizing Triangle Centers Using Geogebra Sanjay Gulati Shri Shankaracharya Vidyalaya, Hudco, Bhilai India http://mathematicsbhilai.blogspot.com/ sanjaybhil@gmail.com ABSTRACT. In this paper, we will
More informationLesson 2: Circles, Chords, Diameters, and Their Relationships
Circles, Chords, Diameters, and Their Relationships Student Outcomes Identify the relationships between the diameters of a circle and other chords of the circle. Lesson Notes Students are asked to construct
More informationAlgebra Unpacked Content For the new Common Core standards that will be effective in all North Carolina schools in the 2012-13 school year.
This document is designed to help North Carolina educators teach the Common Core (Standard Course of Study). NCDPI staff are continually updating and improving these tools to better serve teachers. Algebra
More informationSOLIDS, NETS, AND CROSS SECTIONS
SOLIDS, NETS, AND CROSS SECTIONS Polyhedra In this section, we will examine various three-dimensional figures, known as solids. We begin with a discussion of polyhedra. Polyhedron A polyhedron is a three-dimensional
More informationThe Triangle and its Properties
THE TRINGLE ND ITS PROPERTIES 113 The Triangle and its Properties Chapter 6 6.1 INTRODUCTION triangle, you have seen, is a simple closed curve made of three line segments. It has three vertices, three
More informationSection 7.2 Linear Programming: The Graphical Method
Section 7.2 Linear Programming: The Graphical Method Man problems in business, science, and economics involve finding the optimal value of a function (for instance, the maimum value of the profit function
More information3. Evaluate the objective function at each vertex. Put the vertices into a table: Vertex P=3x+2y (0, 0) 0 min (0, 5) 10 (15, 0) 45 (12, 2) 40 Max
SOLUTION OF LINEAR PROGRAMMING PROBLEMS THEOREM 1 If a linear programming problem has a solution, then it must occur at a vertex, or corner point, of the feasible set, S, associated with the problem. Furthermore,
More informationStar and convex regular polyhedra by Origami.
Star and convex regular polyhedra by Origami. Build polyhedra by Origami.] Marcel Morales Alice Morales 2009 E D I T I O N M O R A L E S Polyhedron by Origami I) Table of convex regular Polyhedra... 4
More informationALGEBRA. sequence, term, nth term, consecutive, rule, relationship, generate, predict, continue increase, decrease finite, infinite
ALGEBRA Pupils should be taught to: Generate and describe sequences As outcomes, Year 7 pupils should, for example: Use, read and write, spelling correctly: sequence, term, nth term, consecutive, rule,
More informationMATH STUDENT BOOK. 8th Grade Unit 6
MATH STUDENT BOOK 8th Grade Unit 6 Unit 6 Measurement Math 806 Measurement Introduction 3 1. Angle Measures and Circles 5 Classify and Measure Angles 5 Perpendicular and Parallel Lines, Part 1 12 Perpendicular
More informationContents. 2 Lines and Circles 3 2.1 Cartesian Coordinates... 3 2.2 Distance and Midpoint Formulas... 3 2.3 Lines... 3 2.4 Circles...
Contents Lines and Circles 3.1 Cartesian Coordinates.......................... 3. Distance and Midpoint Formulas.................... 3.3 Lines.................................. 3.4 Circles..................................
More informationLecture 2: Homogeneous Coordinates, Lines and Conics
Lecture 2: Homogeneous Coordinates, Lines and Conics 1 Homogeneous Coordinates In Lecture 1 we derived the camera equations λx = P X, (1) where x = (x 1, x 2, 1), X = (X 1, X 2, X 3, 1) and P is a 3 4
More information12 Surface Area and Volume
12 Surface Area and Volume 12.1 Three-Dimensional Figures 12.2 Surface Areas of Prisms and Cylinders 12.3 Surface Areas of Pyramids and Cones 12.4 Volumes of Prisms and Cylinders 12.5 Volumes of Pyramids
More informationGEOMETRY CONCEPT MAP. Suggested Sequence:
CONCEPT MAP GEOMETRY August 2011 Suggested Sequence: 1. Tools of Geometry 2. Reasoning and Proof 3. Parallel and Perpendicular Lines 4. Congruent Triangles 5. Relationships Within Triangles 6. Polygons
More informationE XPLORING QUADRILATERALS
E XPLORING QUADRILATERALS E 1 Geometry State Goal 9: Use geometric methods to analyze, categorize and draw conclusions about points, lines, planes and space. Statement of Purpose: The activities in this
More informationEveryday Mathematics. Grade 4 Grade-Level Goals CCSS EDITION. Content Strand: Number and Numeration. Program Goal Content Thread Grade-Level Goal
Content Strand: Number and Numeration Understand the Meanings, Uses, and Representations of Numbers Understand Equivalent Names for Numbers Understand Common Numerical Relations Place value and notation
More informationNotes on tangents to parabolas
Notes on tangents to parabolas (These are notes for a talk I gave on 2007 March 30.) The point of this talk is not to publicize new results. The most recent material in it is the concept of Bézier curves,
More informationEdExcel Decision Mathematics 1
EdExcel Decision Mathematics 1 Linear Programming Section 1: Formulating and solving graphically Notes and Examples These notes contain subsections on: Formulating LP problems Solving LP problems Minimisation
More informationChapter 5. Linear Inequalities and Linear Programming. Linear Programming in Two Dimensions: A Geometric Approach
Chapter 5 Linear Programming in Two Dimensions: A Geometric Approach Linear Inequalities and Linear Programming Section 3 Linear Programming gin Two Dimensions: A Geometric Approach In this section, we
More informationIncenter Circumcenter
TRIANGLE: Centers: Incenter Incenter is the center of the inscribed circle (incircle) of the triangle, it is the point of intersection of the angle bisectors of the triangle. The radius of incircle is
More informationIntersection of Convex Objects: The Method of Separating Axes
Intersection of Convex Objects: The Method of Separating Axes David Eberly Geometric Tools, LLC http://www.geometrictools.com/ Copyright c 1998-2016. All Rights Reserved. Created: January 28, 2001 Last
More information1. A plane passes through the apex (top point) of a cone and then through its base. What geometric figure will be formed from this intersection?
Student Name: Teacher: Date: District: Description: Miami-Dade County Public Schools Geometry Topic 7: 3-Dimensional Shapes 1. A plane passes through the apex (top point) of a cone and then through its
More informationActivity Set 4. Trainer Guide
Geometry and Measurement of Solid Figures Activity Set 4 Trainer Guide Mid_SGe_04_TG Copyright by the McGraw-Hill Companies McGraw-Hill Professional Development GEOMETRY AND MEASUREMENT OF SOLID FIGURES
More informationVolumes of Revolution
Mathematics Volumes of Revolution About this Lesson This lesson provides students with a physical method to visualize -dimensional solids and a specific procedure to sketch a solid of revolution. Students
More informationJim Lambers MAT 169 Fall Semester 2009-10 Lecture 25 Notes
Jim Lambers MAT 169 Fall Semester 009-10 Lecture 5 Notes These notes correspond to Section 10.5 in the text. Equations of Lines A line can be viewed, conceptually, as the set of all points in space that
More information1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More informationVector storage and access; algorithms in GIS. This is lecture 6
Vector storage and access; algorithms in GIS This is lecture 6 Vector data storage and access Vectors are built from points, line and areas. (x,y) Surface: (x,y,z) Vector data access Access to vector
More informationTHREE DIMENSIONAL GEOMETRY
Chapter 8 THREE DIMENSIONAL GEOMETRY 8.1 Introduction In this chapter we present a vector algebra approach to three dimensional geometry. The aim is to present standard properties of lines and planes,
More informationA floor is a flat surface that extends in all directions. So, it models a plane. 1-1 Points, Lines, and Planes
1-1 Points, Lines, and Planes Use the figure to name each of the following. 1. a line containing point X 5. a floor A floor is a flat surface that extends in all directions. So, it models a plane. Draw
More information