285 search results - page 34 / 57 » Steaming on Convex Hulls |
CCCG
1993
13 years 11 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 ...
FMSD
2006
13 years 9 months ago
2006
Convex polyhedra are often used to approximate sets of states of programs involving numerical variables. The manipulation of convex polyhedra relies on the so-called double descri...
DAM
2007
13 years 9 months ago
2007
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
TCSV
2008
13 years 9 months ago
2008
This paper proposes a novel joint source-channel coding (JSCC) methodology which minimizes the end-to-end distortion for the transmission over packet loss channels of scalable vide...
IWPEC
2004
Springer
14 years 3 months ago
2004
Springer
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...