942 search results - page 29 / 189 » Constraints in Graph Drawing Algorithms |
153
Voted
TVCG
2011
14 years 9 months ago
2011
—This paper considers the problem of interactively finding the cutting contour to extract components from an existing mesh. First, we propose a constrained random walks algorith...
ICALP
2000
Springer
15 years 6 months ago
2000
Springer
142
Voted
AGTIVE
1999
Springer
15 years 7 months ago
1999
Springer
We discuss geometric positioning, highlighting of visited nodes and user defined highlighting that form the algorithm animation facilities in the Grrr graph rewriting programming l...
86
Voted
GD
2004
Springer
15 years 8 months ago
2004
Springer
In this paper we study simple families of clustered graphs that are highly unconnected. We start by studying 3-cluster cycles, which are clustered graphs such that the underlying ...
121
click to vote
ISCI
2007
15 years 2 months ago
2007
Techniques for drawing graphs have proven successful in producing good layouts of undirected graphs. When nodes must be labeled however, the problem of overlapping nodes arises, p...