Implicitly representing arrangements of lines or segments
- 1 October 1989
- journal article
- research article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 4 (5) , 433-466
- https://doi.org/10.1007/bf02187742
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- ɛ-nets and simplex range queriesDiscrete & Computational Geometry, 1987
- Fractional cascading: II. ApplicationsAlgorithmica, 1986
- Halfplanar range search in linear space and O(n0.695) query timeInformation Processing Letters, 1986
- Planar point location using persistent search treesCommunications of the ACM, 1986
- Constructing Arrangements of Lines and Hyperplanes with ApplicationsSIAM Journal on Computing, 1986
- Optimal Point Location in a Monotone SubdivisionSIAM Journal on Computing, 1986
- The power of geometric dualityBIT Numerical Mathematics, 1985
- Optimal Search in Planar SubdivisionsSIAM Journal on Computing, 1983
- Polygon RetrievalSIAM Journal on Computing, 1982
- Maintenance of configurations in the planeJournal of Computer and System Sciences, 1981