Sciweavers

557 search results - page 5 / 112
» On the set multi-cover problem in geometric settings
Sort
View
ICRA
2008
IEEE
164views Robotics» more  ICRA 2008»
14 years 2 months ago
Visual servoing set free from image processing
— This paper proposes a new way to achieve robotic tasks by visual servoing. Instead of using geometric features (points, straight lines, pose, homography, etc.) as it is usually...
Christophe Collewet, Éric Marchand, Fran&cc...
WG
2004
Springer
14 years 1 months ago
A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs
A unit disk graph is the intersection graph of unit disks in the euclidean plane. We present a polynomial-time approximation scheme for the maximum weight independent set problem i...
Tim Nieberg, Johann Hurink, Walter Kern
ICPR
2006
IEEE
14 years 8 months ago
Reconciling Landmarks and Level Sets
Shape warping is a key problem in statistical shape analysis. This paper proposes a framework for geometric shape warping based on both shape distances and landmarks. Our method i...
Olivier D. Faugeras, Pierre Maurel, Renaud Keriven
GD
2009
Springer
13 years 11 months ago
Complexity of Some Geometric and Topological Problems
We show that recognizing intersection graphs of convex sets has the same complexity as deciding truth in the existential theory of the reals. Comparing this to similar results on t...
Marcus Schaefer
COMPGEOM
2004
ACM
14 years 1 months ago
Inner and outer rounding of set operations on lattice polygonal regions
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementa...
Olivier Devillers, Philippe Guigue