Best partial covering of a convex domain by congruent circles of a given total area

DOI10.1007/S00454-007-1337-4zbMATH Open1140.52011OpenAlexW1987569912MaRDI QIDQ2464360

Yanyan Li

Publication date: 19 December 2007

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-007-1337-4

zbMATH Keywords

coveringdensity

Mathematics Subject Classification ID

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

Related Items (4)

Unavoidable crossings in a thinnest plane covering with congruent convex disks ⋮ Covering the plane with fat ellipses without non-crossing assumption ⋮ A convex cover for closed unit curves has area at least 0.1 ⋮ Optimal covering of plane domains by circles via hyperbolic smoothing

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Optimal circle covering problems and their applications 👍 👎
• On coverings of spheres by convex sets 👍 👎
• Optimal covering of plane domains by circles via hyperbolic smoothing 👍 👎
• Optimal coverage of convex regions 👍 👎
• Covering of radial segments for domains bounded by \(k\)-circles 👍 👎
• Finite packing and covering by congruent convex domains 👍 👎
• Recouvrement optimal du cercle par les multiples d'un intervalle 👍 👎
• On coverings with convex domains 👍 👎

This page was built for publication: Best partial covering of a convex domain by congruent circles of a given total area

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2464360)