Sciweavers

12 search results - page 2 / 3
» On Computing the Vertex Centroid of a Polyhedron
Sort
View
CVPR
2010
IEEE
13 years 11 months ago
Image Retrieval via Probabilistic Hypergraph Ranking
In this paper, we propose a new transductive learning framework for image retrieval, in which images are taken as vertices in a weighted hypergraph and the task of image search is...
Yuchi Huang, Qingshan Liu, Shaoting Zhang, Metaxas...
CVGIP
2002
126views more  CVGIP 2002»
13 years 5 months ago
Dual Mesh Resampling
The dual of a 2-manifold polygonal mesh without boundary is commonly defined as another mesh with the same topology (genus) but different connectivity (vertex-face incidence), in ...
Gabriel Taubin
GRAPP
2009
14 years 8 months ago
Skeleton-based Rigid Skinning for Character Animation
Skeleton-based skinning is widely used for realistic animation of complex characters defining mesh movement as a function of the underlying skeleton. In this paper, we propose a ne...
Andreas Vasilakis, Ioannis Fudos
IMR
2003
Springer
13 years 10 months ago
Isotropic Remeshing of Surfaces: A Local Parameterization Approach
We present a method for isotropic remeshing of arbitrary genus surfaces. The method is based on a mesh adaptation process, namely, a sequence of local modifications performed on ...
Vitaly Surazhsky, Pierre Alliez, Craig Gotsman
COMPGEOM
2003
ACM
13 years 10 months ago
Local polyhedra and geometric graphs
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
Jeff Erickson