Sciweavers

852 search results - page 25 / 171
» Using graph parsing for automatic graph drawing
Sort
View
ICMCS
2005
IEEE
169views Multimedia» more  ICMCS 2005»
14 years 2 months ago
Automatic 3D Face Recognition Using Topological Techniques
In this paper, we use the three-dimensionaltopological shape information for human face identification. We propose a new method to represent 3D faces as a topological graph. Fine...
Chafik Samir, Jean-Philippe Vandeborre, Mohamed Da...
GD
2001
Springer
14 years 28 days ago
Labeling Heuristics for Orthogonal Drawings
This paper studies the problem of computing an orthogonal drawing of a graph with labels along the edges. Labels are not allowed to overlap with each other or with edges to which t...
Carla Binucci, Walter Didimo, Giuseppe Liotta, Mad...
DAGSTUHL
2007
13 years 10 months ago
Exact Elimination of Cycles in Graphs
One of the standard basic steps in drawing hierarchical graphs is to invert some arcs of the given graph to make the graph acyclic. We discuss exact and parameterized algorithms fo...
Daniel Raible, Henning Fernau
ICDAR
1995
IEEE
13 years 12 months ago
Efficient analysis of complex diagrams using constraint-based parsing
This paper describes substantial advances in the analysis (parsing) of diagrams using constraint grammars. The addition of set types to the grammar and spatial indexing of the dat...
Robert P. Futrelle, Nikos Nikolakis
HCI
2009
13 years 6 months ago
Sphere Anchored Map: A Visualization Technique for Bipartite Graphs in 3D
Circular anchored maps have been proposed as a drawing technique to acquire knowledge from bipartite graphs, where nodes in one set are arranged on a circumference. However, the re...
Takao Ito, Kazuo Misue, Jiro Tanaka