Skip to main content
SpringerLink
Log in

Fitting enclosing cylinders to data in R n

  • Original Paper
  • Published:
Numerical Algorithms Aims and scope Submit manuscript

Abstract

A simple iterative algorithm is given for finding a stationary point of the (non-convex) problem of finding the smallest enclosing (n–d)-cylinder to discrete data in R n, that is a cylinder whose axis is a d-dimensional linear manifold. An important special case is the problem of finding the smallest enclosing (usual) cylinder, when n=3 and d=1. The method is based on the solution of a sequence of second order cone programming problems, which can be efficiently solved by interior point methods and for which good software packages are available.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Agarwal, P.K., Aronov, B., Sharir, M.: Line traversals of balls and smallest enclosing cylinders in three dimensions. Discrete Comput. Geom. 21, 373–388 (1999)

    Article  MathSciNet  Google Scholar 

  2. Al-Subaihi, I., Watson, G.A.: The use of the l 1 and l ∞ norms in parametric fitting of curves and surfaces to data. Appl. Numer. Anal. Comput. Math. 1, 363–376 (2004)

    Article  MathSciNet  Google Scholar 

  3. Brenberg, R., Theobald, T.: Algebraic methods for computing smallest enclosing and circumscribing cylinders of simplices. Appl. Algebra Eng. Commun. Comput. 14, 439–460 (2004)

    Article  Google Scholar 

  4. Brandenberg, R., Theobald, T.: Radii minimal projections of polytopes and constrained optimization of symmetric polynomials. Adv. Geom. 6, 71–83 (2006)

    Article  MathSciNet  Google Scholar 

  5. Chan, T.M.: Approximating the diameter, width, smallest enclosing cylinder, and minimum width annulus. Int. J. Comput. Geom. Appl. 12, 67–85 (2002)

    Article  Google Scholar 

  6. Gritzmann, P., Klee, V.: Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces. Math. Program. 59(A), 163–213 (1993)

    Article  MathSciNet  Google Scholar 

  7. Lobo, M.S., Vandenberghe, L., Boyd, S.: SOCP: Software for second-order cone programming. User’s guide. Stanford report (1997)

  8. The MOSEK optimization software. http://www.mosek.com

  9. Nelder, J.A., Mead, R.: A simplex method for function minimization. Comput. J. 7, 308–313 (1965)

    Google Scholar 

  10. Press, W., Teukolsky, S., Wetterling, W., Flannery, B.: Numerical Recipes in C. Cambridge University Press, Cambridge (1988)

    MATH  Google Scholar 

  11. Schömar, E., Sellen, J., Teichmann, M., Yap, C.: Smallest enclosing cylinders. Algorithmica 27, 170–186 (2000)

    Article  MathSciNet  Google Scholar 

  12. SeDuMi: Advanced Optimization Laboratory. http://sedumi.mcmaster.ca/ (McMaster University)

  13. Suresh, K., Voelcker, H.B.: New challenges in dimensional metrology: a case study based on “size”. Manuf. Rev. 7, 292–303 (1994)

    Google Scholar 

  14. Toh, K.C., Tutuncu, R.H., Todd, M.J.: SDPT3. http://www.math.nus.edu.sg/~mattohkc/sdpt3.html

  15. Watson, G.A.: Approximation Theory and Numerical Methods. Wiley, Chichester (1980)

    MATH  Google Scholar 

  16. Watson, G.A.: The solution of generalized least squares problems. In: Schempp, W., Zeller, K. (eds.) Multivariate Approximation Theory ISNM 75, vol. 3, pp. 388–400. Birkhäuser Verlag, Basel (1985)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Dundee, Dundee, DD1 4HN, Scotland

    G. Alistair Watson

Authors
  1. G. Alistair Watson
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to G. Alistair Watson.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Watson, G.A. Fitting enclosing cylinders to data in R n . Numer Algor 43, 189–196 (2006). https://doi.org/10.1007/s11075-006-9054-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11075-006-9054-2

Keywords

Search

Navigation