Fitting enclosing cylinders to data in \(\mathbb R^n\)

DOI10.1007/s11075-006-9054-2zbMath1109.65059OpenAlexW2115062384MaRDI QIDQ861741

G. Alistair Watson

Publication date: 30 January 2007

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-006-9054-2

zbMATH Keywords

convergencesimple iterationnon-convex problemsmallest enclosing cylindersecond order cone problemsmoothing, curve fitting

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (2)

About the algebraic solutions of smallest enclosing cylinders problems ⋮ Truncated aggregate homotopy method for nonconvex nonlinear programming

Uses Software

• SOCP
• SDPT3
• Mosek

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Line transversals of balls and smallest enclosing cylinders in three dimensions
• Algebraic methods for computing smallest enclosing and circumscribing cylinders of simplices
• Smallest enclosing cylinders
• Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces
• The Use of thel1 andl? Norms in Fitting Parametric Curves and Surfaces to Data
• APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
• Radii minimal projections of polytopes and constrained optimization of symmetric polynomials
• A Simplex Method for Function Minimization

This page was built for publication: Fitting enclosing cylinders to data in \(\mathbb R^n\)