Constructing Belts in Two-Dimensional Arrangements with Applications
- 1 February 1986
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 15 (1), 271-284
- https://doi.org/10.1137/0215019
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Constructing Arrangements of Lines and Hyperplanes with ApplicationsSIAM Journal on Computing, 1986
- On the number of line separations of a finite set in the planeJournal of Combinatorial Theory, Series A, 1985
- Optimal Search in Planar SubdivisionsSIAM Journal on Computing, 1983
- An Optimal Illumination Region Algorithm for Convex PolygonsIEEE Transactions on Computers, 1982
- Polygonal intersection searchingInformation Processing Letters, 1982
- Maintenance of configurations in the planeJournal of Computer and System Sciences, 1981
- Worst-case optimal insertion and deletion methods for decomposable searching problemsInformation Processing Letters, 1981
- Data Structures for Range SearchingACM Computing Surveys, 1979
- Decomposable searching problemsInformation Processing Letters, 1979
- Dissection Graphs of Planar Point SetsPublished by Elsevier ,1973