On recognizing and characterizing visibility graphs of simple polygons

SWAT 88 - Lecture Notes in Computer Science ◽

10.1007/3-540-19487-8_10 ◽

1988 ◽

pp. 96-104 ◽

Author(s):

Subir Kumar Ghosh

Keyword(s):

Simple Polygons ◽

Visibility Graphs

Download Full-text

A combinatorial view of visibility graphs of simple polygons

Proceedings of ICCI'93: 5th International Conference on Computing and Information ◽

10.1109/icci.1993.315398 ◽

2002 ◽

Author(s):

J. Abello ◽

K. Kumar ◽

O. Egecioglu

Keyword(s):

Simple Polygons ◽

Visibility Graphs

Download Full-text

On the number of visibility graphs of simple polygons

Discrete Mathematics ◽

10.1016/s0012-365x(00)00353-8 ◽

2001 ◽

Vol 232 (1-3) ◽

pp. 139-143 ◽

Author(s):

Ferran Hurtado ◽

Marc Noy

Keyword(s):

Simple Polygons ◽

Visibility Graphs

Download Full-text

A P-Completeness Result for Visibility Graphs of Simple Polygons

Mathematical Logic Quarterly ◽

10.1002/1521-3870(200008)46:3<361::aid-malq361>3.0.co;2-0 ◽

2000 ◽

Vol 46 (3) ◽

pp. 361-375

Author(s):

Jana Dietel ◽

Hans-Dietrich Hecker

Keyword(s):

Simple Polygons ◽

Visibility Graphs ◽

Completeness Result

Download Full-text

On recognizing and characterizing visibility graphs of simple polygons

Discrete & Computational Geometry ◽

10.1007/bf02770871 ◽

1997 ◽

Vol 17 (2) ◽

pp. 143-162 ◽

Author(s):

S. K. Ghosh

Keyword(s):

Simple Polygons ◽

Visibility Graphs

Download Full-text

A new necessary condition for the vertex visibility graphs of simple polygons

Discrete & Computational Geometry ◽

10.1007/bf02574366 ◽

1994 ◽

Vol 12 (1) ◽

pp. 65-82 ◽

Author(s):

G. Srinivasaraghavan ◽

A. Mukhopadhyay

Keyword(s):

Necessary Condition ◽

Simple Polygons ◽

Visibility Graphs

Download Full-text

Detecting Weakly Simple Polygons

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611973730.110 ◽

2014 ◽

Author(s):

Hsien-Chih Chang ◽

Jeff Erickson ◽

Chao Xu

Keyword(s):

Simple Polygons

Download Full-text

Vertex-edge pseudo-visibility graphs

Proceedings of the thirteenth annual symposium on Computational geometry - SCG '97 ◽

10.1145/262839.262915 ◽

1997 ◽

Author(s):

Joseph O'Rourke ◽

Ileana Streinu

Keyword(s):

Visibility Graphs

Download Full-text

A linear-time algorithm for triangulating simple polygons

Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 ◽

10.1145/12130.12170 ◽

1986 ◽

Author(s):

R E Tarjan ◽

C J Van Wyk

Keyword(s):

Linear Time ◽

Time Algorithm ◽

Linear Time Algorithm ◽

Simple Polygons

Download Full-text

Computing the Fréchet distance between simple polygons in polynomial time

Proceedings of the twenty-second annual symposium on Computational geometry - SCG '06 ◽

10.1145/1137856.1137870 ◽

2006 ◽

Author(s):

Kevin Buchin ◽

Maike Buchin ◽

Carola Wenk

Keyword(s):

Polynomial Time ◽

Fréchet Distance ◽

Simple Polygons ◽

Frechet Distance

Download Full-text

Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons

Proceedings of the eighteenth annual symposium on Computational geometry - SCG '02 ◽

10.1145/513400.513423 ◽

2002 ◽

Author(s):

David Kirkpatrick ◽

Bettina Speckmann

Keyword(s):

Context Sensitive ◽

Simple Polygons ◽

Hierarchical Representations

Download Full-text