Dynamic C-oriented polygonal intersection searching
- 31 December 1984
- journal article
- Published by Elsevier in Information and Control
- Vol. 63 (3), 143-163
- https://doi.org/10.1016/s0019-9958(84)80011-x
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Optimal divide-and-conquer to compute measure and contour for a set of iso-rectanglesActa Informatica, 1984
- An optimal contour algorithm for iso-oriented rectanglesJournal of Algorithms, 1984
- Stabbing c-oriented polygonsInformation Processing Letters, 1983
- Polygonal intersection searchingInformation Processing Letters, 1982
- Counting and Reporting Intersections of d-RangesIEEE Transactions on Computers, 1982
- On the intersection of Orthogonal objectsInformation Processing Letters, 1981
- The rectangle intersection problem revisitedBIT Numerical Mathematics, 1980
- An Optimal Worst Case Algorithm for Reporting Intersections of RectanglesIEEE Transactions on Computers, 1980
- Decomposable searching problemsInformation Processing Letters, 1979
- Triangulating a simple polygonInformation Processing Letters, 1978