Partitioning arrangements of lines I: An efficient deterministic algorithm
- 1 October 1990
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 5 (5) , 449-483
- https://doi.org/10.1007/bf02187805
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision DetectionSIAM Journal on Computing, 1990
- An Optimal-Time Algorithm for Slope SelectionSIAM Journal on Computing, 1989
- New applications of random sampling in computational geometryDiscrete & Computational Geometry, 1987
- ɛ-nets and simplex range queriesDiscrete & Computational Geometry, 1987
- On k-Hulls and Related ProblemsSIAM Journal on Computing, 1987
- A linear time algorithm for minimum link paths inside a simple polygonComputer Vision, Graphics, and Image Processing, 1986
- More onk-sets of finite sets in the planeDiscrete & Computational Geometry, 1986
- Constructing Belts in Two-Dimensional Arrangements with ApplicationsSIAM Journal on Computing, 1986
- Applying Parallel Computation Algorithms in the Design of Serial AlgorithmsJournal of the ACM, 1983
- Sorting inc logn parallel stepsCombinatorica, 1983