An improved algorithm for Klee's measure problem on fat boxes
type: Item
instance of: scholarly article
title: An improved algorithm for Klee's measure problem on fat boxes
zbMATH Open document ID: 1375.52006
author: Karl Bringmann
published in: Computational Geometry
publication date: 2012-05-18T00:00:00Z
Mathematics Subject Classification ID: 52A38
Mathematics Subject Classification ID: 52A55
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 6036382
zbMATH Keywords: geometric data structures
zbMATH Keywords: union of cubes
MaRDI profile type: Publication
full work available at URL: j.comgeo.2011.12.001
OpenAlex ID: W2055560312
cites work: An improved algorithm for computing the volume of the union of cubes
cites work: Q3602886
cites work: Voronoi diagrams in higher dimensions under certain polyhedral distance functions
cites work: Approximating the Volume of Unions and Intersections of High-Dimensional Geometric Objects
cites work: Semi-Online Maintenance of Geometric Optima and Measures
cites work: A (slightly) faster algorithm for Klee's measure problem
cites work: Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles
cites work: On the complexity of computing the measure of ∪[a i ,b i ]
cites work: Q2934665
cites work: Can the Measure of ∪ n 1 [ a i , b i ] be Computed in Less Than O(n logn) Steps?
cites work: Q3688439
cites work: New Upper Bounds in Klee’s Measure Problem
DOI: 10.1016/J.COMGEO.2011.12.001
description: scientific article; zbMATH DE number 6036382