49 search results - page 2 / 10 » Recent Progress and Open Problems in Algorithmic Convex Geom... |
JMIV
2010
13 years 15 hour ago
2010
Recent work on geometric vision problems has exploited convexity properties in order to obtain globally optimal solutions. In this paper we give an overview of these developments a...
AAAI
2007
13 years 7 months ago
2007
We consider problems of geometric exploration and selfdeployment for simple robots that can only sense the combinatorial (non-metric) features of their surroundings. Even with suc...
ECCV
2006
Springer
14 years 7 months ago
2006
Springer
This paper presents a practical method for finding the provably globally optimal solution to numerous problems in projective geometry including multiview triangulation, camera rese...
DIMACS
2001
13 years 6 months ago
2001
We investigate visibility computations with moving viewpoints. The initial problems are of discrete and algorithmic nature, but even for simple classes of objects (such as balls an...
COMPGEOM
1995
ACM
13 years 8 months ago
1995
ACM
A convex polytope P can be speci ed in two ways: as the convex hull of the vertex set V of P, or as the intersection of the set H of its facet-inducing halfspaces. The vertex enum...