The Union of Probabilistic Boxes: Maintaining the Volume
Authors:
- 1 January 2011
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 591-602
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Klee's measure problem on fat boxes in time ∂( n
(
d
+2)/3
)2010
- An improved algorithm for computing the volume of the union of cubes2010
- A (slightly) faster algorithm for Klee's measure problemComputational Geometry, 2010
- Computing the volume of the union of cubes2007
- New Upper Bounds in Klee’s Measure ProblemSIAM Journal on Computing, 1991
- Efficient maintenance of the union of intervals on a line, with applicationsJournal of Algorithms, 1991
- Direct dynamic structures for some line segment problemsComputer Vision, Graphics, and Image Processing, 1983
- The measure problem for rectangular ranges in d-spaceJournal of Algorithms, 1981
- Can the Measure of be Computed in Less than O(n log n) Steps?The American Mathematical Monthly, 1977