111 search results - page 5 / 23 » On the implementation of fast marching methods for 3D lattic... |
CGF
2008
13 years 5 months ago
2008
Given a 3D solid model S represented by a tetrahedral mesh, we describe a novel algorithm to compute a hierarchy of convex polyhedra that tightly enclose S. The hierarchy can be b...
SIGPRO
2008
13 years 5 months ago
2008
: In this letter, an efficient algorithm for three-dimensional (3-D) vector radix decimation in frequency is derived for computing the type-III 3-D discrete W transform (DWT). Comp...
ICIP
2006
IEEE
14 years 7 months ago
2006
IEEE
In this paper, we analyze the redundancy in calculating all pairs of geodesic distances on a rectangular grid. Fast marching method is an efficient way to estimate the geodesic di...
EMMCVPR
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We introduce a novel implicit approach for single object segmentation in 3D images. The boundary surface of this object is assumed to contain two known curves (the constr...
ICIAP
2005
ACM
14 years 5 months ago
2005
ACM
This paper presents an efficient implementation of moving least square(MLS) approximation for 3D surface reconstruction. The smoothness of the MLS is mainly determined by the weigh...