About the algebraic solutions of smallest enclosing cylinders problems
From MaRDI portal
Publication:694570
DOI10.1007/s00200-012-0171-yzbMath1257.51010arXiv1008.5259MaRDI 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 algorithm; best fitting cylinder; circumscribed cylinder through five points; minimal cylinder; smallest enclosing cylinder
65D10: Numerical smoothing, curve fitting
65K05: Numerical mathematical programming methods
90C26: Nonconvex programming, global optimization
51M04: Elementary problems in Euclidean geometries
51N15: Projective analytic geometry
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