Computational geometry: an introduction
Computational geometry: an introduction
On k-hulls and related problems
SIAM Journal on Computing
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
On a triangle counting problem
Information Processing Letters
Efficient algorithms for maximum regression depth
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
An improved bound for k-sets in three dimensions
Proceedings of the sixteenth annual symposium on Computational geometry
Fast implementation of depth contours using topological sweep
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Improved bounds on planar k-sets and k-levels
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
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
Algorithms and data structures in computational geometry
Algorithms and data structures in computational geometry
An optimal randomized algorithm for maximum Tukey depth
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On the convex layers of a planar set
IEEE Transactions on Information Theory
An optimal randomized algorithm for d-variate zonoid depth
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
Zonoid depth is a definition of data depth proposed by Dyckerhoff et al. [R. Dyckerhoff, G. Koshevoy, K. Mosler, Zonoid data depth: Theory and computation, in: A. Prat (Ed.), COMPSTAT 1996-Proceedings in Computational Statistics, Physica-Verlag, Heidelberg, August 1996, pp. 235-240]. Efficient algorithms for solving several computational problems related to zonoid depth in 2-dimensional (bivariate) data sets are studied. These include algorithms for computing a zonoid depth map, computing a zonoid depth contour, and computing the zonoid depth of a point.