Maximum stabbing line in 2D plane

Authors:
Francis Y. L. Chin;Cao An Wang;Fu Lee Wang
Affiliations:
Department of Computer Science and Information Systems, The University of Hong Kong, Hong Kong;Department of Computer Science, Memorial University of Newfoundland, St. John's, NFLD, Canada;Department of Computer Science and Information Systems, The University of Hong Kong, Hong Kong
Venue:
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Year:
1999

Citing 8
Cited 1

Constructing arrangements of lines and hyperplanes with applications

SIAM Journal on Computing
Algorithms in combinatorial geometry

Algorithms in combinatorial geometry
Efficient algorithms for common transversals

Information Processing Letters
Algorithms for line transversals in space

SCG '87 Proceedings of the third annual symposium on Computational geometry
The K-dense corridor problems

Pattern Recognition Letters
On a class of O(n2) problems in computational geometry

Computational Geometry: Theory and Applications
A practical approximation algorithm for the LMS line estimator

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
A fast algorithm for computing longest common subsequences

Communications of the ACM

Combinatorial Approaches for Mass Spectra Recalibration

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)

Quantified Score

Hi-index	0.00

Visualization

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.