In-place algorithms for computing (Layers of) maxima
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- A simple algorithm for in-place merging
- An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time
- Asymptotically efficient in-place merging
- Computing dominances in \(E^ n\)
- Dynamic Maintenance of Maxima of 2-d Point Sets
- Fast linear expected-time algorithms for computing maxima and convex hulls
- LATIN 2004: Theoretical Informatics
- Line-segment intersection made in-place
- Maintenance of configurations in the plane
- Multidimensional divide-and-conquer
- On Finding the Maxima of a Set of Vectors
- On the convex layers of a planar set
- Optimal output-sensitive convex hull algorithms in two and three dimensions
- Optimizing stable in-place merging.
- Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time
- Space-efficient geometric divide-and-conquer algorithms
- Space-efficient planar convex hull algorithms
- Stable minimum space partitioning in linear time
- Stable unmerging in linear time and constant space
- Three-dimensional layers of maxima
- Towards in-place geometric algorithms and data structures
Cited in
(11)- Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection
- Computing maximal layers of points in \(E^{f(n)}\)
- Dynamic layers of maxima with applications to dominating queries
- Maxima-finding algorithms for multidimensional samples: A two-phase approach
- scientific article; zbMATH DE number 1947398 (Why is no real title available?)
- In-Place Algorithms for Computing (Layers of) Maxima
- A Fast Algorithm for Three-Dimensional Layers of Maxima Problem
- Fast computation of output-sensitive maxima in a word RAM
- Prune-and-search with limited workspace
- Linear space adaptive data structures for planar range reporting
- Three-dimensional layers of maxima
This page was built for publication: In-place algorithms for computing (Layers of) maxima
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q848632)
