Finding the largest disk containing a query point in logarithmic time with linear storage (extended abstract)

DOI10.1145/2582112.2582164zbMATH Open1395.68308OpenAlexW1995293831MaRDI QIDQ4635544FDOQ4635544

Authors: Tal Kaminker, Micha Sharir 

Publication date: 23 April 2018

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

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

Recommendations

• Finding the largest disk containing a query point in logarithmic time with linear storage
• Finding the largest empty disk containing a query point
• Finding the maximal empty disk containing a query point
• Intersection queries in sets of disks
• Intersection queries in sets of disks

zbMATH Keywords

data structurespoint locationlargest empty disk

Mathematics Subject Classification ID

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

Cited In (4)

• Finding the largest disk containing a query point in logarithmic time with linear storage
• Localized geometric query problems
• Finding the maximal empty disk containing a query point
• Finding the largest empty disk containing a query point

This page was built for publication: Finding the largest disk containing a query point in logarithmic time with linear storage (extended abstract)

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