Covering the plane by a sequence of circular disks with a constraint

DOI10.1016/j.comgeo.2020.101680zbMath1454.52016arXiv1810.01255OpenAlexW3104377168MaRDI QIDQ827304

Amitava Bhattacharya, Anupam Mondal

Publication date: 7 January 2021

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1810.01255

zbMATH Keywords

lattice coveringcovering densityplane covering

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Packing, covering and tiling in two-dimensional spaces
• Covering the plane with fat ellipses without non-crossing assumption
• Thin non‐lattice covering with an affine image of a strictly convex body
• Covering the Plane with Convex Sets
• On minimum circumscribed polygons

This page was built for publication: Covering the plane by a sequence of circular disks with a constraint