459 search results - page 13 / 92 » Delaunay mesh construction |
CGF
2000
13 years 7 months ago
2000
We present a fast, memory efficient algorithm that generates a manifold triangular mesh S passing through a set of unorganized points P R3 . Nothing is assumed about the geometry,...
FIMH
2011
Springer
12 years 11 months ago
2011
Springer
In this paper, we present an effective algorithm to construct a 3D shape atlas for the left ventricle of heart from cardiac Magnetic Resonance Image data. We derive a framework tha...
BILDMED
2003
13 years 9 months ago
2003
We present an approach to generating volumetric meshes from closed triangulated surface meshes. The approach initially generates a structured hexahedral mesh based on the bounding ...
CCCG
2003
13 years 9 months ago
2003
The key step in the construction of the Delaunay triangulation of a finite set of planar points is to establish correctly whether a given point of this set is inside or outside t...
COMPGEOM
2003
ACM
14 years 26 days ago
2003
ACM
We address the problem of curvature estimation from sampled smooth surfaces. Building upon the theory of normal cycles, we derive a definition of the curvature tensor for polyhed...