Pages that link to "Item:Q5361676"
From MaRDI portal
The following pages link to Towards in-place geometric algorithms and data structures (Q5361676):
Displayed 14 items.
- Reprint of: Memory-constrained algorithms for simple polygons (Q390167) (← links)
- Prune-and-search with limited workspace (Q473192) (← links)
- In-place algorithm for erasing a connected component in a binary image (Q692939) (← 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)
- Space-efficient geometric divide-and-conquer algorithms (Q883238) (← links)
- Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection (Q991174) (← links)
- Line-segment intersection made in-place (Q2385700) (← links)
- Memory-constrained algorithms for simple polygons (Q2391542) (← links)
- Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time (Q2489016) (← links)
- Computing (and Life) Is All about Tradeoffs (Q2848971) (← links)
- Succinct and Implicit Data Structures for Computational Geometry (Q2848977) (← links)
- Time-Space Trade-offs for Triangulations and Voronoi Diagrams (Q3449845) (← links)
- Geometric Streaming Algorithms with a Sorting Primitive (Q5387783) (← links)