Total curvature and spiralling shortest paths

dc.creatorBarany, Imre
dc.creatorKuperberg, Krystyna
dc.creatorZamfirescu, Tudor
dc.date2003-01-28
dc.date.accessioned2026-07-07T04:54:45Z
dc.date.available2026-07-07T04:54:45Z
dc.descriptionThis 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.
dc.description9 pages, 6 figures (to appear in Discrete & Computational Geometry)
dc.identifierhttps://arxiv.org/abs/math/0301338
dc.identifierhttp://arxiv.org/abs/math/0301338
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/66380
dc.subjectMetric Geometry
dc.subject52A (primary), 53A (secondary)
dc.titleTotal curvature and spiralling shortest paths
dc.typetext

Files

Collections