Enclosing \(k\) points in the smallest axis parallel rectangle
From MaRDI portal
Publication:293194
DOI10.1016/S0020-0190(97)00212-3zbMath1338.68269MaRDI QIDQ293194
Publication date: 9 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019097002123?np=y
Related Items (17)
Expected size of random Tukey layers and convex layers ⋮ Computing a minimum-width square or rectangular annulus with outliers ⋮ Square and Rectangle Covering with Outliers ⋮ Covering points by disjoint boxes with outliers ⋮ QUANTILE APPROXIMATION FOR ROBUST STATISTICAL ESTIMATION AND k-ENCLOSING PROBLEMS ⋮ A generalized pivotal quantity approach to portfolio selection ⋮ On the construction of combinedk-fault-tolerant Hamiltonian graphs ⋮ On the density and discrepancy of a 2D point set with applications to thermal analysis of VLSI chips ⋮ Placing Two Axis-Parallel Squares to Maximize the Number of Enclosed Points ⋮ ON PIERCING SETS OF AXIS-PARALLEL RECTANGLES AND RINGS ⋮ Unnamed Item ⋮ Smallest \(k\)-enclosing rectangle revisited ⋮ Computing a Minimum-Width Square or Rectangular Annulus with Outliers ⋮ Smallest k-enclosing rectangle revisited ⋮ Algorithms for optimal outlier removal ⋮ Smallest \(k\)-point enclosing rectangle and square of arbitrary orientation ⋮ Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points
Cites Work
- Unnamed Item
- L-infinity interdistance selection by parametric search
- Iterated nearest neighbors and finding minimal polytopes
- On geometric optimization with few violated constraints
- Finding k points with minimum diameter and related problems
- Generalized Selection and Ranking: Sorted Matrices
- On some geometric selection and optimization problems via sorted matrices
- Static and dynamic algorithms for k-point clustering problems
This page was built for publication: Enclosing \(k\) points in the smallest axis parallel rectangle
