General position subset selection in line arrangements

DOI10.1007/978-3-031-92932-8_6MaRDI QIDQ6902206zbMATH OpenFDO

Authors Adrian Dumitrescu

Publication date 11 November 2025

Full work available at URL https://doi.org/10.1007/978-3-031-92932-8_6

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A note on arrays of dots with distinct slopes
• Additive combinatorics
• Computational geometry. Algorithms and applications.
• Convex independent sets and 7-holes in restricted planar point sets
• Crossing Numbers and Hard Erdős Problems in Discrete Geometry
• Dense point sets with many halving lines
• Distributions of points in the unit square and large \(k\)-gons
• Extremal problems in discrete geometry
• Finding points in general position
• Forbidden configurations in discrete geometry
• scientific article; zbMATH DE number 1017008 (Why is no real title available?)
• scientific article; zbMATH DE number 1749054 (Why is no real title available?)
• scientific article; zbMATH DE number 2112064 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• scientific article; zbMATH DE number 835734 (Why is no real title available?)
• On a Problem of Heilbronn
• On the General Position Subset Selection Problem
• On the interval containing at least one prime number
• On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
• Research Problems in Discrete Geometry
• The design of approximation algorithms
• The difference between consecutive primes. II
• The probabilistic method
• Turan's theorem for k-graphs

This page was built for publication: General position subset selection in line arrangements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6902206)