Optimal Cover of Points by Disks in a Simple Polygon

DOI10.1137/100808459zbMath1234.68443OpenAlexW1987589676MaRDI QIDQ5895543

Haim Kaplan, Gila Morgenstern, Matthew J. Katz, Micha Sharir

Publication date: 15 March 2012

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/100808459

zbMATH Keywords

chordal graphsgeometric coveringminimum disk cover

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Perfect graphs (05C17)

Related Items (max. 100)

Segmentation and restoration of images on surfaces by parametric active contours with topology changes ⋮ Experiments with unit disk cover algorithms for covering massive pointsets

This page was built for publication: Optimal Cover of Points by Disks in a Simple Polygon