TY - JOUR

T1 - An efficient algorithm for computing the maximum empty rectangle in three dimensions

AU - Datta, Amitava

AU - Soundaralakshmi, S.

PY - 2000

Y1 - 2000

N2 - Given a set P of n points in three dimensions within a bounding hyper rectangle (BHR), the maximum empty hyper rectangle (MEHR) problem is to find a maximum volume or surface area hyper rectangle R within BHR such that R does not contain any point from the set P. We present an efficient algorithm for computing the MEHR. The worst and expected case time complexities of our algorithm are O(n(3)) and O(n log(4) n), respectively. The worst and expected case space complexities of our algorithm are O(n(2)log n) and O(n log(3) n), respectively. No previous algorithm was known for this problem. (C) 2000 Elsevier Science Inc. All rights reserved.

AB - Given a set P of n points in three dimensions within a bounding hyper rectangle (BHR), the maximum empty hyper rectangle (MEHR) problem is to find a maximum volume or surface area hyper rectangle R within BHR such that R does not contain any point from the set P. We present an efficient algorithm for computing the MEHR. The worst and expected case time complexities of our algorithm are O(n(3)) and O(n log(4) n), respectively. The worst and expected case space complexities of our algorithm are O(n(2)log n) and O(n log(3) n), respectively. No previous algorithm was known for this problem. (C) 2000 Elsevier Science Inc. All rights reserved.

U2 - 10.1016/S0020-0255(00)00047-5

DO - 10.1016/S0020-0255(00)00047-5

M3 - Article

VL - 128

SP - 43

EP - 65

JO - Information Sciences

JF - Information Sciences

SN - 0020-0255

ER -