论文信息 - Iterated Point–Line Configurations Grow Doubly-Exponentially

Iterated Point–Line Configurations Grow Doubly-Exponentially

Begin with a set of four points in the real plane in general position. Add to this collection the intersection of all lines through pairs of these points. Iterate. Ismailescu and Radoičić (Comput. Geom. 27:257–267, 2004) showed that the limiting set is dense in the plane. We give doubly exponential upper and lower bounds on the number of points at each stage. The proof employs a variant of the Szemerédi–Trotter Theorem and an analysis of the “minimum degree” of the growing configuration.

Joshua N. Cooper | Mark Walters

[1] Christopher J. Hillar,et al. A result about the density of iterated line intersections in the plane , 2006, Comput. Geom..

[2] András Bezdek,et al. On iterative processes generating dense point sets , 2006, Period. Math. Hung..

[3] Ansgar Grüne,et al. On the density of iterated line segment intersections , 2008, Comput. Geom..

[4] Endre Szemerédi,et al. Extremal problems in discrete geometry , 1983, Comb..

[5] Dan Ismailescu,et al. A dense planar point set from iterated line intersections , 2004, Comput. Geom..

[6] L. A. Oa,et al. Crossing Numbers and Hard Erd} os Problems in Discrete Geometry , 1997 .

[7] László A. Székely,et al. Crossing Numbers and Hard Erdős Problems in Discrete Geometry , 1997, Combinatorics, Probability and Computing.

[8] Melvyn B. Nathanson,et al. Additive Number Theory , 1996 .

[9] Melvyn B. Nathanson,et al. Additive Number Theory: Inverse Problems and the Geometry of Sumsets , 1996 .

[10] János Pach,et al. Graphs drawn with few crossings per edge , 1997, Comb..