Pages that link to "Item:Q883238"
From MaRDI portal
The following pages link to Space-efficient geometric divide-and-conquer algorithms (Q883238):
Displaying 10 items.
- Prune-and-search with limited workspace (Q473192) (← links)
- Memory efficient algorithms for cactus graphs and block graphs (Q528335) (← links)
- An in-place algorithm for Klee's measure problem in two dimensions (Q845997) (← links)
- In-place algorithms for computing (Layers of) maxima (Q848632) (← links)
- Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection (Q991174) (← links)
- Intersections and circuits in sets of line segments (Q2084612) (← links)
- Variations of largest rectangle recognition amidst a bichromatic point set (Q2201768) (← links)
- Rectilinear path problems in restricted memory setup (Q2357163) (← links)
- Line-segment intersection made in-place (Q2385700) (← links)
- (Q5091039) (← links)
