The Complexity of Hyperplane Depth in the Plane

Discrete and Computational Geometry

Volumn 30, Issue 2, 2003, Pages 299-309

  Langerman, Stefan ^a   Steiger, William ^b  

^a MCGILL UNIVERSITY   (Canada)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0042418564     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-003-0011-x     Document Type: Conference Paper

References (15)

1. N. Amenta, M. Bern, D. Eppstein, and S.-H. Teng. Regression Depth and Center Points. Discrete Comput. Geom. 23(3) (2000), 305-323.
2. B. Chazelle. New Techniques for Computing Order Statistics in the Euclidean Plane. Proc. First ACM Symposium on Computational Geometry, pp. 125-134, 1985.
3. R. Cole. Slowing Down Sorting Networks to Obtain Faster Sorting Algorithms. J. Assoc. Comput. Mach. 34(1) (1987), 200-208.
4. R. Cole, J. Salowe, W. Steiger, and E. Szemerédi. An Optimal Time Algorithm for Slope Selection, SIAM J. Comput. 18 (1989), 792-810.
5. R. Cole, M. Sharir, and K. Yap. On k-Hulls and Related Problems. SIAM J. Comput. 16(1) (1987), 61-77.
6. H. Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag, Berlin, 1987.
7. J. Gill, W. Steiger, and A. Wigderson. Geometric Medians. Discrete Math. 108 (1992), 37-51.
8. S. Jadhav and A. Mukhopadhyay. Computing a Centerpoint of a Finite Planar Set of Points in Linear Time. Discrete Comput. Geom. 12 (1994), 291-312.
9. M. van Kreveld, J. Mitchell, P. Rousseeuw, M. Sharir, J. Snoeyink, and B. Speckmann. Efficient Algorithms for Maximum Regression Depth. Discrete Comput. Geom. (to appear).
10. S. Langerman and W. Steiger. Computing a Maximal Depth Point in the Plane. Proc. Japan Conference on Discrete and Computational Geometry, Tokyo, 2000.
11. J. Matoušek. Computing the Center of a Planar Point Set. In Discrete and Computational Geometry: Papers from the DIMACS Special Year (J. E. Goodman, R. Pollack, and W. Steiger, eds.), pp. 221-230. American Mathematical Society, Providence, RI, 1992.
12. P. Rousseeuw and M. Hubert. Depth in an Arangement of Hyperplanes. Discrete Comput. Geom. 22(2) (1999), 167-176.
13. P. Rousseeuw and M. Hubert. Regression Depth. J. Amer. Statist. Assoc. 94 (1999), 388-402.
14. W. Steiger and R. Wenger. Hyperplane Depth and Nested Simplices (extended abstract). Proc. 10th Canadian Conference on Computational Geometry, McGill University, Montreal, 1998.
15. J. Tukey. Mathematics and the Picturing of Data. Proc. International Conference of Mathematicians, Vancouver, 1971.