The measure problem for rectangular ranges in d-space

DOI10.1016/0196-6774(81)90027-4zbMATH Open0487.68032OpenAlexW2015690843WikidataQ30051222 ScholiaQ30051222MaRDI QIDQ3948587FDOQ3948587

Authors: J. Van Leeuwen, D. 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)

Cited In (14)

• A fast implementation for the 2D/3D box placement problem
• Parallel computational geometry of rectangles
• Computing Klee's measure of grounded boxes
• Internal and external algorithms for the point-in-regions problem - the INSIDE join of georelational algebra
• A (slightly) faster algorithm for Klee's measure problem
• Enhanced layered segment trees: a pragmatic data structure for real-time processing of geometric objects
• Title not available (Why is that?)
• Interval graphs and related topics
• Approximating the volume of unions and intersections of high-dimensional geometric objects
• 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
• On some union and intersection problems for polygons with fixed orientations
• Ectropy of diversity measures for populations in Euclidean space

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3948587)