Towards in-place geometric algorithms and data structures
From MaRDI portal
Recommendations
- Succinct and Implicit Data Structures for Computational Geometry
- scientific article; zbMATH DE number 2086251
- scientific article; zbMATH DE number 1424298
- A tutorial for designing flexible geometric algorithms
- scientific article; zbMATH DE number 66476
- Dynamic geometric data structures via shallow cuttings
- scientific article; zbMATH DE number 7559224
- scientific article; zbMATH DE number 4060718
- Geometric data structures for computer graphics.
Cited in
(34)- Speeding up the incremental construction of the union of geometric objects in practice.
- LOOK: A lazy object-oriented kernel design for geometric computation
- Time-space trade-offs for triangulations and Voronoi diagrams
- Variations of largest rectangle recognition amidst a bichromatic point set
- Dynamic geometric data structures via shallow cuttings
- Frameworks for designing in-place graph algorithms
- Two approaches to building time-windowed geometric data structures
- Rectilinear path problems in restricted memory setup
- Line-segment intersection made in-place
- Memory-constrained algorithms for simple polygons
- Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time
- Computing (and Life) Is All about Tradeoffs
- Succinct and Implicit Data Structures for Computational Geometry
- Progressive geometric algorithms
- Time-space trade-offs for triangulations and Voronoi diagrams
- Reprint of: Memory-constrained algorithms for simple polygons
- scientific article; zbMATH DE number 36761 (Why is no real title available?)
- Progressive geometric algorithms
- Prune-and-search with limited workspace
- A framework for in-place graph algorithms
- Optimal In-place Algorithms for Basic Graph Problems
- scientific article; zbMATH DE number 7559224 (Why is no real title available?)
- Memory efficient algorithms for cactus graphs and block graphs
- Optimal in-place algorithms for 3-D convex hulls and 2-D segment intersection
- Geometric Streaming Algorithms with a Sorting Primitive
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Constant workspace algorithms for computing relative hulls in the plane
- In-place algorithm for erasing a connected component in a binary image
- Competitive data-structure dynamization
- Efficient in-place Hough transform algorithm for arbitrary image sizes
- An in-place algorithm for Klee's measure problem in two dimensions
- In-place algorithms for computing (Layers of) maxima
- Space-efficient geometric divide-and-conquer algorithms
- Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection
This page was built for publication: Towards in-place geometric algorithms and data structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361676)
