The following pages link to Self-approaching Graphs (Q4912208):
Displaying 19 items.
- Monotone drawings of graphs with few directions (Q506161) (← links)
- On the plane angle-monotone graphs (Q824336) (← links)
- Angle-monotonicity of Delaunay triangulation (Q827337) (← links)
- (Weakly) self-approaching geometric graphs and spanners (Q1631774) (← links)
- Continuous Yao graphs (Q1693326) (← links)
- On the area requirements of planar greedy drawings of triconnected planar graphs (Q2019489) (← links)
- Self-approaching paths in simple polygons (Q2173458) (← links)
- On planar greedy drawings of 3-connected planar graphs (Q2283114) (← links)
- Euclidean greedy drawings of trees (Q2411820) (← links)
- Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition (Q2961543) (← links)
- (Q4294577) (← links)
- On the Stretch Factor of Polygonal Chains (Q5001847) (← links)
- (Q5092418) (← links)
- Rooted Uniform Monotone Minimum Spanning Trees (Q5283385) (← links)
- Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions (Q5370573) (← links)
- Construction and Local Routing for Angle-Monotone Graphs (Q5377357) (← links)
- Greedy rectilinear drawings (Q5915947) (← links)
- Drawing graphs as spanners (Q5918794) (← links)
- Greedy rectilinear drawings (Q5919678) (← links)