Sciweavers

459 search results - page 55 / 92
» Delaunay mesh construction
Sort
View
CGF
2010
120views more  CGF 2010»
13 years 7 months ago
Polygonal mesh watermarking using Laplacian coordinates
We propose a watermarking algorithm for polygonal meshes based on the modification of the Laplacian coordinates. More specifically, we first compute the Laplacian coordinates (x,y...
Ying Yang, Ioannis P. Ivrissimtzis
CVPR
2008
IEEE
14 years 9 months ago
Increasing the density of Active Appearance Models
Active Appearance Models (AAMs) typically only use 50-100 mesh vertices because they are usually constructed from a set of training images with the vertices hand-labeled on them. ...
Krishnan Ramnath, Simon Baker, Iain Matthews, Deva...
IPPS
1997
IEEE
13 years 12 months ago
On the Dynamic Initialization of Parallel Computers
Abstract. The incremental and dynamic construction of interconnection networks from smaller components often leaves the fundamental problem of assigning addresses to processors to ...
Stephan Olariu, Ivan Stojmenovic, Albert Y. Zomaya
CAD
2007
Springer
13 years 7 months ago
Interpolation by geometric algorithm
We present a novel geometric algorithm to construct a smooth surface that interpolates a triangular or a quadrilateral mesh of arbitrary topological type formed by n vertices. Alt...
Takashi Maekawa, Yasunori Matsumoto, Ken Namiki
MOC
2002
115views more  MOC 2002»
13 years 7 months ago
Approximation by quadrilateral finite elements
We consider the approximation properties of finite element spaces on quadrilateral meshes. The finite element spaces are constructed starting with a given finite dimensional space ...
Douglas N. Arnold, Daniele Boffi, Richard S. Falk