Extending a flexible unit-bar framework to a rigid one
Discrete Mathematics - Topological, algebraical and combinatorial structures; Froli´k's memorial volume
The density of iterated crossing points and a gap result for triangulations of finite point sets
Proceedings of the twenty-second annual symposium on Computational geometry
A result about the density of iterated line intersections in the plane
Computational Geometry: Theory and Applications
On the density of iterated line segment intersections
Computational Geometry: Theory and Applications
A result about the density of iterated line intersections in the plane
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
Given S1, a starting set of points in the plane, not all on a line, we define a sequence of planar point sets {Si}∞i=1 as follows. With Si already determined, let Li be the set of all the lines determined by pairs of points from Si, and let Si+1 be the set of all the intersection points of lines in Li. We show that with the exception of some very particular starting configurations, the limiting point set Ui=1∞ Si is everywhere dense in the plane.