An Algorithm to Construct Greedy Drawings of Triangulations

DOI10.1007/978-3-642-00219-9_4zbMath1213.68424OpenAlexW1904516326MaRDI QIDQ5901462

Luca Grilli, Fabrizio Frati, Patrizio Angelini

Publication date: 3 March 2009

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00219-9_4

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (7)

A generalized greedy routing algorithm for 2-connected graphs ⋮ Category-based routing in social networks: membership dimension and the small-world phenomenon ⋮ Greedy routing via embedding graphs onto semi-metric spaces ⋮ An optimal greedy routing algorithm for triangulated polygons ⋮ Greedy Routing via Embedding Graphs onto Semi-metric Spaces ⋮ Distributed computation of virtual coordinates for greedy routing in sensor networks ⋮ On planar greedy drawings of 3-connected planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Some results on greedy embeddings in metric spaces
• How to draw a planar graph on a grid
• On a conjecture related to geometric routing
• Distributed computation of virtual coordinates

This page was built for publication: An Algorithm to Construct Greedy Drawings of Triangulations