An optimal visibility graph algorithm for triangulated simple polygons

This publication has 12 references indexed in Scilit:

• An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
  SIAM Journal on Computing, 1988
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
  Algorithmica, 1987
• An output sensitive algorithm for computing visibility graphs
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1987
• Visibility of disjoint polygons
  Algorithmica, 1986
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
  ACM Transactions on Graphics, 1985
• Triangulation and shape-complexity
  ACM Transactions on Graphics, 1984
• Fast triangulation of simple polygons
  Published by Springer Nature ,1983
• A new data structure for representing sorted lists
  Acta Informatica, 1982
• Triangulating a simple polygon
  Information Processing Letters, 1978
• A new representation for linear lists
  Published by Association for Computing Machinery (ACM) ,1977