164 search results - page 9 / 33 » Adaptive Algorithms for Planar Convex Hull Problems |
86
Voted
ECCV
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We propose a homography estimation method from the contours of planar regions. Standard projective invariants such as cross ratios or canonical frames based on hot points...
CCCG
1993
15 years 1 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 ...
GD
2006
Springer
15 years 3 months ago
2006
Springer
We consider the problem of intersection-free planar graph morphing, and in particular, a generalization from Euclidean space to spherical space. We show that there exists a continu...
ICML
2006
IEEE
16 years 17 days ago
2006
IEEE
We address the problem of learning a kernel for a given supervised learning task. Our approach consists in searching within the convex hull of a prescribed set of basic kernels fo...
COMPGEOM
2004
ACM
15 years 5 months ago
2004
ACM
For many geometric problems, there are efficient algorithms that use surprisingly very little extra space other than the given array holding the input. For many geometric query pr...