On some problems of elementary and combinatorial geometry
From MaRDI portal
Publication:1216631
DOI10.1007/BF02414146zbMath0303.52006OpenAlexW1970934335MaRDI QIDQ1216631
Publication date: 1975
Published in: Annali di Matematica Pura ed Applicata. Serie Quarta (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02414146
Problem books (00A07) Combinatorial inequalities (05A20) Inequalities and extremum problems involving convexity in convex geometry (52A40) Length, area and volume in real or complex geometry (51M25)
Related Items
On convex holes in d-dimensional point sets ⋮ Two theorems on point-flat incidences ⋮ Bisector energy and few distinct distances ⋮ On a question of Erdős and Ulam ⋮ A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets ⋮ A survey of Sylvester's problem and its generalizations ⋮ Point sets with distinct distances ⋮ Sphere-and-point incidence relations in high dimensions with applications to unit distances and furthest-neighbor pairs ⋮ The exact fitting problem in higher dimensions ⋮ Distinct distances in finite planar sets ⋮ Many collinear \(k\)-tuples with no \(k+1\) collinear points ⋮ Distinct distances between a collinear set and an arbitrary set of points ⋮ Geometria combinatoria e geometrie finite ⋮ Some combinatorial problems in the plane ⋮ Sets with many pairs of orthogonal vectors over finite fields ⋮ The Mathematics of Ferran Hurtado: A Brief Survey ⋮ On the pinned distances problem in positive characteristic ⋮ Few distinct distances implies no heavy lines or circles ⋮ Bisectors and pinned distances ⋮ Combinatorial complexity bounds for arrangements of curves and spheres ⋮ On the combinatorial problems which I would most like to see solved ⋮ A bichromatic incidence bound and an application ⋮ Beck's theorem for plane curves ⋮ Every large point set contains many collinear points or an empty pentagon ⋮ The chromatic number of the space $( {\mathbb R}^n, l_1)$ ⋮ Computational geometric aspects of rhythm, melody, and voice-leading ⋮ A note on distinct distances in rectangular lattices ⋮ Characterizing optimal point sets determining one distinct triangle ⋮ A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation ⋮ Distinct distances in planar point sets with forbidden 4-point patterns ⋮ On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry ⋮ The number of different distances determined by n points in the plane ⋮ A combinatorial distinction between the Euclidean and projective planes ⋮ Sets with few distinct distances do not have heavy lines ⋮ The Erdos-Szekeres problem on points in convex position – a survey
Cites Work
