Computing Boundary Cycle of a Pseudo-Triangle Polygon from Its Visibility Graph - Topics in Theoretical Computer Science Access content directly
Conference Papers Year : 2020

Computing Boundary Cycle of a Pseudo-Triangle Polygon from Its Visibility Graph

Hossein Boomari
  • Function : Author
  • PersonId : 1093215
Soheila Farokhi
  • Function : Author
  • PersonId : 1093216

Abstract

Visibility graph of a simple polygon is a graph with the same vertex set in which there is an edge between a pair of vertices if and only if the segment through them lies completely inside the polygon. Each pair of adjacent vertices on the boundary of the polygon are assumed to be visible. Therefore, the visibility graph of each polygon always contains its boundary edges. This implies that we have always a Hamiltonian cycle in a visibility graph which determines the order of vertices on the boundary of the corresponding polygon. In this paper, we propose a polynomial time algorithm for determining such a Hamiltonian cycle for a pseudo-triangle polygon from its visibility graph.
Fichier principal
Vignette du fichier
495613_1_En_5_Chapter.pdf (239.68 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03165378 , version 1 (10-03-2021)

Licence

Attribution

Identifiers

Cite

Hossein Boomari, Soheila Farokhi. Computing Boundary Cycle of a Pseudo-Triangle Polygon from Its Visibility Graph. 3rd International Conference on Topics in Theoretical Computer Science (TTCS), Jul 2020, Tehran, Iran. pp.61-71, ⟨10.1007/978-3-030-57852-7_5⟩. ⟨hal-03165378⟩
34 View
14 Download

Altmetric

Share

Gmail Facebook X LinkedIn More