241 search results - page 23 / 49 » Efficient Parallel Algorithms for Euclidean Distance Transfo... |
ICIP
2005
IEEE
14 years 10 months ago
2005
IEEE
Many basic computations can be done by means of iterative neighborhood-based calculations, including threshold, optimum, distance transform, contour closing, mathematical morpholo...
CG
2005
Springer
13 years 9 months ago
2005
Springer
This article discusses an enhanced polygonization algorithm for variational implicit surfaces. The polygonization scheme is a simple hierarchical adaptation of the Marching Cubes ...
PAMI
2006
13 years 9 months ago
2006
This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We pres...
IPPS
1999
IEEE
14 years 1 months ago
1999
IEEE
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
CGF
2008
13 years 9 months ago
2008
Proximity queries such as closest point computation and collision detection have many applications in computer graphics, including computer animation, physics-based modeling, augm...