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

SIAM Journal on Computing

Volumn 30, Issue 2, 2000, Pages 561-575

  Chan, Timothy M ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Computational geometry; Levels in arrangements; Nearest neighbor searching; Randomized algorithms; Randomized data structures; Range searching; Voronoi diagrams

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; DATA STRUCTURES; OPTIMAL SYSTEMS; PROBLEM SOLVING; RANDOM PROCESSES; SAMPLING;

RANDOM SAMPLING; RANGE SEARCHING;

PROGRAM PROCESSORS;

EID: 0342902479     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539798349188     Document Type: Article

References (57)

1. P. K. AGARWAL, B. ARONOV, T. M. CHAN, AND M. SHARIR, On levels in arrangements of lines, segments, planes, and triangles, Discrete Comput. Geom., 19 (1998), pp. 315-331.
2. P. K. AGARWAL, M. DE BERG, J. MATOUŠEK, AND O. SCHWARZKOPF, Constructing levels in arrangements and higher order Voronoi diagrams, SIAM J. Comput., 27 (1998), pp. 654-667.
3. P. K. AGARWAL, A. EFRAT, AND M. SHARIR, Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications, in Proceedings of the 11th ACM Symposium on Computational Geometry, Vancouver, Canada, 1995, pp. 39-50.
4. P. K. AGARWAL AND J. ERICKSON, Geometric range searching and its relatives, in Advances in Discrete and Computational Geometry, B. Chazelle, J. E. Goodman, and R. Pollack, eds., AMS, Providence, RI, 1999, pp. 1-56.
5. P. K. AGARWAL AND J. MATOUŠEK, Ray shooting and parametric search, SIAM J. Comput., 22 (1993), pp. 794-806.
6. P. K. AGARWAL AND J. MATOUŠEK, Dynamic half-space range reporting and its applications, Algorithmica, 13 (1995), pp. 325-345.
7. P. K. AGARWAL, J. MATOUŠEK, AND O. SCHWARZKOPF, Computing many faces in arrangements of lines and segments, SIAM J. Comput., 27 (1998), pp. 491-505.
8. P. K. AGARWAL AND M. SHARIR, Arrangements and their applications, in Handbook of Computational Geometry, J. Urrutia and J. Sack, eds., North-Holland, Amsterdam, to appear.
9. A. AGGARWAL, L. J. GUIBAS, J. SAXE, AND P. W. SHOR, A linear-time algorithm for computing the Voronoi diagram of a convex polygon, Discrete Comput. Geom., 4 (1989), pp. 591-604.
10. A. AGGARWAL, M. HANSEN, AND T. LEIGHTON, Solving query-retrieval problems by compacting Voronoi diagrams, in Proceedings of the 22nd ACM Symposium on the Theory of Computing, ACM, New York, 1990, pp. 331-340.
11. A. ANDRZEJAK AND E. WELZL, k-Sets and j-Facets: A Tour of Discrete Geometry, 1997, manuscript.
12. T. ASANO AND T. TOKUYAMA, Topological walk revisited, in Proceedings of the 6th Canadian Conference on Computational Geometry, Saskatoon, Saskatchewan, Canada, 1994, pp. 1-6.
13. F. AURENHAMMER, Voronoi diagrams: A survey of a fundamental geometric data structure, ACM Comput. Surv., 23 (1991), pp. 345-405.
14. F. AURENHAMMER AND O. SCHWARZKOPF, A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams, Internat. J. Comput. Geom. Appl., 2 (1992), pp. 363-381.
15. J.-D. BOISSONNAT, O. DEVILLERS, AND M. TEILLAUD, A semidynamic construction of higher-order Voronoi diagrams and its randomized analysis, Algorithmica, 9 (1993), pp. 329-356.
16. J. L. BENTLEY AND H. A. MAURER, A note on Euclidean near neighbor searching in the plane, Inform. Process. Lett., 8 (1979), pp. 133-136.
17. I. Z. EMIRIS AND J. F. CANNY, A general approach to removing degeneracies, SIAM J. Comput., 24 (1995), pp. 650-664.
18. T. M. CHAN, Output-sensitive results on convex hulls, extreme points, and related problems, Discrete Comput. Geom., 16 (1996), pp. 369-387.
19. T. M. CHAN, On enumerating and selecting distances, in Proceedings of the 14th ACM Symposium on Computational Geometry, Minneapolis, MN, 1998, pp. 279-286.
20. T. M. CHAN, Dynamic planar convex hull operations in near-logarithmic amortized time, in Proceedings of the 40th IEEE Symposium on the Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1999, pp. 92-99.
21. T. M. CHAN, Remarks on k-Level Algorithms in the Plane, 1999, manuscript.
22. B. CHAZELLE, On the convex layers of a planar set, IEEE Trans. Inform. Theory, IT-31 (1985), pp. 509-517.
23. B. CHAZELLE, Filtering search: A new approach to query-answering, SIAM J. Comput., 15 (1986), pp. 703-724.
24. B. CHAZELLE, An optimal convex hull algorithm in any fixed dimension, Discrete Comput. Geom., 10 (1993), pp. 377-409.
25. B. CHAZELLE, R. COLE, F. P. PREPARATA, AND C. K. YAP, New upper bounds for neighbor searching, Inform. and Control, 68 (1986), pp. 105-124.
26. B. CHAZELLE AND H. EDELSBRUNNER, An improved algorithm for constructing kth-order Voronoi diagrams, IEEE Trans. Comput., C-36 (1987), pp. 1349-1354.
27. B. CHAZELLE AND J. FRIEDMAN, A deterministic view of random sampling and its use in geometry, Combinatorica, 10 (1990), pp. 229-249.
28. B. CHAZELLE, L. GUIBAS, AND D. T. LEE, The power of geometric duality, BIT, 25 (1985), pp. 76-90.
29. B. CHAZELLE AND F. P. PREPARATA, Halfspace range search: An algorithmic application of k-sets, Discrete Comput. Geom., 1 (1986), pp. 3-93.
30. K. L. CLARKSON, New applications of random sampling in computational geometry, Discrete Comput. Geom., 2 (1987), pp. 195-222.
31. K. L. CLARKSON, A randomized algorithm for closest-point queries, SIAM J. Comput., 17 (1988), pp. 830-847.
32. K. L. CLARKSON AND P. W. SHOR, Applications of random sampling in computational geometry II, Discrete Comput. Geom., 4 (1989), pp. 387-421.
33. R. COLE, M. SHARIR, AND C. K. YAP, On k-hulls and related problems, SIAM J. Comput., 16 (1987), pp. 61-77.
34. T. K. DEY, Improved bounds on planar k-sets and k-levels, Discrete Comput. Geom., 19 (1998), pp. 373-382.
35. T. K. DEY AND H. EDELSBRUNNER, Counting triangle crossings and halving planes, Discrete Comput. Geom., 12 (1994), pp. 281-289.
36. H. EDELSBRUNNER, Edge-skeletons in arrangements with applications, Algorithmica, 1 (1986), pp. 93-109.
37. H. EDELSDRUNNER, Algorithms in Combinatorial Geometry, Springer-Verlag, Berlin, 1987.
38. H. EDELSBRUNNER AND E. P. MÜCKE, Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms, ACM Trans. on Graphics, 9 (1990), pp. 66-104.
39. H. EDELSBRUNNER, J. O'ROURKE, AND R. SEIDEL, Constructing arrangements of lines and hyperplanes with applications, SIAM J. Comput., 15 (1986), pp. 341-363.
40. H. EDELSBRUNNER AND E. WELZL, Constructing belts in two-dimensional arrangements with applications, SIAM J. Comput., 15 (1986), pp. 271-284.
41. P. ERDOS, L. LOVÁSZ, A. SIMMONS, AND E. STRAUS, Dissection graphs of planar point sets, in A Survey of Combinatorial Theory, J. N. Srivastava, ed., North-Holland, Amsterdam, 1973, pp. 139-154.
42. H. EVERETT, J.-M. ROBERT, AND M. VAN KREVELD, An optimal algorithm for the (≤ k)-levels, with applications to separation and transversal problems, Internat. J. Comput. Geom. Appl., 6 (1996), pp. 247-261.
43. D. HALPERIN, Arrangements, in Handbook of Discrete and Computational Geometry, J. E. Goodman and J. O'Rourke, eds., CRC Press, Boca Raton, FL, 1997, pp. 389-412.
44. S. HAR-PELED, Taking a walk in a planar arrangement, in Proceedings of the 40th IEEE Symposium on the Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1999, pp. 100-110.
45. N. KATOH AND K. IWANO, Finding k farthest pairs and k closest/farthest bichromatic pairs for points in the plane, Internat. J. Comput. Geom. Appl., 5 (1995), pp. 37-51.
46. D. T. LEE, On k-nearest neighbor Voronoi diagrams in the plane, IEEE Trans. Comput., C-31 (1982), pp. 478-287.
47. J. MATOUŠEK, Efficient partition trees, Discrete Comput. Geom., 8 (1992), pp. 315-334.
48. J. MATOUŠEK, Reporting points in halfspaces, Comput. Geom., 2 (1992), pp. 169-186.
49. J. MATOUŠEK, Geometric range searching, ACM Comput. Surv., 26 (1994), pp. 421-461.
50. R. MOTWANI AND P. RAGHAVAN, Randomized Algorithms, Cambridge University Press, New York, 1995.
51. d of order 1 to k, in Proceedings of the 22nd ACM Symposium on the Theory of Computing, ACM, New York, 1990, pp. 322-330.
52. K. MULMULEY, On levels in arrangements and Voronoi diagrams, Discrete Comput. Geom., 6 (1991), pp. 307-338.
53. K. MULMULEY, Computational Geometry: An Introduction Through Randomized Algorithms, Prentice-Hall, Englewood Cliffs, NJ, 1994.
54. F. P. PREPARATA AND S. J. HONG, Convex hulls of finite sets of points in two and three dimensions, Commun. ACM, 20 (1977), pp. 87-93.
55. F. P. PREPARATA AND M. I. SHAMOS, Computational Geometry: An Introduction, Springer-Verlag, New York, 1985.
56. E. RAMOS, On range reporting, ray shooting, and k-level construction, in Proceedings of the 15th ACM Symposium on Computational Geometry, ACM, New York, 1999, pp. 390-399.
57. M. I. SHAMOS AND D. HOEY, Closest-point problems, in Proceedings of the 16th IEEE Symposium on the Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1977, pp. 151-162.