Algorithms for bivariate medians and a Fermat-Torricelli problem for lines

Computational Geometry: Theory and Applications

Volumn 26, Issue 1, 2003, Pages 69-79

  Aloupis, Greg ^a   Langerman, Stefan ^a   Soss, Michael ^b   Toussaint, Godfried ^a  

^a MCGILL UNIVERSITY   (Canada)

^b Chemical Computing Group   (Canada)

Author keywords

Algorithms; Computational geometry; Estimators of location; Fermat Torricelli problem; Geometric medians; Oja depth; Simplicial depth

Indexed keywords

EID: 84867945612     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(02)00173-6     Document Type: Conference Paper

References (23)

1. G. Aloupis, On computing geometric estimators of location, M. Sc. Thesis, McGill University, 2001
2. G. Aloupis, C. Cortes, F. Gomez, M. Soss, and G. Toussaint Lower bounds for computing statistical depth Computational Statistics and Data Analysis 40 2002 223 229
3. G. Aloupis, M. Soss, G. Toussaint, On the computation of the bivariate median and a Fermat-Torricelli problem, Technical Report SOCS-01.2, School of Computer Science, McGill University, February 2001
4. R. Barbara The Fermat-Torricelli points of n lines Math. Gazette 84 2000 24 29
5. L. Dalla A note on the Fermat-Torricelli point of a d-simplex J. Geom. 70 2001 38 43
6. P. de Fermat, Abhandlungen über maxima und minima, in: M. Miller (Ed.), Ostwalds Klassiker der exacten Wissenschaften, p. 238
7. H. Edelsbrunner Algorithms in Combinatorial Geometry 1987 Springer-Verlag Berlin
8. H. Edelsbrunner, and L. Guibas Topologically sweeping an arrangement J. Comput. System Sci. 38 1989 165 194
9. J. Gill, W. Steiger, and A. Wigderson Geometric medians Discrete Math. 108 1992 37 51
10. C. Groß, and T. Strempel On generalizations of conics and on a generalization of the Fermat-Torricelli problem Amer. Math. Monthly 105 8 1998 732 743
11. S. Khuller, and J. Mitchell On a triangle counting problem Inform. Process. Lett. 33 1989 319 321
12. Y. Kupitz, and H. Martini Geometric aspects of the generalized Fermat-Torricelli problem Intuitive Geometry, Bolyai Society Math. Studies 6 1997 55 127
13. S. Langerman, and W. Steiger Computing a maximal depth point in the plane Japan Conference on Discrete and Computational Geometry 2000
14. S. Langerman, W. Steiger, Optimization in arrangements, Technical Report SOCS-02.7, School of Computer Science, McGill University, 2002. To appear at the 20th International Symposium on Theoretical Aspects of Computer Science (STACS 2003)
15. D. Lee, and Y. Ching The power of geometric duality revisited Inform. Process. Lett. 21 1985 117 122
16. R. Liu On a notion of data depth based upon random simplices Ann. Statist. 18 1990 405 414
17. R. Liu, J. Parelius, and K. Singh Multivariate analysis of data depth: descriptive statistics, graphics and inference Ann. Statist. 27 3 1999 783 858
18. G. Loria, and G. Vassura Opere di Evangelista Torricelli, Vol. 1 1919 Faenza
19. A. Niinimaa, H. Oja, and J. Nyblom Algorithm AS 277: The Oja bivariate median Appl. Statist. 41 1992 611 617
20. A. Niinimaa, H. Oja, and M. Tableman The finite-sample breakdown point of the Oja bivariate median and of the corresponding half-samples version Statist. Probab. Lett. 10 1990 325 328
21. H. Oja Descriptive statistics for multivariate distributions Statist. Probab. Lett. 1 1983 327 332
22. P. Rousseeuw, and I. Ruts Bivariate location depth Appl. Statist. 45 1996 516 526
23. C. Small A survey of multidimensional medians Internat. Statist. Rev. 58 1990 263 277