Algorithms for Colourful Simplicial Depth and Medians in the Plane

DOI10.1007/978-3-319-48749-6_28zbMath1483.68472arXiv1608.07348OpenAlexW2518021572MaRDI QIDQ2958332

Olga Zasenko, Tamon Stephen

Publication date: 1 February 2017

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1608.07348

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Computing colourful simplicial depth and Median in \(\mathbb{R}_2\)

Uses Software

• AS 307
• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• The colourful simplicial depth conjecture
• On Gromov's method of selecting heavily covered points
• Improving the crossing lemma by finding more crossings in sparse graphs
• On a triangle counting problem
• On a notion of data depth based on random simplices
• The colourful feasibility problem
• Multiway in-place merging
• The power of geometric duality revisited
• Topologically sweeping an arrangement
• Geometric medians
• Algorithms for bivariate medians and a Fermat-Torricelli problem for lines.
• General notions of statistical depth function.
• Colourful simplicial depth
• Colourful Linear Programming and its Relatives
• Algorithm AS 307: Bivariate Location Depth