Multipole-based force approximation revisited - A simple but fast implementation using a dynamized enclosing-circle-enhanced k-d-tree

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

Volumn 4372 LNCS, Issue , 2007, Pages 20-29

  Lauther, Ulrich ^a  

^a SIEMENS AG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DATA STRUCTURES; DECISION TREES;

MULTI-POLE APPROXIMATIONS; MULTI-POLE EXPANSION;

GRAPH THEORY;

EID: 38149029335     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70904-6_4     Document Type: Conference Paper

References (13)

1. Eades, P.: A heuristic for graph drawing. Congressus Numerantium 42 (1984) 149-160
2. Kamada, T., Kawai, S.: An Algorithm for Drawing General Undirected Graphs. Information Processing Letters 31 (1989) 7-15
3. Fruchterman, T., Reingold, E.: Graph Drawing by Force-directed Placement. Software-Practice and Experience 21 (1991) 1129-1164
4. Davidson, R., Harel, D.: Drawing Graphs Nicely Using Simulated Annealing. ACM Transaction on Graphics 15 (1996) 301-331
5. Hachul, S., Jünger, M.: Drawing large graphs with a potential-field-based multilevel algorithm. In Pach, J., ed.: Graph Drawing. Volume 3383 of Lecture Notes in Computer Science., Springer (2004) 285-295
6. Barnes, J., Hut, P.: A hierarchical O(N log N) force-calculation algorithm. Nature 324 (1986) 446-449
7. Quigley, A., Eades, P.: FADE: Graph Drawing, Clustering, and Visual Abstraction. In Marks, J., ed.: Graph Drawing 2000. Volume 1984 of Lecture Notes in Computer Science., Springer-Verlag (2001) 197-210
8. Tunkelang, D.: JIGGLE: Java Interactive Graph Layout Environment. In Whitesides, S.H., ed.: Graph Drawing 1998. Volume 1547 of Lecture Notes in Computer Science., Springer-Verlag (1998) 413-422
9. Greengard, L.: The Rapid Evaluation of Potential Fields in Particle Systems. ACM distinguished dissertations. The MIT Press, Cambridge, Massachusetts (1988)
10. Hachul, S.: A Potential-Field-Based Multilevel Algorithm for Drawing Large Graphs. PhD thesis, Institut für Informatik, Universität zu Köln, Germany (2005) URN: urn:nbn:de:hbz:38-14097, URL: http://kups.ub.uni-koeln.de/volltexte/2005/1409.
11. Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18 (1975) 509-517
12. Welzl, E.: Smallest enclosing disks (balls and ellipses). New Results and New Trends in Computer Science 555 (1991) 359-370
13. Lauther, U.: The c++ class library turbo - a toolbox for discrete optimization. Software@Siemens (2000) 34-36