Algorithms - ESA 2003

DOI10.1007/B13632zbMath1266.68190OpenAlexW1827234103WikidataQ60299159 ScholiaQ60299159MaRDI QIDQ5897282

Kaspar Fischer, Bernd 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)

Related Items (18)

An efficient algorithm for the smallest enclosing ball problem in high dimensions ⋮ A dual algorithm for the minimum covering ball problem in \(\mathbb R^n\) ⋮ A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\) ⋮ A hybrid algorithm for the minimum bounding sphere problem ⋮ The minimum covering Euclidean ball of a set of Euclidean balls in \(\mathbb{R}^n\) ⋮ A dual algorithm for the minimum covering weighted ball problem in \({\mathbb{R}^n}\) ⋮ Unnamed Item ⋮ On the string consensus problem and the Manhattan sequence consensus problem ⋮ Packing of concave polyhedra with continuous rotations using nonlinear optimisation ⋮ Minimal containment under homothetics: a simple cutting plane approach ⋮ Finding the homology of submanifolds with high confidence from random samples ⋮ Reconstructing functions from random samples ⋮ A dual simplex-type algorithm for the smallest enclosing ball of balls ⋮ Approximate minimum enclosing balls in high dimensions using core-sets ⋮ Fast estimation of the shear stress amplitude for fatigue life analysis of metals ⋮ Distance between the fractional Brownian motion and the space of adapted Gaussian martingales ⋮ Measuring diversity from dissimilarities with Rao's quadratic entropy: are any dissimilarities suitable? ⋮ The nearest polynomial to multiple given polynomials with a given zero in the real case

Uses Software

• Miniball

This page was built for publication: Algorithms - ESA 2003