Statements (20)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:application |
gptkb:geographic_information_systems
computer graphics database systems |
| gptkbp:complexity2D |
O(n log n)
|
| gptkbp:complexityHigherD |
O(n^{d/2})
|
| gptkbp:describes |
computing the measure of the union of n d-dimensional rectangles
|
| gptkbp:field |
gptkb:geometry
|
| gptkbp:hasDimensionParameter |
d
|
| https://www.w3.org/2000/01/rdf-schema#label |
Klee's measure problem
|
| gptkbp:input |
n axis-aligned rectangles
|
| gptkbp:introducedIn |
1977
|
| gptkbp:namedAfter |
gptkb:Victor_Klee
|
| gptkbp:openProblem |
optimal complexity for d > 2
|
| gptkbp:output |
Lebesgue measure of union
|
| gptkbp:relatedTo |
computational complexity
rectangle union sweep line algorithm |
| gptkbp:bfsParent |
gptkb:Victor_Klee
|
| gptkbp:bfsLayer |
5
|