Loading...

Pseudo-triangulating a simple polygon from its visibility graph

Emamy, Z. S ; Sharif University of Technology | 2015

436 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/ICCKE.2015.7365868
  3. Publisher: Institute of Electrical and Electronics Engineers Inc , 2015
  4. Abstract:
  5. Visibility graph of a simple polygon in a plain is a graph in which the number of its vertices corresponds with the number of vertices in the polygon and each of its edges corresponds with a pair of visible vertices in the polygon. Visibility graph reconstruction of a polygon is one of the old and important problems in computational geometry for which no algorithm has been offered yet. Considering that the problem of visibility graph reconstruction of a pseudo-triangle has been solved, we present an O(n2)-time algorithm for pseudo-triangulation of a simple polygon, using the visibility graph corresponding with the polygon (n is number of vertices of the polygon). To do so, first we present a method for triangulation of a simple polygon, using the visibility graph. Then, using the properties about the polygon, we gained from the visibility graph, we represent a pseudo-triangulation of the polygon
  6. Keywords:
  7. Reconstruction from visibility information ; Computational geometry ; Geometry ; Knowledge engineering ; Surveying ; Triangulation ; Visibility ; Pseudo-triangle ; Pseudo-triangulations ; Simple polygon ; Time algorithms ; Visibility graphs ; Graph theory
  8. Source: 2015 5th International Conference on Computer and Knowledge Engineering, ICCKE 2015, 29 October 2015 ; October , 2015 , Pages 106-111 ; 9781467392808 (ISBN)
  9. URL: http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=7365868