Graph Drawing
By Tim Dwyer, Kim Marriott, Michael Wybrow, A. Çivril, M. Ismail, Eli-Bocek Rivele, Joachim Gudmundsson, M. V. Kreveld, D. Merrick. Lecture Notes in Computer Science, 2003
366 citations recorded by the source corpus.
Subfields: Computational Mechanics, Computational Theory and Mathematics, Mechanics of Materials
View Paper: https://www.semanticscholar.org/paper/d623470360ac2346f2d011e7a83f06f86a53c44d
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Mechanics
In Computational Theory and Mathematics
In Mechanics of Materials
Citations in the corpus
- Geometric Graphs and Arrangements (2004, background): “This basic idea of spring-embeddings has been modified and developed in many directions, confer the graph drawing book [61] for further references.”
- Digraphs - theory, algorithms and applications (2002, methodology): “We refer the reader to the book [97] by Battista, Eades, Tamassia and Tollis for several algorithms for drawing graphs nicely, in particular drawing of ASP digraphs.”
- Spectral clustering and the high-dimensional stochastic blockmodel (2010, neutral): “Visualization is an important tool for social networks analysts [Liotta (2004), Freeman (2000), Wasserman and Faust (1994)].”
- Information Visualization and Visual Data Mining (2002, neutral): “A nice overview of hierachical information visualization techniques can be found in [18], an overview of web visualization techniques at [19], and an overview book on all aspects related to graph drawing is [20].”
- Rectangle and Square Representations of Planar Graphs (2013, neutral): “A sketch of the proof of correctness for the algorithm can be found in [DETT99].”
- Model‐based clustering for social networks (2007, neutral): “Keywords: Bayes factor; Dyad; Latent space; Markov chain Monte Carlo methods; Mixture model; Transitivity”
- A Comparison of the Readability of Graphs Using Node-Link and Matrix-Based Representations (2004, neutral): “In [3], the authors visualize the load distribution of a telecommunication network using a matrix but most of their effort aims at improving the display of a node-link representation such as displaying half-links or postponing the display of important links to minimize occlusion problems.”
- Low Distortion Delaunay Embedding of Trees in Hyperbolic Plane (2011, methodology): “Eppstein and Goodrich [8] show a related method that uses small sized coordinates.”