Computing a minimum-width square or rectangular annulus with outliers
From MaRDI portal
Publication:1624585
DOI10.1016/j.comgeo.2018.08.002zbMath1476.68267OpenAlexW2890379719WikidataQ129280617 ScholiaQ129280617MaRDI QIDQ1624585
Publication date: 16 November 2018
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2018.08.002
Related Items (3)
On the minimum-area rectangular and square annulus problem ⋮ Cause I'm a genial imprecise point: outlier detection for uncertain data ⋮ Minimum-width annulus with outliers: circular, square, and rectangular cases
Cites Work
- Unnamed Item
- Enclosing \(k\) points in the smallest axis parallel rectangle
- Minimum-width rectangular annulus
- Finding the upper envelope of n line segments in O(n log n) time
- Covering points by disjoint boxes with outliers
- An optimal \(O(n\log n)\) algorithm for finding an enclosing planar rectilinear annulus of minimum width
- Algorithms for optimal outlier removal
- Improved bounds for planar \(k\)-sets and related problems
- Computing a minimum-width square annulus in arbitrary orientation
- Geometric applications of a randomized optimization technique
- Applications of random sampling in computational geometry. II
- On geometric optimization with few violated constraints
- Finding k points with minimum diameter and related problems
- Generalized Selection and Ranking: Sorted Matrices
- AN OPTIMAL ALGORITHM FOR COMPUTING (≤K)-LEVELS, WITH APPLICATIONS
This page was built for publication: Computing a minimum-width square or rectangular annulus with outliers
