Klee's measure problem
Statement
Determine the optimal complexity of computing the volume of the union of axis-aligned boxes in fixed dimension at least three. In particular, is there a near-linear three-dimensional algorithm or an lower bound, and can fat or equal-sized boxes be handled faster?
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.