Pages that link to "Item:Q3558019"
From MaRDI portal
The following pages link to Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time (Q3558019):
Displaying 8 items.
- A faster algorithm for computing motorcycle graphs (Q471142) (← links)
- Optimal deterministic algorithms for 2-d and 3-d shallow cuttings (Q728495) (← links)
- Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection (Q991174) (← links)
- On constant factors in comparison-based geometric algorithms and data structures (Q2349854) (← links)
- Succinct and Implicit Data Structures for Computational Geometry (Q2848977) (← links)
- Polynomial Data Structure Lower Bounds in the Group Model (Q5067444) (← links)
- Adaptive Point Location in Planar Convex Subdivisions (Q5370568) (← links)
- Random access in persistent strings and segment selection (Q6174650) (← links)
