On the area requirements of planar greedy drawings of triconnected planar graphs
From MaRDI portal
Publication:2019489
DOI10.1007/978-3-030-58150-3_35OpenAlexW3081569775MaRDI QIDQ2019489FDOQ2019489
Authors: Giordano Da Lozzo, Anthony D'Angelo, Fabrizio Frati 
Publication date: 21 April 2021
Full work available at URL: https://arxiv.org/abs/2003.00556
Cites Work
- On a conjecture related to geometric routing
- Succinct greedy geometric routing in the Euclidean plane
- Succinct Greedy Geometric Routing Using Hyperbolic Geometry
- An Algorithm to Construct Greedy Drawings of Triangulations
- Some results on greedy embeddings in metric spaces
- Greedy drawings of triangulations
- Title not available (Why is that?)
- Euclidean greedy drawings of trees
- 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
- On succinct greedy drawings of plane triangulations and 3-connected plane graphs
- Self-approaching graphs
- Increasing-chord graphs on point sets
- On the number of planar orientations with prescribed degrees
- Algorithmic Aspects of Wireless Sensor Networks
- Gabriel triangulations and angle-monotone graphs: local routing and recognition
- Construction and Local Routing for Angle-Monotone Graphs
- On self-approaching and increasing-chord drawings of 3-connected planar graphs
- Hyperbolic Embeddings for Near-Optimal Greedy Routing
Cited In (5)
- On the Area Requirements of Planar Greedy Drawings of Triconnected Planar Graphs
- Efficient enumeration of drawings and combinatorial structures for maximal planar graphs
- Greedy drawings of triangulations
- On succinct greedy drawings of plane triangulations and 3-connected plane graphs
- On Area-Optimal Planar Graph Drawings
This page was built for publication: On the area requirements of planar greedy drawings of triconnected planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2019489)
