Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6876369 | Computer-Aided Design | 2018 | 31 Pages |
Abstract
We present an algorithm to implicitize rational tensor product surfaces that works correctly and efficiently even in the presence of base points by combining three complementary approaches, some classical and some novel, to implicitization. One straightforward method is to implicitize these surfaces using the Dixon A-resultant of three obvious syzygies. For surfaces that cannot be implicitized using this resultant due, for example, to the presence of base points, we try the method of moving planes and moving quadrics. We show that this method works very well on surfaces with simple base points. For general rational surfaces that cannot be implicitized by these two methods, we refine the method that employs the resultant matrix of three low bidegree moving planes by providing a simple technique to construct this resultant matrix. To avoid computing the base points explicitly, we compute the extraneous factors associated to the base points by solving a system of polynomial equations with a finite number of solutions.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Graphics and Computer-Aided Design
Authors
Li-Yong Shen, Ron Goldman,