Klee's measure problem
id:
klee-s-measure-problem-197-7743907
title:
Klee's measure problem
text:
In computational geometry, Klee's measure problem is the problem of determining how efficiently the measure of a union of (multidimensional) rectangular ranges can be computed. Here, a d-dimensional rectangular range is defined to be a Cartesian product of d intervals of real numbers, which is a subset of Rd. The problem is named after Victor Klee, who gave an algorithm for computing the length of a union of intervals which was later shown to be optimally efficient in the sense of computational
brand slug:
wiki
category slug:
encyclopedia
description:
Computational geometry problem
original url:
https://en.wikipedia.org/wiki/Klee%27s_measure_problem
date created:
date modified:
2023-12-17T12:13:49Z
main entity:
{"identifier":"Q6420068","url":"https://www.wikidata.org/entity/Q6420068"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/c/c8/Set_of_rectangles_%28Klee%27s_Trellis%29.svg","width":354,"height":354}
fields total:
13
integrity:
15