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

DOI10.1016/S0020-0255(00)00047-5zbMath0969.68600OpenAlexW2062166254MaRDI QIDQ5938672

Amitava Datta, Subbiah Soundaralakshmi

Publication date: 1 October 2001

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0255(00)00047-5

zbMATH Keywords

three dimensionscomputational geometryexpected case complexitymaximum empty hyper rectanglesegment-interval treespace sweep paradigm

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies and applications (68U99)

Related Items (3)

On the largest empty axis-parallel box amidst \(n\) points ⋮ On the number of maximum empty boxes amidst \(n\) points ⋮ Maximal Empty Boxes Amidst Random Points

Cites Work

• Unnamed Item
• Unnamed Item
• A new algorithm for the largest empty rectangle problem
• On the maximum empty rectangle problem
• A note on finding a maximum empty rectangle
• An efficient algorithm for maxdominance, with applications
• Efficient algorithms for the largest rectangle problem
• Computing the Largest Empty Rectangle
• Direct dominance of points
• Fast algorithms for direct enclosures and direct dominances
• On the Average Number of Maxima in a Set of Vectors and Applications

This page was built for publication: An efficient algorithm for computing the maximum empty rectangle in three dimensions