Search all library resources

An Implementation of Quad-fragment Merging for Micropolygon Rendering

Current graphics cards (GPUs) shade small polygons inefficiently. When surfaces are represented using micropolygons of less than a pixel in size, many shading computations performed by a GPU are redundant. Since shading is typically the most expensive operation in a graphics pipeline, this leads to poor rendering performance. This thesis presents a prototype implementation of quad-fragment merging, which reduces redundant shading work by buffering and selectively merging rasterized fragments prior to shading. The prototype quad-fragment merger is described in detail, and evidence is presented that it is amenable to implementation in fixed-function hardware. Performance results indicate that our implementation decreases shader executions by a factor of eight when rendering micropolygons, and effectively makes use of a number of optimizations to yield high performance. Finally, an early prototype of a corollary technique that shades scenes with motion blur is described, and preliminary results are presented.

Linear geometry with computer graphics

Disk contains: GraphLib 1.0.Stressing the interplay between theory and its practice, this text presents the construction of linear models that satisfy geometric postulate systems and develops geometric topics in computer graphics. It includes a computer graphics utility library of specialized subroutines on a 3.5" disk, designed for use with Turbo PASCAL 4.0 (or later version) - an effective means of computer-aided instruction for writing graphics problems. Providing instructors with maximum flexibility that allows for the mathematics or computer graphics sections to be taught independently, this book: reviews linear algebra and notation, focusing on ideas of geometric significance that are often omitted in general purpose linear algebra courses; develops symmetric bilinear forms through classical results, including the inertia theorem, Witt's cancellation theorem and the unitary diagonalization of symmetric matrices; examines the Klein Erlanger programm, constructing models of geometries, and studying associated transformation groups; clarifies how to construct geometries from groups, encompassing topological notions; and introduces topics in computer graphics, including geometric modeling, surface rendering and transformation groups.

The verdict geometric quality library. [electronic resource].

Verdict is a collection of subroutines for evaluating the geometric qualities of triangles, quadrilaterals, tetrahedra, and hexahedra using a variety of metrics. A metric is a real number assigned to one of these shapes depending on its particular vertex coordinates. These metrics are used to evaluate the input to finite element, finite volume, boundary element, and other types of solvers that approximate the solution to partial differential equations defined over regions of space. The geometric qualities of these regions is usually strongly tied to the accuracy these solvers are able to obtain in their approximations. The subroutines are written in C++ and have a simple C interface. Each metric may be evaluated individually or in combination. When multiple metrics are evaluated at once, they share common calculations to lower the cost of the evaluation.

Online OSTI