Graphics Reference
In-Depth Information
[BoyB00]
Boyer, Vincent, and Bourdin, Jean-Jacques, “Auto-Adaptive Step Straight-Line Algorithm,”
CG&A,
20
(5), September/October 2000, 67-69.
[Bres65]
Bresenham, J.E., “Algorithm for Computer Control of a Digital Plotter,” IBM Systems Journal,
4
(1), 1965, 25-30.
[Bres77]
Bresenham, J.E., “A Linear Algorithm for Incremental Digital Display of Circular Arcs,”
CACM,
20
(2), February 1977, 100-106.
[DeFL87]
DeFanti, Tom, Frankel, Rick, and Leske, Larry, “A Call for the Publishing of Blt-Stones,”
CG&A,
7
(10), October 1987, 39-49.
[Fish90b]
Fishkin, Ken, “Filling a Region in a Frame Buffer,” in [Glas90], 278-284.
[FisB85]
Fishkin, K.P., and Barsky, B.A., “An Analysis and Algorithm for Filling Propagation,” Proc.
Graphics Interface 1985, 203-212.
[Free69]
Freeman, H., “A Review of Relevant Problems in the Processing of Line-drawing Data,” in
Automatic Interpretation and Classification of Images
, edited by A. Grasselli, Academic Press,
1969.
[GupS81]
Gupta, S., and Sproull, R.E., “Filtering Edges for Gray-Scale Displays,” SIGGRAPH 81,
15
(3),
August 1981, 1-5.
[Heck90a]
Heckbert, Paul S., “What Are the Coordinates of a Pixel?” in [Glas90], 246-248.
[Heck90b]
Heckbert, Paul S., “A Seed Fill Algorithm,” in [Glas90], 275-277.
[Heck90c]
Heckbert, Paul S., “Digital Line Drawing,” in [Glas90], 99-100.
[Mcil92]
McIlroy, M. Douglas, “Getting Raster Ellipses Right,” ACM TOG,
11
(3), July 1992, 259-275.
[Morr90]
Morrison, Jack C., “Fast Anti-aliasing Polygon Scan Conversion,” in [Glas90], 76-83.
[Pitt67]
Pitteway, M.L.V., “Algorithm for Drawing Ellipses or Hyperbolae with a Digital Plotter,”
Computer J.,
10
(3), November 1967, 282-289.
[PitW80]
Pitteway, M.L.V., and Watkinson, D.J., “Bresenham's Algorithm with Grey-Scale,” CACM,
23
(11), November 1980, 625-626.
[RoWW90]
Rokne, J.G., Wyvill, Brian, and Wu, Xiaolin, “Fast Line Scan-Conversion,” ACM TOG,
9
(4),
October 1990, 376-388.
[Smit79]
Smith, A.R., “Tint Fill,” SIGGRAPH 79,
13
(2), August 1979, 276-283.
[SteL00]
Stephenson, Peter, and Litow, Bruce, “Why Step When You Can Run,” CG&A,
20
(6),
November/December 2000, 76-84.
[Thom90]
Thompson, Kelvin, “Rendering Anti-Aliased Lines,” in [Glas90], 105-106.
[VanN85]
Van Aken, Jerry, and Novak, Mark, “Curve-Drawing Algorithms for Raster Displays,” ACM
TOG,
4
(2), April 1985, 147-169.
[Wüth98]
Wüthrich, Charles A., “A Model for Curve Rasterization in n-Dimensional Space,” Computers
& Graphics,
22
(2-3), 1998, 153-160.
[Wyvi90]
Wyvill, Brian, “Symmetric Double Step Line Algorithm,” in [Glas90], 101-104.
Ray Tracing
[Aman84]
Amantides, J., “Ray Tracing with Cones,” SIGGRAPH 84,
18
(3), July 1984, 129-136.
[Cook86]
Cook, Robert L., “Stochastic Sampling in Computer Graphics,” ACM TOG,
5
(1), January 1986,
51-72.
[Cook89]
Cook, Robert L., “Stochastic Sampling and Distributed Ray Tracing,” in [Glas89], 161-199.
[CoPL84]
Cook, Robert L., Porter, Thomas, and Carpenter, Loren, “Distributed Ray Tracing,”
SIGGRAPH 84,
18
(3), July 1984, 137-145.
[FuTI86]
Fujimoto, A., Tanaka, T., and Iwata, K., “ARTS: Accelerated Ray Tracing System,” CG&A,
6
(4),
April 1986, 16-26.
[Glas84]
Glassner, Andrew S., “Space Subdivision for Fast Ray Tracing,” CG&A,
4
(10), October 1984,
15-22.
[Glas86]
Glassner, Andrew S., “An Overview of Ray Tracing,” in [Glas89], 1-31.
[Glas89]
Glassner, A.S., editor,
An Introduction to Ray Tracing
, Academic Press, 1989.
[Hain89]
Haines, Eric., “Essential Ray Tracing,” in [Glas89], 33-77.
[Hanr89]
Hanrahan, Pat., “A Survey of Ray-Surface Intersection Algorithms,” in [Glas89], 79-119.
Havran, Vlastimil, Kopal, Tomáˇ, Bittner, Jiˇ i, and
ˇ
ára, “Fast Robust BSP Tree Traversal Algo-
rithm for Ray Tracing,” J. of Graphics Tools,
2
(4), 1997, 15-23.
[HKBZ97]
[HecH84]
Heckbert, Paul S., and Hanrahan, Pat, “Beam Tracing Polygon Objects,” SIGGRAPH 84,
18
(3),
July 1984, 119-128.
[Kapl85]
Kaplan, Michael R., “Space-Tracing, a Constant Time Ray-Tracer,” Course Notes, Volume 11,
SIGGRAPH 85, July 1985.
