141 search results - page 3 / 29 » Self-improving Algorithms for Convex Hulls |
WADS
2005
Springer
15 years 2 months ago
2005
Springer
COSIT
2003
Springer
15 years 2 months ago
2003
Springer
This paper looks at axioms for convexity, and shows how they can be applied to discrete spaces. Two structures for a discrete geometry are considered: oriented matroids, and cell c...
CCCG
2008
14 years 11 months ago
2008
We prove a tight asymptotic bound of ( log(n/)) on the worst case computational complexity of the convex hull of the union of two convex objects of sizes summing to n requiring o...
103
click to vote
ICIP
2000
IEEE
15 years 11 months ago
2000
IEEE
This paper describes an algorithm that achieves an approximately optimal assignment of forward error correction to progressive data within the unequal loss protection framework [1...
ISVD
2007
IEEE
15 years 3 months ago
2007
IEEE
We consider the problem of computing the time convex hull of a set of points in the presence of a straight-line highway in the plane. The traveling speed in the plane is assumed t...