Pages that link to "Item:Q4604367"
From MaRDI portal
The following pages link to Simplex Range Searching and Its Variants: A Review (Q4604367):
Displaying 16 items.
- New variants of perfect non-crossing matchings (Q831710) (← links)
- Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model (Q2096389) (← links)
- On 3SUM-hard problems in the decision tree model (Q2117780) (← links)
- Dynamic geometric data structures via shallow cuttings (Q2223621) (← links)
- Time and space efficient collinearity indexing (Q2678263) (← links)
- Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications (Q4989918) (← links)
- Polynomial Data Structure Lower Bounds in the Group Model (Q5067444) (← links)
- (Q5088930) (← links)
- (Q5088951) (← links)
- (Q5088955) (← links)
- On Ray Shooting for Triangles in 3-Space and Related Problems (Q5092511) (← links)
- (Q5111687) (← 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)
- New variants of perfect non-crossing matchings (Q6180638) (← links)
