Self-approaching curves
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.
- Generalized self-approaching curves
- Self-Curvature Curves
- Self-parallel curves.
- Self-overlapping curves revisited
- Self-parallel and transnormal curves
- Self-convexity and curvature
- Self-crossing geodesics
- Self-intersecting filling curves on surfaces
- Self-intersections of curves on surfaces
- Self-linked curve singularities
- Geometric dilation of closed curves in normed planes
- A fast algorithm for approximating the detour of a polygonal chain.
- (Weakly) self-approaching geometric graphs and spanners
- Continuous Yao graphs
- Self-approaching paths in simple polygons
- Gathering by repulsion
- Euclidean greedy drawings of trees
- Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D
- Tight analysis of a self-approaching strategy for the online kernel-search problem
- Gabriel triangulations and angle-monotone graphs: local routing and recognition
- Self-Curvature Curves
- Self-approaching paths in simple polygons
- Computing the stretch factor and maximum detour of paths, trees, and cycles in the normed space
- On the stretch factor of polygonal chains
- On the stretch factor of polygonal chains
- Gathering by repulsion
- Plane R-curves and their steepest descent properties I
- Rooted Uniform Monotone Minimum Spanning Trees
- Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions
- Greedy rectilinear drawings
- Drawing graphs as spanners
- Greedy rectilinear drawings
- Generalized self-approaching curves
- Bounding regions to plane steepest descent curves of quasiconvex families
- On the plane angle-monotone graphs
- Angle-monotonicity of Delaunay triangulation
- Rectifiability property for plane paths and descent curves
- Geometric dilation of closed planar curves: New lower bounds
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)