839 search results - page 91 / 168 » Three-Clustering of Points in the Plane |
134
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
Searching for a point in the plane is a well-known search game problem introduced in the early eigthies. The best known search strategy is given by a spiral and achieves a competi...
143
click to vote
ICRA
2009
IEEE
16 years 1 months ago
2009
IEEE
—This paper presents HSM3D, an algorithm for global rigid 6DOF alignment of 3D point clouds. The algorithm works by projecting the two input sets into the Radon/Hough domain, who...
164
click to vote
AAIM
2007
Springer
16 years 16 days ago
2007
Springer
The disc covering problem asks to cover a set of points on the plane with a minimum number of fix-sized discs. We develop an O(n(log n)2 (log log n)2 ) deterministic time 2.8334-a...
IROS
2006
IEEE
16 years 11 days ago
2006
IEEE
— We present in this article an original manner to estimate the trajectory of a vehicle running in urban-like areas. The method consists in extracting then tracking features (poi...
168
click to vote
IV
2005
IEEE
15 years 12 months ago
2005
IEEE
Transition systems are graphs and it is natural to consider their visual representation as a graph visualization problem. They also pose an interesting multidimensional visualizat...