An Algorithm to Construct Greedy Drawings of Triangulations

DOI10.7155/jgaa.00197zbMath1194.05108OpenAlexW1993306206MaRDI QIDQ5897052

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

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

Angle-monotonicity of Delaunay triangulation, On \(k\)-greedy routing algorithms, Succinct greedy drawings do not always exist, Local routing in sparse and lightweight geometric graphs, (Weakly) self-approaching geometric graphs and spanners, Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles, Monotone Drawings of 3-Connected Plane Graphs, Nearly optimal monotone drawing of trees, Compact Monotone Drawing of Trees, Euclidean greedy drawings of trees, A simple routing algorithm based on Schnyder coordinates, Monotone Drawings of Graphs with Fixed Embedding, Optimal Monotone Drawings of Trees, Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition, Succinct strictly convex greedy drawing of 3-connected plane graphs, On succinct greedy drawings of plane triangulations and 3-connected plane graphs, Monotone drawings of graphs with few directions, On the area requirements of planar greedy drawings of triconnected planar graphs, Greedy rectilinear drawings, On planar greedy drawings of 3-connected planar graphs, Greedy rectilinear drawings, Every Schnyder drawing is a greedy embedding, Drawing graphs as spanners, Unnamed Item, Monotone drawings of graphs with fixed embedding