Optimal coverage of convex regions (Q1068722): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Q596383 / rank | |||
Property / author | |||
Property / author: Gennady Samorodnitsky / rank | |||
Property / author | |||
Property / author: Reuven Y. Rubinstein / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Gennady Samorodnitsky / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3311717 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Generating random vectors uniformly distributed inside and on the surface of different regions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A stochastic method for global optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Convex Analysis / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf00939828 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2042029127 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 11:31, 30 July 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
0 references
0 references