@inproceedings{5fa6cccf939a4c8cb50f7897458e15e3,
title = "Maximum stabbing line in 2D plane",
abstract = "Two line estimator problems using the perpendicular and vertical distance measure are considered in this paper. (1) Given a set of n points in a plane, the line estimator problem is to determine a straight line which best fits this set of points. (2) Given a sequence of n points in a plane, the ordered line estimator problem is to determine a straight line which can best fit this set of points in order. Depending on the perpendicular/vertical distance measure, these two problems are related to the stabbing line problems of n circles/vertical line segments. With arrangement of curves, both problems can be solved in O(n2) and O(n3) time respectively.",
author = "Chin, {Francis Y.L.} and Wang, {Cao An} and Wang, {Fu Lee}",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1999.; 5th Annual International Conference on Computing and Combinatorics, COCOON 1999 ; Conference date: 26-07-1999 Through 28-07-1999",
year = "1999",
doi = "10.1007/3-540-48686-0_38",
language = "English",
isbn = "3540662006",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "379--388",
editor = "Shin-ichi Nakano and Hideki Imai and D.T. Lee and Takeshi Tokuyama and Takao Asano",
booktitle = "Computing and Combinatorics - 5th Annual International Conference, COCOON 1999, Proceedings",
}