activity
20052025
most citedOn the computation of the straight lines contained in a rational surface

2 citations · 5 across the 16 of their papers we have counts for

collaborators

18 papers

cs.CG2025

Relative position of a parabola or a hyperbola and an ellipse without computing intersection points

Jorge Caravantes, Gema M. Diaz-Toca, Mario Fioravanti +1

Efficient methods to determine the relative position of two conics are of great interest for applications in robotics, computer animation, CAGD, computational physics, and other ar…

math.AG2025

Tools for analyzing the intersection curve between a torus and a quadric through projection and lifting

Laureano Gonzalez-Vega, Jorge Caravantes, Gema M. Diaz-Toca +1

This article introduces efficient and user-friendly tools for analyzing the intersection curve between a ringed torus and an irreducible quadric surface. Without loose of generalit…

math.AG2023★ 1 cited

Closed formulae for multiple roots of univariate polynomials through subresultants

Jorge Caravantes, Gema M. Diaz-Toca, Laureano Gonzalez-Vega

The computation of the topology of a real algebraic plane curve is greatly simplified if there are no more than one critical point in each vertical line: the general position condi…

math.AG2022

Birational Reparametrizations of Surfaces

Jorge Caravantes, Sonia Pérez-Díaz, J. Rafael Sendra

Given a unirational parameterization of a surface, we present a general algorithm to determine a birational parameterization without using parameterization algorithms. Additionally…

math.AG2022

A note about rational surfaces as unions of affine planes

Jorge Caravantes, J. Rafael Sendra, David Sevilla +1

We prove that any smooth rational projective surface over the field of complex numbers has an open covering consisting of 3 subsets isomorphic to affine planes.

math.AG2021

Covering rational surfaces with rational parametrization images

Jorge Caravantes, J. Rafael Sendra, David Sevilla +1

Let be a rational projective surface given by means of a projective rational parametrization whose base locus satisfies a mild assumption. In this paper we present an algorithm…