Linear time approximation of 3D convex polytopes
نویسندگان
چکیده
منابع مشابه
Hausdorff approximation of 3D convex polytopes
Let P be a convex polytope in R, d = 3 or 2, with n vertices. We present linear time algorithms for approximating P by simpler polytopes. For instance, one such algorithm selects k < n vertices of P whose convex hull is the approximating polytope. The rate of approximation, in the Hausdorff distance sense, is best possible in the worst case. An analogous algorithm, where the role of vertices is...
متن کامل2 N ov 2 01 7 Balas formulation for the union of polytopes is optimal
A celebrated theorem of Balas gives a linear mixed-integer formulation for the union of two nonempty polytopes whose relaxation gives the convex hull of this union. The number of inequalities in Balas formulation is linear in the number of inequalities that describe the two polytopes and the number of variables is doubled. In this paper we show that this is best possible: in every dimension the...
متن کاملPii: S0925-7721(02)00100-1
We develop algorithms for the approximation of a convex polytope in R3 by polytopes that are either contained in it or containing it, and that have fewer vertices or facets, respectively. The approximating polytopes achieve the best possible general order of precision in the sense of volume-difference. The running time is linear in the number of vertices or facets. 2002 Elsevier Science B.V. ...
متن کاملAsymptotic approximation of smooth convex bodies by general polytopes
For the optimal approximation of convex bodies by inscribed or circumscribed polytopes there are precise asymptotic results with respect to different notions of distance. In this paper we want to derive some results on optimal approximation without restricting the polytopes to be inscribed or circumscribed. Let Pn and P(n) denote the set of polytopes with at most n vertices and n facets, respec...
متن کاملPolytopes of linear programming relaxation for triangulations
Universal polytope is the polytope de ned as the convex hull of the characteristic vectors of all triangulations for a given point con guration. The equality system de ning this polytope was found, but the system of inequalities are not known yet. Larger polytopes, corresponding to linear programming relaxations, have been used in practice. We show that (1) the universal polytope, the polytope ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comput. Geom.
دوره 23 شماره
صفحات -
تاریخ انتشار 2002