A tracking algorithm for implicitly defined curves
- 1 March 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Graphics and Applications
- Vol. 8 (2) , 83-89
- https://doi.org/10.1109/38.506
Abstract
A tracking algorithm is given for curves that have equations of the form f(x,y)=0. It produces the next approximating pixel by looking for a sign difference in function evaluations at midpoints between the eight nearest neighboring pixels. The search proceeds in order of decreasing likelihood, examining the most probable candidates first.Keywords
This publication has 10 references indexed in Scilit:
- Techniques for conic splinesPublished by Association for Computing Machinery (ACM) ,1985
- Algorithms of Conic GenerationPublished by Springer Nature ,1985
- An Efficient Ellipse-Drawing AlgorithmIEEE Computer Graphics and Applications, 1984
- Topologically reliable display of algebraic curvesPublished by Association for Computing Machinery (ACM) ,1983
- A linear algorithm for incremental digital display of circular arcsCommunications of the ACM, 1977
- An algorithm for drawing the curve f(x,y) = 0The Computer Journal, 1976
- Comment on "An Improved Algorithm for the Generation of Nonparametric CurvesIEEE Transactions on Computers, 1976
- Nonparametric CurvesIEEE Transactions on Computers, 1976
- An Improved Algorithm for the Generation of Nonparametric CurvesIEEE Transactions on Computers, 1973
- Incremental Curve GenerationIEEE Transactions on Computers, 1970