1 February 1992 Resolvents and their applications in computer-aided geometric design
Author Affiliations +
Abstract
Elimination theory was originally developed in the 18th and 19th centuries to find solvability criteria for a system of polynomial equations. We present some new resolvent methods that are suitable to solve important problems in computer aided geometric design (CAGD), including implicitization, inversion, intersection, computation of self intersection points, and detection of unfaithful parametrizations of rational curves and surfaces.
© (1992) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Hang K. Du, Hang K. Du, Ronald N. Goldman, Ronald N. Goldman, } "Resolvents and their applications in computer-aided geometric design", Proc. SPIE 1610, Curves and Surfaces in Computer Vision and Graphics II, (1 February 1992); doi: 10.1117/12.135144; https://doi.org/10.1117/12.135144
PROCEEDINGS
15 PAGES


SHARE
RELATED CONTENT

Symmetric algorithms for curves and surfaces
Proceedings of SPIE (July 31 1990)
Improving G1 surface joins by using a composite patch
Proceedings of SPIE (October 31 1992)
Knot insertion algorithms for splines (Invited Paper)
Proceedings of SPIE (January 31 1992)
Multiple target tracking using the Radon transform
Proceedings of SPIE (July 31 1990)
Recovering signals from inaccurate data
Proceedings of SPIE (January 31 1992)

Back to Top