Colourful simplicial depth

Discrete and Computational Geometry

Volumn 35, Issue 4, 2006, Pages 597-615

  Deza, Antoine ^a   Huang, Sui ^a   Stephen, Tamon ^b   Terlaky, Tamás ^a  

^a MCMASTER UNIVERSITY   (Canada)

^b SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33646470735     PISSN: 01795376     EISSN: 14320444     Source Type: Journal    
DOI: 10.1007/s00454-006-1233-3     Document Type: Article

References (18)

1. N. Alon, I. Bárány, Z. Füredi, and D. J. Kleitman, Point selections and weak ε-nets for convex hulls, Combin. Probab. Comput. 1(3) (1992), 189-200.
2. G. Aloupis, Geometric measures of data depth, submitted, 2004.
3. M. J. C. Baker, Covering with triangles III, James Cook Mathematical Notes 17 (1978), 11.
4. I. Bárány. A generalization of Carathéodory's theorem. Discrete Math. 40(2-3) (1982), 141-152.
5. I. Bárány and J. Matoušek, Quadratically many colorful simplices, submitted, 2005.
6. I. Bárány and S. Onn, Carathéodory's theorem, colourful and applicable, in Intuitive Geometry (Budapest, 1995). Bolyai Soc. Math. Stud., vol. 6, János Bolyai Math. Soc., Budapest, 1997, pp. 11-21.
7. I. Bárány and S. Onn, Colourful linear programming and its relatives, Math. Oper. Res. 22(3) (1997). 550-567.
8. E. Boros and Z. Füredi, The number of triangles covering the center of an n-set, Geom. Dedicata 17(1) (1984), 69-77.
9. A. Y. Cheng and M. Ouyang, On algorithms for simplicial depth, Proceedings of the 13th Canadian Conference, on Computational Geometry, 2001, pp. 53-56.
10. K. Fukuda and V. Rosta, Data depth and maximal feasible subsystems, in Graph Theory and Combinatorial Optimization (D. Avis, A. Hertz, and O. Marcotte, eds.), Springer-Verlag, New York, 2005, pp. 37-67.
11. J. Gil, W. Steiger, and A. Wigderson, Geometric medians, Discrete Math. 108(1-3) (1992), 37-51.
12. F. Kárteszi, Extremalaufgaben über endliche Punktsysteme, Publ. Math. Debrecen 4 (1955), 16-27.
13. R. Y. Liu, On a notion of data depth based on random simplices, Ann. Statist. 18(1) (1990), 405-414.
14. J. R. Munkres, Elements of Algebraic Topology, Addison-Wesley, Menlo Park, CA, 1984.
15. T. Stephen and H. Thomas, A quadratic lower bound for colourful simplicial depth, submitted, 2005.
16. U. Wagner, On k-sets and applications, Ph.D. thesis, Department of Mathematics, ETH Zürich, 2003.
17. U. Wagner and E. Welzl, A continuous analogue of the upper bound theorem, Discrete Comput. Geom. 26(2) (2001), 205-219.
18. R. T. Živaljevič and S. T. Vrećica, The colored Tverberg's problem and complexes of injective functions. J. Combin. Theory Ser. A 61(2) (1992), 309-318.