On a set of problems on covering of a bounded set

DOI10.1007/BF01953365zbMath0684.52007MaRDI QIDQ1825437

S. V. Yakovliev

Publication date: 1989

Published in: Acta Mathematica Hungarica (Search for Journal in Brave)

zbMATH Keywords

coveringpolyhedra in k-dimensional Euclidean space

Mathematics Subject Classification ID

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Related Items (7)

The concept of modeling packing and covering problems using modern computational geometry software ⋮ Configuration space of geometric objects ⋮ The method of artificial space dilation in problems of optimal packing of geometric objects ⋮ Unnamed Item ⋮ Formalizing spatial configuration optimization problems with the use of a special function class ⋮ On the density of the thinnest covering of \(\mathbb{R}^n\) ⋮ Lattice coverage of cuboid with minimum number of hemispheres

Cites Work

• Unnamed Item

This page was built for publication: On a set of problems on covering of a bounded set