Graphics Reference
In-Depth Information
[SuDr95]
Su, Peter, and Drysdale, Robert L. Scot, “A Comparison of Sequential Delaunay Triangulation
Algorithms,” in
Proc. of the 11
th
Annual Symp. on Computational Geometry
, Vancouver, British
Columbia, Canada, June 5-7, 1995, ACM Press, 61-70.
[ZalC99]
Zalik, Borut, and Clapworthy, Gordon J., “A Universal Trapezoidation Algorithm for Planar
Polygons,” Computers & Graphics,
23
, 1999, 353-363.
Conics
[Blin87]
Blinn, James F., “How Many Ways Can You Draw a Circle,” CG&A,
7
(8), August 1987,
39-44.
[Blin88a]
Blinn, James F., “Jim Blinn's Answer,” CG&A,
8
(3), May 1988, 12.
[Galt89]
Galton, Ian, “An Efficient Three-Point Arc Algorithm,” CG&A,
9
(6), November 1989,
44-49.
[JoLH73]
Jordan, B.W., Lennon, W.J., and Holm, B.D., “An Improved Algorithm for the Generation of
Nonparametric Curves,” IEEE Trans. Computers, Volume
C-22
, 1973, 1052-1060.
[Kap85]
Kappel, M.R., “An Ellipse-Drawing Algorithm for Raster Displays,” in [Earn85], 257-280.
[Pitt85]
Pitteway, M.L.V., “Algorithms of Conic Generation,” in [Earn85], 219-237.
[VanA84]
Van Aken, J.R., “An Efficient Ellipse-Drawing Algorithm,” CG&A,
4
(9), September 1984,
24-35.
[Wils87]
Wilson, Peter R., “Conic Representations for Shape Description,” CG&A,
7
(4), April 1987,
23-30.
Constructive Solid Geometry
[LaTH86]
LaidLaw, David II, Trumbore, W. Benjamin, and Hughes, John F., “Constructive Solid Geom-
etry for Polyhedral Objects,” SIGGRAPH 86,
20
(4), August 1986, 161-168.
[RosV89]
Rossignac, J., and Voelcker, H., “Active Zones in CSG for Accelerating Boundary Evaluation,
Redundancy Elimination, Interference Detection, and Shading Algorithms,” ACM TOG,
8
(1),
January 1989, 51-87.
[ShaV91a]
Shapiro, Vadim, and Vossler, Donald L., “Construction and Optimization of CSG Represen-
tation,” CAD,
23
(1), January/February 1991, 4-20.
[ShaV91b]
Shapiro, Vadim, and Vossler, Donald L., “Efficient CSG Representations of Two-dimensional
Solids,” Trans. ASME, Journal of Mechanical Design,
113
(3), September 1991, 292-305.
[ShaV93]
Shapiro, Vadim, and Vossler, Donald L., “Separation for Boundary to CSG Conversion,” ACM
TOG,
12
(1), January 1993, 35-55.
Contours
[DLTW90]
Dobkin, David P., Levy, Silvio V.F., Thurston, William P., and Wilks, Allan R., “Contour Tracing
by Piecewise Linear Approximations,” ACM TOG
9
(4), October 1990, 389-423.
[Dowd85]
Dowd, P.A., “Algorithms for Three-dimensional Interpolation Between Planar Slices,” in
[Earn85], 531-554.
[FuKU77]
Fuchs, H., Kedem, Z.M., and Uselton, S.P., “Optimal Surface Reconstruction from Planar
Contours,” CACM,
20
(10), October 1977, 693-702.
[GanD82]
Ganapathy, S., and Dennehy, T.G., “A New General Triangulation Method for Planar
Contours,” SIGGRAPH 82,
16
(3), July 1982, 69-75.
[MeSS92]
Meyers, David, Skinner, Shelley, and Sloan, Kenneth, “Surfaces from Contours,” TOG,
11
(3),
July 1992, 228-258.
[ParK96]
Park, Hyungjun, and Kim, Kwangsoo, “Smooth Surface Approximation to Serial Cross-
sections,” CAD,
28
(12), December 1996, 995-1005.
[Preu86]
Preusser, Albrecht, “Computing Area Filling Contours for Surfaces Defined by Piecewise
Polynomials,” CAGD,
3
(4), December 1986, 267-279.
[Sabi85]
Sabin, M.A., “Contouring—The State of the Art,” in [Earn85], 411-482.
[Sutc80]
Sutcliffe, D., “Contouring over Rectangular and Skewed Rectangular Grids—An Introduc-
tion,” in [Brod80], 39-62.
