1274 search results - page 51 / 255 » The Geometry of Coin-Weighing Problems |
107
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
We show that n lines in 3-space can be cut into O(n2-1/69 log16/69 n) pieces, such that all depth cycles defined by triples of lines are eliminated. This partially resolves a long...
144
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
Epipolar geometry and relative camera pose computation are examples of tasks which can be formulated as minimal problems and solved from a minimal number of image points. Finding ...
121
click to vote
COMPGEOM
2004
ACM
15 years 10 months ago
2004
ACM
We prove that the lines tangent to four possibly intersecting convex polyhedra in 3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...
162
click to vote
ICRA
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract— This paper presents a geometry-based, multilayered synergistic approach to solve motion planning problems for mobile robots involving temporal goals. The temporal goals...
212
click to vote
COMPGEOM
2011
ACM
14 years 8 months ago
2011
ACM
Many real-world data sets can be viewed of as noisy samples of special types of metric spaces called metric graphs [16]. Building on the notions of correspondence and GromovHausdo...