Divide-and-conquer in planar geometry

References

• Bentley , J.L. 1977 . Solutions to Klee's rectangle problems , Carnegie-Mellon University . Department of Computer Science, unpublished manuscript
   Google Scholar
• Bentley , J.L. and Ottmann , Th. 1979 . Algorithms for reporting and counting geometric intersections . IEEE Transactions on Computers , C-28 : 643 – 647 .
   Web of Science ®Google Scholar
• Bentley , J.L. and Wood , D. 1980 . An optimal worst-case algorithm for reporting intersections of rectangles . IEEE Transactions on Computers , C-29 : 571 – 577 .
   Web of Science ®Google Scholar
• Edelsbrunner , H. 1983 . A new approach lo rectangle intersections, Part I . International Journal of Computer Mathematics , 13 : 209 – 219 .
   Web of Science ®Google Scholar
• Edelsbrunner , H. , Van Leeuwen , J. , Ottmann , Th. and Wood , D. 1984 . Connected components of orthogonal geometrical objects . RAIRO Theoretical Informatics , 18 : 171 – 183 .
   Web of Science ®Google Scholar
• Güing , R.H. 1984 . An optimal contour algorithm for iso-oriented rectangles . Journal of Algorithms , 5 : 303 – 326 .
   Google Scholar
• Güting , R.H. 1984 . Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles . Acta Informatica , 21 : 271 – 291 .
   Web of Science ®Google Scholar
• Güting , R.H. 1983 . Conquering contours: Efficient algorithms for computational geometry , Universität Dortmund . Lehrstuhl Informatik VI, Ph.D. thesis
   Google Scholar
• Güting R. H. Finding connected components in a set of rectangles by divide-and-conquer 1983 unpublished notes
   Google Scholar
• Güting , R.H. and Schilling , W. 1985 . A practical divide-and-conquer algorithm for the rectangle intersection problem , Universität Dortmund . Abteilung Informatik, Report 196
   Google Scholar
• Güting , R.H. and Wood , D. 1984 . Finding rectangle intersections by divide-and-conquer . IEEE Transactions on Computers , C-33 : 671 – 675 .
   Web of Science ®Google Scholar
• Lee , D.T. and Preparata , F.P. 1982 . An improved algorithm for the rectangle enclosure problem . Journal of Algorithms , 3 : 218 – 224 .
   Web of Science ®Google Scholar
• Lipski , W. and Preparata , F.P. 1980 . Finding the contour of a union of iso-oriented rectangles . Journal of Algorithms , 1 : 235 – 246 .
   Google Scholar
• McCreight , E.M. 1980 . Efficient algorithms for enumerating intersecting intervals and rectangles , XEROX Palo Alto Research Center . Report CSL-80-9
   Google Scholar
• Schilling , W. 1985 . A time- and space-optimal divide-and-conquer solution for the rectangular closure problem , Universität Dortmund . Lehrstuhl Informatik VI, in preparation
   Google Scholar
• Shamos , M.I. 1978 . “ Computational geometry ” . In Ph.D. thesis , Yale University .
   Google Scholar
• Six , H.W. and Wood , D. 1982 . Counting and reporting intersections of d-ranges . IEEE Transactions on Computers , C-31 : 181 – 187 .
   Web of Science ®Google Scholar
• Soisalon-Soisinen , E. and Wood , D. 1984 . Optimal algorithms to compute the closure of a set of iso-rectangles . Journal of Algorithms , 5 : 199 – 214 .
   Web of Science ®Google Scholar
• Vaishnavi , V. and Wood , D. 1980 . Data structures for the rectangle containment and enclosure problems . Computer Graphics and Image Processing , 13 : 372 – 384 .
   Google Scholar
• Van Leeuwen , J. and Wood , D. 1981 . The measure problem for rectangular ranges in d-space . Journal of Algorithms , 2 : 282 – 300 .
   Web of Science ®Google Scholar