Euclidean greedy drawings of trees
From MaRDI portal
Publication:2411820
DOI10.1007/s00454-017-9913-8zbMath1375.05057arXiv1306.5224MaRDI QIDQ2411820
Roman Prutkin, Martin Nöllenburg
Publication date: 25 October 2017
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.5224
05C05: Trees
05C82: Small world graphs, complex networks (graph-theoretic aspects)
68R10: Graph theory (including graph drawing) in computer science
05C10: Planar graphs; geometric and topological aspects of graph theory
68M14: Distributed systems
05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
Related Items
Greedy rectilinear drawings, Drawing graphs as spanners, On the area requirements of planar greedy drawings of triconnected planar graphs, On planar greedy drawings of 3-connected planar graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some results on greedy embeddings in metric spaces
- Greedy drawings of triangulations
- 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
- Self-approaching curves
- On planar greedy drawings of 3-connected planar graphs
- Angles of Planar Triangular Graphs
- Self-approaching Graphs
- Succinct Greedy Geometric Routing Using Hyperbolic Geometry
- Wireless Sensor Networks
- An Algorithm to Construct Greedy Drawings of Triangulations
- Increasing-Chord Graphs On Point Sets
