Pages that link to "Item:Q2354673"

The following pages link to Multilevel polynomial partitions and simplified range searching (Q2354673):

Displaying 18 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)
• \(L^2\) bounds for a maximal directional Hilbert transform (Q2152580) (← links)
• The polynomial method over varieties (Q2208425) (← links)
• Cutting algebraic curves into pseudo-segments and applications (Q2397099) (← links)
• Shallow packings, semialgebraic set systems, macbeath regions, and polynomial partitioning (Q2415378) (← links)
• A semi-algebraic version of Zarankiewicz's problem (Q2628329) (← links)
• Few cuts meet many point sets (Q2696278) (← links)
• On a real analog of Bezout inequality and the number of connected components of sign conditions (Q2795904) (← links)
• Simplex Range Searching and Its Variants: A Review (Q4604367) (← links)
• Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications (Q4989918) (← links)
• On the Stretch Factor of Polygonal Chains (Q5001847) (← links)
• Maximal directional operators along algebraic varieties (Q5014716) (← links)
• (Q5092418) (← links)
• Polynomial partitioning on varieties of codimension two and point-hypersurface incidences in four dimensions (Q5964223) (← 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)