Graphics (TOG)


Search Issue
enter search term and/or author name


ACM Transactions on Graphics (TOG), Volume 8 Issue 1, Jan. 1989

The circle-brush algorithm
K. C. Posch, W. D. Fellner
Pages: 1-24
DOI: 10.1145/49155.49156
Brushing commonly refers to the drawing of curves with various line widths in hit-mapped graphics systems. It is best done with circles of suitable diameter so that a constant line width, independent of the curve's slope, is...

Intersection algorithms for lines and circles
A. E. Middleditch, T. W. Stacey, S. B. Tor
Pages: 25-40
DOI: 10.1145/49155.49157
This paper presents a unified representation scheme for the implicit equations of points, lines, and circles. An associated set of geometric algorithms operates successfully on degenerate and nearly degenerate geometry, and when necessary...

A parallel B-spline surface fitting algorithm
Fuhua Cheng, Ardeshir Goshtasby
Pages: 41-50
DOI: 10.1145/49155.214377
A parallel fitting algorithm using uniform bicubic B-spline surfaces is presented. This algorithm is based on the observation that a tensor product spline surface fitting problem can be split into two spline curve fitting problems, and each of...

Active zones in CSG for accelerating boundary evaluation, redundancy elimination, interference detection, and shading algorithms
Jaroslaw R. Rossignac, Herbert B. Voelcker
Pages: 51-87
DOI: 10.1145/49155.51123
Solids defined by Boolean combinations of solid primitives may be represented in constructive solid geometry (CSG) as binary trees. Most CSG-based algorithms (e.g., for boundary evaluation, graphic shading, interference detection) do various...