Title
Algorithms for Colourful Simplicial Depth and Medians in the Plane.
Abstract
The colourful simplicial depth (CSD) of a point Open image in new window relative to a configuration (P=(P^1, P^2, ldots , P^k)) of n points in k colour classes is exactly the number of closed simplices (triangles) with vertices from 3 different colour classes that contain (x) in their convex hull. We consider the problems of efficiently computing the colourful simplicial depth of a point x, and of finding a point in Open image in new window , called a median, that maximizes colourful simplicial depth.
Year
Venue
DocType
2016
COCOA
Conference
Volume
Citations 
PageRank 
abs/1608.07348
0
0.34
References 
Authors
10
2
Name
Order
Citations
PageRank
Olga Zasenko100.34
Tamon Stephen212116.03