Pages that link to "Item:Q5938672"
From MaRDI portal
The following pages link to An efficient algorithm for computing the maximum empty rectangle in three dimensions (Q5938672):
Displaying 5 items.
- Efficient algorithms for the largest rectangle problem (Q1193696) (← links)
- On the number of maximum empty boxes amidst \(n\) points (Q1745207) (← links)
- On the largest empty axis-parallel box amidst \(n\) points (Q1950392) (← links)
- Maximal empty boxes amidst random points (Q5891110) (← links)
- Faster algorithms for largest empty rectangles and boxes (Q6174805) (← links)