Add to ORKGThis is an overview of results and open problems pertaining to straight-line drawings of graphs in integer grids, in particular when drawn in three dimensions. As presented at: Journees de Geometrie Algorithmique 2002
We present two algorithms for orthogonal graph drawing in three dimensional space. For graphs of max...
. This paper introduces a novel approach to the drawing of threedimensional graphs: the geometric ap...
AbstractThis paper investigates the basic problem of computing crossing-free straight-line 3D grid d...
Graph drawing research has been mostly oriented toward two-dimensional drawings. This paper describe...
We prove that every n-vertex graph with path-width pw(G) a three-dimensional straight-line drawing w...
This paper investigates the following question: Given a grid , where is a proper subset of the int...
A three-dimensional grid drawing of a graph G is a placement of the vertices at distinct integer poi...
A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with i...
A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with i...
In this paper we contribute to the understanding of the geometric properties of 3D drawings. Namely,...
A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with i...
We prove that every n-vertex graph G with path-width pw(G) has a three-dimensional straight-line gri...
Graphs arise in a natural way in many applications, together with the need to be drawn. Except for v...
A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once. In ...
We study straight-line drawings of graphs with few segments and few slopes. Optimal results are obta...
We present two algorithms for orthogonal graph drawing in three dimensional space. For graphs of max...
. This paper introduces a novel approach to the drawing of threedimensional graphs: the geometric ap...
AbstractThis paper investigates the basic problem of computing crossing-free straight-line 3D grid d...
Graph drawing research has been mostly oriented toward two-dimensional drawings. This paper describe...
We prove that every n-vertex graph with path-width pw(G) a three-dimensional straight-line drawing w...
This paper investigates the following question: Given a grid , where is a proper subset of the int...
A three-dimensional grid drawing of a graph G is a placement of the vertices at distinct integer poi...
A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with i...
A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with i...
In this paper we contribute to the understanding of the geometric properties of 3D drawings. Namely,...
A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with i...
We prove that every n-vertex graph G with path-width pw(G) has a three-dimensional straight-line gri...
Graphs arise in a natural way in many applications, together with the need to be drawn. Except for v...
A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once. In ...
We study straight-line drawings of graphs with few segments and few slopes. Optimal results are obta...
We present two algorithms for orthogonal graph drawing in three dimensional space. For graphs of max...
. This paper introduces a novel approach to the drawing of threedimensional graphs: the geometric ap...
AbstractThis paper investigates the basic problem of computing crossing-free straight-line 3D grid d...