An increasingly prominent area of computer science is Computer Aided Geometric Design or CAGD. The main task of CAGD is to automate, to the greatest extent possible, the process of designing physical objects. A designer typically models an object as a collection of surfaces. For many objects, design...

Ausführliche Beschreibung

Bibliographische Detailangaben

1. Verfasser:	Warren, Joseph D. (VerfasserIn)
Format:	Buch
Sprache:	English
Veröffentlicht:	Ithaca, New York 1986
Schriftenreihe:	Cornell University <Ithaca, NY> / Department of Computer Science: Technical report 770
Schlagworte:	Computer-aided design Geometry, Algebraic Surfaces Hochschulschrift
Zusammenfassung:	An increasingly prominent area of computer science is Computer Aided Geometric Design or CAGD. The main task of CAGD is to automate, to the greatest extent possible, the process of designing physical objects. A designer typically models an object as a collection of surfaces. For many objects, design specifications indicate only a few critical surfaces, with the remaining surfaces to be chosen so as to make the surface of the resulting object smooth. Smoothness is important because, in many mechanical objects, sharp edges are undesirable for functional or aesthetic reasons. For example, sharp edges on the interior surface of a gate valve retard fluid flow. Automatically calculating these remaining surfaces, called blending surfaces is an important task in any CAGD system. Therefore, an understanding of the mathematics of surfaces that meet smoothly is fundamental to CAGD Specifically, this thesis investigates the following problem: given a surface V and a point or curve W on that surface, construct surfaces that meet with V with a specified degree of smoothness along W. Working from a measure of smoothness known as geometric continuity, the first half of this thesis establishes that the space of all surfaces meeting V with the k-th order geometric continuity along W is directly related to certain algebraic structures called ideals. For example, let Z(M) (the set of point for which a polynomial M is zero) be an irreducible surface that intersects another surface Z(N) transversally (nontangentially) in an irreducible curve Z(M) The second half of this work applies these results to the problem of generating blending surfaces. Using the geometric properties of blending surfaces, it is shown that any surface Z(F) that smooths the intersection of two surfaces Z(M) and Z(N) must have certain algebraic properties. In particular, the degree of F must be greater than or equal to the maximum of the degrees of
Beschreibung:	Zugl.: Ithaca, NY, Cornell Univ., Diss., 1986
Beschreibung:	VIII, 106 Sp.