Lattice coverage of cuboid with minimum number of hemispheres
From MaRDI portal
Publication:2103797
DOI10.1007/s10559-022-00489-4OpenAlexW4306690044MaRDI QIDQ2103797
Publication date: 9 December 2022
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-022-00489-4
Cites Work
- Unnamed Item
- Optimal placement of irradiation sources in the planning of radiotherapy: mathematical models and methods of solving
- On N. Z. Shor's three scientific ideas
- Covering a polygonal region by rectangles
- Theory and software implementations of Shor's \(r\)-algorithms
- Combinatorial configurations in balance layout optimization problems
- Covering a compact polygonal set by identical circles
- Optimal packing and covering in the plane are NP-complete
- Modeling and optimization in space engineering. State of the art and new challenges
- Shor's \(r\)-algorithms: theory and practice
- Placement problems for irregular objects: mathematical modeling, optimization and applications
- On a set of problems on covering of a bounded set
- New exact algorithms for planar maximum covering location by ellipses problems
- Packing ellipses in an optimized convex polygon
- Sparse balanced layout of ellipsoids
- Coverage problems in sensor networks
- Covering a convex 3D polytope by a minimal number of congruent spheres
- Planar Maximum Coverage Location Problem with Partial Coverage and Rectangular Demand and Service Zones
- The Number of Circles Covering a Set
This page was built for publication: Lattice coverage of cuboid with minimum number of hemispheres
