Pages that link to "Item:Q796307"
From MaRDI portal
The following pages link to On the maximum empty rectangle problem (Q796307):
Displaying 44 items.
- A new algorithm for the largest empty rectangle problem (Q582097) (← links)
- Finding the largest area axis-parallel rectangle in a polygon (Q676593) (← links)
- Finding squares and rectangles in sets of points (Q802873) (← links)
- On the minimum-area rectangular and square annulus problem (Q827319) (← links)
- On finding a widest empty 1-corner corridor (Q844199) (← 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)
- 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 data mining approach for visual and analytical identification of neurorehabilitation ranges in traumatic brain injury cognitive rehabilitation (Q1668935) (← links)
- A note on minimal dispersion of point sets in the unit cube (Q1686268) (← links)
- A note on the dispersion of admissible lattices (Q1730266) (← links)
- The minimal \(k\)-dispersion of point sets in high dimensions (Q1734695) (← links)
- On the number of maximum empty boxes amidst \(n\) points (Q1745207) (← links)
- Finding a largest rectangle inside a digital object and rectangularization (Q1747507) (← links)
- Planar maximum-box problem revisited (Q1749536) (← links)
- Maximal empty coboids among points and blocks (Q1806576) (← links)
- Cutting rectangles avoiding rectangular defects (Q1808447) (← 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)
- A lower bound for the dispersion on the torus (Q1996949) (← links)
- Mining maximal frequent rectangles (Q2103852) (← links)
- Deterministic constructions of high-dimensional sets with small dispersion (Q2149098) (← 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)
- On the size of the largest empty box amidst a point set (Q2399300) (← links)
- On the rectangle escape problem (Q2402267) (← links)
- Empty squares in arbitrary orientation among points (Q2700381) (← links)
- A good sampling method for guessing rectangles in \([0,1]^2\) (Q2725824) (← links)
- Polynomial Time Algorithms for Bichromatic Problems (Q2971630) (← links)
- Fast sequential and parallel algorithms for finding the largest rectangle separating two sets (Q3210919) (← links)
- Maximal strips data structure to represent free space on partially reconfigurable FPGAs (Q3399241) (← links)
- The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions (Q3557005) (← links)
- (Q3773363) (← links)
- An Upper Bound of the Minimal Dispersion via Delta Covers (Q4611843) (← links)
- On Computing a Largest Empty Arbitrarily Oriented Rectangle (Q4818583) (← links)
- THE LARGEST EMPTY ANNULUS PROBLEM (Q4818587) (← links)
- (Q5743404) (← 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)
- Finding the largest separating rectangle among two point sets (Q6614025) (← links)
