Sciweavers

742 search results - page 49 / 149
» Visualizing Graphs - A Generalized View
Sort
View
FOCS
2009
IEEE
15 years 4 months ago
Planarity Allowing Few Error Vertices in Linear Time
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
Ken-ichi Kawarabayashi
GD
1998
Springer
15 years 1 months ago
A Framework for Drawing Planar Graphs with Curves and Polylines
We describe a unified framework of aesthetic criteria and complexity measures for drawing planar graphs with polylines and curves. This framework includes several visual properties...
Michael T. Goodrich, Christopher G. Wagner
ICANN
2007
Springer
15 years 3 months ago
A Comparison of Features in Parts-Based Object Recognition Hierarchies
Parts-based recognition has been suggested for generalizing from few training views in categorization scenarios. In this paper we present the results of a comparative investigation...
Stephan Hasler, Heiko Wersing, Edgar Körner
INFOVIS
1997
IEEE
15 years 1 months ago
H3: laying out large directed graphs in 3D hyperbolic space
We present the H3 layout technique for drawing large directed graphs as node-link diagrams in 3D hyperbolic space. We can lay out much larger structures than can be handled using ...
Tamara Munzner
WWW
2007
ACM
15 years 10 months ago
On building graphs of documents with artificial ants
We present an incremental algorithm for building a neighborhood graph from a set of documents. This algorithm is based on a population of artificial agents that imitate the way re...
Hanane Azzag, Julien Lavergne, Christiane Guinot, ...