×

Removing edge-node intersections in drawings of graphs. (English) Zbl 1032.68991


MSC:

68W05 Nonnumerical algorithms
68R10 Graph theory (including graph drawing) in computer science
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Di Battista, G.; Eades, P.; Tamassia, R.; Tollis, I., Algorithms for drawing graphs: An annotated bibliography, Comput. Geometry: Theory Appl., 4, 5, 235-282 (1994) · Zbl 0804.68001
[2] Eades, P., A heuristic for graph drawing, Congressus Numer., 42, 149-160 (1984)
[3] Eades, P.; Lai, W., Visual interface design for relational systems, (Proc. 5th Australian Software Engineering Conference, Sydney (May 1990)), 259-263
[4] Eades, P.; Lai, W.; Misue, K.; Sugiyama, K., Preserving the mental map of a diagram, (Proc. COMPUGRAPHICS’91, Sesimbra, Portugal (September 1991)), 34-43
[5] Eades, P.; Lai, W.; Misue, K.; Sugiyama, K., Layout adjustment and the mental map, J. Visual Languages Comput., 6, 183-210 (1995)
[6] Eades, P.; Lai, W., Algorithms for disjoint node images, (Proc. 15th Australian Computer Science Conference, Hobart (January 1992)), 253-265
[7] Harel, D., On visual formalisms, Comm. ACM, 31, 5, 514-530 (1988)
[8] He, W.; Marriott, K., Removing node overlapping using constrained optimization, (Proc. 21st Australian Computer Science Conference, Perth (February 1998)), 169-180
[9] Masuzawa, T.; Hayashi, K.; Inoue, M.; Fujiwara, H., A layout adjustment problem for disjoint rectangles preserving orthogonal order, (Graph Drawing (GD’98). Graph Drawing (GD’98), Lecture Notes in Comput. Sci., 1547 (1998), Springer: Springer Berlin), 183-197
[10] Larson, R. C.; Li, V. O.K., Finding minimum rectilinear distance paths in the paths in the presence of barriers, Networks, 11, 285-304 (1981) · Zbl 0459.90082
[11] Lee, D. T.; Preparata, F. P., Euclidean shortest paths in the presence of rectilinear barriers, Networks, 14, 393-410 (1984) · Zbl 0545.90098
[12] Lozano-Perez, T.; Wesley, M. A., An algorithm for planning collision-free paths among polyhedral obstacles, Comm. ACM, 22, 560-570 (1979)
[13] Rumbaugh, J., OMT: The development process, J. Object-Oriented Programm., 5, 8-16 (1995)
[14] Sugiyama, K.; Misue, K., Visualization of structural information: Automatic drawing of compound digraphs, IEEE Trans. Systems, Man Cybernetics, 21, 4, 876-892 (1991)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.