Pages that link to "Item:Q794651"
From MaRDI portal
The following pages link to Extremal problems in discrete geometry (Q794651):
Displayed 46 items.
- The complexity and construction of many faces in arrangements of lines and of segments (Q582900) (← links)
- The complexity of many cells in arrangements of planes and related problems (Q582901) (← links)
- Locating a robot with angle measurements (Q751327) (← links)
- On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry (Q789732) (← links)
- Combinatorial complexity bounds for arrangements of curves and spheres (Q917017) (← links)
- Partitioning arrangements of lines. II: Applications (Q921915) (← links)
- Two results about points, lines and planes (Q1079194) (← links)
- Sphere-and-point incidence relations in high dimensions with applications to unit distances and furthest-neighbor pairs (Q1113458) (← links)
- Tight bounds on a problem of lines and intersections (Q1175423) (← links)
- The complexity of point configurations (Q1175788) (← links)
- Repeated angles in the plane and related problems (Q1185877) (← links)
- The number of different distances determined by a set of points in the Euclidean plane (Q1186077) (← links)
- Counting facets and incidences (Q1189286) (← links)
- Counting and cutting cycles of lines and rods in space (Q1194306) (← links)
- Graphs drawn with few crossings per edge (Q1272189) (← links)
- On linear combinatorics. I: Concurrency---an algebraic approach (Q1280269) (← links)
- On the number of circles determined by \(n\) points in the Euclidean plane (Q1320453) (← links)
- Finding degeneracies among sets of lines (Q1343155) (← links)
- On distinct sums and distinct distances. (Q1418004) (← links)
- Convexity and sumsets (Q1581869) (← links)
- The maximum number of unit distances in a convex \(n\)-gon (Q1813293) (← links)
- Counting \(k\)-projections of a point set (Q1813981) (← links)
- New lower bounds for Hopcroft's problem (Q1816464) (← links)
- Counting problems relating to a theorem of Dirichlet (Q1841992) (← links)
- A polynomial bound in Freiman's theorem. (Q1847934) (← links)
- New results on the Erdős-Szemerédi sum-product problems. (Q1871468) (← links)
- On counting point-hyperplane incidences (Q1873152) (← links)
- Restriction and Kakeya phenomena for finite fields (Q1880948) (← links)
- On the number of directions determined by a three-dimensional points set (Q1881677) (← links)
- Two combinatorial problems in the plane (Q1892420) (← links)
- Multiplicities of interpoint distances in finite planar sets (Q1894357) (← links)
- Rich cells in an arrangement of hyperplanes (Q1899434) (← links)
- The exact fitting problem in higher dimensions (Q1917054) (← links)
- Lines, line-point incidences and crossing families in dense sets (Q1924496) (← links)
- On empty convex polygons in a planar point set (Q2368650) (← links)
- A sum-product estimate in algebraic division algebras (Q2382266) (← links)
- Forbidden paths and cycles in ordered graphs and matrices (Q2472738) (← links)
- A survey of Sylvester's problem and its generalizations (Q2638534) (← links)
- On the Number of Tetrahedra with Minimum, Unit, and Distinct Volumes in Three-Space (Q3512600) (← links)
- On a Question of Bourgain about Geometric Incidences (Q3527547) (← links)
- Regularity lemmas for hypergraphs and quasi-randomness (Q3978309) (← links)
- A Bipartite Strengthening of the Crossing Lemma (Q5452205) (← links)
- ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES (Q5484909) (← links)
- From harmonic analysis to arithmetic combinatorics (Q5503659) (← links)
- Research problems (Q5896308) (← links)
- Radial points in the plane (Q5946643) (← links)