Efficient Speed-Up of the Smallest Enclosing Circle Algorithm
From MaRDI portal
Publication:5040739
DOI10.15388/22-INFOR477OpenAlexW4226341581WikidataQ130248711 ScholiaQ130248711MaRDI QIDQ5040739
Publication date: 18 October 2022
Published in: Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.15388/22-infor477
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- A simple algorithm for computing the smallest enclosing circle
- Computing the smallest \(k\)-enclosing circle and related problems
- Fast algorithms for computing the smallest \(k\)-enclosing circle
- Solution methodologies for the smallest enclosing circle problem
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Computing the smallest k-enclosing circle and related problems
- Algorithms - ESA 2003
This page was built for publication: Efficient Speed-Up of the Smallest Enclosing Circle Algorithm