Iterated point-line configurations grow doubly-exponentially
From MaRDI portal
(Redirected from Publication:2380786)
Abstract: 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 Radoiv{c}i'{c} (2003) 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'edi-Trotter Theorem and an analysis of the ``minimum degree of the growing configuration.
Recommendations
Cites work
- scientific article; zbMATH DE number 933467 (Why is no real title available?)
- A dense planar point set from iterated line intersections.
- A point set everywhere dense in the plane
- A result about the density of iterated line intersections in the plane
- Crossing Numbers and Hard Erdős Problems in Discrete Geometry
- Extremal problems in discrete geometry
- Graphs drawn with few crossings per edge
- On iterative processes generating dense point sets
- On point sets containing their triangle centers
- On the density of iterated line segment intersections
Cited in
(4)
This page was built for publication: Iterated point-line configurations grow doubly-exponentially
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380786)