Near-linear approximation algorithms for geometric hitting sets

DOI10.1145/1542362.1542368zbMath1379.68342OpenAlexW2109163646MaRDI QIDQ5370696

Micha Shair, Esther Ezra, Pankaj K. Agarwal

Publication date: 20 October 2017

Published in: Proceedings of the twenty-fifth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1542362.1542368

zbMATH Keywords

randomized algorithmshitting setsgeometric range spacesshallow cuttingsunion of simply-shaped regions

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Randomized algorithms (68W20)

This page was built for publication: Near-linear approximation algorithms for geometric hitting sets