Abstract

Given n points in three dimensions, we show how to answer halfspace range reporting queries in O(logn+k) expected time for an output size k. Our data structure can be preprocessed in optimal O(n log n) expected time. We apply this result to obtain the first optimal randomized algorithm for the construction of the ( k)-level in an arrangement of n planes in three dimensions. The algorithm runs in O(n log n+nk²) expected time. Our techniques are based on random sampling. Applications in two dimensions include an improved data structure for "k nearest neighbors" queries, and an algorithm that constructs the order-k Voronoi diagram in O(n log n + nk log k) expected time.

Citations

1611	Computational geometry: An introduction - Preparata, Shamos - 1985
1567	Randomized Algorithms - Motwani, Raghavan - 1995
643	Algorithms in combinatorial geometry - Edelsbrunner - 1987
472	Voronoi diagrams: A survey of a fundamental geometric data structure - Aurenhammer - 1991
357	Applications of random sampling in computational geometry - Shor - 1989
275	Computational Geometry: An Introduction Through Randomized Algorithms - Mulmuley - 1993
244	Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms - Edelsbrunner, Mücke - 1990
173	Closest-point problems - Shamos, Hoey - 2009
121	Ray shooting and parametric search - Agarwal, Matouˇsek - 1993
104	A randomized algorithm for closest-point queries - Clarkson - 1988
101	Constructing arrangements of lines and hyperplanes with applications - Edelsbrunner, O’Rourke, et al. - 1986
98	Filtering search: a new approach to query-answering - Chazelle - 1986
96	A deterministic view of random sampling and its use in geometry, Combinatorica 10 - Chazelle, Friedman - 1990
83	Convex hulls of finite sets of points in two and three dimensions - PREPARATA, HONG - 1977
82	The power of geometric duality - Chazelle, Guibas, et al. - 1983
75	A linear-time algorithm for computing the Voronoi diagram of a convex polygon - Aggarwal, Guibas, et al. - 1989
71	Efficient partition trees - Matoušek - 1992
70	An optimal convex hull algorithm in any fixed dimension, Discrete Comput - Chazelle - 1993
65	Reporting points in halfspaces - MATOUSEK - 1991
60	Output-sensitive results on convex hulls, extreme points, and related problems - Chan - 1995
56	On k-hulls and related problems - Cole, Sharir, et al. - 1987
53	On the convex layers of a planar set - Chazelle - 1985
51	A general approach to removing degeneracies - Emiris, Canny - 1995
49	On k-nearest neighbor voronoi diagrams in the plane - Lee - 1982
46	Geometric range searching - Matoušek - 1994
45	Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications - Agarwal, Efrat, et al. - 1996
41	Constructing levels in arrangements and higher order Voronoi diagrams - Agarwal, Berg, et al.
40	On levels in arrangements of lines, segments, planes, and triangles - Agarwal, Aronov, et al. - 1998
38	Dynamic half-space range reporting and its applications - Agarwal, Matou˘sek - 1995
35	Constructing belts in two-dimensional arrangements with applications - Edelsbrunner, Welzl - 1986
35	Dissection graphs of planar point sets - Erdős, Lovász, et al. - 1973
32	Halfspace range search: an algorithmic application of k-sets - Chazelle, Preparata - 1985
31	Dynamic planar convex hull operations in near-logarithmic amortized time - Chan - 1999
28	Computing many faces in arrangements of lines and segments - Agarwal, Matouˇsek, et al. - 1998
26	Solving query-retrieval problems by compacting voronoi diagrams - Aggarwal, Hansen, et al. - 1990
25	Kreveld, An optimal algorithm for the (< k)-levels, with applications to separation and transversal problems - Everett, Robert, et al. - 1993
24	2D arrangements - Wein, Fogel, et al. - 2008
23	Taking a walk in a planar arrangement - Har-Peled
23	On range reporting, ray shooting, and k-level construction - Ramos - 1999
18	Counting triangle crossings and halving planes - Dey, Edelsbrunner - 1994
16	New upper bounds for neighbor searching - Chazelle - 1986
15	Improved bounds on planar k-sets and k-levels - Dey - 1998
14	On levels in arrangements and Voronoi diagrams - Mulmuley - 1991
13	A simple on-line randomized incremental algorithm for computing higher order voronoi diagrams - Aurenhammer, Schwarzkopf - 1991
12	Remarks on k-level algorithms in the plane - Chan
11	An improved algorithm for constructing kth-order voronoi diagrams - Chazelle, Edelsbrunner - 1987
10	A note on Euclidean near neighbor searching - Bentley, Maurer - 1979
9	On enumerating and selecting distances - Chan
8	k-sets and j-facets: a tour of discrete geometry - Andrzejak, Welzl - 1997
8	A semidynamic construction of higher-order Voronoi diagrams and its randomized analysis - Boissonnat, Devillers, et al. - 1993