DOCSLIB.ORG

Skeleton Structures and Origami Design

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Skeleton Structures and Origami Design University of Massachusetts Amherst ScholarWorks@UMass Amherst Doctoral Dissertations Dissertations and Theses November 2015 Skeleton Structures and Origami Design John C. Bowers University of Massachusetts Amherst Follow this and additional works at: https://scholarworks.umass.edu/dissertations_2 Part of the Geometry and Topology Commons, Graphics and Human Computer Interfaces Commons, and the Theory and Algorithms Commons Recommended Citation Bowers, John C., "Skeleton Structures and Origami Design" (2015). Doctoral Dissertations. 477. https://doi.org/10.7275/7463101.0 https://scholarworks.umass.edu/dissertations_2/477 This Open Access Dissertation is brought to you for free and open access by the Dissertations and Theses at ScholarWorks@UMass Amherst. It has been accepted for inclusion in Doctoral Dissertations by an authorized administrator of ScholarWorks@UMass Amherst. For more information, please contact [email protected]. SKELETON STRUCTURES AND ORIGAMI DESIGN A Dissertation Presented by JOHN CHRISTOPHER BOWERS Submitted to the Graduate School of the University of Massachusetts Amherst in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY September 2015 School of Computer Science c Copyright by John Christopher Bowers 2015 All Rights Reserved SKELETON STRUCTURES AND ORIGAMI DESIGN A Dissertation Presented by JOHN CHRISTOPHER BOWERS Approved as to style and content by: Ileana Streinu, Chair Andrew McGregor, Member Gerome Miklau, Member Tom Braden, Member Lori Clarke, Chair School of Computer Science DEDICATION For Katherine and Pippin and Scout. ACKNOWLEDGMENTS I would like to express my heartfelt thanks and appreciation for the many people who helped me in completing this thesis. This thesis would not have been possible without the advice and support of my advisor, Ileana Streinu. Ileana's adept guidance was crucial to my maturing as a researcher, a scholar, and a teacher. From her I learned perseverance (especially when facing reviewers), confidence and independence, and above all how to be a researcher. When I needed it, she pushed me (especially to revise, revise, revise!), and when I needed to step up on my own, she gave me free rein to do so. Most importantly, she introduced and fostered in me the joy of computational geometry. I remember coming away from one of the first lectures in Ileana's class thinking, this is it; this is what I want to study. I am very grateful for her mentorship and greatly value my time working with and learning from her. I also want to thank my committee, Andrew McGregor, Gerome Miklau, and Tom Braden, for their support and guidance. Additionally, I thank Andrew for many helpful conversations over the course of my graduate career. I thank Tom for helping me to improve the writing of this document. I next want to thank Rui Wang, who helped me get my start as a researcher, took me to my first academic conferences, and has been an inspiration and a support throughout my graduate career. Rui's energy and enthusiasm is infectious and he is a model for the type of researcher and advisor I want to be. I hope that my interactions with future students will be as energetic and inspiring as Rui's were with me. Especially in the last year, I have benefitted greatly from the professional advice and sound council of many that traveled this path before me. I thank Andrew Berke, v Henry Field, Jackie Field, Megan Olson, Audrey St. John, and Jerod Weinman for encouragement at the last mile, for proofreading, and especially for advice that gave me the courage to complete this thesis and start my career as a professor. I want to thank the many Theory and LinKaGe Lab students who were in the trenches with me: Ashraf Alam, Marco Carmosino, Michael Crouch, Naomi Fox, Cibele Freire, Filip Jagodzinski, Brandon McPhail, Daniel Stubbs, Patrick Taylor, David Tench, Hoa Vu, and Sofya Vorotnikova. Through conversation, debate, white- board mini-lectures, practice talks, and plenty of coffee, I found encouragement, in- spiration, and above all kept my sanity. A special thanks as well to Leeanne Leclerc, who deftly shepherded me (and many before me) through the many hoops and re- quirements of the graduate school. A large part of this work was supported by the National Science Foundation Graduate Research Fellowship Program. I first started down the path of a computer scientist when a friend of my parents, Steve Payne, taught me to program in sixth grade. Since then Steve has become both a mentor and a close friend. I am very much in debt to Steve for the years of support, guidance, and prayers. I remember at one point during high school a warning he gave me that I (mostly) took to heart. He warned me it sometimes becomes necessary to focus on one direction and not to simply become a Jack of All Trades and Master of None. This thesis is my heeding of that advice. I also thank those many friends who have given me love and support throughout this thesis process; for the friendship and support of Craig Nicolson{he has been a invaluable fellow traveller in The Way and additionally helped me to grow as a presenter and speaker; for Ian Callahan, whose courage and steadfastness inspires me daily; for Mike Foster and Richard Vachet, who model the sort of professor I want to be; for Steve Oloo, who has shared the PhD journey with me; for Ben Greene, who adventured into forest, over cliff, and up ice flows, when I needed to escape the LED vi glare of my computer screen; and for Nate Daman, who has been a parenting role model, friend, and council. Above all I gratefully thank my wife, Katherine Bowers, and my family. This thesis is a part of my and Katherine's shared vocation and I thank her for her patience and support throughout the process of completing it. She is my best friend, and is a wonderful mother to our little ones. This thesis is dedicated to her and to our two children, Pippin and Scout, who are my daily joy and inspiration. I thank my parents, Phil and Kris Bowers, for the innumerable ways they have supported me and nurtured me{to Dad, especially for the many mathematical conversations and coffee supply; and to Mom, especially for the prayers and encouragement and teaching advice. I thank my siblings, Maddy and Thomas Bowers, for relaxing and recreating with me. I thank my parents-in-law, Eric and Lu Grimm, and my sisters-in-law, Kellie Bowers and Beca Grimm, for the years of encouragement, and countless ways they have made me feel supported and loved. vii ABSTRACT SKELETON STRUCTURES AND ORIGAMI DESIGN SEPTEMBER 2015 JOHN CHRISTOPHER BOWERS B.Sc., THE FLORIDA STATE UNIVERSITY M.Sc., UNIVERSITY OF MASSACHUSETTS AMHERST Ph.D., UNIVERSITY OF MASSACHUSETTS AMHERST Directed by: Professor Ileana Streinu In this dissertation we study problems related to polygonal skeleton structures that have applications to computational origami. The two main structures studied are the straight skeleton of a simple polygon (and its generalizations to planar straight line graphs) and the universal molecule of a Lang polygon. This work builds on results completed jointly with my advisor Ileana Streinu. Skeleton structures are used in many computational geometry algorithms. Exam- ples include the medial axis, which has applications including shape analysis, optical character recognition, and surface reconstruction; and the Voronoi diagram, which has a wide array of applications including geographic information systems (GIS), point location data structures, motion planning, etc. The straight skeleton, studied in this work, has applications in origami design, polygon interpolation, biomedical imaging, and terrain modeling, to name just a few. Though the straight skeleton has been well studied in the computational geometry viii literature for over 20 years, there still exists a significant gap between the fastest algorithms for constructing it and the known lower bounds. One contribution of this thesis is an efficient algorithm for computing the straight skeleton of a polygon, polygon with holes, or a planar straight-line graph given a secondary structure called the induced motorcycle graph. The universal molecule is a generalization of the straight skeleton to certain con- vex polygons that have a particular relationship to a metric tree. It is used in Robert Lang's seminal TreeMaker method for origami design. Informally, the univer- sal molecule is a subdivision of a polygon (or polygonal sheet of paper) that allows the polygon to be \folded" into a particular 3D shape with certain tree-like properties. One open problem is whether the universal molecule can be rigidly folded: given the initial flat state and a particular desired final \folded" state, is there a continuous motion between the two states that maintains the faces of the subdivision as rigid panels? A partial characterization is known: for a certain measure zero class of uni- versal molecules there always exists such a folding motion. Another open problem is to remove the restriction of the universal molecule to convex polygons. This is of practical importance since the TreeMaker method sometimes fails to produce an out- put on valid input due the convexity restriction and extending the universal molecule to non-convex polygons would allow TreeMaker to work on all valid inputs. One further interesting problem is the development of faster algorithms for computing the universal molecule. In this thesis we make the following contributions to the study of the universal molecule. We first characterize the tree-like family of surfaces that are foldable from universal molecules. In order to do this we define a new family of surfaces we call Lang surfaces and prove that a restricted class of these surfaces are equivalent to the universal molecules. Next, we develop and compare efficient implementations for computing the universal molecule.
Load more

