235 search results - page 8 / 47 » The Complexity of Separating Points in the Plane |
COMPGEOM
2009
ACM
15 years 2 months ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
81
Voted
IJCGA
2006
14 years 9 months ago
2006
We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show (n log n) time lower bounds for sep...
73
Voted
CAIP
1999
Springer
15 years 1 months ago
1999
Springer
We address the problem of control-based recovery of robot pose and the environmental lay-out. Panoramic sensors provide us with a 1D projection of characteristic features of a 2D ...
IJCGA
2007
14 years 9 months ago
2007
Given two sets A and B of m non-intersecting line segments in the plane, we show how to compute in O(m log m) time a data structure that uses O(m) space and allows to answer the fo...
80
Voted
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
Recovering the three-dimensional (3D) object shape lies as an unresolved and active research topic on the crosssection of computer vision, photogrammetry and bioinformatics. Altho...