Graph Paper Art (Graph Art S.)

Product Information

Published in Grandjean, Martin (2014). "La connaissance est un réseau". Les Cahiers du Numérique. 10 (3): 37–54. doi: 10.3166/lcn.10.3.37-54. Archived from the original on 2015-06-27 . Retrieved 2014-10-15. Freese, Ralph (2004), "Automated lattice drawing", in Eklund, Peter (ed.), Concept Lattices: Second International Conference on Formal Concept Analysis, ICFCA 2004, Sydney, Australia, February 23-26, 2004, Proceedings (PDF), Lecture Notes in Computer Science, vol.2961, Springer-Verlag, pp.589–590, CiteSeerX 10.1.1.69.6245, doi: 10.1007/978-3-540-24651-0_12, ISBN 978-3-540-21043-6, archived (PDF) from the original on 2016-03-14 , retrieved 2011-09-17 . Misue, K.; Eades, P.; Lai, W.; Sugiyama, K. (1995), "Layout Adjustment and the Mental Map", Journal of Visual Languages & Computing, 6 (2): 183–210, doi: 10.1006/jvlc.1995.1010 . Saaty, Thomas L. (1964), "The minimum number of intersections in complete graphs", Proc. Natl. Acad. Sci. U.S.A., 52 (3): 688–690, Bibcode: 1964PNAS...52..688S, doi: 10.1073/pnas.52.3.688, PMC 300329, PMID 16591215 . Holten, Danny; van Wijk, Jarke J. (2009), "A user study on visualizing directed edges in graphs", Proceedings of the 27th International Conference on Human Factors in Computing Systems (CHI '09) (PDF), pp.2299–2308, CiteSeerX 10.1.1.212.5461, doi: 10.1145/1518701.1519054, ISBN 9781605582467, S2CID 9725345, archived from the original (PDF) on 2011-11-06 .

Tamassia, Roberto, ed. (2014), Handbook of Graph Drawing and Visualization, CRC Press, archived from the original on 2013-08-15 , retrieved 2013-08-28 . yFiles – Visualization and Automatic Layout of Graphs", by Roland Wiese, Markus Eiglsperger, and Michael Kaufmann, in Jünger & Mutzel (2004). Di Battista, Giuseppe; Eades, Peter; Tamassia, Roberto; Tollis, Ioannis G. (1998), Graph Drawing: Algorithms for the Visualization of Graphs, Prentice Hall, ISBN 978-0-13-301615-4 .Microsoft Automatic Graph Layout, open-source .NET library (formerly called GLEE) for laying out graphs [31] Di Battista et al. (1994), pp. vii–viii; Herman, Melançon & Marshall (2000), Section 1.1, "Typical Application Areas". Dominance drawing places vertices in such a way that one vertex is upwards, rightwards, or both of another if and only if it is reachable from the other vertex. In this way, the layout style makes the reachability relation of the graph visually apparent. [21]

Data-flow diagrams, drawings in which the nodes represent the components of an information system and the edges represent the movement of information from one component to another. Di Battista et al. (1994), Chapter 5, "Flow and Orthogonal Drawings", pp. 137–170; ( Eiglsperger, Fekete & Klau 2001).Knuth, Donald E. (2013), "Two thousand years of combinatorics", in Wilson, Robin; Watkins, John J. (eds.), Combinatorics: Ancient and Modern, Oxford University Press, pp.7–37 . BioFabric open-source software for visualizing large networks by drawing nodes as horizontal lines. The area of a drawing is the size of its smallest bounding box, relative to the closest distance between any two vertices. Drawings with smaller area are generally preferable to those with larger area, because they allow the features of the drawing to be shown at greater size and therefore more legibly. The aspect ratio of the bounding box may also be important. Pach, János; Sharir, Micha (2009), "5.5 Angular resolution and slopes", Combinatorial Geometry and Its Algorithmic Applications: The Alcalá Lectures, Mathematical Surveys and Monographs, vol.152, American Mathematical Society, pp.126–127 .

Mathematica, a general purpose computation tool that includes 2D and 3D graph visualization and graph analysis tools. [29] [30]

Angular resolution is a measure of the sharpest angles in a graph drawing. If a graph has vertices with high degree then it necessarily will have small angular resolution, but the angular resolution can be bounded below by a function of the degree. [12]