Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
414328 | Computational Geometry | 2008 | 14 Pages |
Abstract
Given S1, a finite set of points in the plane, we define a sequence of point sets Si as follows: With Si already determined, let Li be the set of all the line segments connecting pairs of points of , and let Si+1 be the set of intersection points of those line segments in Li, which cross but do not overlap. We show that with the exception of some starting configurations the set of all crossing points is dense in a particular subset of the plane with nonempty interior. This region is the intersection of all closed half planes which contain all but at most one point from S1.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics