Quote: algorithm for smallest enclosing ball in d-space; floating-point arthimetic; fast, robust, simple

Quotation Skeleton

I describe a C++ program for computing the … is very fast for d<=20, robust and simple … the simplex method for linear programming, and a … [p. 327] The basis of our method is Emo … [the smallest enclosing ball] if it exists [LNCS 555, 1991]. … The practical efficiency comes from the fact that … are moved to the front and will therefore … [p. 328] The effect is that the ball maintained by the algorithm … Large-scale problems are handled by a pivoting variant … has largest distance from the current ball. … [p. 336] the move-to-front method is faster than the … more than ten times faster.   Google-1   Google-2

Copyright clearance needed for quotation.

Related Topics

Topic: computational geometry (20 items)