Skip to main content
Conference ProceedingsOPEN ACCESS

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) (1999) 1731 59-71
DOI: 10.1007/3-540-46648-7_6
17Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Counting the number of crossings between straight line segments is an important problem in several areas of Computer Science. It is also a performance bottleneck for Sugiyama-style layout algorithms. This paper describes an algorithm for leveled graphs, based on the classification of edges that is O(e log e) where e is the number of edges. This improves on the best algorithm in the literature which is O(e1.695log e). The improved crossing algorithm enabled an implementation of a Sugiyama-style algorithm to lay out graphs of tens of thousands of nodes in a few seconds on current hardware.

Cite

CITATION STYLE

APA

Waddle, V., & Malhotra, A. (1999). An e log e line crossing algorithm for levelled graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1731, pp. 59–71). Springer Verlag. https://doi.org/10.1007/3-540-46648-7_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free