Approximate Euclidean shortest path in 3-space

Joonsoo Choi, Jurgen Sellen, Chee Keng Yap

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Papadimitriou's approximation approach to the Euclidean shortest path (ESP) problem in 3-space is revisited. As this problem is NP-hard, his approach represents an important step towards practical algorithms. Unfortunately, there are non-trivial gaps in the original description. Besides giving a complete treatment, we also give an alternative to his subdivision method which has some nice properties. Among the tools needed are root-separation bounds and non-trivial applications of Brent's complexity bounds on evaluation of elementary functions using floating point numbers.

Original languageEnglish (US)
Title of host publicationProceedings of the Annual Symposium on Computational Geometry
Editors Anon
PublisherPubl by ACM
Pages41-48
Number of pages8
ISBN (Print)0897916484
StatePublished - Jan 1 1994
EventProceedings of the 10th Annual Symposium on Computational Geometry - Stony Brook, NY, USA
Duration: Jun 6 1994Jun 8 1994

Publication series

NameProceedings of the Annual Symposium on Computational Geometry

Other

OtherProceedings of the 10th Annual Symposium on Computational Geometry
CityStony Brook, NY, USA
Period6/6/946/8/94

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Computational Mathematics

Fingerprint Dive into the research topics of 'Approximate Euclidean shortest path in 3-space'. Together they form a unique fingerprint.

  • Cite this

    Choi, J., Sellen, J., & Yap, C. K. (1994). Approximate Euclidean shortest path in 3-space. In Anon (Ed.), Proceedings of the Annual Symposium on Computational Geometry (pp. 41-48). (Proceedings of the Annual Symposium on Computational Geometry). Publ by ACM.