Recommendations
Cites work
- (Weakly) self-approaching geometric graphs and spanners
- An Algorithm to Construct Greedy Drawings of Triangulations
- Construction and Local Routing for Angle-Monotone Graphs
- Curves with increasing chords
- Euclidean greedy drawings of trees
- Gabriel triangulations and angle-monotone graphs: local routing and recognition
- Geometric Spanner Networks
- Improved stretch factor of Delaunay triangulations of points in convex position
- Increasing-chord graphs on point sets
- Increasing-chord graphs on point sets
- On planar greedy drawings of 3-connected planar graphs
- On succinct convex greedy drawing of 3-connected plane graphs
- Self-approaching curves
- Self-approaching graphs
- Some results on greedy embeddings in metric spaces
- Succinct greedy geometric routing in the Euclidean plane
- The stretch factor of the Delaunay triangulation is less than 1.998
Cited in
(6)- The farthest point Delaunay triangulation minimizes angles
- Lack of relative monotonicity among various measures of trihedral angles
- Explicit angle structures for veering triangulations
- Construction and local routing for angle-monotone graphs
- A monotonicity property for weighted Delaunay triangulations
- On the plane angle-monotone graphs
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)