An in-place algorithm for Klee's measure problem in two dimensions
From MaRDI portal
(Redirected from Publication:845997)
Recommendations
- A (slightly) faster algorithm for Klee's measure problem
- A (slightly) faster algorithm for klee's measure problem
- An improved algorithm for Klee's measure problem on fat boxes
- scientific article; zbMATH DE number 1302378
- Bringing order to special cases of Klee's measure problem
- A faster optimal algorithm for the measure problem
- An optimal speedup algorithm for the measure problem
- Algorithms for \(k\)-dispersion for points in convex position in the plane
- scientific article; zbMATH DE number 1092062
- Two algorithms for approximation in highly complicated planar domains
Cites work
- Algorithms and Data Structures
- Asymptotically efficient in-place merging
- Can the Measure of ∪ n 1 [ a i , b i ] be Computed in Less Than O(n logn) Steps?
- New Upper Bounds in Klee’s Measure Problem
- On the complexity of computing the measure of ∪[a i ,b i ]
- Space-efficient geometric divide-and-conquer algorithms
- Space-efficient planar convex hull algorithms
- Stable unmerging in linear time and constant space
- Towards in-place geometric algorithms and data structures
Cited in
(4)
This page was built for publication: An in-place algorithm for Klee's measure problem in two dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845997)