On a set of problems on covering of a bounded set
The author describes a constructive approach to the search of admissible coverings of a polyhedron by translates of polyhedra. The domain \(S_ 0\) of the covering is a point set of the Euclidean space \(E^ k\), and \(S_ i\), \(i=1,...,n\), are the covering objects. The main attention is paid to the case when the objects \(S_ i\), \(i=0,...,n\), are polyhedra of the space \(E^ k\). A location of the covering objects when each point of the domain of the covering belongs to at least one object is called an admissible covering. The author can give such coverings for arbitrary polyhedra \(S_ i\). He shows the major stages of solutions of this problem and describes algorithms for auxiliary problems occuring at each stage by referring to the respective literature. A numerical example given at the end of the paper shows the acceptability of the approach given and, on the whole, shows difficulties of its realization.
- On some polyhedra covering problems
- Configuration space of geometric objects
- Lattice coverage of cuboid with minimum number of hemispheres
- Formalizing spatial configuration optimization problems with the use of a special function class
- Set cover problems with small neighborhood covers
- The Lebesgue universal covering problem
- The covering of non-convex polytope by a finite family of right parallelepipeds
- scientific article; zbMATH DE number 4194598 (Why is no real title available?)
- On covering of linear operators on polyhedral sets
- scientific article; zbMATH DE number 4081307 (Why is no real title available?)
- Continuous extensions on Euclidean combinatorial configurations
- On the p‐coverage problem on the real line
- scientific article; zbMATH DE number 3285212 (Why is no real title available?)
- The concept of modeling packing and covering problems using modern computational geometry software
- The method of artificial space dilation in problems of optimal packing of geometric objects
- On the density of the thinnest covering of \(\mathbb{R}^n\)
- Formalization and solution of one class of covering problems for the design of monitoring and testing systems
This page was built for publication: On a set of problems on covering of a bounded set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1825437)
