Visibility Graphs of Anchor Polygons - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

Visibility Graphs of Anchor Polygons


Visibility graph of a polygon corresponds to its internal diagonals and boundary edges. For each vertex on the boundary of the polygon, we have a vertex in this graph and if two vertices of the polygon see each other there is an edge between their corresponding vertices in the graph. Two vertices of a polygon see each other if and only if their connecting line segment completely lies inside the polygon. Recognizing visibility graphs is the problem of deciding whether there is a simple polygon whose visibility graph is isomorphic to a given graph. Another important problem is to reconstruct such a polygon if there is any. These are well-known and well-studied, but yet open problems in geometric graphs and computational geometry. However, these problems have been solved efficiently for special cases where the target polygon is known to be a tower or a spiral polygon. In this paper, we solve these recognizing and reconstruction problems for another type of polygons, named anchor polygons.
Fichier principal
Vignette du fichier
385217_1_En_6_Chapter.pdf (309.66 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01446265 , version 1 (25-01-2017)





Hossein Boomari, Alireza Zarei. Visibility Graphs of Anchor Polygons. 1st International Conference on Theoretical Computer Science (TTCS), Aug 2015, Tehran, Iran. pp.72-89, ⟨10.1007/978-3-319-28678-5_6⟩. ⟨hal-01446265⟩
120 View
88 Download



Gmail Facebook Twitter LinkedIn More