Constructing arrangements of lines and hyperplanes with applications
SIAM Journal on Computing
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Information and Computation
Algorithms for vertical and orthogonal L1 linear approximation of points
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
The nature of statistical learning theory
The nature of statistical learning theory
Efficient approximation and optimization algorithms for computational metrology
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Linear Programming in Linear Time When the Dimension Is Fixed
Journal of the ACM (JACM)
Algorithms for facility location problems with outliers
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Separating objects in the plane by wedges and strips
Discrete Applied Mathematics - Special issue 14th European workshop on computational geometry CG'98 Selected papers
Penetration depth of two convex polytopes in 3D
Nordic Journal of Computing
Low-Dimensional Linear Programming with Violations
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
High-dimensional shape fitting in linear time
Proceedings of the nineteenth annual symposium on Computational geometry
SIAM Journal on Computing
Faster core-set constructions and data stream algorithms in fixed dimensions
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Approximating extent measures of points
Journal of the ACM (JACM)
On approximating the depth and related problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient algorithms for bichromatic separability
ACM Transactions on Algorithms (TALG)
Red-blue separability problems in 3D
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
How to get close to the median shape
Proceedings of the twenty-second annual symposium on Computational geometry
How to get close to the median shape
Computational Geometry: Theory and Applications - Special issue on the 21st European workshop on computational geometry (EWCG 2005)
| Hi-index | 0.00 |
We develop exact and approximate algorithms for computing optimal separators and measuring the extent to which two point sets in d-dimensional space are separated, with respect to different classes of separators and various extent measures. This class of geometric problems generalizes two widely studied problem families, namely separability and the computation of statistical estimators.