swMATH5179MaRDI QIDQ17319FDOQ17319
Author name not available (Why is that?)
Official website: http://www.inf.ethz.ch/personal/gaertner/miniball.html
Cited In (64)
- Approximate minimum enclosing balls in high dimensions using core-sets
- Minimal containment under homothetics: a simple cutting plane approach
- Practical methods for shape fitting and kinetic data structures using coresets
- Using machine learning for model benchmarking and forecasting of depletion-induced seismicity in the Groningen gas field
- Algorithms for determining relative position between spheroids and hyperboloids with one sheet
- The log-exponential smoothing technique and Nesterov's accelerated gradient method for generalized Sylvester problems
- An efficient algorithm for the smallest enclosing ball problem in high dimensions
- Covering convex polygons by two congruent disks
- Covering convex polygons by two congruent disks
- Counting unique-sink orientations
- Image‐Based Surface Compression
- An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions
- Chebyshev centres, Jung constants, and their applications
- Čech-Delaunay gradient flow and homology inference for self-maps
- Surface area estimation of digitized 3D objects using quasi-Monte Carlo methods
- A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\)
- Integration of expert knowledge into radial basis function surrogate models
- On a minimum enclosing ball of a collection of linear subspaces
- Efficient algorithms for the smallest enclosing ball problem
- giotto-ph
- Algorithms - ESA 2003
- A dual algorithm for the minimum covering ball problem in \(\mathbb R^n\)
- Combinatorial generalizations of Jung's theorem
- On the string consensus problem and the Manhattan sequence consensus problem
- Unique sink orientations of grids
- A dual simplex-type algorithm for the smallest enclosing ball of balls
- Fast estimation of the shear stress amplitude for fatigue life analysis of metals
- Edgebreaker
- Algorithm 853
- fastcluster
- Metro
- BetaSCP
- FRSDE
- Hull
- AS 307
- Random sampling with removal
- Collision detection for deforming necklaces
- binvox
- RASP
- QPRefinement
- A simple sampling lemma: Analysis and applications in geometric optimization
- A quasi-Monte Carlo method for computing areas of point-sampled surfaces
- Sparips.jl
- ABCDepth
- PMP
- QTFier
- orderkdelaunay
- rhomboidtiling
- SAGA: sparse and geometry-aware non-negative matrix factorization through non-linear local embedding
- A dual algorithm for the minimum covering weighted ball problem in \({\mathbb{R}^n}\)
- Solving quadratic programs to high precision using scaled iterative refinement
- Title not available (Why is that?)
- UnitDiskCoverAlgorithms
- A new approach for the computation of halfspace depth in high dimensions
- Two Algorithms for the Minimum Enclosing Ball Problem
- Penalty-based aggregation of multidimensional data
- On the elimination of inessential points in the smallest enclosing ball problem
- Protein structure optimization by side-chain positioning via beta-complex
- Approximating persistent homology in Euclidean space through collapses
- Title not available (Why is that?)
- APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING
- Uncertainty quantification of the 4th kind; optimal posterior accuracy-uncertainty tradeoff with the minimum enclosing ball
- An efficient cutting plane algorithm for the smallest enclosing circle problem
- Solving \(k\)-center problems involving sets based on optimization techniques
This page was built for software: Miniball
