An improved algorithm for approximating the radii of point sets

DOI10.1007/B11961MaRDI QIDQ5900932zbMATH OpenOpenAlexFDO

Authors Yinyu Ye, Jiawei Zhang

Publication date 26 May 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b11961

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Randomized algorithms (68W20) Approximation algorithms (68W25) Semidefinite programming (90C22)

Recommendations

• Approximating the Radii of Point Sets
• Deterministic and randomized polynomial‐time approximation of radii
• High-dimensional shape fitting in linear time
• High-dimensional shape fitting in linear time
• Approximation algorithms for minimum-width annuli and shells

Cited in

(5)

• A fully polynomial time approximation scheme for the smallest diameter of imprecise points
• scientific article; zbMATH DE number 4035223 (Why is no real title available?)
• A Newton Based Radius Reduction Algorithm for Nearest Point Problems in Pos Cones
• Approximating the Radii of Point Sets
• Fast subspace approximation via greedy least-squares

This page was built for publication: An improved algorithm for approximating the radii of point sets

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