Abstract
In this paper, the problem of dissecting a plane rectilinear polygon with arbitrary (possibly, degenerate) holes into a minimum number of rectangles is shown to be solvable inO(n 3/2 logn) time. This fact disproves a famous assertion about the NP-hardness of the minimum rectangular dissection problem for rectilinear polygons with point holes.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
L. Ferrari, P. V. Sancar, and J. Sklansky, Minimal rectilinear partitions of digitized blocks,Comput. Vision Graphics Image Process. 28 (1984), 58–71.
A. N. Gorpinevich and V. Soltan, Simple algorithms of the partition of rectilinear regions into rectangles in VLSI engineering,Bull. Acad. Sci. Mold. SSR. Ser. Phis.—Tehn, and Math. Sci. No. 2 (1989), 19–25 (Russian).
H. Imai and T. Asano, Efficient algorithm for geometric graph search problems,SIAM J. Comput. 15 (1986), 478–494.
N. M. Kornienko, G. V. Matveev, N. N. Metelsky and R. I. Tyshkevich, On tiling of polygons,Izv. Akad. Nauk. BSSR. Ser. Phis.—Math. Sci. No. 2 (1978), 25–29 (Russian).
A. Lingas, The power of non-rectilinear holes. Lecture Notes on Computer Science, Vol. 140. Springer-Verlag, Berlin, 1982, pp. 369–383.
W. Lipski, E. Lord, F. Luccio, C. Mugnai, and L. Pagli, On two-dimensional data organization II,Fund. Inform. 2 (1979), 245–260.
W. Lipski, Finding a Manhattan path and related problems,Networks,13 (1983), 399–409.
W. Lipski, AnO(n logn) Manhattan path algorithms,Inform. Process. Lett. 19 (1984), 99–102.
V. P. Rubtsov, Realization of VLSI topology by rectangles,Electronnaya Tehnica. Ser. 3. No. 6 (1976), 54–61 (Russian).
V. Soltan and A. N. Gorpinevich, Minimum partition of a plane region into rectangles, In:Republican Seminar on Discrete Optimization, Kiev, 1985, pp. 107–108 (Russian).
V. Soltan and A. N. Gorpinevich, Some algorithms of the partition of a plane region into rectangles, In:Geometrie und Anwendungen. Vortrage der 7.Tagung der Fachsektion Geometrie. AdW der DDR, Berlin, 1988, pp. 111–112.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Soltan, V., Gorpinevich, A. Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles. Discrete Comput Geom 9, 57–79 (1993). https://doi.org/10.1007/BF02189307
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02189307