Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference31 articles.
1. Adiprasito, K.A., Brinkmann, P., Padrol, A., Paták, P., Patáková, Z., Sanyal, R.: Colorful Simplicial Depth, Minkowski Sums, and Generalized Gale Transforms. Int. Math. Res. Not. 2019(6), 1894–1919 (2017)
2. Afshani, P., Sheehy, D.R., Stein, Y.: Approximating the simplicial depth in high dimensions. The European Workshop on Computational Geometry (2016)
3. Ajtai, M., Chvátal, V., Newborn, M., Szemerédi, E.: Crossing-free subgraphs. North-Holland Math. Stud. 60, 9–12 (1982)
4. Aloupis, G.: Geometric measures of data depth, Data depth: robust multivariate analysis, computational geometry and applications. DIMACS Ser. Discrete Math. Theoret. Comput. Sci., Amer. Math. Soc., Providence, RI 72, 147–158 (2006)
5. Aloupis, G., Cortés, C., Gómez, F., Soss, M., Toussaint, G.: Lower bounds for computing statistical depth. Comput. Stat. Data Anal. 40 (2), 223–229 (2002)