• DocumentCode
    479948
  • Title

    Diagonal-Flip Distance Algorithms of Three Type Triangulations

  • Author

    Wang, Deqiang ; Wang, Xian ; Li, Shaoxi ; Zhang, Shaofang

  • Author_Institution
    Inst. of Nautical Sci. & Technol., Dalian Maritime Univ., Dalian
  • Volume
    2
  • fYear
    2008
  • fDate
    12-14 Dec. 2008
  • Firstpage
    980
  • Lastpage
    983
  • Abstract
    In this paper we study the diagonal flipping problem in three special type triangulations of n (n > 7) vertex convex polygons (and rotations in three type binary trees). By labelling vertices of the triangulations, we propose six linear time algorithms for computing diagonal-flip distances in these three type triangulations (and rotation distance in these three type binary trees).
  • Keywords
    computational complexity; computational geometry; trees (mathematics); binary tree; diagonal-flip distance algorithm; linear time algorithm; rotation distance; three special type triangulation; vertex convex polygon; Binary trees; Clocks; Computer science; Labeling; Polynomials; Software algorithms; Software engineering; Upper bound; binary tree; diagonal-flip distance; triangulation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Science and Software Engineering, 2008 International Conference on
  • Conference_Location
    Wuhan, Hubei
  • Print_ISBN
    978-0-7695-3336-0
  • Type

    conf

  • DOI
    10.1109/CSSE.2008.337
  • Filename
    4722214
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=479948