Recommended publications
  • GEOMETRIC FOLDING ALGORITHMS I
    P1: FYX/FYX P2: FYX 0521857570pre CUNY758/Demaine 0 521 81095 7 February 25, 2007 7:5 GEOMETRIC FOLDING ALGORITHMS Folding and unfolding problems have been implicit since Albrecht Dürer in the early 1500s but have only recently been studied in the mathemat- ical literature. Over the past decade, there has been a surge of interest in these problems, with applications ranging from robotics to protein folding. With an emphasis on algorithmic or computational aspects, this comprehensive treatment of the geometry of folding and unfolding presents hundreds of results and more than 60 unsolved “open prob- lems” to spur further research. The authors cover one-dimensional (1D) objects (linkages), 2D objects (paper), and 3D objects (polyhedra). Among the results in Part I is that there is a planar linkage that can trace out any algebraic curve, even “sign your name.” Part II features the “fold-and-cut” algorithm, establishing that any straight-line drawing on paper can be folded so that the com- plete drawing can be cut out with one straight scissors cut. In Part III, readers will see that the “Latin cross” unfolding of a cube can be refolded to 23 different convex polyhedra. Aimed primarily at advanced undergraduate and graduate students in mathematics or computer science, this lavishly illustrated book will fascinate a broad audience, from high school students to researchers. Erik D. Demaine is the Esther and Harold E. Edgerton Professor of Elec- trical Engineering and Computer Science at the Massachusetts Institute of Technology, where he joined the faculty in 2001. He is the recipient of several awards, including a MacArthur Fellowship, a Sloan Fellowship, the Harold E.
    [Show full text]
  • © Cambridge University Press Cambridge
    Cambridge University Press 978-0-521-85757-4 - Geometric Folding Algorithms: Linkages, Origami, Polyhedra Erik D. Demaine and Joseph O’Rourke Index More information Index 1-skeleton, 311, 339 bar, 9 3-Satisfiability, 217, 221 base, see origami, base, 2 α-cone canonical configuration, 151, 152 Bauhaus, 294 α-producible chain, 150, 151 Bellows theorem, 279, 348 δ-perturbation, 115 bending λ order function, 176, 177, 186 machine, xi, 13, 306 antisymmetry condition, 177, 186 pipe, 13, 14 consistency condition, 178, 186 sheet metal, 306 noncrossing condition, 179, 186 beta sheet, 158 time continuity, 174, 183, 187 Bezdek, Daniel, 331 transitivity condition, 178, 186 blooming, continuous, 333, 435 bond angle, 14, 131, 148, 151 Abe’s angle trisection, 286, 287 bond length, 148 accordion, 85, 193, 200, 261 active path, 244, 245, 247–249 cable, 53–55 acyclicity, 108 CAD, see cylindrical algebraic decomposition, 19 additor (Kempe), 32, 34, 35 cage, 21, 92, 93 Alexandrov, Aleksandr D., 348 canonical form, 74, 86, 87, 141, 151 Alexandrov’s theorem, 339, 348, 349, 352, 354, Cauchy’s arm lemma, 72, 133, 143, 145, 342, 343, 368, 381, 393, 419 377 existence, 351 Cauchy’s rigidity theorem, 43, 143, 213, 279, 339, uniqueness, 350 341, 342, 345, 348–350, 354, 403 algebraic motion, 107, 111 Cauchy—Steinitz lemma, 72, 342 algebraic set, 39, 44 chain algebraic variety, 27 4D, 92, 93, 437 alpha helix, 151, 157, 158 abstract, 65, 149, 153, 158 Amato, Nancy, 157 convex, 143, 145 amino acid, 158 cutting, xi, 91, 123 amino acid residue, 14, 148, 151 equilateral, see
    [Show full text]
  • Straight Skeletons by Means of Voronoi Diagrams Under Polyhedral Distance Functions
    CCCG 2014, Halifax, Nova Scotia, August 11{13, 2014 Straight Skeletons by Means of Voronoi Diagrams Under Polyhedral Distance Functions Stefan Huber∗ Oswin Aichholzery Thomas Hackly Birgit Vogtenhubery Abstract work of Klein [10]. In particular, the straight skeleton does not constitute a Voronoi diagram under some ap- We consider the question under which circumstances the propriate distance function. In this sense, straight skele- straight skeleton and the Voronoi diagram of a given in- tons and Voronoi diagrams are in general fundamentally put shape coincide. More precisely, we investigate con- different. For instance, computing straight skeletons of vex distance functions that stem from centrally symmet- polygons with holes is P -complete [9], but computing ric convex polyhedra as unit balls and derive sufficient Voronoi diagrams is not. Straight skeletons can change and necessary conditions for input shapes in order to ob- discontinuously when input vertices are moved [6], but tain identical straight skeletons and Voronoi diagrams the Voronoi diagram does not. with respect to this distance function. Under these circumstances, it is most interesting that This allows us to present a new approach for general- for rectilinear input in general position (that is, a rec- izing straight skeletons by means of Voronoi diagrams, tilinear polygon where no two edges are collinear) the so that the straight skeleton changes continuously when straight skeleton and the Voronoi diagram under L1- vertices of the input shape are dislocated, that is, no dis- metric indeed coincide [2]. Barequet et al. [5] carried continuous changes as in the Euclidean straight skeleton over this fact to rectilinear polyhedra in three-space.
    [Show full text]
  • Continuously Flattening Polyhedra Using Straight Skeletons
    Continuously Flattening Polyhedra Using Straight Skeletons The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation Zachary Abel, Erik D. Demaine, Martin L. Demaine, Jin-ichi Itoh, Anna Lubiw, Chie Nara, and Joseph O'Rourke. 2014. Continuously Flattening Polyhedra Using Straight Skeletons. In Proceedings of the thirtieth annual symposium on Computational geometry (SOCG '14). ACM, New York, NY, USA, Pages 396, 10 pages. As Published http://dx.doi.org/10.1145/2582112.2582171 Publisher Association for Computing Machinery (ACM) Version Author's final manuscript Citable link http://hdl.handle.net/1721.1/99990 Terms of Use Creative Commons Attribution-Noncommercial-Share Alike Detailed Terms http://creativecommons.org/licenses/by-nc-sa/4.0/ Continuously Flattening Polyhedra Using Straight Skeletons Zachary Abel Erik D. Demaine Jin-ichi Itoh MIT Department of Mathematics Martin L. Demaine Faculty of Education 77 Massachusetts Ave. MIT CSAIL Kumamoto University Cambridge, MA 02139, USA 32 Vassar St., Cambridge Kumamoto, 860-8555, Japan [email protected] MA 02139, USA [email protected] {edemaine,mdemaine}@mit.edu Anna Lubiw Chie Nara Joseph O'Rourke Cheriton School of Computer Science Liberal Arts Education Center Department of Computer Science University of Waterloo Aso Campus, Tokai University Smith College Waterloo, ON, N2L 3G1, Canada Aso, Kumamoto, 869-1404, Japan Northampton, MA 01063, USA [email protected] [email protected] [email protected] ABSTRACT 1. Introduction We prove that a surprisingly simple algorithm folds the sur- When you step on a cardboard cereal box to flatten it, some face of every convex polyhedron, in any dimension, into a natural folds appear that are like the folds of a paper bag| flat folding by a continuous motion, while preserving in- each narrow side of the box has a fold down the middle trinsic distances and avoiding crossings.
    [Show full text]
  • Continuously Flattening Polyhedra Using Straight Skeletons
    Continuously Flattening Polyhedra Using Straight Skeletons Zachary Abel Erik D. Demaine Jin-ichi Itoh MIT Department of Mathematics Martin L. Demaine Faculty of Education 77 Massachusetts Ave. MIT CSAIL Kumamoto University Cambridge, MA 02139, USA 32 Vassar St., Cambridge Kumamoto, 860-8555, Japan [email protected] MA 02139, USA [email protected] {edemaine,mdemaine}@mit.edu Anna Lubiw Chie Nara Joseph O'Rourke Cheriton School of Computer Science Liberal Arts Education Center Department of Computer Science University of Waterloo Aso Campus, Tokai University Smith College Waterloo, ON, N2L 3G1, Canada Aso, Kumamoto, 869-1404, Japan Northampton, MA 01063, USA [email protected] [email protected] [email protected] ABSTRACT 1. Introduction We prove that a surprisingly simple algorithm folds the sur- When you step on a cardboard cereal box to flatten it, some face of every convex polyhedron, in any dimension, into a natural folds appear that are like the folds of a paper bag| flat folding by a continuous motion, while preserving in- each narrow side of the box has a fold down the middle trinsic distances and avoiding crossings. The flattening re- joining a triangle at the bottom. See Figure 1. To cap- spects the straight-skeleton gluing, meaning that points of ture these natural folds for any 3D polyhedron, Demaine et the polyhedron touched by a common ball inside the poly- al. [15] examined the mapping (or \gluing") of the surface hedron come into contact in the flat folding, which answers induced by the flattening. Imagine piercing the flat fold- an open question in the book Geometric Folding Algorithms.
    [Show full text]
  • Weighted Skeletons and Fixed-Share Decomposition
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Computational Geometry 40 (2008) 93–101 www.elsevier.com/locate/comgeo Weighted skeletons and fixed-share decomposition ✩ Franz Aurenhammer Institute for Theoretical Computer Science, University of Technology, Graz, Austria Received 19 July 2006; accepted 28 August 2007 Available online 16 October 2007 Communicated by T. Asano Abstract We introduce the concept of weighted skeleton of a polygon and present various decomposition and optimality results for this skeletal structure when the underlying polygon is convex. © 2007 Elsevier B.V. All rights reserved. Keywords: Polygon decomposition; Straight skeleton; Optimal partition 1. Introduction Polygon decomposition is a major issue in computational geometry. Its relevance stems from breaking complex shapes (modeled by polygons) into sub-polygons that are easier to manipulate, and from subdividing areas of interest into parts that satisfy certain containment requirements and/or optimality properties. We refer to [13] for a nice survey on this topic. In particular, a rich literature exists on decomposition into convex polygons. Convex decompositions are most natural in some sense. They have many applications and can be computed efficiently; see e.g. [7,14,16]. In this paper, we focus on the problem of decomposing a convex polygon such that predefined constraints are met. More specifically, the goal is to partition a given convex n-gon P into n convex parts, each part being based on a single side of P and containing a specified ‘share’ of P . The share may relate, for example, to the spanned area, to the number of contained points from a given point set, or to the total edge length covered from a given set of curves.
    [Show full text]
  • Straight Skeletons of Three-Dimensional Polyhedra 1
    Straight Skeletons of Three-Dimensional Polyhedra Gill Barequet1, David Eppstein2, Michael T. Goodrich2, and Amir Vaxman1 1 Dept. of Computer Science Technion—Israel Institute of Technology {barequet,avaxman}(at)cs.technion.ac.il 2 Computer Science Department University of California, Irvine {eppstein,goodrich}(at)ics.uci.edu Abstract. This paper studies the straight skeleton of polyhedra in three dimensions. We first address voxel-based polyhedra (polycubes), formed as the union of a collection of cubical (axis-aligned) voxels. We analyze the ways in which the skeleton may intersect each voxel of the polyhedron, and show that the skeleton may be constructed by a simple voxel-sweeping algorithm taking constant time per voxel. In addition, we describe a more complex algo- rithm for straight skeletons of voxel-based polyhedra, which takes time proportional to the area of the surfaces of the straight skeleton rather than the volume of the polyhedron. We also consider more general polyhedra with axis- parallel edges and faces, and show that any n-vertex polyhedron of this type has a straight skeleton with O(n2) fea- tures. We provide algorithms for constructing the straight skeleton, with running time O(min(n2 logn,k logO(1) n)) where k is the output complexity. Next, we discuss the straight skeleton of a general nonconvex polyhedron. We show that it has an ambiguity issue, and suggest a consistent method to resolve it. We prove that the straight skeleton of a general polyhedron has a superquadratic complexity in the worst case. Finally, we report on an implementation of a simple algorithm for the general case.
    [Show full text]
  • A Faster Algorithm for Computing Straight Skeletons Thesis by Liam
    A Faster Algorithm for Computing Straight Skeletons Thesis by Liam Mencel In Partial Fulfilment of the Requirements For the Degree of Masters of Science King Abdullah University of Science and Technology, Thuwal, Kingdom of Saudi Arabia May, 2014 2 The thesis of Liam Mencel is approved by the examination committee. Committee Chairperson: Antoine Vigneron Committee Member: Mikhail Moshkov Committee Member: Markus Hadwiger 3 Copyright ©2014 Liam Mencel All Rights Reserved 4 ABSTRACT A Faster Algorithm for Computing Straight Skeletons Liam Mencel We present a new algorithm for computing the straight skeleton of a polygon. For a polygon with n vertices, among which r are reflex vertices, we give a de- terministic algorithm that reduces the straight skeleton computation to a motor- cycle graph computation in O(n(log n) log r) time. It improves on the previously best known algorithm for this reduction, which is randomised, and runs in expected O(nph + 1 log2 n) time for a polygon with h holes. Using known motorcycle graph algorithms, our result yields improved time bounds for computing straight skeletons. In particular, we can compute the straight skeleton of a non-degenerate polygon in O(n(log n) log r + r4=3+") time for any " > 0. On degenerate input, our time bound increases to O(n(log n) log r + r17=11+"). 5 ACKNOWLEDGEMENTS I would like to express gratitude towards my supervisor, Professor Antoine Vigneron for his expertise and support over the past year, in particular for the significant time he put into handling the formatting and submission of our paper. I also wish to thank Professor Siu-Wing Cheng, who helped me settle into Hong Kong over the summer period and supported me in the early stages of this research during that time.
    [Show full text]
  • What Makes a Tree a Straight Skeleton?∗
    CCCG 2012, Charlottetown, P.E.I., August 8{10, 2012 What makes a Tree a Straight Skeleton?∗ Oswin Aichholzery Howard Chengz Satyan L. Devadossx Thomas Hackly Stefan Huber{ Brian Lix Andrej Risteskik Abstract Let G be a cycle-free connected straight-line graph with predefined edge lengths and fixed order of incident edges around each vertex. We address the problem of decid- ing whether there exists a simple polygon P such that G is the straight skeleton of P . We show that for given e G such a polygon P might not exist, and if it exists it f(e) might not be unique. For the later case we give an ex- ample with exponentially many suitable polygons. For small star graphs and caterpillars we show necessary and sufficient conditions for constructing P . Figure 1: The straight skeleton (thin) of a simple poly- Considering only the topology of the tree, that is, gon (bold) is defined by the propagating wavefront (dot- ignoring the length of the edges, we show that any tree ted). whose inner vertices have degree at least 3 is isomorphic to the straight skeleton of a suitable convex polygon. wavefront edge and splits the wavefront into pieces, see 1 Introduction Figure 1. The straight skeleton (P ) is defined as the set of loci that are traced out byS the wavefront vertices The straight skeleton (P ) of a simple polygon P is a and it partitions P into polygonal faces. Each face f(e) skeleton structure like theS Voronoi diagram, but consists belongs to a unique edge e of P .
    [Show full text]
  • Prove That the Dihedral Angles of a Regular Polyhedron Are Identical
    December 13, 2010 Time: 06:48pm fm.tex Discrete and Computational GEOMETRY This page intentionally left blank December 13, 2010 Time: 06:48pm fm.tex Discrete and Computational GEOMETRY SATYAN L. DEVADOSS and JOSEPH O’ROURKE PRINCETON UNIVERSITY PRESS PRINCETON AND OXFORD iii December 13, 2010 Time: 06:48pm fm.tex Copyright c 2011 by Princeton University Press Requests for permission to reproduce material from this work should be sent to Permissions, Princeton University Press Published by Princeton University Press, 41 William Street, Princeton, New Jersey 08540 In the United Kingdom: Princeton University Press, 6 Oxford Street, Woodstock, Oxfordshire OX20 1TW All Rights Reserved Library of Congress Cataloging-in-Publication Data Devadoss, Satyan L., 1973– Discrete and computational geometry / Satyan L. Devadoss and Joseph O’Rourke. p. cm. Includes index. ISBN 978-0-691-14553-2 (hardcover : alk. paper) 1. Geometry–Data processing. I. O’Rourke, Joseph. II. Title. QA448.D38D48 2011 516.00285–dc22 2010044434 British Library Cataloging-in-Publication Data is available This book has been composed in Sabon Princeton University Press books are printed on acid-free paper, and meet the guidelines for permanence and durability of the Committee on Production Guidelines for Book Longevity of the Council on Library Resources Typeset by S R Nova Pvt Ltd, Bangalore, India press.princeton.edu Printed in China 10987654321 iv December 13, 2010 Time: 06:48pm fm.tex SLD Dedication. To my family, for their unconditional love of this ragamuffin. JOR Dedication.
    [Show full text]
  • On Triangulation Axes of Polygons∗
    On Triangulation Axes of Polygons∗ Wolfgang Aigner† Franz Aurenhammer† Bert J¨uttler‡ Abstract We propose the triangulation axis as an alternative skeletal structure for a simple polygon P . This axis is a straight-line tree that can be interpreted as an anisotropic medial axis of P , where inscribed disks are line segments or triangles. The underlying trian- gulation that specifies the anisotropy can be varied, to adapt the axis so as to reflect predominant geometri- cal and topological features of P . Triangulation axes typically have much fewer edges and branchings than Figure 1: A triangulation axis of a simple polygon. the Euclidean medial axis or the straight skeleton of P . Still, they retain important properties, as for example the reconstructability of P from its skeleton. Triangulation axes can be computed from their defin- of P , or for the sake of stability with respect to slight ing triangulations in O(n) time. We investigate the boundary changes of P . Several attempts have been effect of using several optimal triangulations for P . In made to adapt and prune the medial axis and the particular, careful edge flipping in the constrained De- straight skeleton accordingly; see Attali et al. [6] and launay triangulation leads, in O(n log n) overall time, Siddiqi and Pizer [16], and Tanase and Veltkamp [17], to an axis competitive to ‘high quality axes’ requiring respectively. n3 Θ( ) time for optimization via dynamic program- In the present note we propose a different idea, ming. namely, of putting some anisotropy on the polygon P . Distances are measured differently at different lo- Keywords: Polygon; medial axis; anisotropic dis- cations within P , by varying the shape of the in- tance; triangulation; edge flipping scribed disks.
    [Show full text]
  • Straight Skeletons of Three-Dimensional Polyhedra
    Straight Skeletons of Three-Dimensional Polyhedra Gill Barequet1, David Eppstein2, Michael T. Goodrich2, and Amir Vaxman1 1 Dept. of Computer Science Technion—Israel Institute of Technology fbarequet,avaxmang(at)cs.technion.ac.il 2 Computer Science Department University of California, Irvine feppstein,goodrichg(at)ics.uci.edu Abstract. This paper studies the straight skeleton of polyhedra in three dimensions. We first address voxel-based polyhedra (polycubes), formed as the union of a collection of cubical (axis-aligned) voxels. We analyze the ways in which the skeleton may intersect each voxel of the polyhedron, and show that the skeleton may be constructed by a simple voxel-sweeping algorithm taking constant time per voxel. In addition, we describe a more complex algo- rithm for straight skeletons of voxel-based polyhedra, which takes time proportional to the area of the surfaces of the straight skeleton rather than the volume of the polyhedron. We also consider more general polyhedra with axis- parallel edges and faces, and show that any n-vertex polyhedron of this type has a straight skeleton with O(n2) fea- tures. We provide algorithms for constructing the straight skeleton, with running time O(min(n2 logn;klogO(1) n)) where k is the output complexity. Next, we discuss the straight skeleton of a general nonconvex polyhedron. We show that it has an ambiguity issue, and suggest a consistent method to resolve it. We prove that the straight skeleton of a general polyhedron has a superquadratic complexity in the worst case. Finally, we report on an implementation of a simple algorithm for the general case.
    [Show full text]