A fast algorithm for the Boolean masking problem
- 30 June 1985
- journal article
- Published by Elsevier in Computer Vision, Graphics, and Image Processing
- Vol. 30 (3), 249-268
- https://doi.org/10.1016/0734-189x(85)90159-8
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A worst-case efficient algorithm for hidden-line elimination†International Journal of Computer Mathematics, 1985
- The contour problem for rectilinear polygonsInformation Processing Letters, 1984
- Stabbing c-oriented polygonsInformation Processing Letters, 1983
- Plane-sweep algorithms for intersecting geometric figuresCommunications of the ACM, 1982
- Comments on “algorithms for reporting and counting geometric intersections”IEEE Transactions on Computers, 1981
- Set Membership Classification: A Unified Approach to Geometric Intersection ProblemsIEEE Transactions on Computers, 1980
- Finding the contour of a union of iso-oriented rectangiesJournal of Algorithms, 1980
- An Optimal Worst Case Algorithm for Reporting Intersections of RectanglesIEEE Transactions on Computers, 1980
- Algorithms for Reporting and Counting Geometric IntersectionsIEEE Transactions on Computers, 1979
- A Characterization of Ten Hidden-Surface AlgorithmsACM Computing Surveys, 1974