Pages that link to "Item:Q4989918"
From MaRDI portal
The following pages link to Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications (Q4989918):
Displayed 9 items.
- Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model (Q2096389) (← links)
- Testing polynomials for vanishing on Cartesian products of planar point sets: collinearity testing and related problems (Q2105319) (← links)
- On 3SUM-hard problems in the decision tree model (Q2117780) (← links)
- Few cuts meet many point sets (Q2696278) (← links)
- On the Stretch Factor of Polygonal Chains (Q5001847) (← links)
- On Ray Shooting for Triangles in 3-Space and Related Problems (Q5092511) (← links)
- On reverse shortest paths in geometric proximity graphs (Q6092309) (← links)
- Throwing a sofa through the window (Q6142343) (← links)
- On semialgebraic range reporting (Q6145667) (← links)
