Computer aided layout of entity relationship diagrams
Journal of Systems and Software - Special double issue on the entity-relationship approach to databases and related software
A linear algorithm for embedding planar graphs using PQ-trees
Journal of Computer and System Sciences
A Layout algorithm for data flow diagrams
IEEE Transactions on Software Engineering
On embedding a graph in the grid with the minimum number of bends
SIAM Journal on Computing
Automatic graph drawing and readability of diagrams
IEEE Transactions on Systems, Man and Cybernetics
A relational model of data for large shared data banks
Readings in database systems
An experimental comparison of four graph drawing algorithms
Computational Geometry: Theory and Applications
Journal of the ACM (JACM)
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
Turn-regularity and optimal area drawings of orthogonal representations
Computational Geometry: Theory and Applications
Computing Orthogonal Drawings with the Minimum Number of Bends
IEEE Transactions on Computers
On the complexity of orthogonal compaction
Computational Geometry: Theory and Applications
An Approximation Scheme for Bin Packing with Conflicts
SWAT '98 Proceedings of the 6th Scandinavian Workshop on Algorithm Theory
Graph Drawing Algorithm Engineering with AGD
Revised Lectures on Software Visualization, International Seminar
What is a Good Diagram? A Pragmatic Approach
Proceedings of the Fourth International Conference on Entity-Relationship Approach
Validating Graph Drawing Aesthetics
GD '95 Proceedings of the Symposium on Graph Drawing
Drawing High Degree Graphs with Low Bend Numbers
GD '95 Proceedings of the Symposium on Graph Drawing
Which Aesthetic has the Greatest Effect on Human Understanding?
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Pitfalls of Using PQ-Trees in Automatic Graph Drawing
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
On the Compuational Complexity of Upward and Rectilinear Planarity Testing
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
Orthogonal drawings of graphs with vertex and edge labels
Computational Geometry: Theory and Applications
Orthogonal drawings of graphs with vertex and edge labels
Computational Geometry: Theory and Applications
Planarity testing and optimal edge insertion with embedding constraints
GD'06 Proceedings of the 14th international conference on Graph drawing
| Hi-index | 0.00 |
A wide number of practical applications would benefit from automatically generated graphical representations of database schemas, in which tables are represented by boxes, and table attributes correspond to distinct stripes inside each table. Links, connecting attributes of two different tables, represent referential constraints or join relationships, and may attach arbitrarily to the left- or to the right-hand side of the stripes representing the attributes. To our knowledge no drawing technique is available to automatically produce diagrams in such a strongly constrained drawing convention. In this paper we provide a polynomial time algorithm for solving this problem, and test its efficiency and effectiveness against a large test suite. Also, we describe an implementation of a system that uses such an algorithm and we study the main methodological problems we faced in developing such a technology.