Finding the largest empty disk containing a query point
From MaRDI portal
Publication:2875646
DOI10.1142/S021819591360008XzbMATH Open1297.68242OpenAlexW2027913039MaRDI QIDQ2875646FDOQ2875646
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
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
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
- Computing circular separability
- A fast planar partition algorithm. I
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
- COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS
- Fast detection of polyhedral intersection
- Localized geometric query problems
- Circular separability of polygons
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)
