Graph Drawing: DIMACS International Workshop, GD '94, Princeton, New Jersey, USA, October 10 - 12, 1994. Proceedings (Lecture Notes in Computer Science (894))

"This volume constitutes the proceedings of the DIMACS International Workshop on Graph Drawing, GD '94, held in Princeton, New Jersey in October 1994. The 50 papers and system descriptions presented address the problem of constructing geometric representations of abstract graphs, networks and hypergraphs, with applications to key technologies such as software engineering, databases, visual interfaces, and circuit layout; they are organized in sections on three-dimensional drawings, orthogonal drawings, planar drawings, crossings, applications and systems, geometry, system demonstrations, upward drawings, proximity drawings, declarative and other approaches; in addition reports on a graph drawing contest and a poster gallery are included."--PUBLISHER'S WEBSITE Three-dimensional graph drawing....Pages 1-11 3-D visualization of program information (extended abstract and system demonstration)....Pages 12-24 3D layout of reachability graphs of communicating processes....Pages 25-32 A flow approach to upward drawings of toroidal maps....Pages 33-39 Improved algorithms and bounds for orthogonal drawings....Pages 40-51 On bend-minimum orthogonal upward drawing of directed planar graphs....Pages 52-63 Grid layouts of block diagrams — bounding the number of bends in each connection (extended abstract)....Pages 64-75 On drawing a graph convexly in the plane (extended abstract)....Pages 76-83 On drawing angle graphs....Pages 84-95 Regular edge labelings and drawings of planar graphs....Pages 96-103 Minimum-width grid drawings of plane graphs extend abstract....Pages 104-110 Regular orientations, arboricity, and augmentation....Pages 111-118 The polyhedral approach to the maximum planar subgraph problem: New chances for related problems....Pages 119-130 Crossing numbers of graphs, lower bound techniques and algorithms: A survey....Pages 131-142 Graph-drawing contest report....Pages 143-146 Visibility graphs and oriented matroids (extended abstract)....Pages 147-158 Rectangle-visibility representations of bipartite graphs....Pages 159-166 On the number of directions in visibility representations of graphs (extended abstract)....Pages 167-176 Directed VR-representable graphs have unbounded dimension....Pages 177-181 GraphEd: A graphical platform for the implementation of graph algorithms (extended abstract and demo)....Pages 182-193 Graph layout through the VCG tool....Pages 194-205 Drawing telecommunication networks....Pages 206-217 Reduction of visual complexity in dynamic graphs....Pages 218-225 TOSCANA — A graphical tool for analyzing and exploring data....Pages 226-233 Characterization and recognition of point-halfspace and related orders....Pages 234-245 Redrawing a graph within a geometric tolerance....Pages 246-253 On the difficulty of embedding planar graphs with inaccuracies....Pages 254-261 A system for drawing graphs with geometric symmetry....Pages 262-265 Demonstration of the interactive graph visualization system da Vinci ....Pages 266-269 CG: A graph drawing system using graph-grammar parsing....Pages 270-273 A demonstration of interactive graph based visual language applications....Pages 274-277 A simple algorithm for drawing large graphs on small screens....Pages 278-281 Molecular graph eigenvectors for molecular coordinates....Pages 282-285 On the computational complexity of upward and rectilinear planarity testing....Pages 286-297 Upward planarity testing of outerplanar dags (extended abstract)....Pages 298-306 Optimal-area upward drawings of AVL trees....Pages 307-317 Upward drawing on the plane grid using less ink....Pages 318-327 Proximity drawability: A survey extended abstract....Pages 328-339 Proximity constraints and representable trees (extended abstract)....Pages 340-351 Recognizing rectangle of influence drawable graphs (extended abstract)....Pages 352-363 A simple and unified method for drawing graphs: Magnetic-spring algorithm....Pages 364-375 Integration of declarative and algorithmic approaches for layout creation....Pages 376-387 A fast adaptive layout algorithm for undirected graphs (extended abstract and system demonstration)....Pages 388-403 Drawing graphs by example efficiently: Trees and planar acyclic digraphs (extended abstract)....Pages 404-415 Designing graph drawings by layout graph grammars....Pages 416-427 Encoding presentation emphasis algorithms for graphs....Pages 428-435 A practical approach to static node positioning....Pages 436-443 Map generalization as a graph drawing problem....Pages 444-451 A geometrical heuristic for drawing concept lattices....Pages 452-459 Poster gallery report....Pages 461-469

This volume constitutes the proceedings of the DIMACS International Workshop on Graph Drawing, GD '94, held in Princeton, New Jersey in October 1994.
The 50 papers and system descriptions presented address the problem of constructing geometric representations of abstract graphs, networks and hypergraphs, with applications to key technologies such as software engineering, databases, visual interfaces, and circuit layout; they are organized in sections on three-dimensional drawings, orthogonal drawings, planar drawings, crossings, applications and systems, geometry, system demonstrations, upward drawings, proximity drawings, declarative and other approaches; in addition reports on a graph drawing contest and a poster gallery are included.

This volume of research papers addresses the problem of constructing geometric representations of abstract graphs, networks and hypergraphs, with applications to key technologies such as software engineering, visual interfaces and circuit layout.