Maximal and minimal balls

DOI10.1016/0925-7721(93)90017-ZMaRDI QIDQ1314525zbMATH OpenFDO

Authors Rex A. Dwyer

Publication date 17 February 1994

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0925-7721(93)90017-Z

zbMATH Keywords

convex hullmove-to-front strategyset of balls

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Maximal balleans
• On the smallest enclosing balls
• Minimax balayage theorem and an inscribed ball problem
• Finite ultrametric balls
• Maximal Balls of Linearly Separable Sets
• Computational Science and Its Applications – ICCSA 2004
• Optimal core-sets for balls
• scientific article; zbMATH DE number 782635
• scientific article; zbMATH DE number 18669

Cites work

• A convex hull algorithm for discs, and applications
• How to reduce the average complexity of convex hull finding algorithms
• scientific article; zbMATH DE number 432763 (Why is no real title available?)
• scientific article; zbMATH DE number 3176961 (Why is no real title available?)
• Moment inequalities for random variables in computational geometry
• Stochastical approximation of convex bodies
• The convex hull of random balls

Cited in

(2)

• Maximal Balls of Linearly Separable Sets
• On the smallest enclosing balls

This page was built for publication: Maximal and minimal balls

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