49 search results - page 3 / 10 » Recent Progress and Open Problems in Algorithmic Convex Geom... |
COMPGEOM
2009
ACM
14 years 2 months ago
2009
ACM
Color red and blue the n vertices of a convex polytope P in R3 . Can we compute the convex hull of each color class in o(n log n)? What if we have χ > 2 colors? What if the co...
SMA
2008
ACM
13 years 7 months ago
2008
ACM
In recent years, there has been an increasing interest in developing geometric algorithms for kinematic computations. The aim of this paper is to present the notion of kinematic c...
ECCV
2010
Springer
13 years 10 months ago
2010
Springer
Globally optimal formulations of geometric computer vision problems comprise an exciting topic in multiple view geometry. These approaches are unaffected by the quality of a provid...
JMLR
2010
13 years 5 months ago
2010
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
CCCG
1993
13 years 8 months ago
1993
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...