The Number of Circles Covering a Set
From MaRDI portal
Cited in
(16)- Combinatorial geometry
- Unconstrained polarization (Chebyshev) problems: basic properties and Riesz kernel asymptotics
- Lattice coverage of cuboid with minimum number of hemispheres
- Covering and packing with spheres by diagonal distortion in R^n
- Covering space with equal spheres
- A sensor deployment strategy in bus-based hybrid ad-hoc networks
- Probabilistic Analysis of Geometric Location Problems
- Optimal sensor networks for area monitoring using rotating and beam sensors
- On the density of lattice covering for n=17
- Die wabenzelle der honigbiene
- Multi-level regular coverings of the plane by disks
- Covering a plane with ellipses
- Efficient band monitoring with sensors outer positioning
- Randomized greedy algorithms for neural network optimization in solving partial differential equations
- Energy-efficient regular strip covering with fixed-size identical sectors
- Lattice packing and covering of convex bodies
This page was built for publication: The Number of Circles Covering a Set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5773681)
