Pages that link to "Item:Q1062440"
From MaRDI portal
The following pages link to On the average length of Delaunay triangulations (Q1062440):
Displaying 14 items.
- On the number of higher order Delaunay triangulations (Q551184) (← links)
- Delaunay graphs are almost as good as complete graphs (Q584279) (← links)
- Expected length of the Voronoi path in a high dimensional Poisson-Delaunay triangulation (Q724951) (← links)
- Toughness and Delaunay triangulations (Q803161) (← links)
- Computing relative neighbourhood graphs in the plane (Q1082094) (← links)
- Asymptotics for the length of a minimal triangulation on a random sample (Q1296585) (← links)
- Size analysis of nearly regular Delaunay triangulations (Q1807745) (← links)
- Fast greedy triangulation algorithms. (Q2482901) (← links)
- Minimum Average Distance Triangulations (Q2912886) (← links)
- THE EXPECTED EXTREMES IN A DELAUNAY TRIANGULATION (Q3212323) (← links)
- A New Heuristic for Minimum Weight Triangulation (Q3801070) (← links)
- On smallest triangles (Q4434472) (← links)
- PROXIMITY GRAPHS: E, δ, Δ, χ AND ω (Q5300005) (← links)
- On exclusion regions for optimal triangulations (Q5929321) (← links)