In this paper we propose algorithms for solving a variety of geometric optimization problems on a stream of points in R2 or R3 . These problems include various extent measures (e.g...
Pankaj K. Agarwal, Shankar Krishnan, Nabil H. Must...
We consider the problem of finding a shortest cycle (freely) homotopic to a given simple cycle on a compact, orientable surface. For this purpose, we use a pants decomposition of...
— Characterizing optimal paths for mobile robots is an interesting, important, and challenging endeavor. Not only they are interesting with respect to the optimized criteria, but...
Hamid Reza Chitsaz, Steven M. LaValle, Devin J. Ba...
— Computing optimal paths for mobile robots is an interesting and important problem. This paper presents a method to compute the shortest path for a differential-drive mobile rob...
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
David Eppstein, Michael T. Goodrich, Darren Strash