THE EXPECTED EXTREMES IN A DELAUNAY TRIANGULATION
From MaRDI portal
Publication:3212323
DOI10.1142/S0218195991000074zbMath0724.68084WikidataQ106189615 ScholiaQ106189615MaRDI QIDQ3212323
David Eppstein, Marshall W. Bern, Frances F. Yao
Publication date: 1991
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (12)
A simple algorithm for enumerating longest distances in the plane ⋮ Expected time analysis for Delaunay point location ⋮ PROXIMITY GRAPHS: E, δ, Δ, χ AND ω ⋮ On the stabbing number of a random Delaunay triangulation ⋮ Combinatorial aspects of geometric graphs ⋮ Connected spatial networks over random points and a route-length statistic ⋮ \(k\)-nearest-neighbor clustering and percolation theory ⋮ On the expected maximum degree of Gabriel and Yao graphs ⋮ Probabilistic bounds on the length of a longest edge in Delaunay graphs of random points in \(d\)-dimensions ⋮ On the number of higher order Delaunay triangulations ⋮ A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee ⋮ A probabilistic result on multi-dimensional Delaunay triangulations, and its application to the 2D case
This page was built for publication: THE EXPECTED EXTREMES IN A DELAUNAY TRIANGULATION
