24 search results - page 4 / 5 » NP-completeness of the Planar Separator Problems |
ECCV
2004
Springer
14 years 9 months ago
2004
Springer
In the present paper, we address the problem of recovering the true underlying model of a surface while performing the segmentation. A novel criterion for surface (model) selection...
ICRA
2005
IEEE
14 years 1 months ago
2005
IEEE
— This paper presents a metric-based matching algorithm to estimate the robot planar displacement by matching dense two-dimensional range scans. The contribution is a geometric d...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
ICRA
2010
IEEE
13 years 6 months ago
2010
IEEE
— Detecting the boundaries of objects is a key step in separating foreground objects from the background, which is useful for robotics and computer vision applications, such as o...
CDC
2009
IEEE
14 years 5 days ago
2009
IEEE
— This paper addresses the problem of localizing a source from noisy time-of-arrival measurements. In particular, we are interested in the optimal placement of M planar sensors s...