The following pages link to Greedy drawings of triangulations (Q848683):
Displaying 24 items.
- On \(k\)-greedy routing algorithms (Q283869) (← 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)
- On approximation behavior of the greedy triangulation for convex polygons (Q1098295) (← links)
- Morphing Schnyder drawings of planar triangulations (Q1739203) (← links)
- Acyclic colorings of graph subdivisions revisited (Q1932357) (← 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)
- Balanced Schnyder woods for planar triangulations: an experimental study with applications to graph drawing and graph separators (Q2206836) (← links)
- On planar greedy drawings of 3-connected planar graphs (Q2283114) (← links)
- Every Schnyder drawing is a greedy embedding (Q2286747) (← links)
- Euclidean greedy drawings of trees (Q2411820) (← links)
- Succinct greedy drawings do not always exist (Q2894243) (← links)
- Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles (Q3451755) (← links)
- Succinct Greedy Graph Drawing in the Hyperbolic Plane (Q3611834) (← links)
- Levi's Lemma, pseudolinear drawings of , and empty triangles (Q4638639) (← links)
- Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions (Q5370573) (← links)
- Graph Drawing (Q5711616) (← links)
- (Q5743479) (← links)
- An Algorithm to Construct Greedy Drawings of Triangulations (Q5897052) (← links)
- Greedy rectilinear drawings (Q5915947) (← links)
- Greedy rectilinear drawings (Q5919678) (← links)
- Efficient enumeration of drawings and combinatorial structures for maximal planar graphs (Q6575407) (← links)
