About the algebraic solutions of smallest enclosing cylinders problems
- 103 Downloads
Given n points in Euclidean space E d , we propose an algebraic algorithm to compute the best fitting (d−1)-cylinder. This algorithm computes the unknown direction of the axis of the cylinder. The location of the axis and the radius of the cylinder are deduced analytically from this direction. Special attention is paid to the case d = 3 when n = 4 and n = 5. For the former, the minimal radius enclosing cylinder is computed algebrically from constrained minimization of a quartic form of the unknown direction of the axis. For the latter, an analytical condition of existence of the circumscribed cylinder is given, and the algorithm reduces to find the zeroes of an one unknown polynomial of degree at most 6. In both cases, the other parameters of the cylinder are deduced analytically. The minimal radius enclosing cylinder is computed analytically for the regular tetrahedron and for a trigonal bipyramids family with a symmetry axis of order 3.
KeywordsBest fitting cylinder Smallest enclosing cylinder Minimal cylinder Circumscribed cylinder through five points Numerical algorithm
Mathematics Subject Classification (2010)51M04 51N15 65D10 65K05 90C26
Unable to display preview. Download preview PDF.
- 5.Edelsbrunner, H.: Constructing convex hulls. In: Brauer, W., Rozenberg, G., Salomaa, A. (eds.) Algorithms in Combinatorial Geometry, Chap. 8, pp. 139–176. Springer, Berlin (1987)Google Scholar
- 6.Eigenwillig, A., Kettner, L., Krandick, W., Mehlhorn, K., Schmitt, S., Wolpert, N.: A Descartes algorithm for polynomials with bit-stream coefficients. In: Computer Algebra in Scientific Computing: 8th International Workshop, CASC 2005, Kalamata, Greece, LNCS, 3718, 138–149 (2005)Google Scholar
- 7.Gill, P.E., Murray, W., Wright, M.H.: Non linear constraints. In: Practical Optimization, pp. 205–260. JAI Press, Emerald Group Publishing Ltd., London, 2008Google Scholar
- 10.Petitjean M.: Solving the geometric docking problem for planar and spatial sets. Internet Electron. J. Mol. Des. 1, 185–192 (2002)Google Scholar
- 12.Preparata, F.P., Shamos, M.I.: Convex hulls: basic algorithms. In: Computational Geometry, Chap. 3, pp. 95–149. Springer, Berlin (1985)Google Scholar