M. Aigner, G. M. Ziegler, Nd Edition, Springer Verlag, H. Alt, ...
[13] N. Calkin, C. Merino, S. Noble and M. Noy, Improved bounds for the number of forests and acyclic orientations in the square lattice, Electron. J. Combin. 10 (2003) #R4. [14] M. Chrobak, M. T....
Therese Biedl, Torsten Thiele, David R. Wood, T. Biedl, T. Thiele, D. R. Wood, ...
Abstract An orthogonal drawing of a graph is an embedding of the graph in the rectangular grid, with vertices represented by axis-aligned boxes, and edges represented by paths in the grid which only...
Searching for the Centre of a Circle (2007)
Biedl Hasan Horton, T. Biedl, M. Hasan, J. D. Horton, A. Lopez-ortiz, T. Vinar
this paper, we study phase (2); see [3] for instructions for the other phases
Complexity of octagonal and rectangular cartograms (2005)
In this paper, we study the complexity of rectangular cartograms, i.e., maps where every region is a rectangle, and which should be deformed such that given area requirements are satisfied. We study...
Locked and Unlocked Polygonal Chains in 3D (1999)
Biedl, T., Demaine, E., Demaine, M., Lazard, S., Lubiw, A., O'Rourke, J., ...
In this paper, we study movements of simple polygonal chains in 3D. We say that an open, simple polygonal chain can be straightened if it can be continuously reconfigured to a straight sequence of...
Bounds for orthogonal 3-D graph drawing (1999)
T. Biedl, T. Shermer, S. Whitesides, S. Wismath
This paper studies 3-D orthogonal grid drawings for graphs of arbitrary degree, in particular Kn, with vertices drawn as boxes. It establishes asymptotic lower bounds for the volume of the bounding...
Bounds for Orthogonal 3-D Graph Drawing (1999)
T. Biedl, T. Shermer, S. Whitesides, S. Wismath
This paper studies 3-D orthogonal grid drawings for graphs of arbitrary degree, in particular Kn , with vertices drawn as boxes. It establishes asymptotic lower bounds for the volume of the bounding...
Locked and Unlocked Polygonal Chains in 3D (1999)
T. Biedl, M. Demaine, M. Demaine, S. Lazard, A. Lubiw, J. O'Rourke, ...
In this paper, we study movements of simple polygonal chains in 3D. We say that an open, simple polygonal chain can be straightened if it can be continuously reconfigured to a straight sequence of...
Locked and Unlocked Polygonal Chains in 3D (1999)
T. Biedl, M. Demaine, M. Demaine, S. Lazard, A. Lubiw, J. O'Rourke, ...
In this paper, we study movements of simple polygonal chains in 3D. We say that an open, simple polygonal chain can be straightened if it can be continuously reconfigured to a straight sequence of...
Bounds for orthogonal 3-D graph drawing (1999)
T. Biedl, T. Shermer, S. Whitesides, S. Wismath
This paper studies 3-D orthogonal grid drawings for graphs of arbitrary degree, in particular Kn, with vertices drawn as boxes. It establishes asymptotic lower bounds for the volume of the bounding...
Locked and Unlocked Polygonal Chains in 3D (1998)
Biedl, T., Demaine, E., Demaine, M., Lazard, S., Lubiw, A., O'Rourke, J., ...
In this paper, we study movements of simple polygonal chains in 3D. We say that an open, simple polygonal chain can be straightened if it can be continuously reconfigured to a straight sequence of...
Graph Multidrawing: Finding Nice Drawings Without Defining Nice (1998)
De Ning Nice, T. Biedl, K. Ryall, J. Marks, S. Whitesides
This paper proposes a multidrawing approach to graph drawing. Current graph-drawing systems typically produce only one drawing of a graph.
On triangulating planar graphs under the four-connectivity constraint (1997)
T. Biedl, T. Biedl, G. Kant, G. Kant, M. Kaufmann, M. Kaufmann, ...
Triangulation of planar graphs under constraints is a fundamental problem in the representation of objects. Related keywords are graph augmentation from the field of graph algorithms and mesh...
On Triangulating Planar Graphs Under the Four-Connectivity Constraint (1997)
Therese C. Biedl, Goos Kant, And Michael Kaufmann, T. Biedl, G. Kant, M. Kaufmann
. Triangulation of planar graphs under constraints is a fundamental problem in the representation of objects. Related keywords are graph augmentation from the field of graph algorithms and mesh...
A better heuristic for ortogobal graph drawings (1995)
An orthogonal drawing of a graph is an embedding in the plane such that all edges are drawn as sequences of horizontal and vertical segments. We present a linear time and space algorithm to draw any...