M. Eiglsperger, U. Foessmeier, and M .Kaufmann. Orthogonal graph drawing with constraints. In Proc. 11th ACM-SIAM Symposium on Discrete Algorithms, pages 3--11, 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
An Approach for Mixed Upward Planarization - Eiglsperger, Eppinger, Kaufmann (2003) Self-citation (Eiglsperger Kaufmann) (Correct)
No context found.
M. Eiglsperger, U. Foessmeier, and M .Kaufmann. Orthogonal graph drawing with constraints. In Proc. 11th ACM-SIAM Symposium on Discrete Algorithms, pages 3--11, 2000.
An Approach for Mixed Upward Planarization - Eiglsperger, Kaufmann Self-citation (Eiglsperger Kaufmann) (Correct)
....and the dummy nodes are discarded. A similar strategy has been applied very successfully in the area of drawing undirected graphs. The most popular algorithms based on this strategy are perhaps the graph drawing algorithms descending from the GIOTTO approach [2] 20] for orthogonal drawings. In [8] we showed recently how to extend the GIOTTO approach to mixed upward planar drawings of mixed upward planar graphs, i.e. mixed graphs which have a planar drawing in which the directed part of the graph is drawn upward. The above strategy can also be applied to this algorithm, the rst phase then ....
Eiglsperger, M., Foessmeier, U., Kaufmann, M., Orthogonal Graph Drawing with Constraints, Proc. 11th Symposium on Discrete Algorithms (SODA'00), pp. 3-11, ACM-SIAM, 2000.
An Experimental Comparison of Orthogonal Compaction Algorithms.. - Klau, al. (2000) (2 citations) (Correct)
No context found.
M. Eiglsperger, U. Fomeier, and M. Kaufmann. Orthogonal graph drawing with constraints. In Proc. 11th Symposium on Discrete Algorithms (SODA '00). ACMSIAM, 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC