852 search results - page 33 / 171 » Using graph parsing for automatic graph drawing |
CVPR
2007
IEEE
14 years 10 months ago
2007
IEEE
Many vision tasks are posed as either graph partitioning (coloring) or graph matching (correspondence) problems. The former include segmentation and grouping, and the latter inclu...
APVIS
2009
13 years 9 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...
ECCV
2010
Springer
14 years 1 months ago
2010
Springer
Since most current scene understanding approaches operate
either on the 2D image or using a surface-based representation, they do
not allow reasoning about the physical constrain...
DCG
2008
13 years 8 months ago
2008
In this paper we study connections between planar graphs, Schnyder woods, and orthogonal surfaces. Schnyder woods and the face counting approach have important applications in gra...
APVIS
2007
13 years 10 months ago
2007
Graphs are typically visualized as node-link diagrams. Although there is a fair amount of research focusing on crossing minimization to improve readability, little attention has b...