Pages that link to "Item:Q5897052"
From MaRDI portal
The following pages link to An Algorithm to Construct Greedy Drawings of Triangulations (Q5897052):
Displayed 25 items.
- On \(k\)-greedy routing algorithms (Q283869) (← links)
- Nearly optimal monotone drawing of trees (Q344763) (← links)
- A simple routing algorithm based on Schnyder coordinates (Q391094) (← links)
- On succinct greedy drawings of plane triangulations and 3-connected plane graphs (Q476437) (← links)
- Monotone drawings of graphs with few directions (Q506161) (← links)
- Angle-monotonicity of Delaunay triangulation (Q827337) (← links)
- (Weakly) self-approaching geometric graphs and spanners (Q1631774) (← links)
- On the area requirements of planar greedy drawings of triconnected planar graphs (Q2019489) (← links)
- Local routing in sparse and lightweight geometric graphs (Q2134745) (← links)
- On planar greedy drawings of 3-connected planar graphs (Q2283114) (← links)
- Every Schnyder drawing is a greedy embedding (Q2286747) (← links)
- Monotone drawings of graphs with fixed embedding (Q2346955) (← links)
- Euclidean greedy drawings of trees (Q2411820) (← links)
- Succinct strictly convex greedy drawing of 3-connected plane graphs (Q2445876) (← links)
- Succinct greedy drawings do not always exist (Q2894243) (← links)
- Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition (Q2961543) (← links)
- Compact Monotone Drawing of Trees (Q3196406) (← links)
- Monotone Drawings of Graphs with Fixed Embedding (Q3223970) (← links)
- Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles (Q3451755) (← links)
- Monotone Drawings of 3-Connected Plane Graphs (Q3452836) (← links)
- Optimal Monotone Drawings of Trees (Q5351867) (← links)
- (Q5743479) (← links)
- Greedy rectilinear drawings (Q5915947) (← links)
- Drawing graphs as spanners (Q5918794) (← links)
- Greedy rectilinear drawings (Q5919678) (← links)