TVCG
2012
12 years 2 months ago
2012
—The Reeb graph of a scalar function represents the evolution of the topology of its level sets. This paper describes a near-optimal output-sensitive algorithm for computing the ...
CONSTRAINTS
1998
14 years 4 days ago
1998
Most current graph layout technology does not lend itself to interactive applications such as animation or advanced user interfaces. We introduce the constrained graph layout model...
DLIB
2002
14 years 7 days ago
2002
In this article we present a method for retrieving documents from a digital library through a visual interface based on automatically generated concepts. We used a vocabulary gene...
TVCG
2008
14 years 10 days ago
2008
Systems biologists use interaction graphs to model the behavior of biological systems at the molecular level. In an iterative process, such biologists observe the reactions of livi...
TVCG
2008
14 years 10 days ago
2008
A standard approach to large network visualization is to provide an overview of the network and a detailed view of a small component of the graph centred around a focal node. The u...
GD
2008
Springer
14 years 1 months ago
2008
Springer
Abstract. Constrained graph layout is a recent generalisation of forcedirected graph layout which allows constraints on node placement. We give a constrained graph layout algorithm...
APVIS
2006
14 years 1 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...
APVIS
2004
14 years 1 months ago
2004
The topic of skeletal animation and its associated techniques have previously been applied in the area of animating computer-generated characters for motion pictures and computer ...
GD
1997
Springer
14 years 4 months ago
1997
Springer
Although routing is a well-studied problem in various contexts, there remain unsolved problems in routing edges for graph layouts. In contrast with techniques from other domains su...
IV
2002
IEEE
14 years 5 months ago
2002
IEEE
We apply fillets — smoothing of sharp angles at the joints — between the connections and nodes of graph-like diagrams. In situations where the graph layout is constrained, e....