Construction and Local Routing for Angle-Monotone Graphs
From MaRDI portal
Publication:5377357
DOI10.7155/jgaa.00494zbMath1416.05271OpenAlexW2938003663MaRDI QIDQ5377357
Publication date: 24 May 2019
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00494
Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
On the plane angle-monotone graphs, Angle-monotonicity of Delaunay triangulation, On the area requirements of planar greedy drawings of triconnected planar graphs, Drawing graphs as spanners
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonobtuse triangulations of PSLGs
- Graph drawing and network visualization. 24th international symposium, GD 2016, Athens, Greece, September 19--21, 2016. Revised selected papers
- Towards tight bounds on theta-graphs: more is not always better
- Provably good mesh generation
- Construction and local routing for angle-monotone graphs
- Competitive online routing in geometric graphs
- On a partition into convex polygons
- On the stretch factor of convex Delaunay graphs
- On self-approaching and increasing-chord drawings of 3-connected planar graphs
- Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
- Geometric Spanner Networks
- Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles
- Curves with increasing chords
- Self-approaching Graphs
- Increasing-Chord Graphs On Point Sets
- Routing with guaranteed delivery in ad hoc wireless networks
