In-place algorithms for computing (Layers of) maxima
From MaRDI portal
Publication:848632
DOI10.1007/s00453-008-9193-zzbMath1184.68558OpenAlexW2126446668MaRDI QIDQ848632
Publication date: 4 March 2010
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://pure.au.dk/ws/files/39850769/fulltext.pdf
Related Items
Dynamic layers of maxima with applications to dominating queries ⋮ Maxima-finding algorithms for multidimensional samples: A two-phase approach ⋮ Prune-and-search with limited workspace ⋮ Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection ⋮ Linear space adaptive data structures for planar range reporting
Uses Software
Cites Work
- Unnamed Item
- Multidimensional divide-and-conquer
- An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time
- Space-efficient planar convex hull algorithms
- A simple algorithm for in-place merging
- Space-efficient geometric divide-and-conquer algorithms
- Stable unmerging in linear time and constant space
- Maintenance of configurations in the plane
- Computing dominances in \(E^ n\)
- Stable minimum space partitioning in linear time
- Fast linear expected-time algorithms for computing maxima and convex hulls
- Optimizing stable in-place merging.
- Optimal output-sensitive convex hull algorithms in two and three dimensions
- Three-dimensional layers of maxima
- Line-segment intersection made in-place
- Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time
- On the convex layers of a planar set
- On Finding the Maxima of a Set of Vectors
- Dynamic Maintenance of Maxima of 2-d Point Sets
- Towards in-place geometric algorithms and data structures
- LATIN 2004: Theoretical Informatics
- Asymptotically efficient in-place merging
