kbg

# Jump Cannon [Annie Jump Cannon](https://en.wikipedia.org/wiki/Annie_Jump_Cannon) > When Cannon first started cataloging the stars, she was able to classify 1,000 stars in three years, but by 1913, she was able to work on 200 stars an hour.[20] Cannon could classify three stars a minute just by looking at their spectral patterns and, if using a magnifying glass, could classify stars down to the ninth magnitude, around 16 times fainter than the human eye can see.[8] Her work was also highly accurate.[20] [8] [Annie Cannon](https://www.sheisanastronomer.org/index.php/history/annie-cannon). She is an Astronomer. 2014. Retrieved February 18, 2014. [20] [Woman Making Index of 100,000 Stars for a Catalogue](https://www.newspapers.com/article/the-danville-news/10248290/). The Danville Morning News. February 10, 1913. Retrieved April 13, 2017 – via Newspapers.com. # Browser Demo [https://ocasazza.github.io/jump-cannon/](https://ocasazza.github.io/jump-cannon/) # Reference Papers ## Graphviz Papers - [Graphviz and Dynagraph - Static and Dynamic Graph Drawing Tools](https://graphviz.org/documentation/EGKNW03.pdf) - a condensed overview ([cite](https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.96.3776)) - [An open graph visualization system and its applications to software engineering](https://graphviz.org/documentation/GN99.pdf) - longer overview, preferred for citation ([cite](http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.106.5621)) - [Graph Drawing by Stress Majorization](https://graphviz.org/documentation/GKN04.pdf) - an improved algorithm for neato ([cite](https://link.springer.com/chapter/10.1007/978-3-540-31843-9_25)) - [Topological Fisheye Views for Visualizing Large Graphs](https://graphviz.org/documentation/GKN04a.pdf) - topological-based distorted views for large graphs - [A method for drawing directed graphs](https://graphviz.org/documentation/TSE93.pdf) - dot's algorithm (1993) ([cite](http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.8982)) - [Efficient and high quality force-directed graph drawing](http://yifanhu.net/PUB/graph_draw.pdf) - sfdp's algorithm (2005) - [Improved Circular Layouts](https://graphviz.org/documentation/GK06.pdf) - crossing reduction and edge bundling for circular layouts ([cite](https://link.springer.com/chapter/10.1007/978-3-540-70904-6_37)) - [Efficient and High Quality Force-Directed Graph Drawing](https://graphviz.org/documentation/Hu05.pdf) - the multiscale algorithm used in sfdp ([cite](http://yifanhu.net/PUB/graph_draw.pdf)) - [Implementing a General-Purpose Edge Router](https://graphviz.org/documentation/DGKN97.pdf) - edge routing in Graphviz ([cite](https://link.springer.com/chapter/10.1007/3-540-63938-1_68)) - [Improved Force-Directed Layouts](https://graphviz.org/documentation/GN98.pdf) - Voronoi-based node overlap removal ([cite](https://link.springer.com/chapter/10.1007/3-540-37623-2_28)) - [GMap: Visualizing graphs and clusters as maps](https://graphviz.org/documentation/GHK09.pdf) - displaying graphs as maps ([cite](http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.154.8753)) - [Efficient Node Overlap Removal Using a Proximity Stress Model](https://graphviz.org/documentation/GH10.pdf) - Prism node overlap removal ([cite](https://link.springer.com/chapter/10.1007/978-3-642-00219-9_20)) - [On-line Hierarchical Graph Drawing](https://graphviz.org/documentation/NW01.pdf) - dynadag algorithm --------------- ## Graph Drawing - [Wikipedia entry.](http://en.wikipedia.org/wiki/Graph_drawing) They also have a [short article on Graphviz](http://en.wikipedia.org/wiki/Graphviz). - [graphdrawing.org](http://www.graphdrawing.org/index.html) - annual symposia, books, data, open problems and more - Open Directory Project [Graph Drawing](http://dmoztools.net/Science/Math/Combinatorics/Software/Graph_Drawing/) entry. - [Survey (Franz Brandenburg talk notes in Powerpoint)](http://www.csse.monash.edu.au/~gfarr/research/GraphDrawing02-Mel.ppt) - [A Short Note on the History of Graph Drawing](https://www.merl.com/publications/TR2001-49) - [David Eppstein's Geometry in Action](http://www.ics.uci.edu/~eppstein/gina/gdraw.html), Graph Drawing section - [Graph Drawing: Algorithms for the Visualization of Graphs](http://www.amazon.com/exec/obidos/tg/detail/-/0133016153/qid=1089229182/sr=8-1/ref=sr_8_xs_ap_i1_xgl14/103-2475216-1750235?v=glance&s=books&n=507846) by Ioannis G. Tollis, Giuseppe Di Battista, Peter Eades, Roberto Tamassia - [Graph Drawing Software (Mathematics and Visualization)](http://www.amazon.com/exec/obidos/tg/detail/-/3540008810/qid=1089229286/sr=1-3/ref=sr_1_3/103-2475216-1750235?v=glance&s=books) by M. Junger, Petra Mutzel, (Symposium on Graph Drawing 2001, Vienna) - [Drawing Graphs: Methods and Models](http://www.amazon.com/exec/obidos/tg/detail/-/3540420622/qid=1089229286/sr=1-8/ref=sr_1_8/103-2475216-1750235?v=glance&s=books) by Michael Kaufmann, Dorothea Wagner - [Handbook of Graph Drawing and Visualization](http://www.amazon.com/Handbook-Visualization-Discrete-Mathematics-Applications/dp/1584884126%3FSubscriptionId%3DAKIAILSHYYTFIVPWUY6Q%26tag%3Dduckduckgo-d-20%26linkCode%3Dxm2%26camp%3D2025%26creative%3D165953%26creativeASIN%3D1584884126) Roberto Tamassia, ed. [(On-line version)](http://cs.brown.edu/people/rtamassi/gdhandbook/) --- ## Information Visualization - IEEE Infovis Symposia: [current](http://vis.computer.org/), [past](http://www.infovis.org/) - [Information Visualization Journal](http://www.palgrave-journals.com/ivs/) - [FlowingData](http://flowingdata.com/) - [York U. Gallery of Visualization](http://www.datavis.ca/gallery/index.php) (see also [Statistics and Statistical Graphics Resources](http://euclid.psych.yorku.ca/SCS/StatResource.html)). - [Stanford University course bibliography](http://graphics.stanford.edu/courses/cs348c-96-fall/resources.html) - [Stanford University Data Journalism](http://datajournalism.stanford.edu/) - [Xerox PARC projects](http://www2.parc.com/istl/projects/uir/projects/ii.html) - [Software Visualization at Georgia Tech](http://www.gvu.gatech.edu/) --- ## License [MIT License](LICENSE)