Directions in combinatorial geometry
Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Combinatorial aspects of finite geometries (05B25) Additive number theory; partitions (11P99) Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02) Erd?s problems and related topics of discrete geometry (52C10) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Combinatorial complexity of geometric structures (52C45)
This is a survey on the problem of estimating the minimum number of different directions determined by the lines that connect \(n\) given points in dimension 2 or 3. Because in the projective plane scenario lines with the same direction intersect the line at infinity at the same point, several results on incidences between lines and points are surveyed as well.
- Solution of Scott's problem on the number of directions determined by a point set in 3-space
- scientific article; zbMATH DE number 431994
- Extremal problems in discrete geometry
- A tight bound for the number of different directions in three dimensions
- On the number of directions determined by a three-dimensional points set
This page was built for publication: Directions in combinatorial geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q814167)
