Sciweavers

378 search results - page 6 / 76
» Computing discrete shape operators on general meshes
Sort
View
DGCI
2005
Springer
15 years 2 months ago
Increasing Interconnection Network Connectivity for Reducing Operator Complexity in Asynchronous Vision Systems
Due to the restriction of SIMD mode to local operations in VLSI massively parallel vision chips, using programmable connections and asynchronous communications are key ingredients ...
Valentin Gies, Thierry M. Bernard
ICIP
2003
IEEE
15 years 11 months ago
Shape analysis algorithm based on information theory
In this paper, we describe an algorithm to measure the shape complexity for discrete approximations of planar curves in 2D images and manifold surfaces for 3D triangle meshes. We ...
Andreas Koschan, Besma Roui-Abidi, David L. Page, ...
CGF
2006
151views more  CGF 2006»
14 years 9 months ago
Differential Representations for Mesh Processing
Surface representation and processing is one of the key topics in computer graphics and geometric modeling, since it greatly affects the range of possible applications. In this pa...
Olga Sorkine
CVGIP
2002
126views more  CVGIP 2002»
14 years 9 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
SMA
2008
ACM
131views Solid Modeling» more  SMA 2008»
14 years 9 months ago
Streaming tetrahedral mesh optimization
Improving the quality of tetrahedral meshes is an important operation in many scientific computing applications. Meshes with badly shaped elements impact both the accuracy and con...
Tian Xia, Eric Shaffer