Pages that link to "Item:Q582097"
From MaRDI portal
The following pages link to A new algorithm for the largest empty rectangle problem (Q582097):
Displaying 25 items.
- On the maximum empty rectangle problem (Q796307) (← links)
- On the minimum-area rectangular and square annulus problem (Q827319) (← links)
- Fast algorithms for finding disjoint subsequences with extremal densities (Q850123) (← links)
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation (Q860396) (← links)
- A note on finding a maximum empty rectangle (Q1079570) (← links)
- An efficient algorithm for maxdominance, with applications (Q1115629) (← links)
- Efficient algorithms for the largest rectangle problem (Q1193696) (← links)
- An optimal algorithm for rectangle placement (Q1306372) (← links)
- Mining for empty spaces in large data sets. (Q1401282) (← links)
- On finding an empty staircase polygon of largest area (width) in a planar point-set (Q1405008) (← links)
- A new algorithm for rectangle enclosure reporting (Q1607019) (← links)
- Maximal empty coboids among points and blocks (Q1806576) (← links)
- A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids (Q1894952) (← links)
- On the largest empty axis-parallel box amidst \(n\) points (Q1950392) (← links)
- An arbitrarily high-order three-dimensional Cartesian-grid method for reconstructing interfaces from volume fraction fields (Q2126971) (← links)
- Variations of largest rectangle recognition amidst a bichromatic point set (Q2201768) (← links)
- Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data (Q2373724) (← links)
- Empty squares in arbitrary orientation among points (Q2700381) (← links)
- Polynomial Time Algorithms for Bichromatic Problems (Q2971630) (← links)
- Maximal strips data structure to represent free space on partially reconfigurable FPGAs (Q3399241) (← links)
- On Computing a Largest Empty Arbitrarily Oriented Rectangle (Q4818583) (← 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)
