ACM DL

Graphics (TOG)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Graphics (TOG), Volume 21 Issue 2, April 2002

Editorial
Jessica Hodgins
Pages: 87-87
DOI: 10.1145/508357.508358
I've now been Editor-in-Chief of ACM TOG for two full years. We've made a number of changes in TOG recently. Perhaps the most visible change is the new format which began with January 2002. The format change is to more closely approximate that of ACM...

Topology-reducing surface simplification using a discrete solid representation
Carlos Andújar, Pere Brunet, Dolors Ayala
Pages: 88-105
DOI: 10.1145/508357.508359
This paper presents a new approach for generating coarse-level approximations of topologically complex models. Dramatic topology reduction is achieved by converting a 3D model to and from a volumetric representation. Our approach produces valid,...

Meshed atlases for real-time procedural solid texturing
Nathan A. Carr, John C. Hart
Pages: 106-131
DOI: 10.1145/508357.508360
We describe an implementation of procedural solid texturing that uses the texture atlas, a one-to-one mapping from an object's surface into its texture space. The method uses the graphics hardware to rasterize the solid texture coordinates as colors...

Pareto-optimal formulations for cost versus colorimetric accuracy trade-offs in printer color management
D. J. Littlewood, P. A. Drakopoulos, G. Subbarayan
Pages: 132-175
DOI: 10.1145/508357.508361
Color management for the printing of digital images is a challenging task, due primarily to nonlinear ink-mixing behavior and the presence of redundant solutions for print devices with more than three inks. Algorithms for the conversion of image data...

The 3D visibility complex
Frédo Durand, George Drettakis, Claude Puech
Pages: 176-206
DOI: 10.1145/508357.508362
Visibility problems are central to many computer graphics applications. The most common examples include hidden-part removal for view computation, shadow boundaries, mutual visibility of objects for lighting simulation. In this paper, we present a...

Permission grids: practical, error-bounded simplification
Steve Zelinka, Michael Garland
Pages: 207-229
DOI: 10.1145/508357.508363
We introduce the permission grid, a spatial occupancy grid which can be used to guide almost any standard polygonal surface simplification algorithm into generating an approximation with a guaranteed geometric error bound. In particular, all...

Acknowledgments
Jessica Hodgins
Pages: 230-230
DOI: 10.1145/508357.508364