Abstract
In an alternative approach to “characterizing” the graph class of visibility graphs of simple polygons, we study the problem of finding a maximum clique in the visibility graph of a simple polygon with n vertices. We show that this problem is very hard, if the input polygons are allowed to contain holes: a gap-preserving reduction from the maxi-mum clique problem on general graphs implies that no polynomial time algorithm can achieve an approximation ratio of \( \frac{{n^{1/8 - \in } }} {4} \) for any ∈ > 0, unless NP = P. To demonstrate that allowing holes in the input polygons makes a major difference, we propose an O(n3) algorithm for the maximum clique problem on visibility graphs for polygons without holes (other O(n 3) algorithms for this problem are already known [3,6,7]). Our algorithm also finds the maximum weight clique, if the polygon vertices are weighted.
We then proceed to study the problem of partitioning the vertices of a visibility graph of a polygon into a minimum number of cliques. This problem is APX-hard for polygons without holes (i.e., there exists a constant γ > 0 such that no polynomial time algorithm can achieve an approximation ratio of 1 +γ ). We present an approximation algorithm for the problem that achieves a logarithmic approximation ratio by iteratively applying the algorithm for finding maximum weighted cliques. Finally, we show that the problem of partitioning the vertices of a visibility graph of a polygon with holes cannot be approximated with a ratio of n1¼ -γ/4 for any γ > 0 by proposing a gap-preserving reduction. Thus, the presence of holes in the input polygons makes this partitioning problem provably harder.
We gratefully acknowledge the support of this work by the Swiss National Science Foundation.
Chapter PDF
Similar content being viewed by others
References
A. Aggarwal, S. Ghosh, and R. Shyamasundar; Computational Complexity of Restricted Polygon Decompositions; Computational Morphology, G. Toussaint, ed., North-Holland, pp. 1–11, 1988.
S. Arora and C. Lund; Hardness of Approximations; in: Approximation Algorithms for NP-Hard Problems (ed. Dorit Hochbaum), PWS Publishing Company, pp. 399–446, 1996.
D. Avis and D. Rappaport; Computing the largest empty convex subset of a set of points; Proc. 1st Ann. ACM Symposium Computational Geometry, pp. 161–167, 1985.
P. Crescenzi, V. Kann; A Compendium of NP Optimization Problems; in the book by G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, M. Protasi, Complexity and Approximation. Combinatorial Optimization Problems and their Approximability Properties, Springer-Verlag, Berlin, 1999; also available in an online-version at:http://www.nada.kth.se/theory/compendium/.
J. C. Culberson and R. A. Reckhow; Covering Polygons is hard; Proc. 29th Symposium on Foundations of Computer Science, 1988.
David P. Dobkin, Herbert Edelsbrunner, and Mark H. Overmars; Searching for Empty Convex Polygons; Algorithmica, 5, pp. 561–571, 1990.
Herbert Edelsbrunner, L. Guibas; Topologically sweeping an arrangement; J. Comput. System Sci. 38, pp. 165–194, 1989.
S. Eidenbenz and P. Widmayer; An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee; manuscript, to appear.
S. Eidenbenz, C. Stamm, and P. Widmayer; Inapproximability of some Art Gallery Problems; Proc. 10th Canadian Conf. Computational Geometry, pp. 64–65, 1998.
S. Eidenbenz, C. Stamm, and P. Widmayer; Positioning Guards at Fixed Height above a Terrain-An Optimum Inapproximability Result; Lecture Notes in Computer Science, Vol. 1461 (ESA’98), pp. 187–198, 1998.
S. Eidenbenz; Inapproximability Results for Guarding Polygons without Holes; Lecture Notes in Computer Science, Vol. 1533 (ISAAC’98), pp. 427–436, 1998.
S. Eidenbenz; How Many People Can Hide in a Terrain ?; Lecture Notes in Computer Science 1741 (ISAAC’99), pp. 184–194, 1999.
H. Everett, D. Corneil; Negative Results on Characterizing Visibility Graphs; Computational Geometry 5, pp. 51–63, 1995.
S. Ghosh; Approximation algorithms for Art Gallery Problems; Proc. of the Canadian Information Processing Society Congress, 1987.
S. Ghosh; On Recognizing and Characterizing Visibility Graphs of Simple Polygons; Discrete Comput Geom 17, pp. 143–162, 1997.
J. Hastad; Clique is hard to approximate within n 1-∈; Proc. of the Symposium on Foundations of Computer Science, 1996.
J. Hershberger; Finding the Visibility Graph of a Polygon in Time Proportional to its Size; Proc. of the 3rd Annual ACM Symposium on Computational Geometry, Waterloo, pp. 11–20, 1987.
D. Hochbaum; Approximating Covering and Packing Problems: Set Cover, Vertex Cover, Independent Set, and Related Problems; in: Approximation Algorithms for NP-Hard Problems (ed. Dorit Hochbaum), PWS Publishing Company, pp. 94–143, 1996.
D. T. Lee and A. K. Lin; Computational Complexity of Art Gallery Problems; IEEE Trans. Info. Th, pp. 126–282, IT-32, 1986.
J. O’Rourke and K. J. Supowit; Some NP-hard Polygon Decomposition Problems; IEEE Transactions on Information Theory, Vol IT-29, No. 2, 1983.
J. O’Rourke; Art Gallery Theorems and Algorithms; Oxford University Press, New York (1987).
J. O’Rourke; Open problems in the combinatorics of visibility and illumination; inAdvances in Discrete and Computational Geometry, eds. B. Chazelle and J. E. Goodman and R. Pollack, (Contemporary Mathematics) American Mathematical Society, Providence, pp. 237–243, 1998.
C.H. Papadimitriou and M. Yannakakis; Optimization, approximation, and complexity classes; Proc. 20th ACM Symposium on the Theory of Computing, pp. 229–234, 1988.
L. Prasad, S.S. Iyengar; A note on the combinatorial structure of the visibility graph in simple polygons; Theoretical Computer Science 140, pp. 249–263, 1995.
T. Shermer; Recent results in Art Galleries; Proc. of the IEEE, 1992.
T. Shermer; Hiding People in Polygons; Comuting 42, pp. 109–131, 1989.
J. Urrutia; Art gallery and Illumination Problems; in Handbook on Computational Geometry, edited by J.-R. Sack and J. Urrutia, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eidenbenz, S., Stamm, C. (2000). Maximum Clique and Minimum Clique Partition in Visibility Graphs. In: van Leeuwen, J., Watanabe, O., Hagiya, M., Mosses, P.D., Ito, T. (eds) Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics. TCS 2000. Lecture Notes in Computer Science, vol 1872. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44929-9_16
Download citation
DOI: https://doi.org/10.1007/3-540-44929-9_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67823-6
Online ISBN: 978-3-540-44929-4
eBook Packages: Springer Book Archive