Fast computation of smallest enclosing circle with center on a query line segment
From MaRDI portal
Publication:975487
DOI10.1016/J.IPL.2008.07.002zbMATH Open1191.68765OpenAlexW2145360688MaRDI QIDQ975487FDOQ975487
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
Recommendations
- Constrained minimum enclosing circle with center on a query line segment
- Constrained Minimum Enclosing Circle with Center on a Query Line Segment
- Optimal algorithms for constrained 1-center problems
- Largest empty circle centered on a query line
- Fast algorithms for computing the smallest \(k\)-enclosing circle
Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Optimal Point Location in a Monotone Subdivision
- Constrained Minimum Enclosing Circle with Center on a Query Line Segment
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some constrained minimax and maximin location problems
Cited In (6)
- Some variations on constrained minimum enclosing circle problem
- Largest empty circle centered on a query line
- An Approximation Algorithm for the Smallest Color-Spanning Circle Problem
- THE ALIGNED K-CENTER PROBLEM
- The approximation algorithms for a class of multiple-choice problem
- Constrained Minimum Enclosing Circle with Center on a Query Line Segment
This page was built for publication: Fast computation of smallest enclosing circle with center on a query line segment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975487)
