17 search results - page 3 / 4 » On Nearly Symmetric Drawings of Graphs |
GD
2007
Springer
14 years 1 months ago
2007
Springer
A geometric simultaneous embedding of two graphs G1 = (V1, E1) and G2 = (V2, E2) with a bijective mapping of their vertex sets γ : V1 → V2 is a pair of planar straightline drawi...
COMGEO
2004
ACM
13 years 7 months ago
2004
ACM
We present a novel hierarchical force-directed method for drawing large graphs. Given a graph G = (V,E), the algorithm produces an embedding for G in an Euclidean space E of any d...
CCCG
2009
13 years 8 months ago
2009
A set of n points in the plane is a universal pointset for a given class of graphs, if any n-vertex graph in that class can be embedded in the plane so that vertices are mapped to...
APVIS
2009
13 years 8 months ago
2009
The spring-electrical model based force directed algorithm is widely used for drawing undirected graphs, and sophisticated implementations can be very efficient for visualizing la...
GD
2003
Springer
14 years 17 days ago
2003
Springer
We address the new problem of puzzle layout as a new application of awing. We present two abstract models of puzzles, permutation puzzles and cyclic puzzles, which can be modeled a...