Adding Constraints to an Algorithm for Orthogonal Graph Drawing

Wiese, Roland and Kaufmann, Michael (1998) Adding Constraints to an Algorithm for Orthogonal Graph Drawing. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998, Montréal, Canada , pp. 462-463 (Official URL: http://dx.doi.org/10.1007/3-540-37623-2_47).

Full text not available from this repository.

Abstract

No Abstract

Item Type:Conference Paper
Additional Information:10.1007/3-540-37623-2_47
Classifications:G Algorithms and Complexity > G.999 Others
P Styles > P.600 Poly-line > P.600.700 Orthogonal
P Styles > P.999 Others
ID Code:318

Repository Staff Only: item control page

References

T. Biedl. Optimal orthogonal drawing: the 3-phases method. Ph.D. thesis, 1997.

T. Biedl, B. Madden, and I.G. Tollis. The three-phase method: A unified approach to orthogonal graph drawing. In DiBattista,ed., Symposium on Graph Drawing 97, vol. 1353 of LNCS. Springer-Verlag, 1998., pages 391-402.

T. Biedl and G. Kant. A Better Heuristic for Orthogonal Graph Drawings. Comput. Geom. Theory Appl., 9:159-180, 1998.

T. Biedl and M. Kaufmann. Area-efficient static and incremental graph drawings. In 5th European Symposium on Algorithms, vol. 1284 of LNCS, pages 37-52. Springer-Verlag, 1997.

A. Papakostas and I.G. Tollis. Orthogonal drawing of high degree graphs with small area and few bends. In WADS (Proc. WADS '97), LNCS, Springer-Verlag, 1997.

R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput. 16 (1987), pages 421-444.