Concise parallel Dixon determinant
暂无分享,去创建一个
Abstract The Dixon resultant is an important computational tool in CAGD. Its definition is theoretically elegant but computationally clumsy due to enormous intermediate expression swell. To speed up the computation, a new Dixon determinant entry formula is derived. The entry formula not only enables the Dixon determinant entries to be computed in parallel, it also solves the problem of intermediate expression swell. Furthermore, the entry formula leads to an expression counting the number of 3 × 3 determinants in the Dixon determinant.
[1] Ron Goldman,et al. Implicitizing rational surfaces with base points by applying perturbations and the factors of zero theorem , 1992 .
[2] A. L. Dixon. The Eliminant of Three Quantics in two Independent Variables , 1909 .
[3] Dinesh Manocha,et al. Algorithm for implicitizing rational parametric surfaces , 1992, Comput. Aided Geom. Des..
[4] Tom Lyche,et al. Mathematical methods in computer aided geometric design , 1989 .