On Algorithms for Simplicial Depth (1998)
by
Andrew Cheng Airport
,
Andrew Y. Cheng
,
Ming Ouyang
| Venue: | Proceedings of the 13th Canadian Conference on Computational Geometry, 2001 |
BibTeX
@INPROCEEDINGS{Airport98onalgorithms,
author = {Andrew Cheng Airport and Andrew Y. Cheng and Ming Ouyang},
title = {On Algorithms for Simplicial Depth},
booktitle = {Proceedings of the 13th Canadian Conference on Computational Geometry, 2001},
year = {1998},
pages = {53--56}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Simplicial depth measures how deep a point is among a set of points. Ecient algorithms to compute it are important to its usefulness in applications, such as multivariate analysis in environmental health and bioinformatics. When the points are in E d , a straightforward method takes O(n d+1 ) time. We discuss an algorithm that takes O(n 2 ) time when the points are in E 3 , and we generalize it to E 4 with a time complexity of O(n 4 ). 1
Citations
| 643 | Algorithms in combinatorial geometry - Edelsbrunner - 1987 |
| 419 | Computational geometry - Preparata, Shamos - 1985 |
| 101 | Constructing arrangements of lines and hyperplanes with applications - Edelsbrunner, O’Rourke, et al. - 1986 |
| 54 | On a notion of data depth based on random simplices - Liu - 1990 |
| 36 | Regression depth - Rousseeuw, Hubert - 1999 |
| 11 | On a triangle counting problem - Khuller, Mitchell - 1989 |
| 1 | Triangles Covering the Centre of an n-set", Geometriae Dedicata 17 - Boros, Furedi - 1984 |
| 1 | Statistical Process Control for Complex Settings and the Establishment of Threshold Systems - Cheng - 1999 |
| 1 | Geometric Medians", Discrete Mathematics 108 - Gil, Steiger, et al. - 1992 |
| 1 | Bivariate Location Depth", Applied Statistics 45 - Rousseeuw, Ruts - 1996 |
| 1 | Tukey, \Mathematics and the Picturing of Data - W |
