1604 search results - page 155 / 321 » Approximation algorithms for developable surfaces |
114
click to vote
VMV
2000
15 years 3 months ago
2000
In this paper the problem of matching freeform surface features against measured point data is studied. The motivation for this investigation is the recent demand for fast and rob...
121
click to vote
IJCV
2007
15 years 1 months ago
2007
This article presents a novel method for computing the visual hull of a solid bounded by a smooth surface and observed by a finite set of cameras. The visual hull is the intersect...
125
click to vote
IFIP
2004
Springer
15 years 7 months ago
2004
Springer
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
CIKM
2010
Springer
15 years 8 days ago
2010
Springer
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the movie ‘Godfather...
198
click to vote
ETVC
2008
15 years 3 months ago
2008
s of the LIX Fall Colloquium 2008: Emerging Trends in Visual Computing Frank Nielsen Ecole Polytechnique, Palaiseau, France Sony CSL, Tokyo, Japan Abstract. We list the abstracts o...