Abstract
This paper presents the first implementation in GeoGebra of an algorithm computing the intersection curve of two quadrics. This approach is based on computing the projection of the intersection curve, also known as cutcurve, determining its singularities and structure and lifting to 3D this plane curve. The considered problem can be used to show some of the difficulties arising when implementing in GeoGebra a geometric algorithm based on the algebraic analysis of the equations defining the considered objects.
Keywords
- GeoGebra
- Cutcurve
- Intersection curve
- Lifting
Second author is partially supported by the Spanish Ministerio de Economia y Competitividad and by the European Regional Development Fund (ERDF), under the project MTM2017-88796-P.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
In the GeoGebra commands presented here, we denote \(\displaystyle x_{\#}\) by x#.
References
Dos Santos, J.M.: Intersection of two surfaces in GeoGebra. Revista do Instituto GeoGebra de São Paulo 6(2), 04–09 (2017)
Dupont, L., Lazard, S., Lazard, D., Petitjean, S.: Near-optimal parameterization of the intersection of quadrics. In: Proceedings of the Annual Symposium on Computational Geometry (2003). https://doi.org/10.1145/777829.777830
Dupont, L., Lazard, D., Lazard, S., Petitjean, S.: Near-optimal parameterization of the intersection of quadrics: II. A classification of pencils. J. Symbolic Comput. (2008). https://doi.org/10.1016/j.jsc.2007.10.012
Dupont, L., Lazard, D., Lazard, S., Petitjean, S.: Near-optimal parameterization of the intersection of quadrics: III. Parameterizing singular intersections. J. Symbolic Comput. (2008). https://doi.org/10.1016/j.jsc.2007.10.007
Dupont, L., Lazard, D., Lazard, S., Petitjean, S.: Near-optimal parameterization of the intersection of quadrics: I. The generic algorithm. J. Symbolic Comput. (2008). https://doi.org/10.1016/j.jsc.2007.10.006
Levin, J.: A parametric algorithm for drawing pictures of solid objects composed of quadric surfaces. Commun. ACM 10, 555–563 (1976). https://doi.org/10.1145/360349.360355
Levin, J.Z.: Mathematical models for determining the intersections of quadric surfaces. Comput. Graph. Image Process. 11(1), 73–87 (1979)
Mourrain, B., Tecourt, J.P., Teillaud, M.: On the computation of an arrangement of quadrics in 3D. Comput. Geom. Theory Appl. (2005). https://doi.org/10.1016/j.comgeo.2004.05.003
Schomer, E., Wolpert, N.: An exact and efficient approach for computing a cell in an arrangement of quadrics. Comput. Geom. Theory Appl. (2006). https://doi.org/10.1016/j.comgeo.2004.02.007
Sendra, J.R., Sevilla, D.: Radical parametrizations of algebraic curves by adjoint curves. J. Symbolic Comput. 46(9), 1030–1038 (2011)
Trocado, A., Gonzalez-Vega, L.: On the intersection of two quadrics (2018, Submitted). http://arxiv.org/abs/1903.06983
Wang, W., Goldman, R., Tu, C.: Enhancing Levin’s method for computing quadric-surface intersections. Comput. Aided Geom. Des. (2003). https://doi.org/10.1016/S0167-8396(03)00081-5
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Trocado, A., Gonzalez-Vega, L., Dos Santos, J.M. (2019). Intersecting Two Quadrics with GeoGebra. In: Ćirić, M., Droste, M., Pin, JÉ. (eds) Algebraic Informatics. CAI 2019. Lecture Notes in Computer Science(), vol 11545. Springer, Cham. https://doi.org/10.1007/978-3-030-21363-3_20
Download citation
DOI: https://doi.org/10.1007/978-3-030-21363-3_20
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-21362-6
Online ISBN: 978-3-030-21363-3
eBook Packages: Computer ScienceComputer Science (R0)