Self-approaching curves

From MaRDI portal
Publication:4238779





An oriented curve \(C\) in the plane is called self-approaching, iff for any three consecutive points \(a, b, c\) in oriented order on \(C\), the inequality \(d(a, c)\geqslant d(b, c)\) holds. In other words, while walking along a self-approaching curve, one gets closer to each point of the curve that has not yet been passed. The authors study the following question: Is this property strong enough to ensure that the detour a self-approaching curve makes while running from \(a\) to \(b\), that is, the ratio of the length of the connecting curve segment over the Euclidean distance from \(a\) to \(b\), can be bounded, independently of \(a, b\), and the curve \(C\)? The authors prove that the length of a self-approaching curve cannot exceed the perimeter of its convex hull. A self-approaching curve is circumscribed by a simple, closed convex curve whose length can be easily computed. This yields an upper bound for the perimeter of the convex hull. It is demonstrated that the resulting bound of 5.3331\dots{} is in fact the sharp upper bound for the detour of self-approaching curves.











This page was built for publication: Self-approaching curves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4238779)