Increasing attention has been given recently to drawings of graphs in which edges connect vertices based on some notion of proximity. Among such drawings are Gabriel, relative neighborhood, Delaunay, sphere of influence, and minimum spanning drawings. This paper attempts to survey the work that has been done to date on proximity drawings, along with some of the problems which remain open in this area
We initiate the study of the vertex-ply of straight-line drawings, as a relaxation of the recently i...
We initiate the study of the vertex-ply of straight-line drawings, as a relaxation of the recently i...
AbstractProximity graphs are used in several areas in which a neighborliness relationship for input ...
Increasing attention has been given recently to drawings of graphs in which edges connect vertices b...
We introduce and study a generalization of the well-known region of influence proximity drawings, ca...
A proximity drawing of a graph is one in which pairs of adjacent vertices are drawn relatively close...
This paper studies weak proximity drawings of graphs and demonstrates their advantages over strong p...
AbstractThis paper studies weak proximity drawings of graphs and demonstrates their advantages over ...
Complete characterizations are given for those trees that can be drawn as either the relative neighb...
We introduce a novel technique for drawing proximity graphs in polynomial area and volume. Previous...
AbstractWe introduce a novel technique for drawing proximity graphs in polynomial area and volume. P...
A family of proximity drawings of graphs called open and closed β-drawings, first defined in [15], a...
In this paper, we study weak β-proximity drawings. All known algorithms that compute (weak)...
AbstractLet P be a set of n points in the plane. A geometric proximity graph on P is a graph where t...
Graph-theoretic properties of certain proximity graphs defined on planar point sets are investigated...
We initiate the study of the vertex-ply of straight-line drawings, as a relaxation of the recently i...
We initiate the study of the vertex-ply of straight-line drawings, as a relaxation of the recently i...
AbstractProximity graphs are used in several areas in which a neighborliness relationship for input ...
Increasing attention has been given recently to drawings of graphs in which edges connect vertices b...
We introduce and study a generalization of the well-known region of influence proximity drawings, ca...
A proximity drawing of a graph is one in which pairs of adjacent vertices are drawn relatively close...
This paper studies weak proximity drawings of graphs and demonstrates their advantages over strong p...
AbstractThis paper studies weak proximity drawings of graphs and demonstrates their advantages over ...
Complete characterizations are given for those trees that can be drawn as either the relative neighb...
We introduce a novel technique for drawing proximity graphs in polynomial area and volume. Previous...
AbstractWe introduce a novel technique for drawing proximity graphs in polynomial area and volume. P...
A family of proximity drawings of graphs called open and closed β-drawings, first defined in [15], a...
In this paper, we study weak β-proximity drawings. All known algorithms that compute (weak)...
AbstractLet P be a set of n points in the plane. A geometric proximity graph on P is a graph where t...
Graph-theoretic properties of certain proximity graphs defined on planar point sets are investigated...
We initiate the study of the vertex-ply of straight-line drawings, as a relaxation of the recently i...
We initiate the study of the vertex-ply of straight-line drawings, as a relaxation of the recently i...
AbstractProximity graphs are used in several areas in which a neighborliness relationship for input ...