FINDING THE LARGEST EMPTY DISK CONTAINING A QUERY POINT

DOI10.1142/S021819591360008XzbMath1297.68242OpenAlexW2027913039MaRDI QIDQ2875646

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)

Cites Work

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

This page was built for publication: FINDING THE LARGEST EMPTY DISK CONTAINING A QUERY POINT