Sciweavers

241 search results - page 3 / 49
» Efficient Parallel Algorithms for Euclidean Distance Transfo...
Sort
View
CVPR
1998
IEEE
14 years 7 months ago
Generation of the Euclidean Skeleton from the Vector Distance Map by a Bisector Decision Rule
The Euclidean skeleton is essential for general shape representation. This paper provides an e cient method to extract a well-connected Euclidean skeleton by a neighbor bisector d...
Hong Li, Albert M. Vossepoel
JGTOOLS
2006
199views more  JGTOOLS 2006»
13 years 5 months ago
Fast Approximation of High-Order Voronoi Diagrams and Distance Transforms on the GPU
We present a graphics hardware implementation of the tangent-plane algorithm for computing the kth-order Voronoi diagram of a set of point sites in image space. Correct and effici...
Ian Fischer, Craig Gotsman
ICRA
2009
IEEE
131views Robotics» more  ICRA 2009»
13 years 3 months ago
Efficient C-space and cost function updates in 3D for unmanned aerial vehicles
When operating in partially-known environments, autonomous vehicles must constantly update their maps and plans based on new sensor information. Much focus has been placed on devel...
Sebastian Scherer, Dave Ferguson, Sanjiv Singh
CVPR
2001
IEEE
14 years 7 months ago
Bending Invariant Representations for Surfaces
Isometric surfaces share the same geometric structure also known as the `first fundamental form'. For example, all possible bending of a given surface, that include all lengt...
Asi Elad (Elbaz), Ron Kimmel
CVIU
2004
134views more  CVIU 2004»
13 years 5 months ago
The "dead reckoning" signed distance transform
Consider a binary image containing one or more objects. A signed distance transform assigns to each pixel (voxel, etc.), both inside and outside of any objects, the minimum distan...
George J. Grevera