Computational Geometry on Surfaces
|
|
- Charlene Hensley
- 5 years ago
- Views:
Transcription
1 Computational Geometry on Surfaces
2 Computational Geometry on Surfaces Performing Computational Geometry on the Cylinder, the Sphere, the Torus, and the Cone by Clara I. Grima Department 0/ Applied Mathematics (E. u.l. T.A.), University 0/ Seville, Seville, Spain and Alberto Marquez Department 0/ Applied Mathematics (F.I.E.. ), University 0/ Seville, Seville, Spain Springer-Science+Business Media, B.V.
3 A C.I.P. Catalogue record for this book is available from the Library of Congress. ISBN ISBN (ebook) DOI / Printed on acid-free paper All Rights Reserved 2001 Springer Science+Business Media Dordrecht Originally published by Kluwer Academic Publishers in Softcover reprint of the hardcover 1 st edition 2001 No part of the material protected by this copyright notice may be reproduced or utilized in any form or by any means, electronic or mechanical, including photocopying, recording or by any information storage and retrieval system, without written permission from the copyright owner.
4 A nuestras familias To our families
5 Contents Preface Acknowledgments 1. PRELIMIN ARlES 1 1. Introduction 1 2. Notations and Terminology The Cylinder The Torus The sphere The cone Orbifolds Point Location and Range Searching Notes and comments EUCLIDEAN POSITION Introduction Euclidean Position Euclidean position on the cylinder and the cone Euclidean position on the torus Euclidean position on the sphere Cylindrical position in the Torus Euclidean position in Orbifolds and in General Surfaces N otes and comments CONVEX RULL Introduction 1.1 Some Extensions of Convexity Ryperconvex Rull Metrically Convex Rull Metrically Convex Rull in the Cylinder Metrically Convex Rull in the Torus Metrically Convex RuH on the Sphere Metrically convex hull on the cone Vll Xl XV
6 VUI COMPUTATIONAL GEOMETRY ON SURFACES 4. Analysis of complexity Minimum enclosing polygon Notes and comments VORONOI DIAGRAMS 61 l. Introduction Voronoi diagrams Voronoi diagrams on the cylinder Voronoi diagrams on the torus Voronoi diagrams on the sphere Voronoi diagrams on the cone Proximity problems and Voronoi diagrams 3.1 Voronoi diagrams and convex hulls Furthest point Voronoi diagram Generalized Voronoi diagrams Voronoi diagrams for a set of points and segments on the cylinder Polar diagram on the cylinder Notes and Comments RADI! 85 l. Introduction The Width of a Convex Set on the Sphere Alternative definitions of width on the sphere Algorithm of the width on the sphere Circumradius Diameter Maximum and minimum distances Notes and remarks VISIBILITY 107 l. Introduction Stabbing line segments Transversal helices Stabbing segments Visibility in the presence of obstacles Notes and comments TRIANGULATIONS 127 l. Introduction Triangulations on the cylinder Maximizing the Smallest Angle Graph of triangulations Triangulations on the sphere and on the torus Triangulations on the sphere Triangulations on the torus The graph of triangulations on non-planar surfaces 168
7 Contents IX 5. Notes and Comments References Topic Index 185 A uthor Index 189
8 Preface In the last thirty years Computational Geometry has emerged as a new discipline from the field of design and analysis of algorithms. That discipline studies geometric problems from a computational point of view, and it has attracted enormous research interest. But that interest is mostly concerned with Euclidean Geometry (mainly the plane or Euclidean 3-dimensional space). Of course, there are some important reasons for this occurrence since the first applieations and the bases of all developments are in the plane or in 3-dimensional space. But, we can find also some exceptions, and so Voronoi diagrams on the sphere, cylinder, the cone, and the torus have been considered previously, and there are many works on triangulations on the sphere and other surfaces. The exceptions mentioned in the last paragraph have appeared to try to answer some quest ions which arise in the growing list of areas in which the results of Computational Geometry are applicable, since, in practiee, many situations in those areas lead to problems of Computational Geometry on surfaces (probably the sphere and the cylinder are the most common examples). We can mention here some specific areas in which these situations happen as engineering, computer aided design, manufacturing, geographie information systems, operations research, roboties, computer graphics, solid modeling, etc. For instance, in geographic information systems and in operations research it is possible to consider worldwide questions which lead to problems in the sphere, in engineering or solid modeling are very common to deal with cases modeled by torus, cylinder or sphere. The cylinder is in general useful when we meet phenomena in which the same configuration appears in cycles. Finally, the arm of a robot does not describe, in general, an Euclidean space but a more complex algebraic surface, which in the simplest cases used to be one of the surfaces considered here. Xl
9 xii COMPUTATIONAL GEOMETRY ON SURFACES As its title declares, this book is about Computational Geometry on Surfaces, but as its subtitle specifies, the material of this book is restricted to four very specific surfaces, the sphere, the cylinder, the cone, and the torus (in fact, this is not exactly true, in so far as we study some questions concerning more general surfaces, but we can say that more than ninety per cent of the book is devoted to the four surfaces mentioned). There are two main reasons for considering those surfaces. On one hand, they are the easiest surfaces after the plane, so naturally they must be the first to be considered when we try to travel beyond the plane. And, on the other hand, we think that restricting the material to those surfaces allows us to reach in an easier way the objective that we had in mind when we decided to start this work. So it is the intention of this book to demonstrate that classical problems of Computational Geometry can be solved when the input and output data are on surfaces other than the plane, but that planar techniques cannot be always adapted successfully and new techniques must be considered. In other words, we try to show here the flavor of Computational Geometry on surfaces. Basically this book is conceived as a graduate text (in fact, its core is C.I. Grima's doctoral dissertation, although a lot of new material has been included), but we think that it can be useful to the professional in the applied fields mentioned above as weil. Finally, it can be a guide for the researeher interested in Computational Geometry 'out of the plane', he or she can find here a sort of catalog of techniques in his/her discipline adapted to the surfaces considered here. In addition, some of the techniques and methods expound here can be adapted to other spaces that have not been treated directly but that share some common characteristics with the surfaces that we consider. EquaIly, we have tried to show not only how to obtain some results, but how it is impossible to obtain those results; in other words, which planar methods are not adaptable to our surfaces. However, it must be pointed out that, as is common in this class of books, this book is not exactly a catalog of readily usable algorithms, but we focus mainly on the keys of the adaptation of planar algorithms to our surfaces. Contents of the book The three fundamental structures in Computational Geometry will be covered: convex huils, Voronoi diagrams, and triangulations. These structures will be considered in three different surfaces, each one of them
10 Preface Xlll with so me special characteristics: the sphere; the cylinder; and the torus (and occasionally the cone). In addition, some other eiassical problems will be studied: width; diameter; stabbing line; visibility; etc. We will start with a first chapter that shows some notations and preliminary concepts, especially those regarding the metric of our surfaces as well as some distinguished elements. After that chapter we will focus on one of the key concepts of the book, Euclidean position. It is easy to imagine that performing Computational Geometry on surfaces will be different from the plane only when the input of an algorithm is a set that is not very small compared to the curvature of the surface. In fact, all surfaces considered here have eiosed geodesics, and, roughly speaking, we will see throughout this book that if the diameter of the set is smaller than half of the length of those geodesics, then to compute any invariant on that set coincides with the computations needed if the input is on the plane, in this case, we will say that the set is in Euclidean position. So, throughout the book, we will center our study on the cases of sets in non-euclidean position. In the third chapter we will study the convex hull of a set on a surface. In particular, two different extensions of convexity to our surfaces will be considered, and we will construct their convex hulls in optimal time. Both extensions will be based in the set of geodesics of each surface. Moreover, we will analyze the expected time of our algorithms and we will see that they run in linear time, hut the bad news is that in most cases the convex hub is too big to he useful as a preprocessing for many problems (width, diameter, etc.), thus other tools must be constructed. In some sense this is one of the main and surprising characteristics of Computational Geometry on Surfaces, since in the plane, convex hull computations appear almost everywhere in order to solve a huge variety of problems, and we leam that, generally, in surfaces, that computation is useless for most of those problems. The fourth chapter is devoted to Voronoi diagrams. As we have said above, these structures have been considered previously by other authors. So in that chapter we will summarize the known results on the eiosest point and the farthest point Voronoi diagrams. In addition, we will complete some of those known results, studying some extensions and giving valid methods for computing those diagrams in the cases which have not been considered previously. So far all structures (convex hulls and Voronoi diagrams) studied in this work have the same complexity as in the plane, but in this chapter we will present a specific generalized Voronoi diagram (the polar diagram ) that is more complex in the cylinder than in the plane.
11 XIV COMPUTATIONAL GEOMETRY ON SURFACES The next two chapters are devoted to solving some practical problems that shape weil the methodology which must be applied when doing Computational Geometry on Surfaces. Thus in Chapter four we will consider the computation of some functionals covered by the general name of radii, such as the width of a convex set or the diameter of a point set. And in the fifth chapter we treat the stabbing line of a segment set, and some visibility problems. In all cases we will show that the solutions given in the plane are not valid anymore (for instance, as we have mentioned above, the convex hull is not a useful tool for computing the diameter of a point set), but, in spite of that, optimal solutions can be found. This is an important part because it shows, probably better than any other part, the flavor of the field. The last chapter intro duces triangulations either of a point set or of a polygon. As in other structures studied before, some important differences appear in this subject. For instance, we can give two possible definitions of triangulations, which are equivalent in the planar case (a maximal subdivision and a triangular subdivision), and it is not c1ear whether both definitions agree outside the plane (we will see that both are equivalent in the case of the cylinder or the sphere but not in the case of the torus). The other three problems studied in this chapter are: what is the domain defined by a set of sites when we perform a triangulation?; is it possible to go from a triangulation to another using diagonal flips?; and, how can we obtain optimal triangulations? we will especially study the connectivity of the graph of triangulations of polygons on surfaces, seeing that, in general, but with some very remarkable exceptions, that graph is not connected.
12 Acknowledgments It would be impossible to thank individually all our colleagues who have contributed to this book. We are grateful to all of them, even if we cannot list all their names here. However, we would like to explicitly thank (in alphabeticalorder) Jose Caceres, Javier Cobos, Carmen Cortes, Juan C. Dana, Angeles Garrido, Ferran Hurtado, Felipe Mateos, Atsuhiro Nakamoto, Lidia Ortega, Joserra Portillo, Francisco Santos and Jesus Valenzuela. Without their contributions this book would never appear at the present time. We are also grateful to Dr. Liesbeth Mol and all the staff from Kluwer Academic Publisher for their support in all stages of the creation of this book. Last, but not least, our thanks go to our families for their support and love during the hours that have led to this finished product. xv
Topological Structure and Analysis of Interconnection Networks
Topological Structure and Analysis of Interconnection Networks Network Theory and Applications Volume 7 Managing Editors: Ding-Zhu Du, University of Minnesota, U.S.A. and Cauligi Raghavendra, University
More informationRETARGETABLE CODE GENERATION FOR DIGITAL SIGNAL PROCESSORS
RETARGETABLE CODE GENERATION FOR DIGITAL SIGNAL PROCESSORS RETARGETABLE CODE GENERATION FOR DIGITAL SIGNAL PROCESSORS Rainer LEUPERS University of Dortmund Department of Computer Science Dortmund, Germany
More informationMULTIMEDIA DATABASE MANAGEMENT SYSTEMS
MULTIMEDIA DATABASE MANAGEMENT SYSTEMS THE KLUWER INTERNATIONAL SERIES IN ENGINEERING AND COMPUTER SCIENCE MULTIMEDIA SYSTEMS AND APPLICATIONS Recently Published Titles: Consulting Editor Borko Furht Florida
More informationGEOMETRIC TOOLS FOR COMPUTER GRAPHICS
GEOMETRIC TOOLS FOR COMPUTER GRAPHICS PHILIP J. SCHNEIDER DAVID H. EBERLY MORGAN KAUFMANN PUBLISHERS A N I M P R I N T O F E L S E V I E R S C I E N C E A M S T E R D A M B O S T O N L O N D O N N E W
More informationARCHITECTURE AND CAD FOR DEEP-SUBMICRON FPGAs
ARCHITECTURE AND CAD FOR DEEP-SUBMICRON FPGAs THE KLUWER INTERNATIONAL SERIES IN ENGINEERING AND COMPUTER SCIENCE ARCHITECTURE AND CAD FOR DEEP-SUBMICRON FPGAs Vaughn Betz Jonathan Rose Alexander Marquardt
More informationCOMPUTATIONAL GEOMETRY AND COMPUTER GRAPHICS IN C++ BY MICHAEL J. LASZLO
COMPUTATIONAL GEOMETRY AND COMPUTER GRAPHICS IN C++ BY MICHAEL J. LASZLO DOWNLOAD EBOOK : COMPUTATIONAL GEOMETRY AND COMPUTER Click link bellow and free register to download ebook: COMPUTATIONAL GEOMETRY
More informationTHE VERILOG? HARDWARE DESCRIPTION LANGUAGE
THE VERILOG? HARDWARE DESCRIPTION LANGUAGE THE VERILOGf HARDWARE DESCRIPTION LANGUAGE by Donald E. Thomas Carnegie Mellon University and Philip R. Moorby Cadence Design Systems, Inc. SPRINGER SCIENCE+BUSINESS
More informationMODERN DESCRIPTIVE GEOMETRY SUPPORTED BY 3D COMPUTER MODELLING
International Conference on Mathematics Textbook Research and Development 2014 () 29-31 July 2014, University of Southampton, UK MODERN DESCRIPTIVE GEOMETRY SUPPORTED BY 3D COMPUTER MODELLING Petra Surynková
More informationTier 2: GEOMETRY INTRODUCTION TO GEOMETRY Lessons Abbreviation Key Table... 7 G1 LESSON: WHAT IS GEOMETRY?... 8 G1E... 9 G1EA...
Craig Hane, Ph.D., Founder Tier 2: GEOMETRY INTRODUCTION TO GEOMETRY... 6 1.1 Lessons Abbreviation Key Table... 7 G1 LESSON: WHAT IS GEOMETRY?... 8 G1E... 9 G1EA... 10 G2 LESSON: STRAIGHT LINES AND ANGLES...
More information1/60. Geometric Algorithms. Lecture 1: Introduction. Convex Hulls
1/60 Geometric Algorithms Lecture 1: Introduction Convex Hulls Geometric algorithms scope 2/60 Geometry algorithms (practice): Study of geometric problems that arise in various applications and how algorithms
More informationINVERSE PROBLEMS IN GROUNDWATER MODELING
INVERSE PROBLEMS IN GROUNDWATER MODELING Theory and Applications of Transport in Porous Media Series Editor: Jacob Bear, Technion - Israel Institute of Technology, Haifa, Israel Volume 6 The titles published
More informationA Flavor of Topology. Shireen Elhabian and Aly A. Farag University of Louisville January 2010
A Flavor of Topology Shireen Elhabian and Aly A. Farag University of Louisville January 2010 In 1670 s I believe that we need another analysis properly geometric or linear, which treats place directly
More informationPrentice Hall Mathematics Geometry, Foundations Series 2011
Prentice Hall Mathematics Geometry, Foundations Series 2011 Geometry C O R R E L A T E D T O from March 2009 Geometry G.1 Points, Lines, Angles and Planes G.1.1 Find the length of line segments in one-
More informationDgp _ lecture 2. Curves
Dgp _ lecture 2 Curves Questions? This lecture will be asking questions about curves, their Relationship to surfaces, and how they are used and controlled. Topics of discussion will be: Free form Curves
More informationGraphics Programming in c++
Graphics Programming in c++ Springer London Berlin Heidelberg New York Barcelona Budapest Hong Kong Milan Paris Santa Clara Singapore Tokyo Mark Walmsley Graphics Programming in c++ Writing Graphics Applications
More informationTheory of Automatic Robot Assembly and Programming
Theory of Automatic Robot Assembly and Programming Theory of Automatic Robot Assembly and Programming Bartholomew o. Nnaji Professor and Director Automation and Robotics Laboratory Department of Industrial
More informationPlanar Graphs and Surfaces. Graphs 2 1/58
Planar Graphs and Surfaces Graphs 2 1/58 Last time we discussed the Four Color Theorem, which says that any map can be colored with at most 4 colors and not have two regions that share a border having
More informationCOMPUTATIONAL DYNAMICS
COMPUTATIONAL DYNAMICS THIRD EDITION AHMED A. SHABANA Richard and Loan Hill Professor of Engineering University of Illinois at Chicago A John Wiley and Sons, Ltd., Publication COMPUTATIONAL DYNAMICS COMPUTATIONAL
More informationEquations and Functions, Variables and Expressions
Equations and Functions, Variables and Expressions Equations and functions are ubiquitous components of mathematical language. Success in mathematics beyond basic arithmetic depends on having a solid working
More informationPrentice Hall CME Project Geometry 2009
Prentice Hall CME Project Geometry 2009 Geometry C O R R E L A T E D T O from March 2009 Geometry G.1 Points, Lines, Angles and Planes G.1.1 Find the length of line segments in one- or two-dimensional
More informationDigital Functions and Data Reconstruction
Digital Functions and Data Reconstruction Li M. Chen Digital Functions and Data Reconstruction Digital-Discrete Methods 123 Li M. Chen University of the District of Columbia Washington, DC, USA ISBN 978-1-4614-5637-7
More informationWhat is a... Manifold?
What is a... Manifold? Steve Hurder Manifolds happens all the time! We just have to know them when we see them. Manifolds have dimension, just like Euclidean space: 1-dimension is the line, 2-dimension
More informationElementary Planar Geometry
Elementary Planar Geometry What is a geometric solid? It is the part of space occupied by a physical object. A geometric solid is separated from the surrounding space by a surface. A part of the surface
More informationLesson 9. Three-Dimensional Geometry
Lesson 9 Three-Dimensional Geometry 1 Planes A plane is a flat surface (think tabletop) that extends forever in all directions. It is a two-dimensional figure. Three non-collinear points determine a plane.
More informationPERFORMANCE ANALYSIS OF REAL-TIME EMBEDDED SOFTWARE
PERFORMANCE ANALYSIS OF REAL-TIME EMBEDDED SOFTWARE PERFORMANCE ANALYSIS OF REAL-TIME EMBEDDED SOFTWARE Yau-Tsun Steven Li Monterey Design Systems, Inc. Sharad Malik Princeton University ~. " SPRINGER
More informationComputational Geometry. Definition, Application Areas, and Course Overview
Computational Geometry Definition, Application Areas, and Course Overview Computational Geometry is a subfield of the Design and Analysis of Algorithms Computational Geometry is a subfield of the Design
More information(Master Course) Mohammad Farshi Department of Computer Science, Yazd University. Yazd Univ. Computational Geometry.
1 / 17 (Master Course) Mohammad Farshi Department of Computer Science, Yazd University 1392-1 2 / 17 : Mark de Berg, Otfried Cheong, Marc van Kreveld, Mark Overmars, Algorithms and Applications, 3rd Edition,
More information(1) Page #2 26 Even. (2) Page 596 #1 14. (3) Page #15 25 ; FF #26 and 28. (4) Page 603 #1 18. (5) Page #19 26
Geometry/Trigonometry Unit 10: Surface Area and Volume of Solids Notes Name: Date: Period: # (1) Page 590 591 #2 26 Even (2) Page 596 #1 14 (3) Page 596 597 #15 25 ; FF #26 and 28 (4) Page 603 #1 18 (5)
More informationFlavor of Computational Geometry. Convex Hull in 2D. Shireen Y. Elhabian Aly A. Farag University of Louisville
Flavor of Computational Geometry Convex Hull in 2D Shireen Y. Elhabian Aly A. Farag University of Louisville February 2010 Agenda Introduction Definitions of Convexity and Convex Hulls Naïve Algorithms
More informationComputational Geometry
Lecture 1: Introduction and convex hulls Geometry: points, lines,... Geometric objects Geometric relations Combinatorial complexity Computational geometry Plane (two-dimensional), R 2 Space (three-dimensional),
More informationADAPTIVE HYPERTEXT AND HYPERMEDIA
ADAPTIVE HYPERTEXT AND HYPERMEDIA ADAPTIVE HYPERTEXT AND HYPERMEDIA Edited by Peter Brusilovsky Carnegie Mellon University Alfred Kobsa GMDFIT German National Research Centre for Information Technology
More informationWhat would you see if you live on a flat torus? What is the relationship between it and a room with 2 mirrors?
DAY I Activity I: What is the sum of the angles of a triangle? How can you show it? How about a quadrilateral (a shape with 4 sides)? A pentagon (a shape with 5 sides)? Can you find the sum of their angles
More informationEXACT FACE-OFFSETTING FOR POLYGONAL MESHES
5.0 GEOMIMESIS/LANDFORMING HAMBLETON + ROSS EXACT FACE-OFFSETTING FOR POLYGONAL MESHES Elissa Ross MESH Consultants Inc. Daniel Hambleton MESH Consultants Inc. ABSTRACT Planar-faced mesh surfaces such
More informationWIRELESS ATM AND AD-HOC NETWORKS. Protocols and Architectures
WIRELESS ATM AND AD-HOC NETWORKS Protocols and Architectures WIRELESS ATM AND AD-HOC NETWORKS Protocols and Architectures C-K Toh, Ph.D. University of Cambridge Cambridge, United Kingdom SPRINGER-SCIENCE+BUSINESS
More informationResearch in Computational Differential Geomet
Research in Computational Differential Geometry November 5, 2014 Approximations Often we have a series of approximations which we think are getting close to looking like some shape. Approximations Often
More informationIntroduction to the Mathematical Concepts of CATIA V5
CATIA V5 Training Foils Introduction to the Mathematical Concepts of CATIA V5 Version 5 Release 19 January 2009 EDU_CAT_EN_MTH_FI_V5R19 1 About this course Objectives of the course Upon completion of this
More informationEXPERIENCING GEOMETRY
EXPERIENCING GEOMETRY EUCLIDEAN AND NON-EUCLIDEAN WITH HISTORY THIRD EDITION David W. Henderson Daina Taimina Cornell University, Ithaca, New York PEARSON Prentice Hall Upper Saddle River, New Jersey 07458
More informationSomeone else might choose to describe the closet by determining how many square tiles it would take to cover the floor. 6 ft.
Areas Rectangles One way to describe the size of a room is by naming its dimensions. So a room that measures 12 ft. by 10 ft. could be described by saying its a 12 by 10 foot room. In fact, that is how
More informationComputational Geometry. Algorithm Design (10) Computational Geometry. Convex Hull. Areas in Computational Geometry
Computational Geometry Algorithm Design (10) Computational Geometry Graduate School of Engineering Takashi Chikayama Algorithms formulated as geometry problems Broad application areas Computer Graphics,
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 informationApproximating a set of points by circles
Approximating a set of points by circles Sandra Gesing June 2005 Abstract This paper is an abstract of the German diploma thesis Approximation von Punktmengen durch Kreise finished by the author in March
More informationFUZZY DATABASES Principles and Applications
FUZZY DATABASES Principles and Applications INTERNATIONAL SERIES IN INTELLIGENT TECHNOLOGIES Prof. Dr. Dr. h.c. Hans-Jiirgen Zimmermann, Editor European Laboratory for Intelligent Techniques Engineering
More informationWeighted and Continuous Clustering
John (ARC/ICAM) Virginia Tech... Math/CS 4414: http://people.sc.fsu.edu/ jburkardt/presentations/ clustering weighted.pdf... ARC: Advanced Research Computing ICAM: Interdisciplinary Center for Applied
More informationSeparable Programming
Separable Programming Applied Optimization Volume 53 Series Editors: Panos M. Pardalos University 0/ Florida, USA. Donald Hearn University 0/ Florida, USA. The tit/es published in this series are listed
More informationLecture 3: Linear Classification
Lecture 3: Linear Classification Roger Grosse 1 Introduction Last week, we saw an example of a learning task called regression. There, the goal was to predict a scalar-valued target from a set of features.
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 informationJEFFERSON COLLEGE COURSE SYLLABUS MTH 009 GEOMETRY. 1 Credit Hour. Prepared By: Carol Ising. Revised Date: September 9, 2008 by: Carol Ising
JEFFERSON COLLEGE COURSE SYLLABUS MTH 009 GEOMETRY 1 Credit Hour Prepared By: Carol Ising Revised Date: September 9, 2008 by: Carol Ising Arts & Science Education Dr. Mindy Selsor, Dean MTH009 Geometry
More informationCHAPTER 3: VOLUME. 1. Passing from One Solid to a Succeeding One. 2. Passing from One Solid to a Non-Successive One
CHAPTER 3: VOLUME I. Introduction II. Volume as a Measurement of Space III. Volume of Solids A. Right-angled Parallelepiped 1. Passing from One Solid to a Succeeding One 2. Passing from One Solid to a
More informationFundamentals of Operating Systems. Fifth Edition
Fundamentals of Operating Systems Fifth Edition Fundamentals of Operating Systems A.M. Lister University of Queensland R. D. Eager University of Kent at Canterbury Fifth Edition Springer Science+Business
More informationTeaching diary. Francis Bonahon University of Southern California
Teaching diary In the Fall 2010, I used the book Low-dimensional geometry: from euclidean surfaces to hyperbolic knots as the textbook in the class Math 434, Geometry and Transformations, at USC. Most
More informationContent Standard 1: Numbers, Number Sense, and Computation
Content Standard 1: Numbers, Number Sense, and Computation Place Value Fractions Comparing and Ordering Counting Facts Estimating and Estimation Strategies Determine an approximate value of radical and
More informationacute angle An angle with a measure less than that of a right angle. Houghton Mifflin Co. 2 Grade 5 Unit 6
acute angle An angle with a measure less than that of a right angle. Houghton Mifflin Co. 2 Grade 5 Unit 6 angle An angle is formed by two rays with a common end point. Houghton Mifflin Co. 3 Grade 5 Unit
More informationEnergy Efficient Microprocessor Design
Energy Efficient Microprocessor Design Energy Efficient Microprocessor Design by Thomas D. Burd Robert W. Brodersen with Contributions Irom Trevor Pering Anthony Stratakos Berkeley Wireless Research Center
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 informationAn Introduction to Geometrical Probability
An Introduction to Geometrical Probability Distributional Aspects with Applications A. M. Mathai McGill University Montreal, Canada Gordon and Breach Science Publishers Australia Canada China Prance Germany
More informationGeometric Modeling Mortenson Chapter 11. Complex Model Construction
Geometric Modeling 91.580.201 Mortenson Chapter 11 Complex Model Construction Topics Topology of Models Connectivity and other intrinsic properties Graph-Based Models Emphasize topological structure Boolean
More informationThe equal tangents property
The equal tangents property J. Jerónimo-Castro, G. Ruiz-Hernández and S. Tabachnikov April 29, 2012 Abstract Let M be a C 2 -smooth strictly convex closed surface in R 3 and denote by H the set of points
More informationHigh-Dimensional Computational Geometry. Jingbo Shang University of Illinois at Urbana-Champaign Mar 5, 2018
High-Dimensional Computational Geometry Jingbo Shang University of Illinois at Urbana-Champaign Mar 5, 2018 Outline 3-D vector geometry High-D hyperplane intersections Convex hull & its extension to 3
More informationEveryday Mathematics
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 informationLoop Tiling for Parallelism
Loop Tiling for Parallelism THE KLUWER INTERNATIONAL SERIES IN ENGINEERING AND COMPUTER SCIENCE LOOP TILING FOR PARALLELISM JINGLING XUE School of Computer Science and Engineering The University of New
More information1 Appendix to notes 2, on Hyperbolic geometry:
1230, notes 3 1 Appendix to notes 2, on Hyperbolic geometry: The axioms of hyperbolic geometry are axioms 1-4 of Euclid, plus an alternative to axiom 5: Axiom 5-h: Given a line l and a point p not on l,
More informationAnswer Key: Three-Dimensional Cross Sections
Geometry A Unit Answer Key: Three-Dimensional Cross Sections Name Date Objectives In this lesson, you will: visualize three-dimensional objects from different perspectives be able to create a projection
More informationTiling Three-Dimensional Space with Simplices. Shankar Krishnan AT&T Labs - Research
Tiling Three-Dimensional Space with Simplices Shankar Krishnan AT&T Labs - Research What is a Tiling? Partition of an infinite space into pieces having a finite number of distinct shapes usually Euclidean
More informationComputational Geometry TOPICS Preliminaries Point in a Polygon Polygon Construction Convex Hulls
Computational Geometry TOPICS Preliminaries Point in a Polygon Polygon Construction Convex Hulls CSE5311 Kumar 1 Geometric Algorithms Geometric Algorithms find applications in such areas as Computer Graphics
More informationGroupware and the World Wide Web
Groupware and the World Wide Web Edited by Richard Bentley, Uwe Busbach, David Kerr & Klaas Sikkel German National Research Center for Information Technology, Institutefor Applied Information Technology
More informationBands: A Physical Data Structure to Represent Both Orientable and Non-Orientable 2-Manifold Meshes
Bands: A Physical Data Structure to Represent Both Orientable and Non-Orientable 2-Manifold Meshes Abstract This paper presents a physical data structure to represent both orientable and non-orientable
More informationCurriculum Catalog
2017-2018 Curriculum Catalog 2017 Glynlyon, Inc. Table of Contents MATHEMATICS 800 FUNDAMENTALS COURSE OVERVIEW... 1 UNIT 1: THE REAL NUMBER SYSTEM... 1 UNIT 2: MODELING PROBLEMS IN INTEGERS... 2 UNIT
More informationPath Planning by Using Generalized Voronoi Diagrams and Dijkstra Algorithm. Lai Hon Lin. Project Proposal. Computational Geometry
Path Planning by Using Generalized Voronoi Diagrams and Dijkstra Algorithm by Lai Hon Lin Project Proposal of Computational Geometry Assessed by: Dr. Deng Jun Hui 1. Abstract: This proposal is a description
More informationOutline of the presentation
Surface Reconstruction Petra Surynková Charles University in Prague Faculty of Mathematics and Physics petra.surynkova@mff.cuni.cz Outline of the presentation My work up to now Surfaces of Building Practice
More informationThe Geometry of Solids
CONDENSED LESSON 10.1 The Geometry of Solids In this lesson you will Learn about polyhedrons, including prisms and pyramids Learn about solids with curved surfaces, including cylinders, cones, and spheres
More informationRobotics: Science and Systems I Lab 6: Motion Planning and Global Navigation Begins: 3/5/2014, 3pm Due: 3/12/2014, 3pm
Objectives and Lab Overview Massachusetts Institute of Technology Robotics: Science and Systems I Lab 6: Motion Planning and Global Navigation Begins: 3/5/2014, 3pm Due: 3/12/2014, 3pm Your objective in
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 informationComputational Geometry - Algorithms and Applications
Computational Geometry - Algorithms and Applications Springer-Verlag Berlin Heidelberg GmbH Mark de Berg Mare van Kreveld Mark Overmars Otfried Sehwarzkopf Computational Geometry Algorithms and Applications
More informationLinear Programming: Mathematics, Theory and Algorithms
Linear Programming: Mathematics, Theory and Algorithms Applied Optimization Volume 2 The titles published in this series are listed at the end of this volume. Linear Programming: Mathematics, Theory and
More informationFoundations of 3D Graphics Programming
Foundations of 3D Graphics Programming Jim X. Chen Edward J. Wegman Foundations of 3D Graphics Programming Using JOGL and Java3D With 139 Figures Jim X. Chen, PhD Computer Science Department George Mason
More informationCurriculum Catalog
2018-2019 Curriculum Catalog Table of Contents MATHEMATICS 800 COURSE OVERVIEW... 1 UNIT 1: THE REAL NUMBER SYSTEM... 1 UNIT 2: MODELING PROBLEMS IN INTEGERS... 3 UNIT 3: MODELING PROBLEMS WITH RATIONAL
More informationCURRICULUM CATALOG. CCR Mathematics Grade 8 (270720) MS
2018-19 CURRICULUM CATALOG Table of Contents COURSE OVERVIEW... 1 UNIT 1: THE REAL NUMBER SYSTEM... 2 UNIT 2: MODELING PROBLEMS IN INTEGERS... 2 UNIT 3: MODELING PROBLEMS WITH RATIONAL NUMBERS... 2 UNIT
More informationUnit Maps: Grade 2 Math
Place Value and Comparing Numbers 2.3 Place value. The student understands how to represent and compare whole numbers, the relative position and magnitude of whole numbers, and relationships within the
More informationAnoka Hennepin K-12 Curriculum plan
Anoka Hennepin K-12 Curriculum plan Department: Elementary Math Unit Title: Packages and Polygons (Blue Book, Geo and Measurement) Triangles and Beyond (Blue Book, Geo and Measurement) Everyday Math: Volume
More informationAmarillo ISD Math Curriculum
Amarillo Independent School District follows the Texas Essential Knowledge and Skills (TEKS). All of AISD curriculum and documents and resources are aligned to the TEKS. The State of Texas State Board
More informationCarnegie Learning High School Math Series: Geometry Indiana Standards Worktext Correlations
Carnegie Learning High School Math Series: Logic and Proofs G.LP.1 Understand and describe the structure of and relationships within an axiomatic system (undefined terms, definitions, axioms and postulates,
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 informationFLORIDA GEOMETRY EOC TOOLKIT
FLORIDA GEOMETRY EOC TOOLKIT CORRELATION Correlated to the Geometry End-of-Course Benchmarks For more information, go to etacuisenaire.com\florida 78228IS ISBN 978-0-7406-9565-0 MA.912.D.6.2 Find the converse,
More informationGeometry Workbook WALCH PUBLISHING
Geometry Workbook WALCH PUBLISHING Table of Contents To the Student..............................vii Unit 1: Lines and Triangles Activity 1 Dimensions............................. 1 Activity 2 Parallel
More informationGeometric Combinatorics
Geometric Combinatorics sponsored by MAA PREP and MSRI Geometric combinatorics refers to a growing body of mathematics concerned with counting properties of geometric objects described by a finite set
More informationDover-Sherborn High School Mathematics Curriculum Geometry Level 1/CP
Mathematics Curriculum A. DESCRIPTION This is the traditional geometry course with emphasis on the student s understanding of the characteristics and properties of two- and three-dimensional geometry.
More informationFINITE FIELDS FOR COMPUTER SCIENTISTS AND ENGINEERS
FINITE FIELDS FOR COMPUTER SCIENTISTS AND ENGINEERS THE KLUWER INTERNATIONAL SERIES IN ENGINEERING AND COMPUTER SCIENCE INFORMATION THEORY Consulting Editor Robert G. Gallager FINITE FIELDS FOR COMPUTER
More informationCourse Number: Course Title: Geometry
Course Number: 1206310 Course Title: Geometry RELATED GLOSSARY TERM DEFINITIONS (89) Altitude The perpendicular distance from the top of a geometric figure to its opposite side. Angle Two rays or two line
More informationMathematics Background
Measurement All measurements are approximations. In their work in this Unit, students explore ways to find measures for two and three dimensional figures. Even using exact formulas depends on how students
More informationQuestion. Why is the third shape not convex?
1. CONVEX POLYGONS Definition. A shape D in the plane is convex if every line drawn between two points in D is entirely inside D. Convex 6 gon Another convex 6 gon Not convex Question. Why is the third
More informationMrs. Daniel s Geometry Vocab List
Mrs. Daniel s Geometry Vocab List Geometry Definition: a branch of mathematics concerned with questions of shape, size, relative position of figures, and the properties of space. Reflectional Symmetry
More informationTABLE OF CONTENTS. Worksheets Lesson 1 Worksheet Introduction to Geometry 41 Lesson 2 Worksheet Naming Plane and Solid Shapes.. 44
Acknowledgement: A+ TutorSoft would like to thank all the individuals who helped research, write, develop, edit, and launch our MATH Curriculum products. Countless weeks, years, and months have been devoted
More informationChapter 2: Rhino Objects
The fundamental geometric objects in Rhino are points, curves, surfaces, polysurfaces, extrusion objects, and polygon mesh objects. Why NURBS modeling NURBS (non-uniform rational B-splines) are mathematical
More informationTutorial 3 Comparing Biological Shapes Patrice Koehl and Joel Hass
Tutorial 3 Comparing Biological Shapes Patrice Koehl and Joel Hass University of California, Davis, USA http://www.cs.ucdavis.edu/~koehl/ims2017/ What is a shape? A shape is a 2-manifold with a Riemannian
More informationCURRICULUM GUIDE. Honors Geometry
CURRICULUM GUIDE Honors Geometry This level of Geometry is approached at an accelerated pace. Topics of postulates, theorems and proofs are discussed both traditionally and with a discovery approach. The
More informationGeodesic and curvature of piecewise flat Finsler surfaces
Geodesic and curvature of piecewise flat Finsler surfaces Ming Xu Capital Normal University (based on a joint work with S. Deng) in Southwest Jiaotong University, Emei, July 2018 Outline 1 Background Definition
More informationThis image cannot currently be displayed. Course Catalog. Pre-algebra Glynlyon, Inc.
This image cannot currently be displayed. Course Catalog Pre-algebra 2016 Glynlyon, Inc. Table of Contents COURSE OVERVIEW... 1 UNIT 1: THE REAL NUMBER SYSTEM... 1 UNIT 2: MODELING PROBLEMS IN INTEGERS...
More informationCopyright 2013 A+ Interactive MATH (an A+ TutorSoft Inc. company), All Rights Reserved.
www.aplustutorsoft.com Page 1 of 20 Dimensions of Shapes Lesson, Worksheet & Solution Guide Release 7 A+ Interactive Math (By A+ TutorSoft, Inc.) Email: info@aplustutorsoft.com www.aplustutorsoft.com www.aplustutorsoft.com
More information2 nd Grade Math Learning Targets. Algebra:
2 nd Grade Math Learning Targets Algebra: 2.A.2.1 Students are able to use concepts of equal to, greater than, and less than to compare numbers (0-100). - I can explain what equal to means. (2.A.2.1) I
More informationUsability Test Report: Bento results interface 1
Usability Test Report: Bento results interface 1 Summary Emily Daly and Ian Sloat conducted usability testing on the functionality of the Bento results interface. The test was conducted at the temporary
More information