Two-bit graphics

Authors:
David Salesin;Ronen Barzel
Affiliations:
-;California Institute of Technology, Pasadena
Venue:
IEEE Computer Graphics and Applications
Year:
1986

Citing 0
Cited 3

Direct WYSIWYG painting and texturing on 3D shapes: An error occurred during the printing of this article that reversed the print order of pages 118 and 119. While we have corrected the sort order of the 2 pages in the DL, the PDF did not allow us to repaginate the 2 pages.

SIGGRAPH '90 Proceedings of the 17th annual conference on Computer graphics and interactive techniques
Multiresolution painting and compositing

SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
Geometrical, topological, and hierarchical structuring of overlapping 2-D discrete objects

Computers and Graphics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ordinary bitmaps allow pixels to be black or white. We introduce a second bitmap, the "alpha" bitmap, which allows pixels to be transparent as well. The alpha bitmap makes it possible to have black-and-white images that are nonrectangular or that have holes in them. It also provides a richer set of operations for working with bitmaps. We present the mathematics for a two-bit compositing algebra, and suggest extensions for two-bit compositing, painting, and region filling. Each of these operations can be implemented with ordinary bitblts and presented on ordinary bitmap displays. We analyze the cost of each two-bit operation in terms of the number of bitblts it requires.