Finding the maximal empty disk containing a query point

DOI10.1145/2261250.2261292MaRDI QIDQ2874590zbMATH OpenOpenAlexFDO

Authors Haim Kaplan, Micha Sharir

Publication date 7 August 2014

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

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

zbMATH Keywords

algorithmscomputational geometrydata structuresmaximal empty disk

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Finding the largest empty disk containing a query point
• Finding the largest disk containing a query point in logarithmic time with linear storage (extended abstract)
• Finding the largest disk containing a query point in logarithmic time with linear storage
• Localized geometric query problems
• Largest empty circle centered on a query line

Cited in

(6)

• Localized geometric query problems
• Finding the largest empty disk containing a query point
• Finding the largest disk containing a query point in logarithmic time with linear storage
• Finding the largest disk containing a query point in logarithmic time with linear storage (extended abstract)
• Finding the largest separating rectangle among two point sets
• Largest empty circle centered on a query line

This page was built for publication: Finding the maximal empty disk containing a query point

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