The Complexity of Halfspace Area Queries

Discrete and Computational Geometry

Volumn 30, Issue 4, 2003, Pages 639-648

  Langerman, Stefan ^a  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0348014488     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-003-2856-2     Document Type: Article

References (15)

1. Open problems session. Presented at Twelfth Computational Geometry Day, 1997.
2. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA, 1974.
3. K.-F. Böhringer, B. Donald, and D. Halperin. On the area bisectors of a polygon. Discrete Compul. Geom., 22(2):269-285, 1999.
4. R. Boland and J. Urrutia. Polygon area problems. In Proceedings of 12th Canadian Conference on Computational Geometry, pages 159-162, 2000.
5. B. Chazelle. Cutting hyperplanes for divide-and-conquer. Discrete Comput. Geom., 9(2):145-158, 1993.
6. B. Chazelle and J. Friedman. A deterministic view of random sampling and ils use in geometry. Combinatorica, 10(3):229-249, 1990.
7. F. Contreras-Alcalá. Cutting polygons and a problem on illumination of stages. M.Sc. thesis, Dept. Computer Science, University of Ottawa, Ottawa, 1998.
8. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, 1997.
9. J. Erickson. New lower bounds for Hopcroft's problem. Discrete Comput. Geom., 16:389-418, 1996.
10. J. Erickson. Space-time tradeoffs for emptiness queries. SIAM J. Comput., 29(6): 1968-1996, 2000.
11. R. Guàrdia and F. Hurtado. On the equipartitions of convex bodies and convex polygons. In Abstracts 16th European Workshop on Computational Geometry, pages 47-50. Ben-Gurion University of the Negev, 2000.
12. J. Iacono and S. Langerman. Volume queries in polyhedra. In Proceedings of Japan Conference on Discrete and Computational Geometry, pages 156-159, 2000.
13. J. Matousek. Efficient partition trees. Discrete Comput. Geom., 8:315-334, 1992.
14. J. Matoušek. Range searching with efficient hierarchical cuttings. Discrete Comput. Geom., 10(2):157-182, 1993.
15. V. Strassen. Algebraic complexity theory. In J. van Leeuwen, editor, Algorithms and Complexity, volume A of Handbook of Theoretical Computer Science, chapter 11, pages 633-672. MIT Press, Cambridge, MA, 1990.