An approximation algorithm for minimum convex cover with logarithmic performance guarantee

SIAM Journal on Computing

Volumn 32, Issue 3, 2003, Pages 654-670

  Eidenbenz, Stephan J ^a,b   Widmayer, Peter ^b  

^a LOS ALAMOS NATIONAL LABORATORY   (United States)

^b ETH ZURICH   (Switzerland)

Author keywords

Approximation algorithms; Art gallery; Convex cover; Dynamic programming; Inapproximability

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; DYNAMIC PROGRAMMING; ITERATIVE METHODS; NUMBER THEORY; OPTIMIZATION; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

APPROXIMATION ALGORITHM; CONVEX POLYGONS; LOGARITHMIC FACTOR; MINIMUM CONVEX COVER;

ALGORITHMS;

EID: 0038299448     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539702405139     Document Type: Article

References (19)

1. S. Arora and C. Lund, Hardness of approximations, in Approximation Algorithms for NP-Hard Problems, D. Hochbaum, ed., PWS Publishing Company, Boston, 1996, pp. 399-446.
2. B. Chazelle and D. P. Dobkin, Optimal convex decompositions, in Computational Geometry, Mach. Intelligence Pattern Recogn. 2, North-Holland, Amsterdam, 1985, pp. 63-133.
3. P. Crescenzi and V. Kann, A compendium of NP optimization problems, in Complexity and Approximation. Combinatorial Optimization Problems and Their Approximability Properties, G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi, eds., Springer-Verlag, Berlin, 1999, pp. 87-122.
4. J. C. Culberson and R. A. Reckhow, Covering polygons is hard, J. Algorithms, 17 (1994), pp. 2-44.
5. D. P. Dobkin, H. Edelsbrunner, and M. H. Overmars, Searching for empty convex polygons, Algorithmica, 5 (1990), pp. 561-571.
6. S. Eidenbenz, C. Stamm, and P. Widmayer, Inapproximability results for guarding polygons and terrains, Algorithmica, 31 (2001), pp. 79-113.
7. S. Eidenbenz, (In-)Approximability of Visibility Problems on Polygons and Terrains, Ph.D. thesis, Dissertation ETH 13683, Zürich, Switzerland, 2000.
8. S. Eidenbenz and P. Widmayer, An approximation algorithm for minimum convex cover with logarithmic performance guarantee, in Algorithms-ESA 2001 (Århus), Lecture Notes in Comput. Sci. 2161, Springer-Verlag, Berlin, 2001, pp. 333-343.
9. D. S. Franzblau, Performance guarantees on a sweep-line heuristic for covering rectilinear polygons with rectangles, SIAM J. Discrete Math., 2 (1989), pp. 307-321.
10. S. Ghosh, Approximation algorithm for art gallery problems, in Proceedings of the Canadian Information Processing Society Congress, Mississauga, ON, Canada, 1987.
11. J. Gudmundsson and C. Levcopoulos, Close approximations of minimum rectangular coverings, J. Comb. Optim., 3 (1999), pp. 437-452.
12. D. H. Green, The decomposition of polygons into convex parts, in Computational Geometry, Advances in Computer Research 1, F. P. Preparata, ed., JAI Press, London, 1983, pp. 235-259.
13. D. Hochbaum, Approximating covering and packing problems: Set cover, vertex cover, independent set, and related problems, in Approximation Algorithms for NP-Hard Problems, D. Hochbaum, ed., PWS Publishing Company, Boston, 1996, pp. 94-143.
14. V. S. A. Kumar and H. Ramesh, Covering rectilinear polygons with axis-parallel rectangles, in Proceedings of the 31st ACM Symposium on Theory of Computing, ACM, New York, 1999, pp. 445-454.
15. A. Lingas, The power of nonrectilinear holes, in Automata, Languages, and Programming, Lecture Notes in Comput. Sci. 140, Springer-Verlag, Berlin, 1982, pp. 369-383.
16. A. Lingas and V. Soltan, Minimum convex partition of a polygon with holes by cuts in given directions, Theory Comput. Syst., 31 (1998), pp. 507-538.
17. J. O'Rourke and K. J. Supowit, Some NP-hard polygon decomposition problems, IEEE Trans. Inform. Theory, 29 (1983), pp. 181-190.
18. T. Shermer, Recent results in art galleries, Proc. IEEE, 80 (1992), pp. 1384-1399.
19. J. Urrutia, Art gallery and illumination problems, in Handbook on Computational Geometry, J.-R. Sack and J. Urrutia, eds., Elsevier, New York, 2000, pp. 973-1027.