An e log e line crossing algorithm for levelled graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1731, Issue , 1999, Pages 59-71

  Waddle, Vance ^a   Malhotra, Ashok ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS);

LAY-OUT; LAYOUT ALGORITHMS; LINE CROSSINGS; ON CURRENTS; PERFORMANCE BOTTLENECKS; STRAIGHT-LINE SEGMENTS;

ALGORITHMS;

EID: 84958956597     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46648-7_6     Document Type: Conference Paper

References (14)

1. Bentley, J.L. and Ottman, T. Algorithms for reporting and counting geometric intersections, IEEE Trans. Comput. C-28, (1979), pp 643-647.
2. Chazelle, B. Reporting and Counting Segment Intersections, Journal of Computer and System Sciences, Vol. 32, pp. 156-182, 1986.
3. Chazelle, B., and Edelsbrunner, H. An Optimal Algorithm for Intersecting Line Segments in the Plane, JACM, 39(1), pp. 1-54, Jan 1992.
4. Di Battista, G., Eades, P., Tamassia, R., and Tollis, I.G. Graph Drawing: Algo-rithms for the Visualization of Graphs, Prentice Hall, 1999.
5. Edelsbrunner, H., and Welzl, E. Halfplanar Range Search in Linear Space and O(n0.695) Query Time,” Tech. Univ. Graz, IIG Report 111, 1983.
6. Gansner, E. R., North, S. C., and Ko, K. P. DAG: A program that draws directed graphs, Software Practice and Experience, 18(11), pp. 1047-1062, Nov 1988.
7. Garey, M. R., and Johnson, D.S. Crossing number is NP-Complete, SIAM Journal on Algebraic and Discrete Methods, 4, 3 (September 1983), pp. 312-316.
8. Huang, M. L., Eades, P., and Wang, J., On-line Animated Visualization of Huge Graphs using a Modified Spring Algorithm, Journal of Visual Languages and Computing, Vol 9., pp. 623-645 (1998).
9. Knuth, D. E., The Art of Computer Programming, Vol. 1: Fundamental Algorithms, Second Ed., pp. 400-401, Addison-Wesley, 1973.
10. Munzer, T., Exploring Large Graphs in 3D Hyperbolic Space, IEEE Computer Graphics and Applications, Vol. 18 No. 4, 1998.
11. Preparata, F. P., and Shamos, M. I., Computational geometry-An introduction. Springer-Verlag, New York, 1985.
12. Rowe, L., et al., A Browser for Directed Graphs, Software Practice and Experience, Vol. 17(1), pp. 61-76, Jan. 1987.
13. Schleupen, K., P. Alt, et al., “High Information Content Color 16.3 inch Desktop AMLCD with 15.7 Million a-Si:H TFTs,” Asia Display ‘98, Digest, Seoul Korea, (1998) pp. 187-191.
14. Sugiyama, K., Tagawa, S., and M. Toda, Methods for Visual Understanding of Hierarchical Structures, IEEE Transactions on Systems, Man, and Cybernetics, Vol. SMC-11, No. 2. Feb. 1981.