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.
Author supplied keywords
Cite
CITATION STYLE
Trocado, A., Gonzalez-Vega, L., & Dos Santos, J. M. (2019). Intersecting two quadrics with geogebra. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11545 LNCS, pp. 237–248). Springer Verlag. https://doi.org/10.1007/978-3-030-21363-3_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
