Open AccessMathematicsComputer Science
K. Clarkson, P. Shor
tlooto-Zusammenfassung
Asymptotically tight bounds for (≤k)-sets are given, which are certain halfspace partitions of point sets, and a simple proof of Lee's bounds for high-order Voronoi diagrams is given.
Abstract
Abstract ist nicht verfügbar.
Zitationsformat
CLARKSON, K.; SHOR, P. Applications of random sampling in computational geometry, II. DISCRETE & COMPUTATIONAL GEOMETRY, 1988, 4: 387–421.