942 search results - page 136 / 189 » Constraints in Graph Drawing Algorithms |
235
Voted
POPL
2004
ACM
16 years 2 months ago
2004
ACM
We aim to specify program transformations in a declarative style, and then to generate executable program transformers from such specifications. Many transformations require non-t...
143
click to vote
SMA
1995
ACM
15 years 6 months ago
1995
ACM
We describe a method of constructing a B-rep solid model from a single hidden-line removed sketch view of a 3D object. The main steps of our approach are as follows. The sketch is...
131
click to vote
TVCG
2008
15 years 2 months 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...
137
click to vote
CVPR
2005
IEEE
16 years 4 months ago
2005
IEEE
This paper addresses the novel problem of automatically synthesizing an output image from a large collection of different input images. The synthesized image, called a digital tap...
111
click to vote
CP
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Variable elimination is the basic step of Adaptive Consistency 4 . It transforms the problem into an equivalent one, having one less variable. Unfortunately, there are ma...