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

DOI10.1016/J.COMGEO.2015.06.007zbMath1334.65052OpenAlexW1114040662MaRDI QIDQ904110

Costas Busch, Gokarna Sharma, Jerry L. Trahan, Ramachandran Vaidyanathan, Suresh Rai

Publication date: 15 January 2016

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2015.06.007

zbMATH Keywords

randomized approximation algorithmsKlee's measure problembounded aspect ratio rectanglesbounded side length rectanglesstreaming model

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved algorithm for Klee's measure problem on fat boxes
• An in-place algorithm for Klee's measure problem in two dimensions
• Approximating the volume of unions and intersections of high-dimensional geometric objects
• Two improved range-efficient algorithms for \(F_0\) estimation
• A (slightly) faster algorithm for Klee's measure problem
• Can the Measure of ∪ n 1 [ a i , b i be Computed in Less Than O(n logn) Steps?]
• The measure problem for rectangular ranges in d-space
• New Upper Bounds in Klee’s Measure Problem
• On the complexity of computing the measure of ∪[a _i ,b _i ]
• PARALLEL CONSTRUCTION OF QUADTREES AND QUALITY TRIANGULATIONS
• Range‐Efficient Counting of Distinct Elements in a Massive Data Stream

This page was built for publication: Efficient transformations for Klee's measure problem in the streaming model