Pages that link to "Item:Q3212323"
From MaRDI portal
The following pages link to THE EXPECTED EXTREMES IN A DELAUNAY TRIANGULATION (Q3212323):
Displaying 16 items.
- On degrees in random triangulations of point sets (Q549246) (← links)
- On the number of higher order Delaunay triangulations (Q551184) (← links)
- Expected length of the Voronoi path in a high dimensional Poisson-Delaunay triangulation (Q724951) (← links)
- On the stabbing number of a random Delaunay triangulation (Q857055) (← links)
- Connected spatial networks over random points and a route-length statistic (Q906528) (← links)
- On the average length of Delaunay triangulations (Q1062440) (← links)
- The farthest point Delaunay triangulation minimizes angles (Q1188284) (← links)
- Combinatorial aspects of geometric graphs (Q1384214) (← links)
- A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case (Q1841245) (← links)
- Expected time analysis for Delaunay point location (Q1882851) (← links)
- Probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in \(d\)-dimensions (Q2261582) (← links)
- A simple algorithm for enumerating longest distances in the plane (Q2366076) (← links)
- \(k\)-nearest-neighbor clustering and percolation theory (Q2461550) (← links)
- On the expected maximum degree of Gabriel and Yao graphs (Q3558941) (← links)
- PROXIMITY GRAPHS: E, δ, Δ, χ AND ω (Q5300005) (← links)
- A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee (Q5919060) (← links)
