The measure problem for rectangular ranges in d-space

DOI10.1016/0196-6774(81)90027-4MaRDI QIDQ3948587zbMATH OpenOpenAlexWikidataFDO

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

efficient scan plane algorithmmeasure of the union of a collection of rectangular rangesquad treesegment tree

Mathematics Subject Classification ID

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

Cited in

(15)

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

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)