Hostname: page-component-6766d58669-nqrmd Total loading time: 0 Render date: 2026-05-21T06:28:09.880Z Has data issue: false hasContentIssue false

Approximation problems for convex polyhedra

Published online by Cambridge University Press:  26 February 2010

G. C. Shephard
Affiliation:
Department of Pure Mathematics, The University, Birmingham.
Get access

Extract

Let K be any convex body in En, and K any given class of convex sets in En. Then we shall say that K is approximable by the class K if there exists a sequence of sets {Ki}, such that, as i→∞, Ki→K in a suitable metric (for example, the Hausdorff metric), where each set Ki is a vector sum of (a finite number of) sets of the class K An approximation problem is to determine necessary and sufficient conditions for K to be approximable by a given class K.

Information

Type
Research Article
Copyright
Copyright © University College London 1964

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable