Abstract
Given the equations of the surfaces, our goal is to construct a univariate polynomial one of the zeroes of which coincides with the square of the distance between these surfaces. To achieve this goal we employ the Elimination Theory methods.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Schneider, P.J., Eberly, D.H.: Geometric Tools for Computer Graphics. Elsevier, San Francisco (2003)
Lin, A., Han, S.-P.: On the distance between two ellipsoids. SIAM J. on Optimization 13, 298–308 (2002)
Uteshev, A.Y., Cherkasov, T.M.: The search for maximum of a polynomial. J. Symbolic Computation 25, 587–618 (1998)
Kalinina, E.A., Uteshev, A.Y.: Elimination Theory (in Russian). St. Petersburg State University (2002)
Bikker, P., Uteshev, A.Y.: On the Bézout construction of the resultant. J. Symbolic Computation 28, 45–88 (1999)
Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, Cambridge (1986)
Faddeev, D.K., Faddeeva, V.N.: Computational Methods of Linear Algebra. Freeman, San Francisco (1963)
Proskuryakov, I.V.: Problems in Linear Algebra. Mir, Moscow (1978)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Uteshev, A.Y., Yashina, M.V. (2007). 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) Computer Algebra in Scientific Computing. CASC 2007. Lecture Notes in Computer Science, vol 4770. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75187-8_31
Download citation
DOI: https://doi.org/10.1007/978-3-540-75187-8_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75186-1
Online ISBN: 978-3-540-75187-8
eBook Packages: Computer ScienceComputer Science (R0)