7351 search results - page 147 / 1471 » Segmenting Point Sets |
135
click to vote
COMPGEOM
1994
ACM
15 years 8 months ago
1994
ACM
For two given point sets, we present a very simple (almost trivial) algorithm to translate one set so that the Hausdor distance between the two sets is not larger than a constant ...
147
click to vote
CCCG
2008
15 years 5 months ago
2008
A set of points in the plane is said to be in general position if no three of them are collinear and no four of them are cocircular. If a point set determines only distinct vector...
129
click to vote
BMCBI
2007
15 years 4 months ago
2007
Background: The number of algorithms available to predict ligand-protein interactions is large and ever-increasing. The number of test cases used to validate these methods is usua...
CVPR
2008
IEEE
16 years 6 months ago
2008
IEEE
In this paper, we extend a computationally efficient framework for real-time 3D tracking and segmentation to support deformable subdivision surfaces. Segmentation is performed in a...
147
click to vote
VC
2008
15 years 4 months ago
2008
Abstract We present an effective framework for segmenting 3D shapes into meaningful components using the curve skeleton. Our algorithm identifies a number of critical points on the...