A Practical Algorithm for Enumerating Collinear Points

06/16/2017
by   Ali Gholami Rudi, et al.
0

This paper studies the problem of enumerating all maximal collinear subsets of size at least three in a given set of n points. An algorithm for this problem, besides solving degeneracy testing and the exact fitting problem, can also help with other problems, such as point line cover and general position subset selection. The classic topological sweeping algorithm of Edelsbrunner and Guibas can find these subsets in O(n^2) time in the dual plane. We present an alternative algorithm that, although asymptotically slower than their algorithm in the worst case, is simpler to implement and more amenable to parallelization. If the input points are decomposed into m convex polygons, our algorithm has time complexity O(n^2 m) and space complexity O(n). Our algorithm can be parallelized on the CREW PRAM with time complexity O(n m) using n processors.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/14/2021

A faster algorithm for Cops and Robbers

We present an algorithm of time complexity O(kn^k+2) deciding whether a ...
research
08/27/2021

Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set

Chvátal and Klincsek (1980) gave an O(n^3)-time algorithm for the proble...
research
05/04/2022

Max-Min k-Dispersion on a Convex Polygon

In this paper, we consider the following k-dispersion problem. Given a s...
research
12/04/2020

Near-Optimal Algorithms for Point-Line Covering Problems

We study fundamental point-line covering problems in computational geome...
research
01/30/2013

Logarithmic Time Parallel Bayesian Inference

I present a parallel algorithm for exact probabilistic inference in Baye...
research
12/21/2020

Change-in-Slope Optimal Partitioning Algorithm in a Finite-Size Parameter Space

We consider the problem of detecting change-points in univariate time se...
research
08/07/2022

Point-in-Convex Polygon and Point-in-Convex Polyhedron Algorithms with O(1) Complexity using Space Subdivision

There are many space subdivision and space partitioning techniques used ...

Please sign up or login with your details

Forgot password? Click here to reset