|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| Peter Stephenson, Bruce Litow, "Why Step When You Can Run? Iterative Line Digitization Algorithms Based On Hierarchies Of Runs," IEEE Computer Graphics and Applications, vol. 20, no. 6, pp. 76-84, November/December, 2000. | |||
| BibTex | x | ||
| @article{ 10.1109/38.888020, author = {Peter Stephenson and Bruce Litow}, title = {Why Step When You Can Run? Iterative Line Digitization Algorithms Based On Hierarchies Of Runs}, journal ={IEEE Computer Graphics and Applications}, volume = {20}, number = {6}, issn = {0272-1716}, year = {2000}, pages = {76-84}, doi = {http://doi.ieeecomputersociety.org/10.1109/38.888020}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - MGZN JO - IEEE Computer Graphics and Applications TI - Why Step When You Can Run? Iterative Line Digitization Algorithms Based On Hierarchies Of Runs IS - 6 SN - 0272-1716 SP76 EP84 EPD - 76-84 A1 - Peter Stephenson, A1 - Bruce Litow, PY - 2000 VL - 20 JA - IEEE Computer Graphics and Applications ER - | |||
1. P.H. Smith and J. van Rosendale, "Data and Visualisation Corridors," Tech. Report CACR-164, Center for Advanced Computing Research, California Institute of Tech nology, Pasadena, Calif., Sept. 1998.
2. J. Foley, "Getting There: The Ten Top Problems Left," IEEE Computer Graphics and Applications, Vol. 20, No. 1, Jan./Feb. 2000, pp. 66-68.
3. P.D. Stephenson, The Structure of the Digitised Line: With Applications to Line Drawing and Ray Tracing in Computer Graphics, PhD thesis, Dept. of Computer Science, James Cook University of North Queensland, Townsville, Australia, Dec. 1998.
4. J.E. Bresenham, "Algorithm for Computer Control of a Digital Plotter," IBM Systems J., Vol. 4, No. 1, July 1965, pp. 25-30.
5. J.E. Bresenham, "Run Length Slice Algorithm for Incremental Lines," Fundamental Algorithms for Computer Graphics, Series F, Vol. 17, NATO Advanced Study Inst., R.A. Earnshaw, ed., Springer-Verlag, Berlin, 1985, pp. 59-104.
6. G.B. Reggiori, Digital Computer Transformations for Irregular Line Drawings, Tech. Report 403-22, New York University, New York, Apr. 1972; available from the US Dept. of Commerce as AD-745-015.
7. M.C. Whitton, "Memory Design for Raster Graphics Displays," IEEE Computer Graphics and Applications, Vol. 4, No. 3, 1984, pp. 48-65.
8. V. Boyer and J.J. Bourdin, "Fast Lines: A Span by Span Method," Computer Graphics Forum (Eurographics 99 Proc.), Vol. 18, No. 3, 1999, pp. C377-C384.
9. A. Rosenfeld, "Digital Straight Line Segments," IEEE Trans. on Computers, Vol. C-23, No. 12, Dec. 1974, pp. 1264-1269.
10. A. Rosenfeld, "Digital Geometry: Introduction and Bibliography," Advances in Digital and Computational Geometry, R. Klette, A. Rosenfeld, and F. Sloboda, eds., Springer, Berlin, 1998, pp. 1-54.