Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus
From MaRDI portal
Publication:5361541
DOI10.1145/336154.336216zbMath1374.68650OpenAlexW2022307052MaRDI QIDQ5361541
Publication date: 29 September 2017
Published in: Proceedings of the sixteenth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/336154.336216
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items (5)
Locating a minisum annulus: a new partial coverage distance model ⋮ A (\(1+{\varepsilon}\))-approximation algorithm for 2-line-center ⋮ Facility location and the geometric minimum-diameter spanning tree. ⋮ Approximate minimum enclosing balls in high dimensions using core-sets ⋮ Lines tangent to $2n-2$ spheres in ${\mathbb R}^n$
This page was built for publication: Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus