About the algebraic solutions of smallest enclosing cylinders problems
Publication:694570
DOI10.1007/s00200-012-0171-yzbMath1257.51010arXiv1008.5259OpenAlexW3103412232MaRDI QIDQ694570
Publication date: 13 December 2012
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1008.5259
numerical algorithmbest fitting cylindercircumscribed cylinder through five pointsminimal cylindersmallest enclosing cylinder
Numerical smoothing, curve fitting (65D10) Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Elementary problems in Euclidean geometries (51M04) Projective analytic geometry (51N15)
Cites Work
- Unnamed Item
- Unnamed Item
- Fitting enclosing cylinders to data in \(\mathbb R^n\)
- On the lines in space with equal distances to n given points
- Circular cylinders through four or five points in space
- From shape similarity to shape complementarity: Toward a docking theory
- Algebraic methods for computing smallest enclosing and circumscribing cylinders of simplices
- Smallest enclosing cylinders
- Computer Algebra in Scientific Computing
- Radii minimal projections of polytopes and constrained optimization of symmetric polynomials
This page was built for publication: About the algebraic solutions of smallest enclosing cylinders problems