725 search results - page 15 / 145 » Graph Drawing in Motion |
COMGEO
2004
ACM
13 years 8 months ago
2004
ACM
We introduce a novel technique for drawing proximity graphs in polynomial area and volume. Previously known algorithms produce representations whose size increases exponentially w...
APVIS
2006
13 years 10 months ago
2006
A common problem in visualising some networks is the presence of localised high density areas in an otherwise sparse graph. Applying common graph drawing algorithms on such networ...
ICDAR
2011
IEEE
12 years 8 months ago
2011
IEEE
—In this paper we propose a symbol spotting technique through hashing the shape descriptors of graph paths (Hamiltonian paths). Complex graphical structures in line drawings can ...
CORR
2002
Springer
13 years 8 months ago
2002
Springer
We introduce a new approach for drawing diagrams. Our approach is to use a technique we call confluent drawing for visualizing non-planar graphs in a planar way. This approach all...
GD
2000
Springer
14 years 11 days ago
2000
Springer
An orthogonal drawing of a graph is an embedding of the graph in the rectangular grid, with vertices represented by axis-aligned boxes, and edges represented by paths in the grid w...