A new algorithm for the largest empty rectangle problem
From MaRDI portal
Recommendations
Cites work
Cited in
(34)- A note on finding a maximum empty rectangle
- An efficient algorithm for maxdominance, with applications
- Efficient algorithms for the largest rectangle problem
- An optimal algorithm for rectangle placement
- Mining for empty spaces in large data sets.
- On finding an empty staircase polygon of largest area (width) in a planar point-set
- A new algorithm for rectangle enclosure reporting
- Maximal empty coboids among points and blocks
- A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids
- On the largest empty axis-parallel box amidst \(n\) points
- An arbitrarily high-order three-dimensional Cartesian-grid method for reconstructing interfaces from volume fraction fields
- Variations of largest rectangle recognition amidst a bichromatic point set
- Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data
- Empty squares in arbitrary orientation among points
- Polynomial time algorithms for bichromatic problems
- Fast sequential and parallel algorithms for finding the largest rectangle separating two sets
- scientific article; zbMATH DE number 3883624 (Why is no real title available?)
- Maximal strips data structure to represent free space on partially reconfigurable FPGAs
- Computing the Largest Empty Rectangle
- Largest empty rectangle among a point set
- scientific article; zbMATH DE number 2077118 (Why is no real title available?)
- scientific article; zbMATH DE number 2080472 (Why is no real title available?)
- On Computing a Largest Empty Arbitrarily Oriented Rectangle
- Maximal empty boxes amidst random points
- An efficient algorithm for computing the maximum empty rectangle in three dimensions
- Fast parallel algorithms for the maximum empty rectangle problem.
- Faster algorithms for largest empty rectangles and boxes
- An efficient method for obtaining the maximum k-gon in a closed contour with obstacles
- Parametric algorithm to find the largest empty rectangle from a set of line segments
- Anisotropic rectangular metric for polygonal surface remeshing
- On the maximum empty rectangle problem
- On the minimum-area rectangular and square annulus problem
- Fast algorithms for finding disjoint subsequences with extremal densities
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation
This page was built for publication: A new algorithm for the largest empty rectangle problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q582097)
