Extremal problems in discrete geometry
From MaRDI portal
Publication:794651
DOI10.1007/BF02579194zbMath0541.05012WikidataQ56454601 ScholiaQ56454601MaRDI QIDQ794651
Endre Szemerédi, William T. jun. Trotter
Publication date: 1983
Published in: Combinatorica (Search for Journal in Brave)
05B30: Other designs, configurations
05A99: Enumerative combinatorics
51M05: Euclidean geometries (general) and generalizations
Related Items
A Bipartite Strengthening of the Crossing Lemma, ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES, From harmonic analysis to arithmetic combinatorics, Research problems, Radial points in the plane, The complexity and construction of many faces in arrangements of lines and of segments, The complexity of many cells in arrangements of planes and related problems, Approximate input sensitive algorithms for point pattern matching, Locating a robot with angle measurements, On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry, Combinatorial complexity bounds for arrangements of curves and spheres, Partitioning arrangements of lines. II: Applications, Degenerate crossing numbers, Extremal problems on triangle areas in two and three dimensions, Two results about points, lines and planes, Sphere-and-point incidence relations in high dimensions with applications to unit distances and furthest-neighbor pairs, Tight bounds on a problem of lines and intersections, The complexity of point configurations, Repeated angles in the plane and related problems, The number of different distances determined by a set of points in the Euclidean plane, Counting facets and incidences, Counting and cutting cycles of lines and rods in space, Graphs drawn with few crossings per edge, On linear combinatorics. I: Concurrency---an algebraic approach, On the number of circles determined by \(n\) points in the Euclidean plane, Finding degeneracies among sets of lines, On distinct sums and distinct distances., Convexity and sumsets, The maximum number of unit distances in a convex \(n\)-gon, Counting \(k\)-projections of a point set, New lower bounds for Hopcroft's problem, Counting problems relating to a theorem of Dirichlet, A polynomial bound in Freiman's theorem., New results on the Erdős-Szemerédi sum-product problems., On counting point-hyperplane incidences, Restriction and Kakeya phenomena for finite fields, On the number of directions determined by a three-dimensional points set, Two combinatorial problems in the plane, Multiplicities of interpoint distances in finite planar sets, Rich cells in an arrangement of hyperplanes, The exact fitting problem in higher dimensions, Lines, line-point incidences and crossing families in dense sets, On empty convex polygons in a planar point set, A sum-product estimate in algebraic division algebras, Forbidden paths and cycles in ordered graphs and matrices, A survey of Sylvester's problem and its generalizations, On the Number of Tetrahedra with Minimum, Unit, and Distinct Volumes in Three-Space, On a Question of Bourgain about Geometric Incidences, Geometric incidence theorems via Fourier analysis, Regularity lemmas for hypergraphs and quasi-randomness
Cites Work
