Pages that link to "Item:Q1193696"
From MaRDI portal
The following pages link to Efficient algorithms for the largest rectangle problem (Q1193696):
Displaying 14 items.
- Finding the largest area axis-parallel rectangle in a polygon (Q676593) (← links)
- A note on finding a maximum empty rectangle (Q1079570) (← links)
- An optimal algorithm for rectangle placement (Q1306372) (← links)
- On finding an empty staircase polygon of largest area (width) in a planar point-set (Q1405008) (← links)
- Finding a largest rectangle inside a digital object and rectangularization (Q1747507) (← links)
- On the largest empty axis-parallel box amidst \(n\) points (Q1950392) (← links)
- Faster algorithms for growing prioritized disks and rectangles (Q2330036) (← links)
- Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points (Q2331206) (← links)
- Maximal strips data structure to represent free space on partially reconfigurable FPGAs (Q3399241) (← links)
- (Q5136216) (← links)
- Maximal empty boxes amidst random points (Q5891110) (← links)
- An efficient algorithm for computing the maximum empty rectangle in three dimensions (Q5938672) (← links)
- Fast parallel algorithms for the maximum empty rectangle problem. (Q5955753) (← links)
- Faster algorithms for largest empty rectangles and boxes (Q6174805) (← links)
