102291 search results - page 256 / 20459 » Computability in Computational Geometry |
226
click to vote
SIBGRAPI
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper presents a 3D face photography system based on a small set of training facial range images. The training set is composed by 2D texture and 3D range images (i.e. geometr...
203
click to vote
SIGGRAPH
1996
ACM
15 years 11 months ago
1996
ACM
Multiresolution analysis has been proposed as a basic tool supporting compression, progressive transmission, and level-of-detail control of complex meshes in a unified and theoret...
245
click to vote
COMPGEOM
2011
ACM
14 years 10 months ago
2011
ACM
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
209
click to vote
SIGGRAPH
1998
ACM
15 years 11 months ago
1998
ACM
In this paper we disprove the belief widespread within the computer graphics community that Catmull-Clark subdivision surfaces cannot be evaluated directly without explicitly subd...
213
click to vote
ICCSA
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...