1. An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles
2. U. Lauther , "An o (n log n) algorithm for boolean mask operations," in Proc . DAC , 1981 , p. 555 -- 562 . U. Lauther, "An o (n log n) algorithm for boolean mask operations," in Proc. DAC, 1981, p. 555--562.
3. M. Sato , J. Kim , T. Awashima , and T. Ohtsuki , " A theoretically optimal and practically fast algorithm for vlsi geometrical design rule verification," in Proc . ISCAS , 1988 , pp. 1445 -- 1448 . M. Sato, J. Kim, T. Awashima, and T. Ohtsuki, "A theoretically optimal and practically fast algorithm for vlsi geometrical design rule verification," in Proc. ISCAS, 1988, pp. 1445--1448.
4. An o (n log m) algorithm for vlsi design rule checking;Bonapace C. R.;IEEE TCAD,1992
5. G. E. Bier and A. R. Pleszkun , " An algorithm for design rule checking on a multiprocessor," in Proc . DAC , 1985 , pp. 299 -- 304 . G. E. Bier and A. R. Pleszkun, "An algorithm for design rule checking on a multiprocessor," in Proc. DAC, 1985, pp. 299--304.