Publikationsansicht

On the Density of Iterated Line Segment Intersections (2005)

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 �i j=1 Sj, 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 � ∞ i=1 Si 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 one point from S1.

Details der Publikation
Download http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.69.960
Quelle http://web.informatik.uni-bonn.de/I/publications/gk-dilsi-06.pdf
Mitarbeiter CiteSeerX
Archiv CiteSeerX - Scientific Literature Digital Library and Search Engine (United States)
Keywords discrete geometry, computational geometry, density, intersections, line
Typ text
Sprache Englisch
Verknüpfungen 10.1.1.60.3511, 10.1.1.61.7370, 10.1.1.88.3245