Smallest k-enclosing rectangle revisited
From MaRDI portal
Publication:5088950
DOI10.4230/LIPIcs.SoCG.2019.23OpenAlexW2920804372MaRDI QIDQ5088950
Timothy M. Chan, Sariel Har-Peled
Publication date: 18 July 2022
Full work available at URL: https://doi.org/10.4230/LIPIcs.SoCG.2019.23
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enclosing \(k\) points in the smallest axis parallel rectangle
- Necklaces, convolutions, and \(X+Y\)
- Relative \((p,\varepsilon )\)-approximations in geometry
- Algorithms for optimal outlier removal
- Smallest \(k\)-point enclosing rectangle and square of arbitrary orientation
- A linear-time algorithm for a special case of disjoint set union
- Reporting points in halfspaces
- Approximate closest-point queries in high dimensions
- Approximate nearest neighbor queries revisited
- Iterated nearest neighbors and finding minimal polytopes
- Fast algorithms for computing the smallest \(k\)-enclosing circle
- Geometric applications of a randomized optimization technique
- Maximum-weight planar boxes in \(O(n^2)\) time (and better)
- Towards polynomial lower bounds for dynamic problems
- Clustered Integer 3SUM via Additive Combinatorics
- Finding k points with minimum diameter and related problems
- Efficiency of a Good But Not Linear Set Union Algorithm
- Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky
- Tight Hardness Results for Maximum Weight Rectangles
- Static and Dynamic Algorithms for k-Point Clustering Problems
- On Problems Equivalent to (min,+)-Convolution
- Covering many points with a small-area box
- Faster all-pairs shortest paths via circuit complexity
This page was built for publication: Smallest k-enclosing rectangle revisited
