Fast computation of smallest enclosing circle with center on a query line segment
From MaRDI portal
Publication:975487
DOI10.1016/j.ipl.2008.07.002zbMath1191.68765OpenAlexW2145360688MaRDI QIDQ975487
Sasanka Roy, Arindam Karmakar, Sandip Das
Publication date: 9 June 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2008.07.002
Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
The approximation algorithms for a class of multiple-choice problem ⋮ An Approximation Algorithm for the Smallest Color-Spanning Circle Problem ⋮ Some variations on constrained minimum enclosing circle problem ⋮ THE ALIGNED K-CENTER PROBLEM
Cites Work