Analysis of Blending Algorithms in Computer Graphics
Abstract
The research on this project centered around the analysis, development, and implementation of fast algorithms for representing a surface which blends together two or more intersecting surfaces. The blending surface should provide a smoother transition than is available when simply considering the intersection of the surfaces. The algorithms developed must be efficient because the major portion of computing time in a solid modeling system should be devoted to the important problems of data representation, object display, surface analysis (ray tracing, shadowing, etc. ) and scene analysis ( hidden line/surface removal, etc.) The important features of a blending surface are speed of computation, ability to be incorporated into the other features of a solid modeling system (such as hidden line/ surface removal), and the visual quality of the blended image. This report is organized as follows. Section 1 is an introduction. Section 2 briefly describes some basic concepts from solid modeling. Section 3 is a description of the organization of the research, major findings, and publications. Section 4 describes additional directions for research. Keywords: Applied geometry, Degrees of freedom.
Document Details
- Document Type
- Technical Report
- Publication Date
- Oct 17, 1988
- Accession Number
- ADA201921
Entities
People
- Ronald J. Leach
Organizations
- Howard University