Approximate Euclidean shortest path in 3-space

Joonsoo Choi, Jurgen Sellen, Chee 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 - 1994
EventProceedings of the 10th Annual Symposium on Computational Geometry - Stony Brook, NY, USA
Duration: Jun 6 1994Jun 8 1994

Other

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

Fingerprint

Shortest path
Computational complexity
Euclidean
Elementary Functions
Shortest Path Problem
Floating point
Subdivision
NP-complete problem
Roots
Alternatives
Evaluation
Approximation

ASJC Scopus subject areas

  • Chemical Health and Safety
  • Software
  • Safety, Risk, Reliability and Quality
  • Geometry and Topology

Cite this

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

Approximate Euclidean shortest path in 3-space. / Choi, Joonsoo; Sellen, Jurgen; Yap, Chee.

Proceedings of the Annual Symposium on Computational Geometry. ed. / Anon. Publ by ACM, 1994. p. 41-48.

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

Choi, J, Sellen, J & Yap, C 1994, Approximate Euclidean shortest path in 3-space. in Anon (ed.), Proceedings of the Annual Symposium on Computational Geometry. Publ by ACM, pp. 41-48, Proceedings of the 10th Annual Symposium on Computational Geometry, Stony Brook, NY, USA, 6/6/94.
Choi J, Sellen J, Yap C. Approximate Euclidean shortest path in 3-space. In Anon, editor, Proceedings of the Annual Symposium on Computational Geometry. Publ by ACM. 1994. p. 41-48
Choi, Joonsoo ; Sellen, Jurgen ; Yap, Chee. / Approximate Euclidean shortest path in 3-space. Proceedings of the Annual Symposium on Computational Geometry. editor / Anon. Publ by ACM, 1994. pp. 41-48
@inproceedings{a0c1b6984469465bae0211fdda3d2ec4,
title = "Approximate Euclidean shortest path in 3-space",
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.",
author = "Joonsoo Choi and Jurgen Sellen and Chee Yap",
year = "1994",
language = "English (US)",
isbn = "0897916484",
pages = "41--48",
editor = "Anon",
booktitle = "Proceedings of the Annual Symposium on Computational Geometry",
publisher = "Publ by ACM",

}

TY - GEN

T1 - Approximate Euclidean shortest path in 3-space

AU - Choi, Joonsoo

AU - Sellen, Jurgen

AU - Yap, Chee

PY - 1994

Y1 - 1994

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0028022432&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028022432&partnerID=8YFLogxK

M3 - Conference contribution

SN - 0897916484

SP - 41

EP - 48

BT - Proceedings of the Annual Symposium on Computational Geometry

A2 - Anon, null

PB - Publ by ACM

ER -