7405 search results - page 1026 / 1481 » Computer Graphics |
127
click to vote
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
We propose a strategy to decompose a polygon, containing zero or more holes, into “approximately convex” pieces. For many applications, the approximately convex components of ...
138
click to vote
CGF
2005
15 years 3 months ago
2005
We propose statistical learning methods for approximating implicit surfaces and computing dense 3D deformation fields. Our approach is based on Support Vector (SV) Machines, which...
199
Voted
TOG
2012
13 years 6 months ago
2012
We present a simple algorithm to compute continuous penalty forces to determine collision response between rigid and deformable models bounded by triangle meshes. Our algorithm co...
157
click to vote
BMCBI
2008
15 years 4 months ago
2008
Background: Searching for similarities in protein and DNA databases has become a routine procedure in Molecular Biology. The Smith-Waterman algorithm has been available for more t...
114
click to vote
3DPVT
2006
IEEE
15 years 10 months ago
2006
IEEE
We present an approach for large-scale modeling of parametric surfaces using spherical harmonics (SHs). A standard least square fitting (LSF) method for SH expansion is not scala...