Lines, line-point incidences and crossing families in dense sets

DOI10.1007/BF01844852zbMath0871.52013OpenAlexW2065078485MaRDI QIDQ1924496

Pavel Valtr

Publication date: 20 October 1996

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01844852

zbMATH Keywords

distanceline segmentscrossing family

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10)

Related Items (6)

On crossing-families in planar point sets ⋮ Applying graphics hardware to achieve extremely fast geometric pattern matching in two and three dimensional transformation space ⋮ The visible perimeter of an arrangement of disks ⋮ Planar point sets determine many pairwise crossing segments ⋮ Flip distance to some plane configurations ⋮ Flip Distance to some Plane Configurations.

Cites Work

• Unnamed Item
• Unnamed Item
• On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
• Extremal problems in discrete geometry
• Convex independent sets and 7-holes in restricted planar point sets
• Crossing families
• Geometric methods in the study of irregularities of distribution
• The maximum size of a convex polygon in a restricted set of points in the plane

This page was built for publication: Lines, line-point incidences and crossing families in dense sets