A fast deterministic smallest enclosing disk approximation algorithm

DOI10.1016/J.IPL.2004.12.006zbMath1173.68867OpenAlexW2130284121MaRDI QIDQ835047

Richard Nock, Frank Nielsen

Publication date: 27 August 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.12.006

zbMATH Keywords

computational geometryapproximation algorithmsminimum enclosing ball

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Cites Work

• Linear Programming in Linear Time When the Dimension Is Fixed
• Computational Science and Its Applications – ICCSA 2004

This page was built for publication: A fast deterministic smallest enclosing disk approximation algorithm