Pages that link to "Item:Q1175423"
From MaRDI portal
The following pages link to Tight bounds on a problem of lines and intersections (Q1175423):
Displaying 16 items.
- Computing tight bounds via piecewise linear functions through the example of circle cutting problems (Q328518) (← links)
- An improved bound for joints in arrangements of lines in space (Q1772127) (← links)
- Seventeen lines and one-hundred-and-one points (Q1885913) (← links)
- Tight bounds for Katona's shadow intersection theorem (Q2048364) (← links)
- A note on the minimum number of red lines needed to pierce the intersections of blue lines (Q2123295) (← links)
- On minimal Besicovitch arrangements in \(\mathbb{F}_q^2\): statistical properties and combinatorial implications (Q2287016) (← links)
- On the density of iterated line segment intersections (Q2479472) (← links)
- A result about the density of iterated line intersections in the plane (Q2489536) (← links)
- (Q2939160) (← links)
- Upper bounds for centerlines (Q2968084) (← links)
- (Q3197871) (← links)
- Efficient maintenance of the union of intervals on a line, with applications (Q3201791) (← links)
- Improved bounds for pencils of lines (Q5145533) (← links)
- (Q5461469) (← links)
- Algorithms - ESA 2003 (Q5897274) (← links)
- Crossing edges and faces of line arrangements in the plane (Q5963637) (← links)
