SHORTEST PATH AMIDST DISC OBSTACLES IS COMPUTABLE

DOI10.1142/S0218195906002191zbMath1114.65016OpenAlexW2148847526MaRDI QIDQ3422224

Hyungju Park, Sung Woo Choi, Ee-Chien Chang, Chee-Keng Yap, Do Yong Kwon

Publication date: 9 February 2007

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195906002191

zbMATH Keywords

shortest pathexact geometric computationreal RAM model, Turing model, transcendental number theory

Mathematics Subject Classification ID

Related Items (2)

A Near-Optimal Algorithm for Shortest Paths Among Curved Obstacles in the Plane ⋮ Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics

Cites Work

• How to recognize zero?
• On angles whose squared trigonometric functions are rational
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: SHORTEST PATH AMIDST DISC OBSTACLES IS COMPUTABLE