Algorithms - ESA 2003

DOI10.1007/B13632MaRDI QIDQ5897282zbMATH OpenOpenAlexFDO

Authors Kaspar Fischer, B. Gärtner, Martin Kuetz

Publication date 3 March 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b13632

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 1985309
• An efficient algorithm for the smallest enclosing ball problem in high dimensions
• Approximate minimum enclosing balls in high dimensions using core-sets
• Streaming and dynamic algorithms for minimum enclosing balls in high dimensions
• Streaming and dynamic algorithms for minimum enclosing balls in high dimensions
• Efficient algorithms for the smallest enclosing ball problem
• A fast deterministic smallest enclosing disk approximation algorithm
• An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions
• Fast algorithms for computing the smallest \(k\)-enclosing circle
• Algorithms - ESA 2003

Cited in

(29)

• A hybrid algorithm for the minimum bounding sphere problem
• Fast Learning of Generalized Minimum Enclosing Ball for Large Datasets
• Reconstructing functions from random samples
• A dual simplex-type algorithm for the smallest enclosing ball of balls
• Finding the homology of submanifolds with high confidence from random samples
• An efficient algorithm for the smallest enclosing ball problem in high dimensions
• Probabilistic smallest enclosing ball in high dimensions via subgradient sampling
• Approximate minimum enclosing balls in high dimensions using core-sets
• A dual algorithm for the minimum covering ball problem in \(\mathbb R^n\)
• Distance between the fractional Brownian motion and the space of adapted Gaussian martingales
• Algorithms for a Minimum Volume Enclosing Simplex in Three Dimensions
• A dual algorithm for the minimum covering weighted ball problem in \({\mathbb{R}^n}\)
• Fast estimation of the shear stress amplitude for fatigue life analysis of metals
• scientific article; zbMATH DE number 7651177 (Why is no real title available?)
• APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING
• The smallest enclosing ball of balls: combinatorial structure and algorithms
• A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\)
• Packing of concave polyhedra with continuous rotations using nonlinear optimisation
• THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS
• The nearest polynomial to multiple given polynomials with a given zero in the real case
• Algorithms - ESA 2003
• Measuring diversity from dissimilarities with Rao's quadratic entropy: are any dissimilarities suitable?
• Optimization algorithms for faster computational geometry
• Identification and Elimination of Interior Points for the Minimum Enclosing Ball Problem
• The minimum covering Euclidean ball of a set of Euclidean balls in \(\mathbb{R}^n\)
• On the string consensus problem and the Manhattan sequence consensus problem
• Minimal containment under homothetics: a simple cutting plane approach
• On approximating the Riemannian 1-center
• Efficient algorithms for the smallest enclosing ball problem

Describes a project that uses

Uses Software

• Miniball

This page was built for publication: Algorithms - ESA 2003

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897282)