The following pages link to (Q5365133):
Displaying 11 items.
- Greedy routing via embedding graphs onto semi-metric spaces (Q388089) (← links)
- A simple routing algorithm based on Schnyder coordinates (Q391094) (← 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)
- Every Schnyder drawing is a greedy embedding (Q2286747) (← links)
- Succinct strictly convex greedy drawing of 3-connected plane graphs (Q2445876) (← links)
- Succinct greedy drawings do not always exist (Q2894243) (← links)
- Greedy Routing via Embedding Graphs onto Semi-metric Spaces (Q3004656) (← links)
- (Q5743479) (← links)
- Greedy rectilinear drawings (Q5915947) (← links)