Michael R. Dunlavey
- 1 ACKLAND, B.D., AND WESTE, N.H. The edge flag algorithm--a fill method for raster scan displays, IEEE Trans. Comput. C-30, 1 (Jan. 1981), 41-47.Google Scholar
- 2 FOLEY, J.D., AND VAN DAM, A. Fundamentals o/Interactive Computer Graphics. Addison- Wesley, Reading, Mass., 1982, pp. 446-450. Google Scholar
- 3 NEWMAN, W.M., AND SPROULL, R.F. Principles o/ Interactive Computer Graphics. McGraw- Hill, New York, 1979, pp. 230-236. Google Scholar
- 4 PAVLIDIS, T. Contour filling in raster graphics. Comput. Gr. 15, 3 (Aug. 1981), 29-36. Google Scholar
- 5 SMITH, A.R. Tint fill. Comput. Gr. 13, 2 (Aug. 1979), 276-283. Google Scholar
Index Terms
- Efficient polygon-filling algorithms for raster displays
Recommendations
Smoothly shaded renderings of polyhedral objects on raster displays
SIGGRAPH '79: Proceedings of the 6th annual conference on Computer graphics and interactive techniquesThe appearance of raster-scan renderings of polyhedral approximations to curved surfaces can be enhanced greatly by shading them in a manner that varies smoothly across each polygon and which matches the correct shade at each vertex. Henri Gouraud and ...
Smoothly shaded renderings of polyhedral objects on raster displays
The appearance of raster-scan renderings of polyhedral approximations to curved surfaces can be enhanced greatly by shading them in a manner that varies smoothly across each polygon and which matches the correct shade at each vertex. Henri Gouraud and ...
Frustum-traced raster shadows: revisiting irregular z-buffers
i3D '15: Proceedings of the 19th Symposium on Interactive 3D Graphics and GamesWe present a real-time system that renders antialiased hard shadows using irregular z-buffers (IZBs). For subpixel accuracy, we use 32 samples per pixel at roughly twice the cost of a single sample. Our system remains interactive on a variety of game ...
Reviews
Joseph J. O'Rourke
Polygon-filling algorithms are ubiquitous in computer graphics. They come in two main varieties: flood algorithms, which grow to all connected pixels from a seed, and parity-based algorithms, which invert interior pixels an odd number of times and exterior pixels an even number. Dunlavey presents two algorithms of the second variety. The first is Ackland and Weste's region-oriented procedure [1], which assumes that the pixels lie between the grid lines. The second is an original vector-oriented algorithm, which assumes that the pixels lie on the grid lines. Both algorithms are described in a uniform notation and explained very clearly. Speed-ups are suggested that limit the length of the scan line inversion. Finally, a careful proof of correctness is provided for the vector-oriented algorithm.
Access critical reviews of Computing literature here
Become a reviewer for Computing Reviews.
Comments