Skip to main content
Journal Article

Approximating smallest enclosing balls

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 3045 147-157
DOI: 10.1007/978-3-540-24767-8_16
22Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present two novel tailored algorithms for computing arbitrary fine approximations of the smallest enclosing ball of balls. The deterministic heuristics are based on solving relaxed decision problems using a primal-dual method. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Nielsen, F., & Nock, R. (2004). Approximating smallest enclosing balls. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3045, 147–157. https://doi.org/10.1007/978-3-540-24767-8_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free