Partitioning arrangements of lines II: Applications
- 1 December 1990
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 5 (6) , 533-573
- https://doi.org/10.1007/bf02187809
Abstract
No abstract availableKeywords
This publication has 39 references indexed in Scilit:
- Lower bounds on the complexity of polytope range searchingJournal of the American Mathematical Society, 1989
- Topologically sweeping an arrangementJournal of Computer and System Sciences, 1989
- Visibility problems for polyhedral terrainsJournal of Symbolic Computation, 1989
- Reporting and Counting Intersections Between Two Sets of Line SegmentsPublished by Springer Nature ,1988
- Worst-case optimal hidden-surface removalACM Transactions on Graphics, 1987
- Fractional cascading: II. ApplicationsAlgorithmica, 1986
- Planar point location using persistent search treesCommunications of the ACM, 1986
- Reporting and counting segment intersectionsJournal of Computer and System Sciences, 1986
- On the maximal number of edges of many faces in an arrangementJournal of Combinatorial Theory, Series A, 1986
- The power of geometric dualityBIT Numerical Mathematics, 1985