• DocumentCode
    1403522
  • Title

    On some link distance problems in a simple polygon

  • Author

    Suri, Subhash

  • Author_Institution
    Johns Hopkins Univ., Baltimore, MD, USA
  • Volume
    6
  • Issue
    1
  • fYear
    1990
  • fDate
    2/1/1990 12:00:00 AM
  • Firstpage
    108
  • Lastpage
    113
  • Abstract
    A technique is presented for preprocessing a simple polygon to answer link distance queries. The preprocessing requires linear time and the time to triangulate the polygon, and it uses linear storage. As an application of the technique, optimal algorithms for several fundamental link distance problems are derived
  • Keywords
    computational complexity; computational geometry; computational complexity; computational geometry; link distance problems; polygon; triangulation; Microwave communication; Motion planning; Navigation; Path planning; Repeaters; Robots; Shortest path problem; Transmitters; Tree graphs; Turning;
  • fLanguage
    English
  • Journal_Title
    Robotics and Automation, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1042-296X
  • Type

    jour

  • DOI
    10.1109/70.88124
  • Filename
    88124
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1403522