Pages that link to "Item:Q1184155"
From MaRDI portal
The following pages link to An upper bound on the number of planar \(K\)-sets (Q1184155):
Displaying 11 items.
- A pseudo-algorithmic separation of lines from pseudo-lines (Q674001) (← links)
- Median hyperplanes in normed spaces -- a survey (Q1281394) (← links)
- A bound on local minima of arrangements that implies the upper bound theorem (Q1312194) (← links)
- On the expected number of \(k\)-sets (Q1327450) (← links)
- Algorithms for ham-sandwich cuts (Q1329191) (← links)
- \(k\)-violation linear programming (Q1336744) (← links)
- Cutting dense point sets in half (Q1355189) (← links)
- Continuous location of dimensional structures. (Q1410321) (← links)
- Dynamic half-space range reporting and its applications (Q1891228) (← links)
- Dense point sets with many halving lines (Q2207605) (← links)
- Extremal problems for geometric hypergraphs (Q6487430) (← links)
