Covering and piercing disks with two centers

DOI10.1016/j.comgeo.2012.09.002zbMath1257.68144arXiv1201.1198OpenAlexW1969784951MaRDI QIDQ1931270

Lena Schlipf, Hee-Kap Ahn, Chan-Su Shin, Sang-Sub Kim, Christian Knauer, Antoine Vigneron

Publication date: 25 January 2013

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

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

zbMATH Keywords

coveringdiskspiercingtwo-center

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Approximation algorithms (68W25)

Related Items (8)

Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls ⋮ Improved separated red-blue center clustering ⋮ Largest and smallest area triangles on imprecise points ⋮ Covering convex polygons by two congruent disks ⋮ Intersecting disks using two congruent disks ⋮ Intersecting disks using two congruent disks ⋮ A fully polynomial time approximation scheme for the smallest diameter of imprecise points ⋮ Covering convex polygons by two congruent disks

This page was built for publication: Covering and piercing disks with two centers