Reporting points in halfspaces
- 1 November 1992
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 2 (3) , 169-186
- https://doi.org/10.1016/0925-7721(92)90006-e
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Dynamic half-space range reporting and its applicationsAlgorithmica, 1995
- On ray shooting in convex polytopesDiscrete & Computational Geometry, 1993
- Cutting hyperplane arrangementsDiscrete & Computational Geometry, 1991
- Quasi-optimal range searching in spaces of finite VC-dimensionDiscrete & Computational Geometry, 1989
- Lower bounds on the complexity of polytope range searchingJournal of the American Mathematical Society, 1989
- ɛ-nets and simplex range queriesDiscrete & Computational Geometry, 1987
- Filtering Search: A New Approach to Query-AnsweringSIAM Journal on Computing, 1986
- Halfspace range search: An algorithmic application ofk-setsDiscrete & Computational Geometry, 1986
- The power of geometric dualityBIT Numerical Mathematics, 1985
- Polygon RetrievalSIAM Journal on Computing, 1982