Implicitization Using Moving Curves and Surfaces
Thomas W. Sederberg, Falai Chen
Proceedings of SIGGRAPH 95, August 1995, pp. 301--308.
Abstract: This paper presents a radically new approach to the century old problem of computing the implicit equation of a parametric surface. For surfaces without base points, the new method expresses the implicit equation in a determinant which is one fourth the size of the conventional expression based on Dixon's resultant. If base points do exist, previous implicitization methods either fail or become much more complicated, while the new method actually simplifies. The new method is illustrated using the bicubic patches from Newell's teapot model. Dixon's method can successfully implicitize only 8 of those 32 patches, ex-pressing the implicit equation as an 18 x 18 determinant. The new method successfully implicitizes all 32 of the patches. Four of the implicit equations can be written as 3 x 3 determinants, eight can be written as 4 x 4 determinants, and the remaining 20 implicit equations can be written using 9 x 9 determinants.
Keyword(s): Bézier patches, implicitization, base points
BibTeX format:
@inproceedings{Sederberg:1995:IUM,
  author = {Thomas W. Sederberg and Falai Chen},
  title = {Implicitization Using Moving Curves and Surfaces},
  booktitle = {Proceedings of SIGGRAPH 95},
  pages = {301--308},
  month = aug,
  year = {1995},
}
Search for more articles by Thomas W. Sederberg.
Search for more articles by Falai Chen.

Return to the search page.


graphbib: Powered by "bibsql" and "SQLite3."