1387 search results - page 33 / 278 » Convexity in Discrete Space |
SIAMJO
2002
13 years 7 months ago
2002
We study best approximation problems with nonlinear constraints in Hilbert spaces. The strong "conical hull intersection property" (CHIP) and the "basic constraint q...
MLQ
2002
13 years 7 months ago
2002
For the computability of subsets of real numbers, several reasonable notions have been suggested in the literature. We compare these notions in a systematic way by relating them to...
STOC
1989
ACM
13 years 11 months ago
1989
ACM
We present a randomised polynomial time algorithm for approximating the volume of a convex body K in n-dimensional Euclidean space. The proof of correctness of the algorithm relie...
JCDCG
2000
Springer
13 years 11 months ago
2000
Springer
A k-dissection D of a polygon P, is a partition of P into a set of subpolygons {Q1, . . . , Qm} with disjoint interiors such that these can be reassembled to form k polygons P1, ....
COMPGEOM
2010
ACM
13 years 11 months ago
2010
ACM
Let C be a family of n convex bodies in the plane, which can be decomposed into k subfamilies of pairwise disjoint sets. It is shown that the number of tangencies between the memb...