Finding the largest empty disk containing a query point

DOI10.1142/S021819591360008XMaRDI QIDQ2875646zbMATH OpenOpenAlexFDO

Authors Haim Kaplan, Micha Sharir

Publication date 11 August 2014

Published in International Journal of Computational Geometry \& Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s021819591360008x

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Finding the maximal 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)
• Largest empty circle centered on a query line
• Localized geometric query problems

Cites work

• A fast planar partition algorithm. I
• A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
• COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS
• Circular separability of polygons
• Computing circular separability
• Fast detection of polyhedral intersection
• Localized geometric query problems
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles

Cited in

(5)

• Largest empty circle centered on a query line
• 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 disk containing a query point in logarithmic time with linear storage (extended abstract)

This page was built for publication: Finding the largest 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 Q2875646)