Searching for "Orthogonal 3-D Graph Drawing." – sorted by Relevance.
-
Bounds for Orthogonal 3-D Graph Drawing
- , no. 4, pp. 63-79 (1999) Bounds for Orthogonal 3-D Graph Drawing T. Biedl School of Computer Science
- Cited by 12 (4 self) – Add To MetaCart
-
ArrangePak, OrthoPak, and VisPak 2.0
- on arrangements of lines, visibility graphs of line segments and polygons, and orthogonal 3-d graph drawing. All
- Add To MetaCart
-
Bibliography
- . (1999). Bounds for orthogonal 3D graph drawing. Journal of Graph Algorithms and Applications, 3
- Add To MetaCart
-
On the hardness of range assignment problem
- an orthogonal drawing of a graph in 2-d resp. 3-d. Then, the edges of the drawing have to be replaced by a
- Cited by 1 (0 self) – Add To MetaCart

