Graphics gems
Linear Programming in Linear Time When the Dimension Is Fixed
Journal of the ACM (JACM)
Fast and robust approximation of smallest enclosing balls in arbitrary dimensions
SGP '13 Proceedings of the Eleventh Eurographics/ACMSIGGRAPH Symposium on Geometry Processing
Hi-index | 0.89 |
We describe a simple and fast O(nlog"21@?)-time algorithm for finding a (1+@?)-approximation of the smallest enclosing disk of a planar set of n points or disks. Experimental results of a readily available implementation are presented.