A General Multi-step Algorithm for Voxel Traversing Along a Line

Simple item page
dc.contributor.authorLiu, Y. K.en_US
dc.contributor.authorSong, H. Y.en_US
dc.contributor.authorZalik, B.en_US
dc.date.accessioned2015-02-21T12:52:49Z
dc.date.available2015-02-21T12:52:49Z
dc.date.issued2008en_US
dc.description.abstractTraversing voxels along a three dimensional (3D) line is one of the most fundamental algorithms for voxel-based applications. This paper presents a new 6-connectivity integer algorithm for this task. The proposed algorithm accepts voxels having different sizes in x, y and z directions. To explain the idea of the proposed approach, a 2D algorithm is firstly considered and then extended in 3D. This algorithm is a multi-step as up to three voxels may be added in one iteration. It accepts both integer and floating-point input.The new algorithm was compared to other popular voxel traversing algorithms. Counting the number of arithmetic operations showed that the proposed algorithm requires the least amount of operations per traversed voxel. A comparison of spent CPU time using either integer or floating-point arithmetic confirms that the proposed algorithm is the most efficient. This algorithm is simple, and in compact form which also makes it attractive for hardware implementation.en_US
dc.description.number1en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume27en_US
dc.identifier.doi10.1111/j.1467-8659.2007.01097.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages73-80en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.2007.01097.xen_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltden_US
dc.titleA General Multi-step Algorithm for Voxel Traversing Along a Lineen_US
Files
Collections
27-Issue 1