Greedy rectilinear drawings
From MaRDI portal
Publication:5915947
DOI10.1007/978-3-030-04414-5_35OpenAlexW2889341302MaRDI QIDQ5915947
Roman Prutkin, Tamara Mchedlidze, Walter Didimo, Luca Grilli, Antonios Symvonis, Patrizio Angelini, Philipp Kindermann, Alessandra Tappini, Michael A. Bekos
Publication date: 15 February 2019
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.09063
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Upward book embeddability of \(st\)-graphs: complexity and algorithms ⋮ Greedy rectilinear drawings ⋮ Every Schnyder drawing is a greedy embedding ⋮ Upward Book Embeddings of st-Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- On succinct greedy drawings of plane triangulations and 3-connected plane graphs
- Some results on greedy embeddings in metric spaces
- Greedy drawings of triangulations
- Turn-regularity and optimal area drawings of orthogonal representations
- Succinct strictly convex greedy drawing of 3-connected plane graphs
- On a conjecture related to geometric routing
- Euclidean Greedy Drawings of Trees
- Succinct greedy drawings do not always exist
- On self-approaching and increasing-chord drawings of 3-connected planar graphs
- Succinct Greedy Geometric Routing in the Euclidean Plane
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Self-approaching curves
- On planar greedy drawings of 3-connected planar graphs
- Self-approaching Graphs
- Succinct Greedy Geometric Routing Using Hyperbolic Geometry
- Algorithmic Aspects of Wireless Sensor Networks
- An Algorithm to Construct Greedy Drawings of Triangulations
- Greedy rectilinear drawings
- Geographic routing on virtual raw anchor coordinate systems
This page was built for publication: Greedy rectilinear drawings
