Linear-time algorithms for linear programming in R3 and related problems
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
An efficient, exact, and generic quadratic programming solver for geometric optimization
Proceedings of the sixteenth annual symposium on Computational geometry
Randomizing combinatorial algorithms for linear programming when the dimension is moderately high
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Spectral processing of point-sampled geometry
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Collision detection for deforming necklaces
Proceedings of the eighteenth annual symposium on Computational geometry
Solution Methodologies for the Smallest Enclosing Circle Problem
Computational Optimization and Applications
The smallest enclosing ball of balls: combinatorial structure and algorithms
Proceedings of the nineteenth annual symposium on Computational geometry
Approximate minimum enclosing balls in high dimensions using core-sets
Journal of Experimental Algorithmics (JEA)
Efficient Algorithms for the Smallest Enclosing Ball Problem
Computational Optimization and Applications
Efficient collision detection for spherical blend skinning
Proceedings of the 4th international conference on Computer graphics and interactive techniques in Australasia and Southeast Asia
Catching elephants with mice: sparse sampling for monitoring sensor networks
Proceedings of the 5th international conference on Embedded networked sensor systems
Action evaluation for mobile robot global localization in cooperative environments
Robotics and Autonomous Systems
Convex sets as prototypes for classifying patterns
Engineering Applications of Artificial Intelligence
A unified approach for physically-based simulations and haptic rendering
Proceedings of the 2009 ACM SIGGRAPH Symposium on Video Games
A quasi-Monte Carlo method for computing areas of point-sampled surfaces
Computer-Aided Design
Catching elephants with mice: Sparse sampling for monitoring sensor networks
ACM Transactions on Sensor Networks (TOSN)
Measuring the orientability of shapes
CAIP'07 Proceedings of the 12th international conference on Computer analysis of images and patterns
COMSNETS'10 Proceedings of the 2nd international conference on COMmunication systems and NETworks
Surface area estimation of digitized 3D objects using quasi-Monte Carlo methods
Pattern Recognition
Minimal containment under homothetics: a simple cutting plane approach
Computational Optimization and Applications
An effective evaluation measure for clustering on evolving data streams
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
A new algorithm for computing the minimal enclosing sphere in feature space
FSKD'05 Proceedings of the Second international conference on Fuzzy Systems and Knowledge Discovery - Volume Part II
The convex subclass method: combinatorial classifier based on a family of convex sets
MLDM'05 Proceedings of the 4th international conference on Machine Learning and Data Mining in Pattern Recognition
Locating motifs in time-series data
PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
Mining positive associations of urban criminal activities using hierarchical crime hot spots
WISI'06 Proceedings of the 2006 international conference on Intelligence and Security Informatics
A dual algorithm for the minimum covering ball problem in Rn
Operations Research Letters
Technical Section: Efficient construction of the Čech complex
Computers and Graphics
Interactive 3D painting on point-sampled objects
SPBG'04 Proceedings of the First Eurographics conference on Point-Based Graphics
Compression of point-based 3D models by shape-adaptive wavelet coding of multi-height fields
SPBG'04 Proceedings of the First Eurographics conference on Point-Based Graphics
MML logistic regression with translation and rotation invariant priors
AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
CARDIS'12 Proceedings of the 11th international conference on Smart Card Research and Advanced Applications
Mining spatially cohesive itemsets in protein molecular structures
Proceedings of the 12th International Workshop on Data Mining in Bioinformatics
Fast and robust approximation of smallest enclosing balls in arbitrary dimensions
SGP '13 Proceedings of the Eleventh Eurographics/ACMSIGGRAPH Symposium on Geometry Processing
EGSR '13 Proceedings of the Eurographics Symposium on Rendering
| Hi-index | 0.00 |
I describe a C++ program for computing the smallest enclosing ball of a point set in d-dimensional space, using floating-point arithmetic only. The program is very fast for d 驴 20, robust and simple (about 300 lines of code, excluding prototype definitions). Its new features are a pivoting approach resembling the simplex method for linear programming, and a robust update scheme for intermediate solutions. The program with complete documentation following the literate programming paradigm [3] is available on the Web.