An Algorithm to Construct Greedy Drawings of Triangulations
From MaRDI portal
Publication:5897052
DOI10.7155/JGAA.00197zbMATH Open1194.05108OpenAlexW1993306206MaRDI QIDQ5897052FDOQ5897052
Patrizio Angelini, Fabrizio Frati, Luca Grilli
Publication date: 4 February 2010
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/225320
Recommendations
- An Algorithm to Construct Greedy Drawings of Triangulations
- Greedy drawings of triangulations
- scientific article
- A space efficient greedy triangulation algorithm
- Fast algorithms for greedy triangulation
- Fast algorithms for greedy triangulation
- On succinct greedy drawings of plane triangulations and 3-connected plane graphs
- Greedy algorithms for adaptive triangulations and approximations
- An efficient algorithm for enumeration of triangulations
- On approximation behavior of the greedy triangulation for convex polygons
Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Cited In (28)
- A simple routing algorithm based on Schnyder coordinates
- Angle-monotonicity of Delaunay triangulation
- On planar greedy drawings of 3-connected planar graphs
- Succinct strictly convex greedy drawing of 3-connected plane graphs
- Succinct greedy drawings do not always exist
- Greedy rectilinear drawings
- Greedy rectilinear drawings
- (Weakly) self-approaching geometric graphs and spanners
- On \(k\)-greedy routing algorithms
- Graph Drawing
- Compact Monotone Drawing of Trees
- Monotone drawings of graphs with fixed embedding
- Monotone Drawings of Graphs with Fixed Embedding
- Nearly optimal monotone drawing of trees
- Greedy drawings of triangulations
- Drawing graphs as spanners
- Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition
- Monotone Drawings of 3-Connected Plane Graphs
- Local routing in sparse and lightweight geometric graphs
- On succinct greedy drawings of plane triangulations and 3-connected plane graphs
- Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles
- Optimal Monotone Drawings of Trees
- Every Schnyder drawing is a greedy embedding
- Title not available (Why is that?)
- Euclidean greedy drawings of trees
- Monotone drawings of graphs with few directions
- Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions
- On the area requirements of planar greedy drawings of triconnected planar graphs
This page was built for publication: An Algorithm to Construct Greedy Drawings of Triangulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897052)
