On recognizing and characterizing visibility graphs of simple polygons

An algorithm for planning collision-free paths among polyhedral obstacles

Tomás Lozano‐Pérez, M. A. Wesley · Communications of the ACM · 1979 · 2.3K citations

Engineering, Global Planning, Collision-free Paths +20

Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph

Fǎnicǎ Gavril · SIAM Journal on Computing · 1972 · 532 citations

Minimum Coloring, Engineering, Planar Graph +17

Decomposition of Two-Dimensional Shapes by Graph-Theoretic Clustering

Linda G. Shapiro, Robert M. Haralick · IEEE Transactions on Pattern Analysis and Machine Intelligence · 1979 · 131 citations

Geometric Modeling, Binary Relation, Engineering +15

An optimal visibility graph algorithm for triangulated simple polygons

John Hershberger · Algorithmica · 1989 · 83 citations

Geometric Modeling, Engineering, Graph Theory +10

Recognizing visibility graphs of spiral polygons

Hazel Everett, Derek G. Corneil · Journal of Algorithms · 1990 · 55 citations

Geometric Modeling, Geometric Graph Theory, Engineering +8