Force-directed graph drawing algorithms are widely used for drawing general graphs.
However, these methods do not guarantee a sub-quadratic running time in general. We …

Although there are many advanced and specialized texts and handbooks on algorithms,
until now there was no book that focused exclusively on the wide variety of data structures …

Quadtrees are hierarchical spatial tree data structures that are based on the principle of
recursive decomposition of space. The term quadtree originated from representation of two …

While there has been decades of work on developing automatic, locality-enhancing
transformations for regular programs that operate over dense matrices and arrays, there has …

This paper proposes a linear‐time repulsive‐force‐calculation algorithm with sub‐linear
auxiliary space requirements, achieving an asymptotic improvement over the Barnes‐Hut …

A new octree-based Coulomb interaction model is developed to model the electrospray of
ionic liquids (ILs) in molecular dynamics. Using an octree-based method, Coulomb …

The simulation of pairwise interactions in huge particle ensembles is a vital issue in scientific
research. Especially the calculation of long-range interactions poses limitations to the …

Network analysis software relies on graph layout algorithms to enable users to visually
explore network data. Nowadays, networks easily consist of millions of nodes and edges …

The neural network in the brain is not hard-wired. Even in the mature brain, new connections
between neurons are formed and existing ones are deleted, which is called structural …

We present DASHMM, a general library implementing multipole methods (including both
Barnes-Hut and the Fast Multipole Method). DASHMM relies on dynamic adaptive runtime …