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

arXiv: https://arxiv.org/abs/2002.06712 · HTML: https://mlsanity.com/paper/2002.06712/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 16 Feb 2020.

## Built on by (most cited first, 1 of 1)

- [Knowledge in Triples for LLMs: Enhancing Table QA Accuracy with Semantic Extraction](https://mlsanity.com/paper/2409.14192/) (2024)

## Abstract (arXiv)

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.