Towards in-place geometric algorithms and data structures
From MaRDI portal
Publication:5361676
DOI10.1145/997817.997854zbMath1374.68646OpenAlexW2011024091MaRDI QIDQ5361676
Eric Y. Chen, Timothy M. Chan, Hervé Brönnimann
Publication date: 29 September 2017
Published in: Proceedings of the twentieth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/997817.997854
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items (21)
Time-space trade-offs for triangulations and Voronoi diagrams ⋮ Optimal In-place Algorithms for Basic Graph Problems ⋮ Time-Space Trade-offs for Triangulations and Voronoi Diagrams ⋮ An in-place algorithm for Klee's measure problem in two dimensions ⋮ In-place algorithms for computing (Layers of) maxima ⋮ Line-segment intersection made in-place ⋮ Memory-constrained algorithms for simple polygons ⋮ Space-efficient geometric divide-and-conquer algorithms ⋮ Reprint of: Memory-constrained algorithms for simple polygons ⋮ Variations of largest rectangle recognition amidst a bichromatic point set ⋮ Prune-and-search with limited workspace ⋮ Geometric Streaming Algorithms with a Sorting Primitive ⋮ Frameworks for designing in-place graph algorithms ⋮ A Framework for In-place Graph Algorithms ⋮ Memory efficient algorithms for cactus graphs and block graphs ⋮ In-place algorithm for erasing a connected component in a binary image ⋮ Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time ⋮ Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection ⋮ Computing (and Life) Is All about Tradeoffs ⋮ Succinct and Implicit Data Structures for Computational Geometry ⋮ Rectilinear path problems in restricted memory setup
This page was built for publication: Towards in-place geometric algorithms and data structures
