999 search results - page 74 / 200 » Finding shapes in a set of points |
151
click to vote
RSS
2007
15 years 7 months ago
2007
— This paper presents BS-SLAM, a simultaneous localization and mapping algorithm for use in unstructured environments that is effective regardless of whether features correspond ...
180
click to vote
SODA
1992
ACM
15 years 7 months ago
1992
ACM
Given a set P of n points in the plane, we wish to find a set Q P of k points for which the convex hull conv(Q) has the minimum area. We solve this, and the related problem of fi...
173
click to vote
CCCG
2010
15 years 7 months ago
2010
Given a set S of n points in the plane and a fixed angle 0 < < , we show how to find all triangles of minimum area with angle that enclose S in O(n log n) time.
179
click to vote
BIRTHDAY
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. This paper considers how to adapt geometric algorithms, developed for content-based music retrieval of symbolically encoded music, to be robust against time deformations ...
154
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We study a dissimilarity measure between shapes, expressed by the natural pseudodistance between size pairs, where a shape is viewed as a topological space endowed with a real-val...