Near-Shortest Path Planning on a Quadratic Surface With <inline-formula> <tex-math notation="LaTeX">$O(n\log n)$ </tex-math></inline-formula> Time

Near-Shortest Path Planning on a Quadratic Surface With - Time | IEEE Journals & Magazine | IEEE Xplore