The following pages link to Self-approaching curves (Q4238779):
Displaying 27 items.
- Tight analysis of a self-approaching strategy for the online kernel-search problem (Q294606) (← links)
- Bounding regions to plane steepest descent curves of quasiconvex families (Q670243) (← links)
- On the plane angle-monotone graphs (Q824336) (← links)
- Angle-monotonicity of Delaunay triangulation (Q827337) (← links)
- Rectifiability property for plane paths and descent curves (Q831376) (← links)
- Geometric dilation of closed planar curves: New lower bounds (Q883237) (← links)
- Geometric dilation of closed curves in normed planes (Q1005328) (← links)
- A fast algorithm for approximating the detour of a polygonal chain. (Q1428113) (← links)
- (Weakly) self-approaching geometric graphs and spanners (Q1631774) (← links)
- Continuous Yao graphs (Q1693326) (← links)
- Self-approaching paths in simple polygons (Q2173458) (← links)
- Gathering by repulsion (Q2206731) (← links)
- Euclidean greedy drawings of trees (Q2411820) (← links)
- Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D (Q2482197) (← links)
- Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition (Q2961543) (← links)
- Self-Curvature Curves (Q3103325) (← links)
- COMPUTING THE STRETCH FACTOR AND MAXIMUM DETOUR OF PATHS, TREES, AND CYCLES IN THE NORMED SPACE (Q4650090) (← links)
- On the Stretch Factor of Polygonal Chains (Q5001847) (← links)
- (Q5092418) (← links)
- Gathering by Repulsion. (Q5116477) (← links)
- Plane <i>R</i>-curves and their steepest descent properties I (Q5197984) (← links)
- Rooted Uniform Monotone Minimum Spanning Trees (Q5283385) (← links)
- Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions (Q5370573) (← links)
- Greedy rectilinear drawings (Q5915947) (← links)
- Drawing graphs as spanners (Q5918794) (← links)
- Greedy rectilinear drawings (Q5919678) (← links)
- Generalized self-approaching curves (Q5929319) (← links)
