Optimal coverage of convex regions (Q1068722): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
Property / author | |||
Property / author: Reuven Y. Rubinstein / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Gennady Samorodnitsky / rank | |||
Normal rank |
Revision as of 16:55, 10 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Optimal coverage of convex regions |
scientific article |
Statements
Optimal coverage of convex regions (English)
0 references
1986
0 references
The problem of the coverage of convex regions with polygons and quadratic configurations of minimal volume is considered. The regions are presented as inequality constraints of a linear or nonlinear programming problem. It is shown that the problem of the optimal coverage with an arbitrary polygon can be reduced to a convex one of coverage with a multidimensional rectangle. If, however, rotation of the coordinate system is allowed, an additional nonconvex problem must be solved. It is also shown that, to find the minimal covering hypersphere or hyperellipsoid, one has to solve two convex programming problems. Algorithms and examples illustrating the feasibility of the proposed methods are presented.
0 references
coverage of convex regions
0 references
polygons
0 references
quadratic configurations
0 references
minimal volume
0 references
inequality constraints
0 references
minimal covering hypersphere
0 references
hyperellipsoid
0 references
convex hulls
0 references
Monte Carlo optimization
0 references
nonconvex programming
0 references