Self-approaching curves
From MaRDI portal
Publication:4238779
Recommendations
- 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
Cited in
(28)- 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)
