Time- and Space-Optimal Contour Computation for a Set of Rectangles
暂无分享,去创建一个
[1] Peter Widmayer,et al. A time-and space-optimal algorithm for Boolean mask operations for orthogonal polygons , 1988 .
[2] Christopher J. Van Wyk,et al. Space Efficient Algorithms for VLSI Artwork Analysis , 1983, 20th Design Automation Conference Proceedings.
[3] Derick Wood,et al. Hole Problems for Rectangles in the Plane , 1988, SIAM J. Discret. Math..
[4] Franco P. Preparata,et al. Finding the Contour of a Union of Iso-Oriented Rectangles , 1980, J. Algorithms.
[5] Ralf Hartmut Güting,et al. An Optimal Contour Algorithm for Iso-Oriented Rectangles , 1984, J. Algorithms.
[6] Derick Wood. The Contour Problem for Rectilinear Polygons , 1984, Inf. Process. Lett..
[7] Jan van Leeuwen,et al. Computing the Connected Components of Simple Rectilinear Geometrical Objects in D-Space , 1984, RAIRO Theor. Informatics Appl..
[8] Franco P. Preparata,et al. Plane-sweep algorithms for intersecting geometric figures , 1982, CACM.