Computing a minimum-width square annulus in arbitrary orientation

DOI10.1016/j.tcs.2016.11.010zbMath1395.68280OpenAlexW2463095684MaRDI QIDQ1705772

Sang Won Bae

Publication date: 16 March 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.11.010

zbMATH Keywords

computational geometrycovering problemarbitrary orientationsquare annulus

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (8)

Geometric separability using orthogonal objects ⋮ On the minimum-area rectangular and square annulus problem ⋮ Computing a minimum-width square or rectangular annulus with outliers ⋮ Empty squares in arbitrary orientation among points ⋮ Minimum-width annulus with outliers: circular, square, and rectangular cases ⋮ Maximum-width empty square and rectangular annulus ⋮ Computing a minimum-width cubic and hypercubic shell ⋮ Minimum-width double-strip and parallelogram annulus

Cites Work

• Unnamed Item
• Unnamed Item
• Minimum-width rectangular annulus
• Offset polygon and annulus placement problems
• 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
• Offset-polygon annulus placement problems
• Efficient randomized algorithms for some geometric optimization problems
• Approximating extent measures of points
• Applications of Parametric Searching in Geometric Optimization
• APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS

This page was built for publication: Computing a minimum-width square annulus in arbitrary orientation