Apr 4, 2013 at 9:07 PM
Edited May 20, 2013 at 6:45 PM
Where can I find more information on what the various layout and overlap removal algorithms are based on, preferably the original scientific articles outlining them?
The Fruchterman-Reingold and Kamada-Kawai Algorithms were easy enough to find, considering they're named after the authors of the scientific articles and both are referenced on the
Force-Directed Graph Drawing Wikipedia Page
The same goes for the Sugiyama Algorithm, which has an entire
dedicated to it.
However, the other algorithms have more generic names that are harder to go by, and I'd really appreciate it if their original code writer or someone knowledgeable on them could give me some basis behind each of them, either a specific scientific publication
that originated them, or a website describing the algorithm if it's a generalized paradigm that was established by a series of scientists. I've already linked the few I've managed to find, and I'll update this post if I manage to find any more of them, but
I really hope others can help.
- Compound Force-Directed (A combination of some of the other force-directed algorithms?)
- One Way Force-Scan
I'm asking about this because I'm doing research on these graph layout drawing algorithms for a project of my own and I'd really appreciate any help I can get on finding resources outlining them and how they work. Thanks in advance! :)