Random Sampling, Halfspace Range Reporting, and Construction of (≤k)-Levels in Three Dimensions (1999)

by Timothy M. Chan
Venue:SIAM J. COMPUT
Citations:32 - 7 self

Documents Related by Co-Citation

24 On Range Reporting, Ray Shooting and k-level Construction – Edgar A. Ramos
396 Applications of Random Sampling in Computational Geometry, II – Kenneth L. Clarkson, Peter W. Shor - 1995
42 Constructing Levels in Arrangements and Higher Order Voronoi Diagrams – Pankaj K. Agarwal, Mark de Berg, Jiri Matousek, Otfried Schwarzkopf - 1994
256 Geometric Range Searching and Its Relatives – Pankaj K. Agarwal
1770 Computational Geometry: An Introduction – Franco P Preparata, Michael Ian Shamos - 1985
55 Reporting points in halfspaces – J Matouˇsek - 1992
95 The power of geometric duality – Bernard Chazelle, Leo J Guibas, D T Lee - 1985
286 Computational Geometry: An Introduction Through Randomized Algorithms – Ketan Mulmuley - 1993
58 Efficient Searching with Linear Constraints (Extended Abstract) – Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Paolo G. Franciosa, Jeffrey Scott Vitter
77 On Two-Dimensional Indexability and Optimal Range Search Indexing (Extended Abstract) – Lars Arge, Vasilis Samoladas, Jeffrey Scott Vitter - 1999
65 Reporting points in halfspaces – Jirí Matousek - 1991
974 Computational Geometry: Algorithms and Applications – M de Berg, M van Kreveld, M Overmars, O Schwarzkopf - 2000
34 Halfspace range search: An algorithmic application of k-sets – B Chazelle, F P Preparata - 1986
38 Constructing Belts in twodimensional arrangements with applications – H Edelsbrunner, E Welzl - 1986
694 Algorithms in Combinatorial Geometry – H Edelsbrunner - 1987
546 The input/output complexity of sorting and related problems – A Aggarwal, J S Vitter - 1988
61 On k-sets in arrangements of curves and surfaces – M Sharir - 1991
44 On geometric optimization with few violated constraints – J Matoušek - 1994
65 Output-Sensitive Results on Convex Hulls, Extreme Points, and Related Problems – T. M. Chan - 1996