Fast and Robust Smallest Enclosing Balls

Fast and Robust Smallest Enclosing Balls

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Gärtner, Bernd
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science
control theory
systems
Current Ball
Exact sciences and technology
Input Point
Recursive Call
Singular Value Decomposition
Support Point
Theoretical computing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.1
ISSN:0302-9743
1611-3349
DOI:10.1007/3-540-48481-7_29