Orecchia, Ferruccio, and Ramella, Isabella. "Implicitization of Parametric Hypersurfaces via Points." Rendiconto dell’Accademia delle Scienze Fisiche e Matematiche 85.1 (2018): 201-204. <http://eudml.org/doc/296734>.
@article{Orecchia2018,
abstract = {Given a parametric polynomial representation of an algebraic hypersurface $\mathbf\{S\}$ in the projective space we give a new algorithm for finding the implicit cartesian equation of $\mathbf\{S\}$.The algorithm is based on finding a suitable finite number of points on $\mathbf\{S\}$ and computing, by linear algebra, the equation of the hypersurface of least degree that passes through the points. In particular the algorithm works for plane curves and surfaces in the ordinary three-dimensional space. Using C++ the algorithm has been implemented on an intel Pentium running Linux. Since our algorithm is based only on computations of linear algebra it reveals very efficient if compared with others that do not use linear algebra for the computations.},
author = {Orecchia, Ferruccio, Ramella, Isabella},
journal = {Rendiconto dell’Accademia delle Scienze Fisiche e Matematiche},
keywords = {Implicitization; Hypersurfaces},
language = {eng},
month = {12},
number = {1},
pages = {201-204},
publisher = {Società Nazione di Scienze, Lettere e Arti in Napoli; Giannini},
title = {Implicitization of Parametric Hypersurfaces via Points},
url = {http://eudml.org/doc/296734},
volume = {85},
year = {2018},
}
TY - JOUR
AU - Orecchia, Ferruccio
AU - Ramella, Isabella
TI - Implicitization of Parametric Hypersurfaces via Points
JO - Rendiconto dell’Accademia delle Scienze Fisiche e Matematiche
DA - 2018/12//
PB - Società Nazione di Scienze, Lettere e Arti in Napoli; Giannini
VL - 85
IS - 1
SP - 201
EP - 204
AB - Given a parametric polynomial representation of an algebraic hypersurface $\mathbf{S}$ in the projective space we give a new algorithm for finding the implicit cartesian equation of $\mathbf{S}$.The algorithm is based on finding a suitable finite number of points on $\mathbf{S}$ and computing, by linear algebra, the equation of the hypersurface of least degree that passes through the points. In particular the algorithm works for plane curves and surfaces in the ordinary three-dimensional space. Using C++ the algorithm has been implemented on an intel Pentium running Linux. Since our algorithm is based only on computations of linear algebra it reveals very efficient if compared with others that do not use linear algebra for the computations.
LA - eng
KW - Implicitization; Hypersurfaces
UR - http://eudml.org/doc/296734
ER -