• DocumentCode
    1414933
  • Title

    Analysis for shortest path algorithm on convex polytope in E3

  • Author

    Lee, Young Soo ; Lee, Eun-seok

  • Author_Institution
    Sch. of Electr. & Comput. Eng., Sungkyunkwan Univ., Suwon, South Korea
  • Volume
    36
  • Issue
    22
  • fYear
    2000
  • fDate
    10/26/2000 12:00:00 AM
  • Firstpage
    1895
  • Lastpage
    1897
  • Abstract
    Hershberger and Suri [1993] proposed an extremely simple approximation scheme for computing shortest paths on the surface of a convex polytope in three dimensions in 1998. Given a convex polytope P with n vertices and two points p, q on its surface, let d,(p, q) denote the shortest path distance between p and q on the surface of P. Their algorithm, ShortestPath, produces a path of length at most 2dp(p, q) in time O(n). This algorithm is revised, and achieves a ratio of 1.786
  • Keywords
    computational geometry; ShortestPath; approximation scheme; computational geometry; convex polytope; shortest path algorithm;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

  • DOI
    10.1049/el:20001317
  • Filename
    888461
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1414933