An algorithm for maximising covered area
From MaRDI portal
Publication:3543082
Recommendations
- Efficient algorithm for placing a given number of base stations to cover a convex region
- scientific article; zbMATH DE number 1522573
- Distributed Computing – IWDC 2005
- Range assignment of base-stations maximizing coverage area without interference
- Optimization of multiple covering of a bounded set with circles
Cites work
- Asymptotically dense spherical codes .II. laminated spherical codes
- Asymptotically dense spherical codes. I. Wrapped spherical codes
- Dense packings of congruent circles in a circle
- Gaussian source coding with spherical codes
- Maximum minimal distance partitioning of the Z/sup 2/ lattice
- Monte Carlo study of the sphere packing problem
- On the covering radius of Z/sub 4/-codes and their lattices
- Optimization and the Geometry of Numbers: Packing and Covering
- The Global Optimization of Incoherent Phase Signals
Cited in
(6)- On the overlap area of a disk and a piecewise circular domain
- Range assignment of base-stations maximizing coverage area without interference
- Heterogeneous locational optimisation using a generalised Voronoi partition
- Distributed Computing – IWDC 2005
- An efficient method for maximal area coverage in the context of a hierarchical controller for multiple unmanned aerial vehicles
- Efficient algorithm for placing a given number of base stations to cover a convex region
This page was built for publication: An algorithm for maximising covered area
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3543082)
