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...
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 ...
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...
Abstract— This paper presents a geometry-based, multilayered synergistic approach to solve motion planning problems for mobile robots involving temporal goals. The temporal goals...
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...