Generating smooth 2-D monocolor line drawings on video displays

Barros, José Wagner de; Fuchs, Henry

doi:10.1145/800249.807454

Cited by 9 publications

(8 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, their computing cost is extremely high. Acceleration techniques using scanlines (Catmull 1978;Barros 1979) can reduce the computing cost, but not enough. Moreover, these algorithms are quite complex.…”

Section: Geometric Approachmentioning

confidence: 99%

Precise rendering method for exact anti-aliasing and highlighting

Tanaka

Takahashi

1992

The Visual Computer

View full text Add to dashboard Cite

Section: Geometric Approachmentioning

confidence: 99%

Precise rendering method for exact anti-aliasing and highlighting

Tanaka

Takahashi

1992

The Visual Computer

View full text Add to dashboard Cite

“…The skinny polygon algorithms [5,2,9] can properly handle crossing lines because they clip polygons against one another before filtering. They are more complicated to implement because they must store all polygons in main memory at one time.…”

Section: Anti-aliasingmentioning

confidence: 99%

“…Notable exceptions are [5], [2], and [9]. A good reason for ignoring the case of crossing lines is that it tends to complicate the antialiasing algorithm.…”

Section: Appendixmentioning

confidence: 99%

See 1 more Smart Citation

Anti-aliased line drawing using brush extrusion

Whitted¹

1983

Proceedings of the 10th Annual Conference on Computer Graphics and Interactive Techniques

View full text Add to dashboard Cite

This algorithm draws lines on a gray-scale raster display by dragging a "brush" along the path of the line. The style of the line is determined by the properties of the brush. An anti-aliasing calculation is performed once for the brush itself and thereafter only a trivial additional operation is needed for each pixel through which the brush is dragged to yield an anti-aliased line.There are few constraints on the size, shape, and attributes of the brush. Lines can be curved as well as straight, It is possible to produce lines with a three dimensional appearance.

show abstract

“…In computer graphics the majority of algorithms for drawing mathematical curves are of the incremental type [2,5,6,11,14,22,23,26,28,29,31].…”

Section: Introductionmentioning

confidence: 99%

Fast line scan-conversion

Rokne

Wyvill

1990

ACM Trans. Graph.

View full text Add to dashboard Cite

A major bottleneck in many graphics displays is the time required to scan-convert straight line segments. Most manufacturers use hardware based on Bresenham's [5] line algorithm. In this paper an algorithm is developed based on the original Bresenham scan-conversion together with the symmetry first noted by Gardner [18] and a recent double-step technique [31]. This results in a speed-up of scan-conversion by a factor of approximately 4 as compared to the original Bresenham algorithm. Hardware implementations are simple and efficient since the property of using only shift and increment operations is preserved.

show abstract

Generating smooth 2-D monocolor line drawings on video displays

Cited by 9 publications

References 4 publications

Precise rendering method for exact anti-aliasing and highlighting

Precise rendering method for exact anti-aliasing and highlighting

Anti-aliased line drawing using brush extrusion

Fast line scan-conversion

Contact Info

Product

Resources

About