An O(n) algorithm for the linear multiple choice knapsack problem and related problems
Information Processing Letters
Slowing down sorting networks to obtain faster sorting algorithms
Journal of the ACM (JACM)
Finite algorithms for Huber's m estimator
SIAM Journal on Scientific and Statistical Computing
On k-hulls and related problems
SIAM Journal on Computing
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
On a class of O(n2) problems in computational geometry
Computational Geometry: Theory and Applications
Efficient algorithms for maximum regression depth
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
On the partitionability of point sets in space (preliminary report)
SCG '85 Proceedings of the first annual symposium on Computational geometry
An optimal algorithm for hyperplane depth in the plane
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Fast implementation of depth contours using topological sweep
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Computing the Center of Area of a Polygon
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
Algorithms for bivariate medians and a Fermat--Torricelli problem for lines
Computational Geometry: Theory and Applications - Special issue on the thirteenth canadian conference on computational geometry - CCCG'01
An optimal randomized algorithm for maximum Tukey depth
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Deterministic sampling and range counting in geometric data streams
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Deterministic sampling and range counting in geometric data streams
ACM Transactions on Algorithms (TALG)
Algorithms for bivariate zonoid depth
Computational Geometry: Theory and Applications
Output-sensitive algorithms for Tukey depth and related problems
Statistics and Computing
A center transversal theorem for hyperplanes and applications to graph drawing
Proceedings of the twenty-seventh annual symposium on Computational geometry
Ray-shooting depth: computing statistical data depth of point sets in the plane
ESA'11 Proceedings of the 19th European conference on Algorithms
JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
Polyline fitting of planar points under min-sum criteria
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Absolute approximation of Tukey depth: Theory and experiments
Computational Geometry: Theory and Applications
A proof of the Oja depth conjecture in the plane
Computational Geometry: Theory and Applications
| Hi-index | 0.01 |
Many problems can be formulated as the optimization of functions in R2 which are implicitly defined by an arrangement of lines, halfplanes, or points, for example linear programming in the plane. We present an efficient general approach to find the optimum exactly, for a wide range of functions that possess certain useful properties. To illustrate the value of this approach, we give a variety of applications in which we speed up or simplify the best known algorithms. These include algorithms for finding robust geometric medians (such as the Tukey Median), robust regression lines, and ham-sandwich cuts.