Covering many points with a small-area box
From MaRDI portal
Publication:5233323
DOI10.20382/jocg.v10i1a8zbMath1418.68225arXiv1612.02149OpenAlexW4301134859MaRDI QIDQ5233323
Christian Knauer, David Eppstein, Sergio Cabello, Mark T. de Berg, Otfried Schwarzkopf
Publication date: 10 September 2019
Full work available at URL: https://arxiv.org/abs/1612.02149
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (4)
Unnamed Item ⋮ Smallest \(k\)-enclosing rectangle revisited ⋮ Smallest k-enclosing rectangle revisited ⋮ Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points
This page was built for publication: Covering many points with a small-area box
