Loading...

Computing boundary cycle of a pseudo-triangle polygon from its visibility graph

Boomari, H ; Sharif University of Technology | 2020

418 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/978-3-030-57852-7_5
  3. Publisher: Springer Science and Business Media Deutschland GmbH , 2020
  4. Abstract:
  5. 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. © 2020, IFIP International Federation for Information Processing
  6. Keywords:
  7. Geometry ; Graph algorithms ; Hamiltonians ; Polynomial approximation ; Visibility ; Adjacent vertices ; Boundary edges ; Hamiltonian cycle ; Polynomial-time algorithms ; Simple polygon ; Triangle polygon ; Vertex set ; Visibility graphs ; Graph theory
  8. Source: 3rd IFIP WG 1.8 International Conference on Topics in Theoretical Computer Science, TTCS 2020, 1 July 2020 through 2 July 2020 ; Volume 12281 LNCS , 2020 , Pages 61-71
  9. URL: https://link.springer.com/chapter/10.1007%2F978-3-030-57852-7_5