[ Algorithms for Boolean Mask Operations
(Based on the
Plane Sweep Technique) ]
Mark de Berg, Marc van Kreveld, Mark Overmars,
and Otfried
Schwarzkopf, Computer Geometry - Algorithms and Applications, Second
Edition, 2000, Chapter 1 & Chapter 2, pp. 1-43
Jon Louis Bentley and Thomas A. Ottmann, "Algorithms for Reporting and Counting Geometric Intersections," IEEE
Transactions on Computers, Vol. C-28, No. 9, September 1979, pp. 643-647
Jon Louis Bentley and Derick Wood, "An
Optimal Worst Case Algorithm for Reporting Intersections of Rectangles,"
IEEE Transactions on Computers, Vol. C-29. No. 7, July 1980, pp. 571-577
Ulrich Lauther, "An O(N log N) Algorithm for Boolean Mask Operations," 18th
Design Automation Conference, 1981, pp. 555-562
James A. Wilmore, "Efficient Boolean
Operations on IC Masks," 18th Design Automation Conference, 1981, pp.
571-579
J. Nievergelt and F. P. Preparata, "Plane-Sweep Algorithms for Intersecting
Geometric Figures," Communications of the ACM, October 1982, Vol. 25, No. 10,
pp. 739-747
Thomas Ottmann, Peter Widmayer, and Derick Wood, "A Fast Algorithm for the
Boolean Masking Problem," Computer Vision, Graphics, and Image Processing, 30,
1985, pp. 249-268
