Breanne Dyck, Stephen Wismath, Zac Friggstad, Kim Hansen, Jill Joevenazzo, Elspeth Nickle Contributed
Copyright c○2004 Stephen Wismath. All rights reserved. This document does not convey a warranty, express or implied, of merchantability or fitness for a particular purpose. Credits: GLuskap Version...
Universal Sets of n Points for 1-bend Drawings of Planar Graphs with n Vertices ⋆ (2008)
Hazel Everett, Sylvain Lazard, Stephen Wismath, Inria Lorraine
Abstract. This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this result is...
�Ö�Ô � Ì��ÓÖ�Ø � �ÓÒ �ÔØ × �Ò �ÓÑÔÙØ�Ö Ë ��Ò � �Ò ÂÙÒ� (2008)
ÔÓÐÝÐ�Ò� × Û�Ø � �Ø ÑÓ×Ø ��Ò � Ô�Ö ��� � Ì�� × Ö�×ÙÐØ � × ×ÓÑ� Û��Ø ×ÙÖÔÖ�×�Ò � ��Ú�Ò Ø� �...
Point-Set Embedding of Trees with Edge Constraints (2008)
Di Giacomo, Emilio, Didimo, Walter, Liotta, Giuseppe, Meijer, Henk, Wismath, Stephen
Given a graph $G$ with $n$ vertices and a set $S$ of $n$ points in the plane, a $point-set embedding$ of $G$ on $S$ is a planar drawing such that each vertex of $G$ is mapped to a distinct point of...
Universal Sets of n Points for 1-bend Drawings of Planar Graphs with n Vertices (2008)
Everett, Hazel, Lazard, Sylvain, Liotta, Giuseppe, Wismath, Stephen
This paper shows that any planar graph with $n$ vertices can be point-set embedded with at most one bend per edge on a universal set of $n$ points in the plane. An implication of this result is that...
Point-Set Embedding of Trees with Edge Constraints (2008)
Di Giacomo, Emilio, Didimo, Walter, Liotta, Giuseppe, Meijer, Henk, Wismath, Stephen
Given a graph $G$ with $n$ vertices and a set $S$ of $n$ points in the plane, a $point-set embedding$ of $G$ on $S$ is a planar drawing such that each vertex of $G$ is mapped to a distinct point of...
Universal Sets of n Points for 1-bend Drawings of Planar Graphs with n Vertices (2008)
Everett, Hazel, Lazard, Sylvain, Liotta, Giuseppe, Wismath, Stephen
This paper shows that any planar graph with $n$ vertices can be point-set embedded with at most one bend per edge on a universal set of $n$ points in the plane. An implication of this result is that...
. Given a set S of n non-intersecting line segments in the plane, we present an algorithm that computes the 2n visibility polygons of the endpoints of S, in output sensitive time. The algorithm...
Stefan Felsner, Stephen Wismath
Abstract. This paper investigates the following question: Given an integer grid , where is a proper subset of the integer plane or a proper subset of the integer 3d space, which graphs admit...
Straight-Line Drawings of Graphs in Three Dimensions (2007)
This 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...
Drawing K_n in Three Dimensions with One Bend per Edge (2006)
Devillers, Olivier, Everett, Hazel, Lazard, Sylvain, Pentcheva, Maria, Wismath, Stephen
We give a drawing of K_n in three dimensions in which vertices are placed at integer grid points and edges are drawn crossing-free with at most one bend per edge in a volume bounded by O(n^{2.5})....
Drawing K_n in Three Dimensions with One Bend per Edge (2006)
Devillers, Olivier, Everett, Hazel, Lazard, Sylvain, Pentcheva, Maria, Wismath, Stephen
We give a drawing of K_n in three dimensions in which vertices are placed at integer grid points and edges are drawn crossing-free with at most one bend per edge in a volume bounded by O(n^{2.5})....
Drawing K_n in Three Dimensions with One Bend per Edge (2006)
Devillers, Olivier, Everett, Hazel, Lazard, Sylvain, Pentcheva, Maria, Wismath, Stephen
We give a drawing of K_n in three dimensions in which vertices are placed at integer grid points and edges are drawn crossing-free with at most one bend per edge in a volume bounded by O(n^{2.5})....
Drawing Kn in Three Dimensions with One Bend per Edge (2005)
Devillers, Olivier, Everett, Hazel, Lazard, Sylvain, Pentcheva, Maria, Wismath, Stephen
We give a drawing of $K_n$ in three dimensions in which vertices are placed at integer grid points and edges are drawn crossing-free with at most one bend per edge in a volume bounded by $O(n^2.5)$.
Drawing Kn in Three Dimensions with One Bend per Edge (2005)
Devillers, Olivier, Everett, Hazel, Lazard, Sylvain, Pentcheva, Maria, Wismath, Stephen
We give a drawing of $K_n$ in three dimensions in which vertices are placed at integer grid points and edges are drawn crossing-free with at most one bend per edge in a volume bounded by $O(n^2.5)$.
Drawing $K_n$ in Three Dimensions with One Bend per Edge (2005)
Devillers, Olivier, Everett, Hazel, Lazard, Sylvain, Pentcheva, Maria, Wismath, Stephen
We give a drawing of $K_n$ in three dimensions in which vertices are placed at integer grid points and edges are drawn crossing-free with at most one bend per edge in a volume bounded by $O(n^2.5)$.
Drawing $K_n$ in Three Dimensions with One Bend per Edge (2005)
Devillers, Olivier, Everett, Hazel, Lazard, Sylvain, Pentcheva, Maria, Wismath, Stephen
We give a drawing of $K_n$ in 3D in which vertices are placed at integer grid points and edges are drawn crossing-free with at most one bend per edge in a volume bounded by $O(n^{2.5})$.
Drawing $K_n$ in Three Dimensions with One Bend per Edge (2005)
Devillers, Olivier, Everett, Hazel, Lazard, Sylvain, Pentcheva, Maria, Wismath, Stephen
We give a drawing of $K_n$ in 3D in which vertices are placed at integer grid points and edges are drawn crossing-free with at most one bend per edge in a volume bounded by $O(n^{2.5})$.
Drawing $K_n$ in Three Dimensions with One Bend per Edge (2005)
Devillers, Olivier, Everett, Hazel, Lazard, Sylvain, Pentcheva, Maria, Wismath, Stephen
We give a drawing of $K_n$ in three dimensions in which vertices are placed at integer grid points and edges are drawn crossing-free with at most one bend per edge in a volume bounded by $O(n^2.5)$.
Drawing $K_n$ in Three Dimensions with One Bend per Edge (2005)
Devillers, Olivier, Everett, Hazel, Lazard, Sylvain, Pentcheva, Maria, Wismath, Stephen
We give a drawing of $K_n$ in three dimensions in which vertices are placed at integer grid points and edges are drawn crossing-free with at most one bend per edge in a volume bounded by $O(n^2.5)$.
Drawing $K_n$ in Three Dimensions with One Bend per Edge (2005)
Devillers, Olivier, Everett, Hazel, Lazard, Sylvain, Pentcheva, Maria, Wismath, Stephen
We give a drawing of $K_n$ in 3D in which vertices are placed at integer grid points and edges are drawn crossing-free with at most one bend per edge in a volume bounded by $O(n^{2.5})$.
Article Type Communicated by Submitted Revised (2005)
Olivier Devillers, Hazel Everett, Sylvain Lazard, Maria Pentcheva, Inria Lorraine, ...
We give a drawing of Kn in three dimensions in which vertices are placed at integer grid points and edges are drawn crossing-free with at most one bend per edge in a volume bounded by O(n 2.5).
Article Type Communicated by Submitted Revised (2005)
Olivier Devillers, Hazel Everett, Sylvain Lazard, Maria Pentcheva, Inria Lorraine, ...
We give a drawing of Kn in three dimensions in which vertices are placed at integer grid points and edges are drawn crossing-free with at most one bend per edge in a volume bounded by O(n 2.5).
GLuskap: Visualization and Manipulation of Graph Drawings in 3-Dimensions (2004)
Dyck, Breanne, Joevenazzo, Jill, Nickle, Elspeth, Wilsdon, Jon, Wismath, Stephen
GLuskap is a software tool for displaying graphs in 3 dimensions, interactively editing the resulting drawing and finally creating a high quality ray traced image. The software is written in C++ and...
GLuskap: Visualization and Manipulation of Graph Drawings in 3-Dimensions (2004)
Dyck, Breanne, Joevenazzo, Jill, Nickle, Elspeth, Wilsdon, Jon, Wismath, Stephen
GLuskap is a software tool for displaying graphs in 3 dimensions, interactively editing the resulting drawing and finally creating a high quality ray traced image. The software is written in C++ and...
GLuskap: Visualization and Manipulation of Graph Drawings in 3-Dimensions (2004)
Dyck, Breanne, Joevenazzo, Jill, Nickle, Elspeth, Wilsdon, Jon, Wismath, Stephen
GLuskap is a software tool for displaying graphs in 3 dimensions, interactively editing the resulting drawing and finally creating a high quality ray traced image. The software is written in C++ and...
Drawing Kn in three dimensions with two bends per edge (2004)
B. Dyck, J. Joevenazzo, E. Nickle, J. Wilsdon, S. K. Wismath, Breanne Dyck, ...
works, in addition to research documents. A work appearing in this report series may not have undergone any prior review, and so the Department cannot assume any liability stemming from claims made...
Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions (2003)
Stefan Felsner, Giuseppe Liotta, Stephen Wismath
This paper investigates the following question: Given a grid ,where is a proper subset of the integer 2D or 3D grid, which graphs admit straight-line crossing-free drawings with vertices located at...
Book Embeddings and Point-Set Embeddings of Series-Parallel Digraphs (2002)
Di Giacomo, Emilio, Didimo, Walter, Liotta, Giuseppe, Wismath, Stephen
An optimal O(n)-time algorithm to compute an upward two-page book embedding of a series-parallel digraph with n vertices is presented. A previous algorithm of Alzohairi and Rival [1] runs in O(n³)...
Felsner, Stefan, Liotta, Giuseppe, Wismath, Stephen
This paper investigates the following question: Given an integer grid $\phi$, where $\phi$ is a proper subset of the integer plane or a proper subset of the integer 3d space, which graphs admit...
Book Embeddings and Point-Set Embeddings of Series-Parallel Digraphs (2002)
Di Giacomo, Emilio, Didimo, Walter, Liotta, Giuseppe, Wismath, Stephen
An optimal O(n)-time algorithm to compute an upward two-page book embedding of a series-parallel digraph with n vertices is presented. A previous algorithm of Alzohairi and Rival [1] runs in O(n³)...
Felsner, Stefan, Liotta, Giuseppe, Wismath, Stephen
This paper investigates the following question: Given an integer grid $\phi$, where $\phi$ is a proper subset of the integer plane or a proper subset of the integer 3d space, which graphs admit...
Book Embeddings and Point-Set Embeddings of Series-Parallel Digraphs (2002)
Di Giacomo, Emilio, Didimo, Walter, Liotta, Giuseppe, Wismath, Stephen
An optimal O(n)-time algorithm to compute an upward two-page book embedding of a series-parallel digraph with n vertices is presented. A previous algorithm of Alzohairi and Rival [1] runs in O(n³)...
Felsner, Stefan, Liotta, Giuseppe, Wismath, Stephen
This paper investigates the following question: Given an integer grid $\phi$, where $\phi$ is a proper subset of the integer plane or a proper subset of the integer 3d space, which graphs admit...
Straight-line drawings on restricted integer grids in two and three dimensions (2002)
S. Felsner, G. Liotta, S. K. Wismath, Stefan Felsner, Stephen Wismath
expository and student works, in addition to research documents. A work appearing in this report series may not have undergone any prior review, and so the Department cannot assume any liability...
Stefan Felsner, Giuseppe Liotta, Stephen Wismath
This paper investigates the following question: Given an integer grid...
Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions (2002)
Stefan Felsner, Giuseppe Liotta, Stephen Wismath
This paper investigates the following question: Given a grid , where is a proper subset of the integer 2D or 3D grid, which graphs admit straight-line crossing-free drawings with vertices located at...
Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions (2002)
Stefan Felsner, Giuseppe Liotta, Stephen Wismath
This paper investigates the following question: Given a grid , where is a proper subset of the integer 2D or 3D grid, which graphs admit straight-line crossing-free drawings with vertices located at...
Fully Dynamic 3-Dimensional Orthogonal Graph Drawing (1999)
Closson, M., Gartshore, S., Johansen, John, Wismath, Stephen
In a 3-dimensional orthogonal drawing of a graph, vertices are mapped to grid points on an integer lattice and edges are routed along integer grid lines. In this paper, we present a layout scheme...
Fully Dynamic 3-Dimensional Orthogonal Graph Drawing (1999)
Closson, M., Gartshore, S., Johansen, John, Wismath, Stephen
In a 3-dimensional orthogonal drawing of a graph, vertices are mapped to grid points on an integer lattice and edges are routed along integer grid lines. In this paper, we present a layout scheme...
Fully Dynamic 3-Dimensional Orthogonal Graph Drawing (1999)
Closson, M., Gartshore, S., Johansen, John, Wismath, Stephen
In a 3-dimensional orthogonal drawing of a graph, vertices are mapped to grid points on an integer lattice and edges are routed along integer grid lines. In this paper, we present a layout scheme...
Orthogonal 3-D Graph Drawing (1998)
Biedl, Therese, Shermer, Thomas, Whitesides, Sue, Wismath, Stephen
This paper studies 3-D orthogonal grid drawings for graphs of arbitrary degree, K_{n} in particular, with vertices drawn as boxes. It establishes an asymptotic lower bound for the volume of the...
Orthogonal 3-D Graph Drawing (1998)
Biedl, Therese, Shermer, Thomas, Whitesides, Sue, Wismath, Stephen
This paper studies 3-D orthogonal grid drawings for graphs of arbitrary degree, K_{n} in particular, with vertices drawn as boxes. It establishes an asymptotic lower bound for the volume of the...
Orthogonal 3-D Graph Drawing (1998)
Biedl, Therese, Shermer, Thomas, Whitesides, Sue, Wismath, Stephen
This paper studies 3-D orthogonal grid drawings for graphs of arbitrary degree, K_{n} in particular, with vertices drawn as boxes. It establishes an asymptotic lower bound for the volume of the...