Minimum-width double-strip and parallelogram annulus
From MaRDI portal
Publication:784485
DOI10.1016/j.tcs.2020.05.045zbMath1455.68228arXiv1911.07504OpenAlexW2991015355MaRDI QIDQ784485
Publication date: 3 August 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.07504
computational geometryexact algorithmarbitrary orientationdouble-stripgeometric dualparallelogram annulustwo-line center
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Unnamed Item
- Minimum-width rectangular annulus
- Finding the upper envelope of n line segments in O(n log n) time
- An optimal \(O(n\log n)\) algorithm for finding an enclosing planar rectilinear annulus of minimum width
- Establishment of a pair of concentric circles with the minimum radial separation for assessing roundness error
- On some geometric selection and optimization problems via sorted matrices
- Computing a minimum-width square annulus in arbitrary orientation
- Efficient randomized algorithms for some geometric optimization problems
- Applications of Parametric Searching in Geometric Optimization
- The two-line center problem from a polar view: a new algorithm and data structure
This page was built for publication: Minimum-width double-strip and parallelogram annulus