arXiv · math/0301338
Total curvature and spiralling shortest paths
Abstract
This paper gives a partial confirmation of a conjecture of P. Agarwal, S. Har-Peled, M. Sharir, and K. Varadarajan that the total curvature of a shortest path on the boundary of a convex polyhedron in the 3-dimensional Euclidean space cannot be arbitrarily large. It is shown here that the conjecture holds for a class of polytopes for which the ratio of the radii of the circumscribed and inscribed ball is bounded. On the other hand, an example is constructed to show that the total curvature of a shortest path on the boundary of a convex polyhedron can exceed 2 π. Another example shows that the spiraling number of a shortest path on the boundary of a convex polyhedron can be arbitrarily large.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Imre Barany, Krystyna Kuperberg, Tudor Zamfirescu. 2003-01-28. Total curvature and spiralling shortest paths. https://arxiv.org/abs/math/0301338
Cite the original work for its findings. Save a collection to share your selection of sources.