This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Chazelle, B.M., “Computational Geometry and Convexity”, PhD Dissertation, 1980, pp 140–145.
Chaiken, S., D.J. Kleitman, M. Saks and J. Shearer, “Covering Regions by Rectangles”, SIAM J. Alg. Disc. Meth., vol. 2, no. 4, 1981.
Franzblau, D., D. Kleitman, “An Algorithm for Constructing Regions with Rectangles”, Proc. 16th Annual ACM Symp. on Theory of Comp., 1984.
Hegedüs, A., “Algorithms for covering polygons by rectangles, Computer Aided Design”, vol. 14, no. 5, 1982.
Kirkpatrick, D.G., “Efficient computation of continuous skeletons”, 20th Annual IEEE Symp. on Found. of Comp. Sc., 1979.
Levcopoulos, C., “On Covering Regions with Minimum Number of Rectangles”, Proc. International Workshop on Parallel Computing and VLSI, Amalfi, Italy, 1984 (North Holland).
Levcopoulos, C., “A Fast Heuristic for Covering Polygons by Rectangles”, Proc. Fundamentals of Comp. Theory, Cottbus, GDR, 1985 (LNCS Springer-Verlag).
Levcopoulos, C., “Covering hole-free polygons with rectangles” (preliminary title), in preparation.
Levcopoulos, C., A. Lingas, “Covering Polygons with Minimum Number of Rectangles”, STACS'84, Paris (LNCS Springer Verlag).
Masek, W.J., “Some NP-complete set covering problems”, manuscript, MIT, August 1979.
O'Rourke, J., “The decidability of covering by convex polygons”, manuscript, The John Hopkins University, May 1982.
O'Rourke, J., and K.J. Supowit, “Some NP-hard Polygon Decomposition Problems”, IEEE Trans. on Information Theory, Vol. IT-29, 2, (1983), 181–190.
Preparata, F.P., and M.I. Shamos, “Computational Geometry”, New York, Springer-Verlag, 1985.
Yamashita, M., T. Ibaraki and N. Honda, “The minimum number cover problem of a rectilinear region by rectangles”, Toyohashi Univ. of Technology, 1984. (abstract appeared in the Bulletin of EATCS, October 1984).
Wiernik, A., “Planar Realizations of Nonlinear Davenport-Schinzel Sequences by Segments”, in Proc. of the 27th IEEE Symp. on Foundations of Computer Science, October 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Levcopoulos, C. (1987). Improved bounds for covering general polygons with rectangles. In: Nori, K.V. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1987. Lecture Notes in Computer Science, vol 287. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18625-5_45
Download citation
DOI: https://doi.org/10.1007/3-540-18625-5_45
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18625-0
Online ISBN: 978-3-540-48033-4
eBook Packages: Springer Book Archive