Rasterization of nonparametric curves
- 1 July 1990
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 9 (3) , 262-277
- https://doi.org/10.1145/78964.78966
Abstract
We examine a class of algorithms for rasterizing algebraic curves based on an implicit form that can be evaluated cheaply in integer arithmetic using finite differences. These algorithms run fast and produce “optimal” digital output, where previously known algorithms have had serious limitations. We extend previous work on conic sections to the cubic and higher order curves, and we solve an important undersampling problem.Keywords
This publication has 10 references indexed in Scilit:
- Numerically stable implicitization of cubic curvesACM Transactions on Graphics, 1991
- Rasterizing curves of constant widthJournal of the ACM, 1989
- Parametric cubics as algebraic curvesComputer Aided Geometric Design, 1988
- Implicitization, inversion, and intersection of planar rational cubic curvesComputer Vision, Graphics, and Image Processing, 1985
- Techniques for conic splinesACM SIGGRAPH Computer Graphics, 1985
- Curve-drawing algorithms for Raster displaysACM Transactions on Graphics, 1985
- [Table of contents]IEEE Transactions on Systems Science and Cybernetics, 1969
- [Table of contents]IEEE Transactions on Systems Science and Cybernetics, 1969
- Algorithm for drawing ellipses or hyperbolae with a digital plotterThe Computer Journal, 1967
- On the Encoding of Arbitrary Geometric ConfigurationsIEEE Transactions on Electronic Computers, 1961