Computing least median of squares regression lines and guided topological sweep

Journal of the American Statistical Association

Volumn 85, Issue 409, 1990, Pages 115-119

  Edelsbrunner, Herbert ^a   Souvaine, Diane L ^b  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

Computational geometry; Duality; Line arrangements; Robust statistics

Indexed keywords

EID: 0006664807     PISSN: 01621459     EISSN: 1537274X     Source Type: Journal    
DOI: 10.1080/01621459.1990.10475313     Document Type: Article

References (14)

1. Edelsbrunner, H. (1987), Algorithms in Combinatorial Geometry, Heidelberg: Springer-Verlag.
2. Edelsbrunner, H., and Guibas, L. J. (1989), “Topologically Sweeping an Arrangement,” Journal of Computer and System Sciences, 38, 165– 194.
3. Edelsbrunner, H., Guibas, L. J., and Sharir, M. (1988), “The Complexity of Many Faces in Arrangements of Lines and of Segments,” in Proceedings of the Fourth Annual ACM Symposium on Computational Geometry, New York: Association for Computing Machinery, pp. 44–55.
4. Edelsbrunner, H., and Mücke, E. P. (1988), “Simulation of Simplicity: A Technique to Cope With Degeneracies in Geometric Algorithms,” in Proceedings of the Fourth Annual ACM Symposium on Computational Geometry, New York: Association for Computing Machinery, pp. 118–133.
5. Edelsbrunner, H., and Welzl, E. (1986), “Constructing Belts in Two-Dimensional Arrangements With Applications,” SIAM Journal on Computing, 15, 271–284.
6. Erdös, P., Lovász, L., Simmons, A., and Strauss, E. G. (1973), “Dissection Graphs of Planar Point Sets,” in A Survey of Combinatorial Theory, eds. J. N. Srivastava et al., Amsterdam: North-Holland, pp. 139–149.
7. Fredman, M. (1976), “On the Information Theoretic Lower Bound,” Theoretical Computer Science, 1, 355–361.
8. Lee, D. T., and Preparata, F. P. (1984), “Euclidean Shortest Paths in the Presence of Rectilinear Barriers,” Network, 14, 393–410.
9. Levi, F. (1926), “Die Teilung der Projektiven Ebene Durch Gerade Oder Pseudogerade,” Berichte Mathematische-Physikalischer Klassen der Sächsischen Akademie der Wissenschaften Leipzig, 78, 256–267.
10. Rousseeuw, P. J. (1984), “Least Median of Squares Regression,” Journal of the American Statistical Association, 79, 871–880.
11. Rousseeuw, P. J., and Leroy, A. M. (1987), Robust Regression and Outlier Detection, New York: John Wiley.
12. Souvaine, D. L., and Steele, J. M. (1987), “Efficient Time and Space Algorithms for Least Median of Squares Regression,” Journal of the American Statistical Association, 82, 794–801.
13. Steele, J. M., and Steiger, W. L. (1986), “Algorithms and Complexity for Least Median of Squares Regression,” Discrete Applied Mathematics, 14, 93–100.
14. Welzl, E. (1986), “More on k-Sets of Finite Sets in the Plane,” Discrete and Computational Geometry, 1, 95–100.