SHORTEST PATH AMIDST DISC OBSTACLES IS COMPUTABLE

DOI10.1142/S0218195906002191MaRDI QIDQ3422224zbMATH OpenOpenAlexFDO

Authors Sung Woo Choi, Hyungju Park, Ee-Chien Chang, Do Yong Kwon, Chee K. Yap

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

exact geometric computationreal RAM model, Turing model, transcendental number theoryshortest path

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• Shortest path amidst disc obstacles is computable
• Computational Science and Its Applications – ICCSA 2004
• Computing shortest paths among curved obstacles in the plane
• Computing shortest paths among curved obstacles in the plane
• SHORTEST PATHS AMONG OBSTACLES IN THE PLANE
• Computing shortest paths in the plane with removable obstacles
• Computing shortest paths amid pseudodisks
• Computing shortest paths amid convex pseudodisks
• Shortest paths in the plane with polygonal obstacles
• Shortest paths in the plane with convex polygonal obstacles

Cites work

• How to recognize zero?
• scientific article; zbMATH DE number 996424 (Why is no real title available?)
• scientific article; zbMATH DE number 3783110 (Why is no real title available?)
• scientific article; zbMATH DE number 1446863 (Why is no real title available?)
• scientific article; zbMATH DE number 3232021 (Why is no real title available?)
• On angles whose squared trigonometric functions are rational

Cited in

(4)

• Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics
• A near-optimal algorithm for shortest paths among curved obstacles in the plane
• Shortest path amidst disc obstacles is computable
• Computational Science and Its Applications – ICCSA 2004

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3422224)