Computing the Largest Empty Rectangle
From MaRDI portal
Recommendations
Cited in
(46)- A note on the largest empty rectangle problem
- Geometric applications of a matrix-searching algorithm
- The orthogonal convex skull problem
- An efficient algorithm for maxdominance, with applications
- Efficient algorithms for the largest rectangle problem
- Mining for empty spaces in large data sets.
- On finding an empty staircase polygon of largest area (width) in a planar point-set
- A data mining approach for visual and analytical identification of neurorehabilitation ranges in traumatic brain injury cognitive rehabilitation
- A note on minimal dispersion of point sets in the unit cube
- The minimal \(k\)-dispersion of point sets in high dimensions
- On the number of maximum empty boxes amidst \(n\) points
- Finding a largest rectangle inside a digital object and rectangularization
- Anchored rectangle and square packings
- 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
- Deterministic constructions of high-dimensional sets with small dispersion
- 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?)
- scientific article; zbMATH DE number 4213497 (Why is no real title available?)
- scientific article; zbMATH DE number 4033105 (Why is no real title available?)
- On Computing a Largest Empty Arbitrarily Oriented Rectangle
- Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications
- A new algorithm for the largest empty rectangle problem
- 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
- Finding the largest separating rectangle among two point sets
- The limit of \(L_p\) Voronoi diagrams as \(p\rightarrow 0\) is the bounding-box-area Voronoi diagram
- Sequential and parallel algorithms for finding a maximum convex polygon
- Finding the largest area axis-parallel rectangle in a polygon
- An efficient method for obtaining the maximum k-gon in a closed contour with obstacles
- On computing the maximum-volume bichromatic separating box
- Faster algorithms for largest empty rectangles and boxes
- 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
- Applications of generalized matrix searching to geometric algorithms
- Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions
- On the density and discrepancy of a 2D point set with applications to thermal analysis of VLSI chips
This page was built for publication: Computing the Largest Empty Rectangle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3747743)
