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