Skip to main content

Distance Evaluation Between an Ellipse and an Ellipsoid

  • Conference paper
  • First Online:
  • 769 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9301))

Abstract

We solve in ℝn the problem of distance evaluation between a quadric and a manifold obtained as the intersection of another quadric and a linear manifold. Application of Elimination Theory algorithms for the system of algebraic equations of the Lagrange multipliers method results in construction of the distance equation, i.e., a univariate algebraic equation one of the zeros of which (generically minimal positive) coincides with the square of the distance between considered manifolds. We also deduce the necessary and sufficient algebraic conditions under which the manifolds intersect and propose an algorithm for finding the coordinates of their nearest points.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cox, D., Little, J., O’Shea, D.: Ideals, Varieties, and Algorithms. Springer, New York (2007)

    Google Scholar 

  2. Gelfand, I.M., Kapranov, M.M., Zelevinsky, A.V.: Discriminants, Resultants and Multidimensional Determinants. Springer, New York (1994)

    Google Scholar 

  3. Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press (1986)

    Google Scholar 

  4. Kalinina, E.A., Uteshev, A.Y.: Determination of the number of roots of a polynominal lying in a given algebraic domain. Linear Algebra Appl. 185, 61–81 (1993)

    Google Scholar 

  5. Netto, E.: Rationale funktionen einer veränderlichen; ihre nullstellen. In: Encyklopädie der Mathematischen Wissenschaften, vol. I, Part 1, pp. 227–253. Teubner, Leipzig (1898)

    Google Scholar 

  6. Perron, O.: Algebra, vol. 1. De Gruyter, Berlin (1927)

    Google Scholar 

  7. Schneider, P.J., Eberly, D.H.: Geometric Tools for Computer Graphics. Elsevier, San Francisco (2003)

    Google Scholar 

  8. Uteshev, A.Y., Yashina, M.V.: Distance computation from an ellipsoid to a linear or a quadric surface in IRn. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2007. LNCS, vol. 4770, pp. 392–401. Springer, Heidelberg (2007)

    Google Scholar 

  9. Uteshev, A.Y., Yashina, M.V.: Metric problems for quadrics in multidimensional space. J. Symb. Comput. 68, 287–315 (2015)

    Google Scholar 

  10. Wang, W., Krasauskas, R.: Interference analysis of conics and quadrics. Contemp. Mathematics 334, 25–36 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alexei Yu. Uteshev .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Uteshev, A.Y., Yashina, M.V. (2015). Distance Evaluation Between an Ellipse and an Ellipsoid. In: Gerdt, V., Koepf, W., Seiler, W., Vorozhtsov, E. (eds) Computer Algebra in Scientific Computing. CASC 2015. Lecture Notes in Computer Science(), vol 9301. Springer, Cham. https://doi.org/10.1007/978-3-319-24021-3_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-24021-3_34

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-24020-6

  • Online ISBN: 978-3-319-24021-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics