Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus

DOI10.1145/336154.336216MaRDI QIDQ5361541zbMATH OpenOpenAlexFDO

Authors Timothy M. Chan

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

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Cited in

(5)

• A (\(1+{\varepsilon}\))-approximation algorithm for 2-line-center
• Facility location and the geometric minimum-diameter spanning tree.
• Locating a minisum annulus: a new partial coverage distance model
• Lines tangent to $2n-2$ spheres in ${\mathbb R}^n$
• Approximate minimum enclosing balls in high dimensions using core-sets

This page was built for publication: Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361541)