scientific article; zbMATH DE number 566419
From MaRDI portal
Publication:4291532
zbMath0799.52005MaRDI QIDQ4291532
Publication date: 10 May 1994
Full work available at URL: https://eudml.org/doc/34376
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation by convex sets (52A27)
Related Items (4)
Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries ⋮ A note on approximation of a ball by polytopes ⋮ Bounding suprema of canonical processes via convex hull ⋮ Geometric clustering for the consolidation of farmland and woodland
Cites Work
- Unnamed Item
- Inequalities of Bernstein-Jackson-type and the degree of compactness of operators in Banach spaces
- Computing the volume is difficult
- Gelfand numbers of operators with values in a Hilbert space
- Variable metric relaxation methods, part II: The ellipsoid method
- Approximation of the Sphere by Polytopes having Few Vertices
This page was built for publication:
