A Tracking Algorithm for Implicitly Defined Curves

Authors:
Richard E. Chandler
Affiliations:
-
Venue:
IEEE Computer Graphics and Applications
Year:
1988

Citing 3
Cited 7

Techniques for conic splines

SIGGRAPH '85 Proceedings of the 12th annual conference on Computer graphics and interactive techniques
A linear algorithm for incremental digital display of circular arcs

Communications of the ACM
Topologically reliable display of algebraic curves

SIGGRAPH '83 Proceedings of the 10th annual conference on Computer graphics and interactive techniques

A family of tangent continuous cubic algebraic splines

ACM Transactions on Graphics (TOG)
Comparison of interval methods for plotting algebraic curves

Computer Aided Geometric Design
Technical Section: GPU-based rendering of curved polygons using simplicial coverings

Computers and Graphics
A BSP-based algorithm for dimensionally nonhomogeneous planar implicit curves with topological guarantees

ACM Transactions on Graphics (TOG)
Visualizing Arcs of Implicit Algebraic Curves, Exactly and Fast

ISVC '09 Proceedings of the 5th International Symposium on Advances in Visual Computing: Part I
A non-uniform binary space partition algorithm for 2D implicit curves

ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
Special Section on CAD/Graphics 2013: A continuation algorithm for planar implicit curves with singularities

Computers and Graphics

Quantified Score

Hi-index	0.01

Visualization

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.