Lattice coverage of cuboid with minimum number of hemispheres
From MaRDI portal
(Redirected from Publication:2103797)
Recommendations
- Determining placement of systems demarcated by hemispheres
- On the number and arrangement of sensors for the multiple covering of bounded plane domains
- Optimal coverage of convex regions
- Global optimization approaches to sensor placement: model versions and illustrative results
- Covering a convex 3D polytope by a minimal number of congruent spheres
Cites work
- scientific article; zbMATH DE number 3083197 (Why is no real title available?)
- Combinatorial configurations in balance layout optimization problems
- Coverage problems in sensor networks: a survey
- Covering a compact polygonal set by identical circles
- Covering a convex 3D polytope by a minimal number of congruent spheres
- Covering a polygonal region by rectangles
- Modeling and optimization in space engineering. State of the art and new challenges
- New exact algorithms for planar maximum covering location by ellipses problems
- On N. Z. Shor's three scientific ideas
- On a set of problems on covering of a bounded set
- Optimal packing and covering in the plane are NP-complete
- Optimal placement of irradiation sources in the planning of radiotherapy: mathematical models and methods of solving
- Packing ellipses in an optimized convex polygon
- Placement problems for irregular objects: mathematical modeling, optimization and applications
- Planar maximum coverage location problem with partial coverage and rectangular demand and service zones
- Shor's r-algorithms: theory and practice
- Sparse balanced layout of ellipsoids
- The Number of Circles Covering a Set
- Theory and software implementations of Shor's r-algorithms
Cited in
(4)
This page was built for publication: Lattice coverage of cuboid with minimum number of hemispheres
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2103797)
