Approximation algorithms for covering polygons with squares and similar problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1269, Issue , 1997, Pages 27-41

  Levcopoulos, Christos ^a   Gudmundsson, Joachim ^a  

^a LUND UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GEOMETRY; POLYNOMIAL APPROXIMATION; RANDOM PROCESSES;

ACKERMANN'S FUNCTIONS; APPROXIMATION FACTOR; ARBITRARY INPUTS; CONSTANT-FACTOR APPROXIMATION ALGORITHMS; LINEAR TIME; POLYNOMIAL-TIME; RUNNING-IN; TIME ALGORITHMS;

APPROXIMATION ALGORITHMS;

EID: 84957712785     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63248-4_3     Document Type: Conference Paper

References (18)

1. L.J. Aupperle, H.E. Conn, J.M. Keil and J. O'Rourke, Covering Orthogonal Polygons with Squares, 26th Annual Allerton Conference on Communication, Control and Computation, 1988.
2. R. Bar-Yehuda and E. Ben-Hanoch, A Linear-Time Algorithm for Covering Simple Polygons with Similar rectangles, International Journal of Computational Geometry k. Applications, vol. 6, no 1, 1996.
3. B.M. Chazelle, Computational Geometry and Convexity, Ph.D. Thesis, Dept. Comp. Sci., Yale University, New Haven, CT, 1979. Carnegie-Mellon Univ. Report CS-80-150.
4. J. Snoeyink, C.A. Wang and F. Chin, Finding the Medial Axis of a Simple Polygon in Linear-Time, ISAAC '95, Cairns, Australia, 1995 (LNCS 1006 Springer-Verlag).
5. C. Levcopoulos and J. Gudmundsson, Close Approximation of Mimmum Rectangular Coverings, FST&TCS-16, Hyderabad, India, 1996 (LNCS, Springer-Verlag).
6. C. Levcopoulos and J. Gudmundsson, Approximation Algorithms for Covering Polygons with Squares and Similar Problems, LU-CS-TR:96-181, Dept, of Comp. Sci., Lund University, 1996.
7. A. Hegedüs, Algorithms for covering polygons by rectangles, Computer Aided Design, vol. 14, no 5, 1982.
8. S. Hart and M. Sharir, Nonlinearity of Davenport-Schinzel Sequences and of Generalized Path Compression Schemes, Tech. Report 84-011, The Eskenasy Institute of Comp. Sci., Tel Aviv University, August 1984.
9. D.G. Kirkpatrick, Efficient computation of continuous skeletons, 20th Annual IEEE Symposium on Foundation of Computer Science, 1979.
10. J.M. Keil and J.-R. Sack, Minimum Decompositions of Polygonal Objects, Machine Intelligence and Pattern Recognition vol. 2: Computational Geometry, pp. 197-215, Elsevier Science Publishers B.V., 1985.
11. C. Levcopoulos, A Fast Heuristic for Covering Polygons by Rectangles, FCT'85, Cottbus, GDR, 1985 (LNCS 199, Springer-Verlag).
12. C. Levcopoulos, Improved Bounds for Covering General Polygons with Rectangles, FST&TCS-7, Pune, India, 1987 (LNCS 287, Springer-Verlag).
13. D. Morita, Finding a Minimal Cover for Binary Images: an Optimal Parallel Algorithm, Tech. Report No. 88-946, Dept, of Comp. Sci., Cornell University, 1988.
14. J. O'Rourke and K.J. Supowit, Some NP-hard Polygon Decomposition Problems, IEEE Transactions on Information Theory, vol. IT-29, pp.181-190, 1983.
15. F.P. Preparata and M.I. Shamos, Computational Geometry, New York, Springer- Verlag, 1985.
16. S. Rajasekaran and S. Raxnaswami, Optimal Parallel Randomized Algorithms for the Voronoi Diagram of Line Segments in the Plane and Related Problems, In Proc. ACM Symposium on Computational Geometry, Stony Brook, New York, 1994.
17. D.S. Scott and S.S. Iyengar, TID: a Translation Invariant Data Structure for Storing Images, Comm, of the ACM, vol. 29, no. 5, 1986.
18. A. Wiernik, Planar Realization of Nonlinear Davenport-Schinzel Sequences by Segments, 27th IEEE Symposium on Computer Science, 1986.