The measure problem for rectangular ranges in d-space

DOI10.1016/0196-6774(81)90027-4zbMath0487.68032OpenAlexW2015690843WikidataQ30051222 ScholiaQ30051222MaRDI QIDQ3948587

Jan van Leeuwen, Derick Wood

Publication date: 1981

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://dspace.library.uu.nl/handle/1874/15897

zbMATH Keywords

segment treequad treeefficient scan plane algorithmmeasure of the union of a collection of rectangular ranges

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Related Items (14)

Accelerated Monte Carlo estimation of exceedance probabilities under monotonicity constraints ⋮ Efficient transformations for Klee's measure problem in the streaming model ⋮ Divide-and-conquer in planar geometry ⋮ Parallel computational geometry of rectangles ⋮ Ectropy of diversity measures for populations in Euclidean space ⋮ Approximating the volume of unions and intersections of high-dimensional geometric objects ⋮ A fast implementation for the 2D/3D box placement problem ⋮ Internal and external algorithms for the point-in-regions problem - the INSIDE join of georelational algebra ⋮ Unnamed Item ⋮ A (slightly) faster algorithm for Klee's measure problem ⋮ Interval graphs and related topics ⋮ Enhanced layered segment trees: a pragmatic data structure for real-time processing of geometric objects ⋮ Computing Klee's measure of grounded boxes ⋮ On some union and intersection problems for polygons with fixed orientations

This page was built for publication: The measure problem for rectangular ranges in d-space