Sciweavers

839 search results - page 91 / 168
» Three-Clustering of Points in the Plane
Sort
View
SODA
2010
ACM
232views Algorithms» more  SODA 2010»
14 years 7 months ago
On the Optimality of Spiral Search
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...
Elmar Langetepe
ICRA
2009
IEEE
151views Robotics» more  ICRA 2009»
14 years 5 months ago
HSM3D: Feature-less global 6DOF scan-matching in the Hough/Radon domain
—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...
Andrea Censi, Stefano Carpin
AAIM
2007
Springer
141views Algorithms» more  AAIM 2007»
14 years 4 months ago
An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem
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...
Bin Fu, Zhixiang Chen, Mahdi Abdelguerfi
IROS
2006
IEEE
84views Robotics» more  IROS 2006»
14 years 4 months ago
Vehicle Trajectory from an Uncalibrated Stereo-Rig with Super-Homography
— 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...
Nicolas Simond, Claude Laurgeau
IV
2005
IEEE
76views Visualization» more  IV 2005»
14 years 3 months ago
Multidimensional Visualization of Transition Systems
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...
A. Johannes Pretorius, Jarke J. van Wijk