Shortest path amidst disc obstacles is computable
From MaRDI portal
Publication:5370603
DOI10.1145/1064092.1064112zbMath1387.68248OpenAlexW1994987092MaRDI QIDQ5370603
Sung Woo Choi, Hyungju Park, Ee-Chien Chang, Chee-Keng Yap, Do Yong Kwon
Publication date: 20 October 2017
Published in: Proceedings of the twenty-first annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1064092.1064112
shortest pathexponential complexityexact geometric computationrobust numerical algorithmsreal RAM modeldisc obstaclesguaranteed precision computation
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
An O(n 2logn) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane ⋮ On soft predicates in subdivision motion planning
This page was built for publication: Shortest path amidst disc obstacles is computable
