Resolvents and their applications in computer-aided geometric design

Hang K. Du; Ronald N. Goldman

doi:10.1117/12.135144

1 February 1992 Resolvents and their applications in computer-aided geometric design

Hang K. Du, Ronald N. Goldman

Proceedings Volume 1610, Curves and Surfaces in Computer Vision and Graphics II; (1992) https://doi.org/10.1117/12.135144
Event: Robotics '91, 1991, Boston, MA, United States

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.

Citation Download Citation

Hang K. Du and 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); https://doi.org/10.1117/12.135144

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available