3025 search results - page 227 / 605 » Computational geometry: a retrospective |
159
click to vote
COMPGEOM
1994
ACM
15 years 10 months ago
1994
ACM
We devise techniques to manipulate a collection of loosely interpenetrating spheres in threedimensional space. Our study is motivated by the representation and manipulation of mol...
182
click to vote
COCOA
2008
Springer
15 years 8 months ago
2008
Springer
The multiple weighted hitting set problem is to find a subset of nodes in a hypergraph that hits every hyperedge in at least m nodes. We extend the problem to a notion of hypergra...
187
Voted
ICONIP
2007
15 years 8 months ago
2007
Variational methods for approximate inference in machine learning often adapt a parametric probability distribution to optimize a given objective function. This view is especially ...
144
click to vote
VMV
2008
15 years 8 months ago
2008
In computer graphics, procedural methods and Lsystems are common approaches to model complex botanical trees. In contrast to previous tree modeling systems, we propose linking rul...
179
click to vote
GRAPHICSINTERFACE
2000
15 years 8 months ago
2000
The frame of our work is the efficient realistic rendering of scenes containing a huge amount of data for which an a priori knowledge is available. In this paper, we present a new...