This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
S. Arora, Polynomial-time approximation schemes for Euclidean TSP and other geometric problems, Proc. 37th IEEE Symp. on Foundations of Computer Science, (1996) pp. 2–12.
S. Arora, Nearly linear time approximation schemes for Euclidean TSP and other geometric problems, IProc. 38th IEEE Symp. on Foundations of Computer Science, (1997) pp. 554–563.
S. Arora, Polynomial-time approximation schemes for Euclidean TSP and other geometric problems, Journal of the ACM 45 (1998) 753–782.
Mihaela Cadei, Xiaoyan Cheng, Xiuzhen Cheng, and Ding-Zhu Du, A tale in guillotine cut, in Proc. of Workshop on Novel Approaches to Hard Discrete Optimization, 2002
V.J. Dielissen and A. Kaldewaij, Rectangular partition is polynomial in two dimensions but NP-complete in three, Information Processing Letters 38 (1991) 1–6.
D.Z. Du, F.K. Hwang, M.T. Shing and T. Witbold: Optimal routing trees, IEEE Transactions on Circuits 35 (1988) 1335–1337.
D.-Z. Du, L.-Q. Pan, and M.-T. Shing, Minimum edge length guillotine rectangular partition, Technical Report 0241886, Math. Sci. Res. Inst., Univ. California, Berkeley, 1986.
D.-Z. Du, D.F. Hsu, and K.-J Xu, Bounds on guillotine ratio, Congressus Numerantium 58 (1987) 313–318.
D.-Z. Du, On heuristics for minimum length rectangularpartitions, Technical Report, Math. Sci. Res. Inst., Univ. California, Berkeley, 1986.
D.-Z. Du and Y.-J. Zhang: On heuristics for minimum length rectilinear partitions, Algorithmica, 5 (1990) 111–128.
T. Gonzalez and S.Q. Zheng, Bounds for partitioning rectilinear polygons, Proc. 1st Symp. on Computational Geometry, 1985.
T. Gonzalez and S.Q. Zheng, Improved bounds for rectangular and guillotine partitions, Journal of Symbolic Computation 7 (1989) 591–610.
A. Gorpinevich and V. Soltan, Simple algorithms of the partition of rectilinear regions into rectangles in VLSI engineering, Bull. Acad. Sci. Mold. SSR. Ser. Phis.-Techn, and Math. Sci. No. 2 (1989) 19–25 (Russian).
L. Ferrari, P.V. Sancar and J. Sklansky, Minimal rectilinear partitions of digitized blocks, Comput. Vision Graphics Image Process 28 (1984) 58–71.
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 (1979) 25–29 (Russian).
C. Levcopoulos, Fast heuristics for minimum length rectangular partitions of polygons, Proc 2nd Symp. on Computational Geometry, 1986.
A. Lingas, R. Y. Pinter, R. L. Rivest, and A. Shamir, Minimum edge length partitioning of rectilinear polygons, Proc, 20th Allerton Conf. on Comm. Control and Compt., Illinos, 1982.
A. Lingas, The power of non-rectilinear holes, Lecture Notes on Computer Science, Vol. 140 (Springer-Verlag, 1982) 369–383.
A. Lingas, Heuristics for minimum edge length rectangular partitions of rectilinear figures, Proc. 6th GI-Conference, Dortmund, January 1983 (Springer-Verlag).
W.T. Liou, J.J.-M. Tan, and R.C.T. Lee, Minimum rectangular partition problem for simple rectilinear polygons, IEEE Trans. on Computer-Aided Designs 9:7 (1990) 720–733.
W.T. Liou, J.J.-M. Tan, and R.C.T. Lee, Minimum partioning simple rectilinear polygons in O(n log log n)-time, 1989, manuscript.
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, An O(n log n) Manhattan path algorithm, Information Processing Letters 19 (1984) 99–102.
B. Lu and L. Ruan, Polynomial time approximation scheme for the rectilinear Steiner arborescence problem, Journal of Combinatorial Optimization 4 (2000) 357–363.
J.S.B. Mitchell, Guillotine subdivisions approximate polygonal subdivisions: A simple new method for the geometric k-MST problem. Proc. 7th ACM-SIAM Symposium on Discrete Algorithms, (1996) pp. 402–408.
J.S.B. Mitchell, A. Blum, P. Chalasani, S. Vempala, A constant-factor approximation algorithm for the geometric k-MST problem in the plane SIAM J. Comput. 28 (1999), no. 3, 771–781.
J.S.B. Mitchell, Guillotine subdivisions approximate polygonal subdivisions: Part II-A simple polynomial-time approximation scheme for geometric k-MST TSP, and related problem, SIAM J. Comput. 29 (1999), no. 2, 515–544.
J.S.B. Mitchell, Guillotine subdivisions approximate polygonal subdivisions: Part III-Faster polynomial-time approximation scheme for geometric network optimization, preprint, 1997.
T. Ohtsuki, Minimum dissection of rectilinear region, Proceedings of IEEE Symposium on Circuits and Systems, 1982, pp.1210–1213.
V. Soltan and A. Gorpinevich, Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles, Discrete and Computational Geometry 9 (1993) 57–79.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Kluwer Academic Publishers
About this chapter
Cite this chapter
Cheng, X., Du, DZ., Kim, JM., Ruan, L. (2004). Optimal Rectangular Partitions. In: Du, DZ., Pardalos, P.M. (eds) Handbook of Combinatorial Optimization. Springer, Boston, MA. https://doi.org/10.1007/0-387-23830-1_7
Download citation
DOI: https://doi.org/10.1007/0-387-23830-1_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-23829-6
Online ISBN: 978-0-387-23830-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)