Pages that link to "Item:Q293194"
From MaRDI portal
The following pages link to Enclosing \(k\) points in the smallest axis parallel rectangle (Q293194):
Displaying 19 items.
- Covering points by disjoint boxes with outliers (Q617548) (← links)
- On the density and discrepancy of a 2D point set with applications to thermal analysis of VLSI chips (Q963432) (← links)
- Algorithms for optimal outlier removal (Q1026234) (← links)
- Smallest \(k\)-point enclosing rectangle and square of arbitrary orientation (Q1041762) (← links)
- Parallel enclosing rectangle on SIMD machines (Q1186184) (← links)
- Computing a minimum-width square or rectangular annulus with outliers (Q1624585) (← links)
- Smallest \(k\)-enclosing rectangle revisited (Q2046452) (← links)
- Expected size of random Tukey layers and convex layers (Q2123288) (← links)
- Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points (Q2331206) (← links)
- Quantile approximation for robust statistical estimation and \(k\)-enclosing problems (Q2708040) (← links)
- On the construction of combined \(k\)-fault-tolerant Hamiltonian graphs (Q2719848) (← links)
- Placing two axis-parallel squares to maximize the number of enclosed points (Q2792797) (← links)
- Computing a Minimum-Width Square or Rectangular Annulus with Outliers (Q2817885) (← links)
- Enclosing a Set of Objects by Two Minimum Area Rectangles (Q3837385) (← links)
- ON PIERCING SETS OF AXIS-PARALLEL RECTANGLES AND RINGS (Q4949987) (← links)
- Smallest k-enclosing rectangle revisited (Q5088950) (← links)
- (Q5111741) (← links)
- A generalized pivotal quantity approach to portfolio selection (Q5138630) (← links)
- Square and Rectangle Covering with Outliers (Q5321703) (← links)
