An efficient algorithm for computing the maximum empty rectangle in three dimensions (Q5938672): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 23:42, 4 March 2024
scientific article; zbMATH DE number 1630206
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm for computing the maximum empty rectangle in three dimensions |
scientific article; zbMATH DE number 1630206 |
Statements
An efficient algorithm for computing the maximum empty rectangle in three dimensions (English)
0 references
1 October 2001
0 references
computational geometry
0 references
maximum empty hyper rectangle
0 references
space sweep paradigm
0 references
three dimensions
0 references
segment-interval tree
0 references
expected case complexity
0 references
