About the algebraic solutions of smallest enclosing cylinders problems

DOI10.1007/S00200-012-0171-YzbMATH Open1257.51010arXiv1008.5259OpenAlexW3103412232MaRDI QIDQ694570FDOQ694570

Authors: Michel Petitjean 

Publication date: 13 December 2012

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/1008.5259

Recommendations

• Algebraic methods for computing smallest enclosing and circumscribing cylinders of simplices
• Smallest enclosing cylinders
• Radius, diameter, incenter, circumcenter, width and minimum enclosing cylinder for some polyhedral distance functions
• Fitting enclosing cylinders to data in \(\mathbb R^n\)
• Cylinders Through Five Points: Computational Algebra and Geometry

zbMATH Keywords

numerical algorithmbest fitting cylindercircumscribed cylinder through five pointsminimal cylindersmallest enclosing cylinder

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Numerical smoothing, curve fitting (65D10) Nonconvex programming, global optimization (90C26) Projective analytic geometry (51N15) Elementary problems in Euclidean geometries (51M04)

Cites Work

• On the lines in space with equal distances to n given points
• Circular cylinders through four or five points in space
• Smallest enclosing cylinders
• Computer Algebra in Scientific Computing
• Algebraic methods for computing smallest enclosing and circumscribing cylinders of simplices
• On congruent embeddings of a tetrahedron into a circular cylinder
• Radii minimal projections of polytopes and constrained optimization of symmetric polynomials
• From shape similarity to shape complementarity: Toward a docking theory
• Title not available (Why is that?)
• Fitting enclosing cylinders to data in \(\mathbb R^n\)

Cited In (4)

• Fitting enclosing cylinders to data in \(\mathbb R^n\)
• Cylinders Through Five Points: Complex and Real Enumerative Geometry
• Algebraic methods for computing smallest enclosing and circumscribing cylinders of simplices
• Circular cylinders through four or five points in space

This page was built for publication: About the algebraic solutions of smallest enclosing cylinders problems

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