New lower bounds for orthogonal drawings.
Biedl, Therese C. (1998)
Journal of Graph Algorithms and Applications
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Lower bounds for the number of bends in three-dimensional orthogonal graph drawings.”
New lower bounds for orthogonal drawings.
On the perspectives opened by right angle crossing drawings.
Angelini, Patrizio, Cittadini, Luca, Didimo, Walter, Frati, Fabrizio, Di Battista, Giuseppe, Kaufmann, Michael, Symvonis, Antonios (2011)
Journal of Graph Algorithms and Applications
Similarity:
Fully dynamic 3-dimensional orthogonal graph drawing.
Closson, M., Gartshore, S., Johansen, J., Wismath, S.K. (2001)
Journal of Graph Algorithms and Applications
Similarity:
Bounds for orthogonal 3-D graph drawing.
Biedl, T., Shermer, T., Whitesides, S., Wismath, S. (1999)
Journal of Graph Algorithms and Applications
Similarity:
On the number of planar orientations with prescribed degrees.
Felsner, Stefan, Zickfeld, Florian (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The maximum number of edges in a three-dimensional grid-drawing.
Bose, Prosenjit, Czyzowicz, Jurek, Morin, Pat, Wood, David R. (2004)
Journal of Graph Algorithms and Applications
Similarity:
Drawing in three dimensions with one bend per edge.
Devillers, Olivier, Everett, Hazel, Lazard, Sylvain, Pentcheva, Maria, Wismath, Stephen (2006)
Journal of Graph Algorithms and Applications
Similarity:
Embedding vertices at points: Few bends suffice for planar graphs.
Kaufmann, Michael, Wiese, Roland (2002)
Journal of Graph Algorithms and Applications
Similarity:
On the crossing numbers of Cartesian products of stars and paths or cycles
Marián Klešč (1991)
Mathematica Slovaca
Similarity:
Planar drawings of higher-genus graphs.
Duncan, Christian A., Goodrich, Michael T., Kobourov, Stephen G. (2011)
Journal of Graph Algorithms and Applications
Similarity:
A split&push approach to orthogonal drawing.
Di Battista, Giuseppe, Patrignani, Maurizio (2000)
Journal of Graph Algorithms and Applications
Similarity: