Can Visibility Graphs Be Represented Compactly?.
N. Alon, S. Suri, P.K. Agarwal, B. Aronov (1994)
Discrete & computational geometry
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Disjoint Edges in Geometric Graphs.”
Can Visibility Graphs Be Represented Compactly?.
Dispersed Points and Geometric Embedding of Complete Bipartite Graphs.
H. Maehara (1991)
Discrete & computational geometry
Similarity:
Generalized Delaunay Triangulation for Planar Graphs.
D.T. Lee, A.K. Lin (1986)
Discrete & computational geometry
Similarity:
Approximating Euclidean Distances by Small Degree Graphs*
José Soares (1994)
Discrete & computational geometry
Similarity:
Embeddings of Graphs in Euclidean Spaces.
J. Reiterman, V Rödl, E. Sinajová (1989)
Discrete & computational geometry
Similarity:
Delaunay Graphs Are Almost as Good as Complete Graphs.
D.P. Dobkin, S.J. Friedman, K.J. Supowit (1990)
Discrete & computational geometry
Similarity:
On the Contact Dimension of Graphs.
P. Frankl, H. Maehara (1988)
Discrete & computational geometry
Similarity:
On Graver's Conjecture Concerning the Rigidity Problem of Graphs.
H. Maehara (1991)
Discrete & computational geometry
Similarity:
Nonorientable Genus of Nearly Complete Bipartite Graphs.
B. Mohar (1988)
Discrete & computational geometry
Similarity:
Tiling the Torus and Other Space Forms.
M. Senechal (1988)
Discrete & computational geometry
Similarity:
Classes of Graphs Which Approximate the Complete Euclidean Graph.
J.M. Keil, C.A. Gutwin (1992)
Discrete & computational geometry
Similarity: