Optimal halfspace range reporting in three dimensions

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2009, Pages 180-186

  Afshani, Peyman ^a   Chan, Timothy M ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL GEOMETRY;

CROSSING NUMBER; EXPECTED TIME; EXTERNAL MEMORY; HIGHER DIMENSIONS; LINEAR SPACES; OPTIMAL SOLUTIONS; STANDARD PROBLEMS; THREE DIMENSIONS;

DATA STRUCTURES;

EID: 67349084476     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973068.21     Document Type: Conference Paper

References (21)

1. P. Afshani. On dominance reporting in 3D. In Proc. 16th European Sympos. Algorithms, Lect. Notes Comput. Sci., vol.5193, Springer-Verlag, pages 41-51, 2008.
2. P. K. Agarwal, L. Arge, J. Erickson, P.G. Franciosa, and J. S. Vitter. Efficient searching with linear constraints. J. Comput. Sys. Sci., 61:192-216, 2000.
3. P. K. Agarwal and J. Erickson. Geometric range searching and its relatives. In Discrete and Computational Geometry: Ten Years Later (B. Chazelle, J. E. Goodman, and R. Pollack, ed.), AMS Press, pages 1-56, 1999.
4. A. Aggarwal, M. Hansen, and T. Leighton. Solving query-retrieval problems by compacting Voronoi diagrams. In Proc. 22nd ACM Sympos. Theory Comput., pages 331-340, 1990.
5. L. Arge, V. Samoladas, and J. S. Vitter. On two-dimensional indexability and optimal range search indexing. In 18th ACM Sympos. Principles of Database Systems, pages 346-357, 1999.
6. B. Aronov, S. Har-Peled, and M. Sharir. On approximate halfspace range counting and relative ε-approximations. In Proc. 23rd ACM Sympos. Comput. Geom., pages 327-336, 2007. (Pubitemid 47582079)
7. J. L. Bentley and H. A. Maurer. A note on Euclidean near neighbor searching in the plane. Inform. Process. Lett., 8:133-136, 1979.
8. T. M. Chan. Random sampling, halfspace range reporting, and construction of (≤ k)-levels in three dimensions. SIAM J. Comput., 30:561-575, 2000.
9. T. M. Chan. A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries. In Proc. 17th ACM-SIAM Sympos. Discrete Algorithms, pages 1196-1202, 2006. Full version at http://www.cs.uwaterloo.ca/~tmchan/dch3d-9-06. ps
10. T. M. Chan and M. Pǎtraşcu. Transdichotomous results in computational geometry, I: Point location in sublogarithmic time. SIAM J. Comput., to appear. Preliminary versions in Proc. 47th IEEE Sympos. Found. Comput. Sci., pages 325-332 and 333-342, 2006.
11. B. Chazelle, R. Cole, F. P. Preparata, and C. K. Yap. New upper bounds for neighbor searching. Inform. Control, 68:105-124, 1986.
12. B. Chazelle, L. Guibas, and D. T. Lee. The power of geometric duality. BIT, 25:76-90, 1985.
13. B. Chazelle and F. P. Preparata. Halfspace range search: an algorithmic application of k-sets. Discrete Comput. Geom., 1:3-93, 1986.
14. K. L. Clarkson and P. W. Shor. Applications of random sampling in computational geometry, II. Discrete Comput. Geom., 4:387-421, 1989.
15. R. Cole and C. K. Yap. Geometric retrieval problems. Inform. Control, 63:39-57, 1984.
16. M. T. Goodrich, J.-J. Tsay, D. E. Vengroff, and J. S. Vitter. External-memory computational geometry. In Proc. 34th IEEE Sympos. Found. Comput. Sci., pages 714-723, 1993.
17. J. Matoušek. Efficient partition trees. Discrete Comput. Geom., 8:315-334, 1992.
18. J. Matoušek. Reporting points in halfspaces. Comput. Geom. Theory Appl., 2:169-186, 1992.
19. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, 1985.
20. E. Ramos. On range reporting, ray shooting, and k-level construction. In Proc. 15th ACM Sympos. Comput. Geom., pages 390-399, 1999.
21. M. I. Shamos and D. Hoey. Closest-point problems. In Proc. 16th IEEE Sympos. Found. Comput. Sci., pages 151-162, 1977.