1604 search results - page 81 / 321 » Approximation algorithms for developable surfaces |
STOC
2009
ACM
14 years 9 months ago
2009
ACM
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...
NPAR
2004
ACM
14 years 2 months ago
2004
ACM
We present a method to aid in the generation of pen-and-ink style renderings of complex geometry. Most illustration algorithms focus on rendering a small number of surfaces with a...
SIGGRAPH
1999
ACM
14 years 1 months ago
1999
ACM
Antialiasing of ray traced images is typically performed by supersampling the image plane. While this type of filtering works well for many algorithms, it is much more efficient t...
COSIT
1995
Springer
14 years 15 days ago
1995
Springer
: Various algorithms have been proposed for the determination of the optimum paths in line networks. Moving in space is a far more complex problem, where research has been scarce. ...
CCCG
2009
13 years 10 months ago
2009
In structural molecular biology software, the accessibility of an atom in a molecule to a ball representing solvent is either computed slowly by building a solventaccessible surfa...