We show that cutting shortest paths from every vertex of a convex polyhedron to a simple closed quasigeodesic, and cutting all but a short segment of the quasigeodesic, unfolds th...
We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and let sort(N) denote...
This paper presents a robust method to solve the two coupled problems: ground layer detection and vehicle egomotion estimation, which appear in visual navigation. We virtually rot...