999 search results - page 26 / 200 » Finding shapes in a set of points |
82
Voted
DCG
2008
14 years 9 months ago
2008
Let P be a set of n points in Rd . A subset S of P is called a (k, )-kernel if for every direction, the direction width of S -approximates that of P, when k "outliers" c...
86
Voted
SAMT
2009
Springer
15 years 4 months ago
2009
Springer
This paper describes an automatic annotation, or autotagging, algorithm that attaches textual tags to 3D models based on their shape and semantic classes. The proposed method emplo...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We present a near-quadratic time algorithm that computes a point inside a simple polygon P having approximately the largest visibility polygon inside P, and a nearlinear time algo...
ICPR
2010
IEEE
15 years 23 days ago
2010
IEEE
We present a novel method for finding more good feature pairs between two sets of features. We first select matched features by Bi-matching method as seed points, then organize th...
ICIP
2006
IEEE
15 years 11 months ago
2006
IEEE
The main focus of this paper is the shape representation and registration using vector level set functions. This powerful representation is more flexible than conventional signed ...