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 $\mathbb{R}^d$ for $d \ge 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, obtaini...
| Published in: | Scientific Annals of Computer Science |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Alexandru Ioan Cuza University of Iasi
2019-09-01
|
| Subjects: | |
| Online Access: | http://dx.doi.org/10.7561/SACS.2019.1.81 |