An efficient algorithm for computing the maximum empty rectangle in three dimensions (Q5938672): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0020-0255(00)00047-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2062166254 / rank | |||
Normal rank | |||
Latest revision as of 09:08, 30 July 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
