Algorithms for minimum volume enclosing simplex in R3
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Projective clustering in high dimensions using core-sets
Proceedings of the eighteenth annual symposium on Computational geometry
On computing the diameter of a point set in high dimensional Euclidean space
Theoretical Computer Science
High-dimensional shape fitting in linear time
Proceedings of the nineteenth annual symposium on Computational geometry
Polynomial-time approximation of largest simplices in V-polytopes
Discrete Applied Mathematics
Inner and outer approximations of polytopes using boxes
Computational Geometry: Theory and Applications
Efficient subspace approximation algorithms
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Generalized semi-infinite programming: A tutorial
Journal of Computational and Applied Mathematics
New Algorithms for k-Center and Extensions
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
A convex analysis-based minimum-volume enclosing simplex algorithm for hyperspectral unmixing
IEEE Transactions on Signal Processing
Minimal containment under homothetics: a simple cutting plane approach
Computational Optimization and Applications
No dimension independent core-sets for containment under homothetics
Proceedings of the twenty-seventh annual symposium on Computational geometry
| Hi-index | 0.00 |