Recognizing Visibility Graphs of Triangulated Irregular Networks

• Autorzy: Boomari Hossein , Ostovari Mojtaba , Zarei Alireza

Identyfikatory

DOI

10.3233/FI-2021-2027

• Języki publikacji: EN

Abstrakty

EN

A Triangulated Irregular Network (TIN) is a data structure that is usually used for representing and storing monotone geographic surfaces, approximately. In this representation, the surface is approximated by a set of triangular faces whose projection on the XY -plane is a triangulation. The visibility graph of a TIN is a graph whose vertices correspond to the vertices of the TIN and there is an edge between two vertices if their corresponding vertices on TIN see each other, i.e. the segment that connects these vertices completely lies above the TIN . Computing the visibility graph of a TIN and its properties have been considered thoroughly in the literature. In this paper, we consider this problem in reverse: Given a graph G, is there a TIN with the same visibility graph as G ? We show that this problem is ∃ℝ-Complete .

Słowa kluczowe

EN

visibility graph triangulated; irregular network recognizing; visibility graph existential; theory of the reals

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2021
• Tom: Vol. 179, nr 4
• Strony: 345--360
• Opis fizyczny: Bibliogr. 14 poz., rys., wykr.

Twórcy

autor

Boomari Hossein

• Department of Mathematical Science, Sharif University of Technology, Azadi Street, Tehran, Iran

autor

Ostovari Mojtaba

• Department of Mathematical Science, Sharif University of Technology, Azadi Street, Tehran, Iran

autor

Zarei Alireza

• Department of Mathematical Science, Sharif University of Technology, Azadi Street, Tehran, Iran

Bibliografia

• [1] O’Sullivan D, Turner A. Visibility graphs and landscape visibility analysis. International Journal of Geographical Information Science, 2001. 15(3):221-237. doi:10.1080/13658810151072859.
• [2] Nagy G. Terrain visibility. Computers & graphics, 1994. 18(6):763-773. doi:10.1016/0097-8493(94)90002-7.
• [3] Floriani L, Magillo P. Algorithms for visibility computation on terrains: a survey. Environment and Planning B: Planning and Design, 2003. 30(5):709-728. doi:10.1068/b12979.
• [4] Cardinal J, Hoffmann U. Recognition and complexity of point visibility graphs. Discrete & Computational Geometry, 2017. 57(1):164-178. doi:10.1007/s00454-016-9831-1.
• [5] Ghosh SK. On recognizing and characterizing visibility graphs of simple polygons. In: Scandinavian Workshop on Algorithm Theory, volume LNCS 318. Springer, 1988 pp. 96-104. doi:10.1007/3-540-19487-8_10.
• [6] Gibson M, Krohn E, Wang Q. A characterization of visibility graphs for pseudo-polygons. In: Algorithms-ESA, Springer, 2015 pp. 607-618. doi:10.1007/978-3-662-48350-3_51.
• [7] Evans W, Saeedi N. On characterizing terrain visibility graphs. Journal of Computational Geometry, 2015. 6(1):108-141. doi:10.20382/jocg.v6i1a5.
• [8] Abello J, Kumar K. Visibility graphs and oriented matroids. In: International Symposium on Graph Drawing, volume LNCS 894. Springer, 1994 pp. 147-158. ISBN:3540589503, 9783540589501.
• [9] Blum L, Shub M, Smale S. On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bulletin of the American Mathematical Society, 1989. 21(1):1-46.
• [10] Shor P. Stretchability of pseudolines is NP-hard. Applied Geometry and Discrete Mathematics-The Victor Klee Festschrift, 1991.
• [11] Schaefer M. Complexity of some geometric and topological problems. In: International Symposium on Graph Drawing. Springer, 2009 pp. 334-344. doi:10.1007/978-3-642-11805-0_32.
• [12] Richter-Gebert J. Mnëv’s Universality Theorem Revisited. Séminaire Lotaringien de Combinatorie, 1995.
• [13] Canny J. Some algebraic and geometric computations in PSPACE. In: Proceedings of the twentieth annual ACM symposium on Theory of computing. ACM, 1988 pp. 460-467. doi:10.1145/62212.62257.
• [14] Goodman JE, Pollack R. Allowable sequences and order types in discrete and computational geometry. In: New trends in discrete and computational geometry, pp. 103-134. Springer, 1993. doi:10.1007/978-3-642-58043-7_6.

Uwagi

Opracowanie rekordu ze środków MNiSW, umowa Nr 461252 w ramach programu "Społeczna odpowiedzialność nauki" - moduł: Popularyzacja nauki i promocja sportu (2021).