
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Luis Ibáñez, Chafiaâ Hamitouche, Christian Roux, "A Vectorial Algorithm for Tracing Discrete Straight Lines in NDimensional Generalized Grids," IEEE Transactions on Visualization and Computer Graphics, vol. 7, no. 2, pp. 97108, AprilJune, 2001.  
BibTex  x  
@article{ 10.1109/2945.928163, author = {Luis Ibáñez and Chafiaâ Hamitouche and Christian Roux}, title = {A Vectorial Algorithm for Tracing Discrete Straight Lines in NDimensional Generalized Grids}, journal ={IEEE Transactions on Visualization and Computer Graphics}, volume = {7}, number = {2}, issn = {10772626}, year = {2001}, pages = {97108}, doi = {http://doi.ieeecomputersociety.org/10.1109/2945.928163}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Visualization and Computer Graphics TI  A Vectorial Algorithm for Tracing Discrete Straight Lines in NDimensional Generalized Grids IS  2 SN  10772626 SP97 EP108 EPD  97108 A1  Luis Ibáñez, A1  Chafiaâ Hamitouche, A1  Christian Roux, PY  2001 KW  Discrete line tracing KW  digital topology KW  discrete geometry. VL  7 JA  IEEE Transactions on Visualization and Computer Graphics ER   
Abstract—This paper presents an algorithm to trace discrete straight lines in regular grids of any dimension. Most known line tracing algorithms have been developed in
[1] J.E. Bresenham, “Algorithm for Computer Control of a Digital Plotter,” IBM Systems J., vol. 4, pp. 2530, 1965.
[2] A.E. Kaufman, “Volume Synthesis,” Proc. Sixth Int'l Workshop Discrete Geometry for Computer Imagery (DGCI 96), pp. 87100, Nov. 1996.
[3] A.S. Glassner, Graphics Gems.Cambridge, Mass.: AP Professional, 1990.
[4] G. Sakas, M. Grimm, and A. Savapoulos, “Optimized Maximum Intensity Projection (MIP),” Proc. Eurographics Workshop, pp. 5163, June 1995.
[5] J.D. Foley,A. van Dam,S.K. Feiner,, and J.F. Hughes,Computer Graphics: Principles and Practice,Menlo Park, Calif.: AddisonWesley, 1990.
[6] S. Matej and R.M. Lewit, “Efficient 3D Grids for Image Reconstruction Using SphericallySymmetric Volume Elements,” IEEE Trans. Nuclear Science, vol. 42, no. 4, pp. 13611370, Aug. 1995.
[7] S. Matej, G.T. Herman, and A. Vardi, “Binary Tomography on the Hexagonal Grid Using Gibbs Priors,” Int'l J. Imaging Systems Technology, vol. 9, pp. 126131, 1998.
[8] G.T. Herman, “Finitary 1Simply Connected Digital Spaces,” Graphical Models and Image Processing, vol. 60, no. 1, pp. 4656, Jan. 1998.
[9] G.T. Herman and E. Zhao, “Jordan Surfaces in Simply Connected Digital Spaces,” J. Math. Imaging and Vision, vol. 6, pp. 121138, 1996.
[10] G.T. Herman, “Biomedical Applications of Digital Geometry,” Proc. Third IEEEEMBS Int'l Summer School, June 1998.
[11] J. Serra, Image Analysis and Mathematical Morphology. Academic Press, 1982.
[12] R. Ulichney, Digital Halftoning. Cambridge, Mass.: MIT Press, 1987.
[13] J.H. Conway and N.J.A. Sloane, Sphere Packing Lattice and Groups, second ed. SpringerVerlag, 1993.
[14] G.E. Martin, Transformation Geometry, An Introduction to Symmetry. Berlin: SpringerVerlag, 1982.
[15] D.E. Dudgeon and R.M. Mersereau, Multidimensional Digital Signal Processing.Englewood Cliffs, N.J.: Prentice Hall, 1984.
[16] L. Ibáñez, C. Hamitouche, and C. Roux, “Determination of Discrete Sampling Grids with Optimal Topological and Spectral Properties,” Proc. Sixth Int'l Workshop Discrete Geometry for Computer Imagery (DGCI 96), pp. 181192, 1996.
[17] L. Ibáñez, C. Hamitouche, and C. Roux, “RayTracing and 3D Object Representation in the BCC and FCC Grids,” Proc. Seventh Int'l Workshop Discrete Geometry for Computer Imagery (DGCI 97), pp. 235241, Dec. 1997 (available from:).
[18] H.S.M. Coxeter, Introduction to Geometry, second ed. John Wiley&Sons, 1969.
[19] D. Nogly and M. Schladt, “Digital Topology on Graphs,” Computer Vision and Image Understanding, vol. 63, no. 2, pp. 394396, Mar. 1996.
[20] JP. Reveillès, “Géométrie discrete, calculs en nombres entiers et algorithmique,” thèse de doctorat d'etat, Département d'Informatique, UniversitéLouis Pasteur, Strasbourg, 1991.
[21] E. Andrè, “Cercles discrets et rotations discretes,” thèse de doctorat, UniversitéLuis Pasteur, Strasbourg, 1992.
[22] O. Figueiredo and J.P. Reveillès, “A Contribution to 3D Digital Lines,” Proc. Fifth Int'l Workshop Discrete Geometry for Computer Imagery (DGCI 95), pp. 187189, Sept. 1995.
[23] E. Andres, P. Nehlig, and J. Françon, “Supercover of Straight Lines, Planes and Triangles,” Proc. Seventh Int'l Workshop Discrete Geometry for Computer Imagery (DGCI 97), pp. 243253, 1997.
[24] J. Françon, J.M. Schramm, and M. Tajine, “Recognizing Arithmetic Straight Lines and Planes,” Proc. Sixth Int'l Workshop Discrete Geometry for Computer Imagery (DGC I96), pp. 141150, 1996.
[25] C.E. Kim, “ThreeDimensional Digital Line Segments,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 5, no. 2, 1983.
[26] I. Stojmenovic and R. Tosic, “Digitization Schemes and the Recognition of Digital Straight Lines, Hyperplanes, and Flats in Arbitrary Dimensions,” Contemporary Math., vol. 119, pp. 197212, 1991.
[27] A. Rosenfeld, “Digital Straight Line Segments,” IEEE Trans. Computers, vol. 23, pp. 12641269, 1974.
[28] A. Kaufman, “Efficient Algorithms for 3D Scan Conversion of Parametric Curves, Surfaces, and Volumes,” Computer Graphics, vol. 21, pp. 171179, 1987.
[29] K. Voss, Discrete Images, Objects, and Functions in$Z^{n}$. SpringerVerlag, 1993.
[30] E. Andrès and J.P. Reveillès, “Discrete RayCasting,” Proc. Eighth Int'l Conf. Discrete Geometry for Computer Imagery (DGCI '99), pp. 435446, Mar. 1999.
[31] J. Amantides and A. Woo, “A Fast Voxel Traversal Algorithm for Ray Tracing,” Proc. EUROGRAPHICS '87, pp. 310, 1987.
[32] G. Ruiz, J.A. Michell, and A. Buron, "SwitchLevel Fault Detection and Diagnosis Environment for MOS Digital Circuits Using Spectral Techniques," IEE Proc., Part E, vol. 139, no. 4, pp. 293307, July 1992.
[33] P. Nehlig and C. Montani, “A Discrete Template Based Plane Casting Algorithm for Volume Viewing,” Proc. Fifth Int'l Workshop Discrete Geometry for Computer Imagery (DGCI 96), pp. 7179, Sept. 1995.