Affiliation:
1. Computer Science Department, Carnegie-Mellon University, Pittsburgh, PA
Abstract
While simple line-drawing techniques produce “jagged” lines on raster images, more complex anti-aliasing, or filtering, techniques use gray-scale to give the appearance of smooth lines and edges. Unfortunately, these techniques are not frequently used because filtering is thought to require considerable computation. This paper presents a simple algorithm that can be used to draw filtered lines; the inner loop is a variant of the Bresenham point-plotting algorithm. The algorithm uses table lookup to reduce the computation required for filtering. Simple variations of the algorithm can be used to draw lines with different thicknesses and to smooth edges of polygons.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,General Computer Science
Cited by
56 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Rasterisation;Undergraduate Topics in Computer Science;2023
2. Learning Implicit Glyph Shape Representation;IEEE Transactions on Visualization and Computer Graphics;2022
3. Rasterung;Grundlagen der Computergrafik;2022
4. Differentiable vector graphics rasterization for editing and learning;ACM Transactions on Graphics;2020-12-31
5. Real-Time Rendering of Wave-Optical Effects on Scratched Surfaces;Computer Graphics Forum;2018-05