Angle-monotonicity of Delaunay triangulation
From MaRDI portal
Publication:827337
DOI10.1016/J.COMGEO.2020.101711zbMATH Open1470.68233OpenAlexW3091718692MaRDI QIDQ827337FDOQ827337
Authors: Davood Bakhshesh, Mohammad Farshi 
Publication date: 7 January 2021
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2020.101711
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Geometric Spanner Networks
- Succinct greedy geometric routing in the Euclidean plane
- An Algorithm to Construct Greedy Drawings of Triangulations
- Some results on greedy embeddings in metric spaces
- Euclidean greedy drawings of trees
- Self-approaching curves
- Curves with increasing chords
- On succinct convex greedy drawing of 3-connected plane graphs
- On planar greedy drawings of 3-connected planar graphs
- The stretch factor of the Delaunay triangulation is less than 1.998
- Self-approaching graphs
- Increasing-chord graphs on point sets
- Improved stretch factor of Delaunay triangulations of points in convex position
- (Weakly) self-approaching geometric graphs and spanners
- Gabriel triangulations and angle-monotone graphs: local routing and recognition
- Construction and Local Routing for Angle-Monotone Graphs
- Increasing-chord graphs on point sets
Cited In (6)
- On the plane angle-monotone graphs
- A monotonicity property for weighted Delaunay triangulations
- Construction and local routing for angle-monotone graphs
- The farthest point Delaunay triangulation minimizes angles
- Lack of relative monotonicity among various measures of trihedral angles
- Explicit angle structures for veering triangulations
This page was built for publication: Angle-monotonicity of Delaunay triangulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q827337)
