A fast deterministic smallest enclosing disk approximation algorithm

DOI10.1016/J.IPL.2004.12.006MaRDI QIDQ835047zbMATH OpenOpenAlexFDO

Authors Frank Nielsen, Richard Nock

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)

Recommendations

• Algorithms - ESA 2003
• Fast algorithms for computing the smallest \(k\)-enclosing circle
• Computing the smallest \(k\)-enclosing circle and related problems
• The discrete 2-center problem
• A simple algorithm for computing the smallest enclosing circle

Cites work

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

Cited in

(8)

• On the smallest enclosing information disk
• scientific article; zbMATH DE number 7278008 (Why is no real title available?)
• Geometric algorithms for minimal enclosing disks in strictly convex normed planes
• Faster algorithms for growing prioritized disks and rectangles
• Computing the smallest k-enclosing circle and related problems
• Algorithms - ESA 2003
• Algorithms - ESA 2003
• A simple algorithm for computing the smallest enclosing circle

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q835047)