Random sampling, halfspace range reporting, and construction of (≤k)-levels in three dimensions

This publication has 36 references indexed in Scilit:

• AN OPTIMAL ALGORITHM FOR COMPUTING (≤K)-LEVELS, WITH APPLICATIONS
  International Journal of Computational Geometry & Applications, 1996
• Randomized Algorithms
  Published by Cambridge University Press (CUP) ,1995
• FINDING k FARTHEST PAIRS AND k CLOSEST/FARTHEST BICHROMATIC PAIRS FOR POINTS IN THE PLANE
  International Journal of Computational Geometry & Applications, 1995
• Geometric range searching
  ACM Computing Surveys, 1994
• Reporting points in halfspaces
  Computational Geometry, 1992
• Algorithms in Combinatorial Geometry
  Published by Springer Nature ,1987
• Constructing Arrangements of Lines and Hyperplanes with Applications
  SIAM Journal on Computing, 1986
• Constructing Belts in Two-Dimensional Arrangements with Applications
  SIAM Journal on Computing, 1986
• On k-Nearest Neighbor Voronoi Diagrams in the Plane
  IEEE Transactions on Computers, 1982
• Dissection Graphs of Planar Point Sets
  Published by Elsevier ,1973