Collinearities in Kinetic Point Sets
Ben D. Lund, George B. Purdy, Justin W. Smith, Csaba D. T\'oth

TL;DR
This paper investigates the maximum number of collinearities among moving points in the plane, establishing tight bounds for the number of 3-collinearities and general k-collinearities under constant velocity motion.
Contribution
It provides tight bounds on the number of k-collinearities among moving points, including the maximum count for 3-collinearities and constructions with no three points ever collinear.
Findings
Maximum 3-collinearities is 2 * C(n,3), tight bound.
Number of k-collinearities is O(n^3) for constant k, tight asymptotic bound.
Existence of point sets with no three points ever collinear.
Abstract
Let be a set of points in the plane, each point moving along a given trajectory. A {\em -collinearity} is a pair of a line and a time such that contains at least points at time , the points along do not all coincide, and not all of them are collinear at all times. We show that, if the points move with constant velocity, then the number of 3-collinearities is at most , and this bound is tight. There are points having distinct -collinearities. Thus, the number of -collinearities among points, for constant , is , and this bound is asymptotically tight. In addition, there are points, moving in pairwise distinct directions with different speeds, such that no three points are ever collinear.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Point processes and geometric inequalities · Advanced Numerical Analysis Techniques
