
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Gabriel Taubin, "Rasterizing Algebraic Curves and Surfaces," IEEE Computer Graphics and Applications, vol. 14, no. 2, pp. 1423, March/April, 1994.  
BibTex  x  
@article{ 10.1109/38.267467, author = {Gabriel Taubin}, title = {Rasterizing Algebraic Curves and Surfaces}, journal ={IEEE Computer Graphics and Applications}, volume = {14}, number = {2}, issn = {02721716}, year = {1994}, pages = {1423}, doi = {http://doi.ieeecomputersociety.org/10.1109/38.267467}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  MGZN JO  IEEE Computer Graphics and Applications TI  Rasterizing Algebraic Curves and Surfaces IS  2 SN  02721716 SP14 EP23 EPD  1423 A1  Gabriel Taubin, PY  1994 VL  14 JA  IEEE Computer Graphics and Applications ER   
A new, recursive, spacesubdivision algorithm for rasterizing algebraic curves and surfaces gets its accuracy from a newly devised, computationally efficient, and asymptotically correct test. The approach followed is essentially the interval arithmetic method for rendering implicit curves. The author's contribution is a particularly efficient way to construct inclusion functions for polynomials. An ideal algorithm is given for rendering an algebraic curve Z(f)={(x,y):f(x,y)=0} in a square box of side n. The algorithm scans the square and paints only those pixels cut by the curve. This algorithm is ideal, because every correct algorithm should paint exactly the same pixels, but it is impractical. It requires n/sup 2/ test evaluations, one for each pixel in the square. However, since in general it will be rendering a curve on a planar region, the number of pixels it is expected to paint is only O(n). We need a more efficient algorithm. There are two issues to examine. The first is how to reduce the computational complexity by recursive subdivision. The second is how to test whether the curve Z(f) cuts a square.
1. C.L. Bajaj et al., "Tracing Surface Intersections,"Computer Aided Geometric Design, Vol. 5, No, 4, Nov. 1988, pp. 285307.
2. D.S. Arnon, "Topologically Reliable Display of Algebraic Curves,"Computer Graphics, Vol. 17, No. 3, July 1983, pp. 219227.
3. E.L. Allgower and P.H. Schmidt, "An Algorithm for PiecewiseLinear Approximation of an Implicitly Defined Manifold,"SIAM J. Numerical Analysis, Vol. 22, No. 2, Apr. 1985, pp. 322346.
4. W.E. Lorensen and H.E. Cline, "Marching Cubes: A HighResolution 3D Surface Construction Algorithm,"Computer Graphics(Proc. Siggraph 87), ACM Press, New York, Vol. 21, No. 4, 1987, pp. 163169.
5. E.L. Allgower and S. Gnutzmann, "Simplicial Pivoting for Mesh Generation of Implicitly Defined Surfaces,"ComputerAided Geometric Design, Vol. 8, No. 4, Oct. 1991, pp. 305325.
6. M. Hall and J. Warren, "Adaptive Polygonization of Implicitly Defined Surfaces,"IEEE CG&A, Vol. 10, No. 6, Nov. 1990, pp. 3342.
7. G. Taubin, "Distance Approximations for Rasterizing Implicit Curves,"ACM Trans. Graphics, Vol. 13, No. 1, Jan. 1994 (to appear).
8. P. Pedersen,Counting Real Zeros, doctoral thesis, Computer Science Dept., New York Univ., New York, 1991.
9. R.T. Farouki and V.T. Rajan, "On the Numerical Condition of Poly1 nomials in Bernstein Form,"ComputerAided Geometric Design, Vol. 4, No. 3, Nov. 1987, pp. 191216.
10. T. Duff, "Interval Arithmetic and Recursive Subdivision for Implicit Functions and Constructive Solid Geometry,"Computer Graphics(Proc. Siggraph), Vol. 26, No. 2, July 1992, pp. 131138.
11. A. Borodin and I. Munro,The Computational Complexity of Algebraic and Numeric Problems, American Elsevier, New York, 1975.
12. R. Walker,Algebraic Curves, Princeton Univ. Press, Princeton, N.J., 1950.