An in-place algorithm for Klee's measure problem in two dimensions

DOI10.1016/j.ipl.2006.12.004zbMath1184.68573OpenAlexW1971889557MaRDI QIDQ845997

Jan Vahrenhold

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.12.004

zbMATH Keywords

analysis of algorithmscomputational geometry

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Efficient transformations for Klee's measure problem in the streaming model

Uses Software

• heapsort

Cites Work

• Space-efficient planar convex hull algorithms
• Space-efficient geometric divide-and-conquer algorithms
• Stable unmerging in linear time and constant space
• 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 ]
• Towards in-place geometric algorithms and data structures
• Algorithms and Data Structures
• Asymptotically efficient in-place merging

This page was built for publication: An in-place algorithm for Klee's measure problem in two dimensions