Document

# Bounding and Computing Obstacle Numbers of Graphs

## File

LIPIcs.ESA.2022.11.pdf
• Filesize: 1 MB
• 13 pages

## Acknowledgements

This research was initiated at the Bertinoro Workshop on Graph Drawing 2022 (BWGD'22).

## Cite As

Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, and Alexander Wolff. Bounding and Computing Obstacle Numbers of Graphs. In 30th Annual European Symposium on Algorithms (ESA 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 244, pp. 11:1-11:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
https://doi.org/10.4230/LIPIcs.ESA.2022.11

## Abstract

An obstacle representation of a graph G consists of a set of pairwise disjoint simply-connected closed regions and a one-to-one mapping of the vertices of G to points such that two vertices are adjacent in G if and only if the line segment connecting the two corresponding points does not intersect any obstacle. The obstacle number of a graph is the smallest number of obstacles in an obstacle representation of the graph in the plane such that all obstacles are simple polygons. It is known that the obstacle number of each n-vertex graph is O(n log n) [Balko, Cibulka, and Valtr, 2018] and that there are n-vertex graphs whose obstacle number is Ω(n/(log log n)²) [Dujmović and Morin, 2015]. We improve this lower bound to Ω(n/log log n) for simple polygons and to Ω(n) for convex polygons. To obtain these stronger bounds, we improve known estimates on the number of n-vertex graphs with bounded obstacle number, solving a conjecture by Dujmović and Morin. We also show that if the drawing of some n-vertex graph is given as part of the input, then for some drawings Ω(n²) obstacles are required to turn them into an obstacle representation of the graph. Our bounds are asymptotically tight in several instances. We complement these combinatorial bounds by two complexity results. First, we show that computing the obstacle number of a graph G is fixed-parameter tractable in the vertex cover number of G. Second, we show that, given a graph G and a simple polygon P, it is NP-hard to decide whether G admits an obstacle representation using P as the only obstacle.

## Subject Classification

##### ACM Subject Classification
• Theory of computation → Computational geometry
• Human-centered computing → Graph drawings
##### Keywords
• Obstacle representation
• Obstacle number
• Visibility
• NP-hardness
• FPT

## Metrics

• Access Statistics
• Total Accesses (updated on a weekly basis)
0

## References

1. Oswin Aichholzer, Jean Cardinal, Vincent Kusters, Stefan Langerman, and Pavel Valtr. Reconstructing point set order types from radial orderings. Internat. J. Comput. Geom. Appl., 26(3-4):167-184, 2016. URL: https://doi.org/10.1142/S0218195916600037.
2. Hannah Alpert, Christina Koch, and Joshua D. Laison. Obstacle numbers of graphs. Discrete Comput. Geom., 44(1):223-244, 2010. URL: https://doi.org/10.1007/s00454-009-9233-8.
3. Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, and Alexander Wolff. Bounding and computing obstacle numbers of graphs, 2022. URL: http://arxiv.org/abs/2206.15414.
4. Martin Balko, Josef Cibulka, and Pavel Valtr. Drawing graphs using a small number of obstacles. Discrete Comput. Geom., 59(1):143-164, 2018. URL: https://doi.org/10.1007/s00454-017-9919-2.
5. Jean Cardinal and Udo Hoffmann. Recognition and complexity of point visibility graphs. Discrete & Computational Geometry, 57(1):164-178, January 2017. URL: https://doi.org/10.1007/s00454-016-9831-1.
6. Steven Chaplick, Fabian Lipp, Ji-won Park, and Alexander Wolff. Obstructing visibilities with one obstacle. In Yifan Hu and Martin Nöllenburg, editors, Proc. 24th Int. Symp. Graph Drawing & Network Vis. (GD), volume 9801 of LNCS, pages 295-308. Springer, 2016. URL: https://doi.org/10.1007/978-3-319-50106-2_23.
7. Rodney G. Downey and Michael R. Fellows. Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, 2013. URL: https://doi.org/10.1007/978-1-4471-5559-1.
8. Vida Dujmović and Pat Morin. On obstacle numbers. Electr. J. Comb., 22(3):#P3.1, 2015. URL: https://doi.org/10.37236/4373.
9. Stefan Felsner and Pavel Valtr. Coding and counting arrangements of pseudolines. Discrete Comput. Geom., 46(3):405-416, 2011. URL: https://doi.org/10.1007/s00454-011-9366-4.
10. Oksana Firman, Philipp Kindermann, Jonathan Klawitter, Boris Klemz, Felix Klesen, and Alexander Wolff. Outside-obstacle representations with all vertices on the outer face. In Patrizio Angelini and Reinhard von Hanxleden, editors, Proc. 30th Int. Symp. Graph Drawing & Network Vis. (GD'22), 2022. URL: http://arxiv.org/abs/2202.13015.
11. Michael R. Garey and David S. Johnson. Complexity results for multiprocessor scheduling under resource constraints. SIAM J. Comput., 4(4):397-411, 1975. URL: https://doi.org/10.1137/0204035.
12. Subir Kumar Ghosh and Bodhayan Roy. Some results on point visibility graphs. Theoretical Computer Science, 575:17-32, 2015. URL: https://doi.org/10.1016/j.tcs.2014.10.042.
13. John Gimbel, Patrice Ossona de Mendez, and Pavel Valtr. Obstacle numbers of planar graphs. In Fabrizio Frati and Kwan-Liu Ma, editors, International Symposium on Graph Drawing and Network Visualization, volume 10692 of LNCS, pages 67-80. Springer, 2017. URL: https://doi.org/10.1007/978-3-319-73915-1_6.
14. Jacob E. Goodman and Richard Pollack. Upper bounds for configurations and polytopes in ℝ^d. Discrete Comput. Geom., 1(3):219-227, 1986. URL: https://doi.org/10.1007/BF02187696.
15. Jacob E. Goodman and Richard Pollack. Allowable sequences and order types in discrete and computational geometry. In New Trends in Discrete and Computational Geometry, volume 10 of Algorithms and Combinatorics, pages 103-134. Springer, Berlin, 1993. URL: https://doi.org/10.1007/978-3-642-58043-7_6.
16. Matthew P. Johnson and Deniz Sarıöz. Representing a planar straight-line graph using few obstacles. In Proc. 26th Canadian Conf. Comput. Geom. (CCCG), pages 95-99, 2014. URL: http://www.cccg.ca/proceedings/2014/papers/paper14.pdf.
17. Donald E. Knuth. Axioms and Hulls, volume 606 of Lecture Notes Comput. Sci. Springer, Heidelberg, Germany, 1992. URL: https://doi.org/10.1007/3-540-55611-7.
18. Padmini Mukkamala, János Pach, and Dömötör Pálvölgyi. Lower bounds on the obstacle number of graphs. Electr. J. Comb., 19(2):#P32, 2012. URL: https://doi.org/10.37236/2380.
19. Frank P. Ramsey. On a problem of formal logic. Proc. London Math. Soc. (2), 30(4):264-286, 1929. URL: https://doi.org/10.1112/plms/s2-30.1.264.
20. Emo Welzl. Constructing the visibility graph for n line segments in O(n²) time. Inform. Process. Lett., 20:167-171, 1985. URL: https://doi.org/10.1016/0020-0190(85)90044-4.
X

Feedback for Dagstuhl Publishing

### Thanks for your feedback!

Feedback submitted

### Could not send message

Please try again later or send an E-mail