An Algorithm to Construct Greedy Drawings of Triangulations

DOI10.7155/JGAA.00197MaRDI QIDQ5897052zbMATH OpenOpenAlexFDO

Authors Patrizio Angelini, Fabrizio Frati, Luca Grilli

Publication date 4 February 2010

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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)

Recommendations

• An Algorithm to Construct Greedy Drawings of Triangulations
• Greedy drawings of triangulations
• scientific article; zbMATH DE number 4064506
• 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

Cited in

(28)

• A simple routing algorithm based on Schnyder coordinates
• Optimal monotone drawings of trees
• Angle-monotonicity of Delaunay triangulation
• On planar greedy drawings of 3-connected planar graphs
• Succinct strictly convex greedy drawing of 3-connected plane graphs
• Competitive routing in the half-\(\theta_6\)-graph
• Monotone drawings of 3-connected plane graphs
• Succinct greedy drawings do not always exist
• (Weakly) self-approaching geometric graphs and spanners
• Greedy rectilinear drawings
• Greedy rectilinear drawings
• On k-greedy routing algorithms
• Gabriel triangulations and angle-monotone graphs: local routing and recognition
• Monotone drawings of graphs with fixed embedding
• Optimal local routing on Delaunay triangulations defined by empty equilateral triangles
• Monotone Drawings of Graphs with Fixed Embedding
• Graph Drawing
• Nearly optimal monotone drawing of trees
• Greedy drawings of triangulations
• Drawing graphs as spanners
• Local routing in sparse and lightweight geometric graphs
• On succinct greedy drawings of plane triangulations and 3-connected plane graphs
• Every Schnyder drawing is a greedy embedding
• Euclidean greedy drawings of trees
• Monotone drawings of graphs with few directions
• On the area requirements of planar greedy drawings of triconnected planar graphs
• Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions
• Compact monotone drawing of trees

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)