Drawing planar graphs with large vertices and thick edges.
Barequet, Gill, Goodrich, Michael T., Riley, Chris (2004)
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 “Techniques for the refinement of orthogonal graph drawings.”
Drawing planar graphs with large vertices and thick edges.
A framework for the static and interactive visualization of statecharts.
Castelló, Rodolfo (2002)
Journal of Graph Algorithms and Applications
Similarity:
Orthogonal hypergraph drawing for improved visibility.
Eschbach, Thomas, Guenther, Wolfgang, Becker, Bernd (2006)
Journal of Graph Algorithms and Applications
Similarity:
Drawing clustered graphs on an orthogonal grid.
Eades, Peter, Feng, Qingwen, Nagamochi, Hiroshi (1999)
Journal of Graph Algorithms and Applications
Similarity:
TimGA: A genetic algorithm for drawing undirected graphs.
Eloranta, Timo, Mäkinen, Erkki (2001)
Divulgaciones Matemáticas
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:
Characterizing families of cuts that can be represented by axis-parallel rectangles.
Brandes, Ulrik, Cornelsen, Sabine, Wagner, Dorothea (2005)
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:
A decomposition algorithm for the oriented adjacency graph of the triangulations of a bordered surface with marked points.
Gu, Weiwen (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Algorithms for cluster busting in anchored graph drawing.
Lyons, Kelly A., Meijer, Henk, Rappaport, David (1998)
Journal of Graph Algorithms and Applications
Similarity:
Navigating clustered graphs using force-directed methods.
Eades, Peter, Huang, Lin Mao (2000)
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:
A note on rectilinearity and angular resolution.
Bodlaender, Hans L., Tel, Gerard (2004)
Journal of Graph Algorithms and Applications
Similarity: