Self-approaching curves

DOI10.1017/S0305004198003016zbMath0923.51017OpenAlexW2117975936MaRDI QIDQ4238779

Rolf Klein, Christian Icking, Elmar Langetepe

Publication date: 6 October 1999

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0305004198003016

zbMATH Keywords

self-approaching curve

Mathematics Subject Classification ID

Directly differentiable curves in geometric order structures (51L10)

Related Items

On the plane angle-monotone graphs, Angle-monotonicity of Delaunay triangulation, Rooted Uniform Monotone Minimum Spanning Trees, Rectifiability property for plane paths and descent curves, Tight analysis of a self-approaching strategy for the online kernel-search problem, (Weakly) self-approaching geometric graphs and spanners, Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions, Self-approaching paths in simple polygons, Euclidean greedy drawings of trees, Geometric dilation of closed planar curves: New lower bounds, Continuous Yao graphs, Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition, Gathering by repulsion, A fast algorithm for approximating the detour of a polygonal chain., Bounding regions to plane steepest descent curves of quasiconvex families, COMPUTING THE STRETCH FACTOR AND MAXIMUM DETOUR OF PATHS, TREES, AND CYCLES IN THE NORMED SPACE, Generalized self-approaching curves, Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D, Unnamed Item, Greedy rectilinear drawings, Plane R-curves and their steepest descent properties I, Greedy rectilinear drawings, Geometric dilation of closed curves in normed planes, Drawing graphs as spanners, Gathering by Repulsion., On the Stretch Factor of Polygonal Chains