Can Visibility Graphs Be Represented Compactly?.
N. Alon, S. Suri, P.K. Agarwal, B. Aronov (1994)
Discrete & computational geometry
Similarity:
Displaying similar documents to “A New Necessary Condition for the Vertex Visibility Graphs of Simple Polygons.”
Can Visibility Graphs Be Represented Compactly?.
Generalized Delaunay Triangulation for Planar Graphs.
D.T. Lee, A.K. Lin (1986)
Discrete & computational geometry
Similarity:
Disjoint Edges in Geometric Graphs.
P. Erdös, N. Alon (1989)
Discrete & computational geometry
Similarity:
Visibility Graphs of Staircase Polygons and the Weak Bruhat Order, I: from Visibility Graphs to Maximal Chains.
K. Kumar, J. Abello, O. Egecioglu (1995)
Discrete & computational geometry
Similarity:
On longest circuits in certain non-regular planar graphs
Michal Tkáč (1995)
Mathematica Slovaca
Similarity:
Classes of Graphs Which Approximate the Complete Euclidean Graph.
J.M. Keil, C.A. Gutwin (1992)
Discrete & computational geometry
Similarity:
Dispersed Points and Geometric Embedding of Complete Bipartite Graphs.
H. Maehara (1991)
Discrete & computational geometry
Similarity:
Randomly graphs
Gary Chartrand, Ortrud R. Oellermann, Sergio Ruiz (1986)
Mathematica Slovaca
Similarity: