Enumerating Collinear Points in Higher Dimensions

In this paper, we study the problem of reporting all maximal collinear subsets of a point set S in R for d ≥ 3. An algorithm for this problem can be used to detect if any three of the points are collinear or find the line that intersects the most points in S. Besides, obtaining such maximal subsets is necessary for some problems about the collinearity relation among points, such as when covering them with the fewest lines. We present practical algorithms to find all maximal collinear subsets of a set of n points, including one with space complexity O(n) and time complexity O(dn log n), and one with space complexity O(n) and time complexity O(dn).

[1]  Stefan Kratsch,et al.  Point Line Cover: The Easy Kernel is Essentially Tight , 2014, SODA.

[2]  W. V. Hodge,et al.  Methods of algebraic geometry , 1947 .

[3]  Ali Gholami Rudi,et al.  A Practical Algorithm for Enumerating Collinear Points , 2017, ArXiv.

[4]  Godfried T. Toussaint.  Complexity of computing nice viewpoints of objects in space , 2000, SPIE Optics + Photonics.

[5]  W. B. Johnson,et al.  Extensions of Lipschitz mappings into Hilbert space , 1984 .

[6]  Bernard Chazelle,et al.  How hard is half-space range searching? , 1993, Discret. Comput. Geom..

[7]  Jirí Matousek,et al.  Geometric range searching , 1994, CSUR.

[8]  Raimund Seidel,et al.  Constructing arrangements of lines and hyperplanes with applications , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[9]  Tetsuo Asano,et al.  Variants for the Hough Transform for Line Detection , 1996, Comput. Geom..

[10]  Micha Sharir,et al.  Combinatorial Geometry and Its Algorithmic Applications , 2008 .

[11]  Leonidas J. Guibas,et al.  Topologically sweeping an arrangement , 1986, STOC '86.

[12]  Bernard Chazelle,et al.  The power of geometric duality , 1985, BIT Comput. Sci. Sect..

[13]  Jirí Matousek,et al.  Reporting Points in Halfspaces , 1992, Comput. Geom..

[14]  Rolf Niedermeier,et al.  Finding Points in General Position , 2015, CCCG.

[15]  Jeff Erickson.  New Lower Bounds for Convex Hull Problems in Odd Dimensions , 1999, SIAM J. Comput..

[16]  Timothy M. Chan,et al.  Optimal halfspace range reporting in three dimensions , 2009, SODA.

[17]  Raimund Seidel,et al.  Erratum to Better Lower Bounds on Detecting Affine and Spherical Degeneracies , 1993, Discret. Comput. Geom..

[18]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[19]  Pankaj K. Agarwal,et al.  Geometric Range Searching and Its Relatives , 2007 .