| |
Browse All Reviews > Computing Methodologies (I) > Computer Graphics (I.3) > Picture/Image Generation (I.3.3) > Display Algorithms (I.3.3...)
|
|
 |
|
|
| |
|
|
| |
1-10 of 35
Reviews about "Display Algorithms (I.3.3...)":
|
Date Reviewed |
| |
Perceptual photometric seamlessness in projection-based tiled displays
Majumder A., Stevens R. ACM Transactions on Graphics (TOG) 24(1): 118-139, 2005. Type: Article
The idea behind photometric seamlessness is to make a multi-projector tiled display behave like a single projector, “such that we cannot tell the number of projectors making up the display.” This allows us to build ...
|
Aug 11 2006 |
| |
Pro .NET 2.0 graphics programming
White E., APress, LP, Berkeley, CA, 2005. 472 pp. Type: Book (9781590594452)
The .NET framework is a software environment for managing code execution and development, supported by Microsoft. It defines a physical layer abstraction, providing virtual resources that expose guaranteed behavior and interfaces, ensu...
|
Jan 31 2006 |
| |
Geometric Texture Modeling
Elber G. IEEE Computer Graphics and Applications 25(4): 66-76, 2005. Type: Article
Texture mapping, bump mapping, and displacement mapping are the main approaches used for adding more realism to synthetic images without adding a lot of geometry to the three dimensional (3D) scene. For these methods, the mapping is ty...
|
Nov 29 2005 |
| |
GPU gems 2: programming techniques for high-performance graphics and general-purpose computation
Pharr M., Fernando R., Addison-Wesley Professional, Boston, MA, 2005. 880 pp. Type: Book (9780321335593)
Modern graphics processing units (GPUs) incorporate not only enormous memory bandwidth and computational power, but also powerful and flexible architectures, providing fully programmable processing units. High-level programming languag...
|
Nov 28 2005 |
| |
Texture potential MIP mapping, a new high-quality texture antialiasing algorithm
Cant R., Shrubsole P. ACM Transactions on Graphics (TOG) 19(3): 164-184, 2000. Type: Article
The authors present a new method of representing images, the texture potential MIP mapping, which they compare to several other methods. A comprehensive description is given of these methods, and their performances are tested. The argu...
|
Apr 19 2002 |
| |
Modeling generalized cylinders via Fourier morphing
Aguado A., Montiel E., Zaluska E. ACM Transactions on Graphics (TOG) 18(4): 293-315, 1999. Type: Article
The authors describe a new approach to modeling generalized cylinders, which are frequently used to represent three-dimensional objects. The main features of their method are contour modeling using Fourier transforms, and contour inter...
|
Jul 1 2000 |
| |
Two methods for display of high contrast images
Tumblin J., Hodgins J., Guenter B. ACM Transactions on Graphics (TOG) 18(1): 56-94, 1999. Type: Article
The authors describe two contrasting methods (pun intended) for thedisplay of images having a high dynamic range in brightness. The ratioof light intensity is formalized into a measure of contrast, and theauthors address the problem of...
|
Jul 1 1999 |
| |
The simplest subdivision scheme for smoothing polyhedra
Peters J., Reif U. ACM Transactions on Graphics (TOG) 16(4): 420-431, 1997. Type: Article
This short note deals with the smoothness of the surface produced when the following subdivision scheme is applied to a polyhedron: “connect every edge-midpoint to the four midpoints of the edges sharing a vertex and a face w...
|
Sep 1 1998 |
| |
Efficient clipping of arbitrary polygons
Greiner G., Hormann K. ACM Transactions on Graphics (TOG) 17(2): 71-83, 1998. Type: Article
An algorithm for clipping two closed polygons in the plane is presented. The clip and subject polygons may both be nonconvex and self-intersecting, but they may not contain holes. The algorithm operates in three phases. Phase 1 searche...
|
Sep 1 1998 |
| |
A fast scan-line algorithm for topological filling of well-nested objects in 2.5D digital pictures
Arquès D., Grange O. Theoretical Computer Science 147(1-2): 211-248, 1995. Type: Article
A method for filling image regions based on nested objects in the plane is presented. The paper is heavy on definitions, theorems, lemmas, proofs, and corollaries. While the authors claim that application of their techniques to dynamic...
|
Apr 1 1996 |
| |
|
|
| |
|
|
