Sciweavers

436 search results - page 61 / 88
» Lombardi Drawings of Graphs
Sort
View
IV
2003
IEEE
201views Visualization» more  IV 2003»
14 years 1 months ago
Layout Metrics for Euler Diagrams
An alternative term for these diagrams is “Euler-Venn diagrams” but they are often inaccurately called “Venn diagrams”. Venn diagrams often look similar, but must contain a...
Jean Flower, Peter Rodgers, Paul Mutton
NIPS
1997
13 years 9 months ago
Graph Matching with Hierarchical Discrete Relaxation
Our aim in this paper is to develop a Bayesian framework for matching hierarchical relational models. Such models are widespread in computer vision. The framework that we adopt fo...
Richard C. Wilson, Edwin R. Hancock
INFOVIS
2005
IEEE
14 years 2 months ago
Interactive Visualization of Genealogical Graphs
The general problem of visualizing “family trees”, or genealogical graphs, in 2D, is considered. A graph theoretic analysis is given, which identifies why genealogical graphs...
Michael J. McGuffin, Ravin Balakrishnan
JCT
2007
111views more  JCT 2007»
13 years 8 months ago
Removing even crossings
An edge in a drawing of a graph is called even if it intersects every other edge of the graph an even number of times. Pach and T´oth proved that a graph can always be redrawn so...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
COCOON
2005
Springer
14 years 2 months ago
On the Complexity of the Balanced Vertex Ordering Problem
We consider the problem of finding a balanced ordering of the vertices of a graph. More precisely, we want to minimise the sum, taken over all vertices v, of the difference betwe...
Jan Kára, Jan Kratochvíl, David R. W...