Approximate Euclidean shortest path in 3-space

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 1994, Pages 41-48

  Choi, Joonsoo ^a   Sellen, Jurgen ^a   Yap, Chee Keng ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; CRITICAL PATH ANALYSIS; DIGITAL ARITHMETIC; DIGITAL CIRCUITS; MATHEMATICAL MODELS; POLYNOMIALS; THREE DIMENSIONAL; TURING MACHINES;

ALGEBRAIC FRAMEWORK; BIT FRAMEWORK; BRENTS COMPLEXITY BOUNDS; EUCLIDEAN SHORTEST PATH; ROOT SEPARATION BOUNDS;

GEOMETRY;

EID: 0028022432     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/177424.177501     Document Type: Conference Paper

References (9)