An Integer One-Pass Algorithm for Voxel Traversal
| dc.contributor.author | Liu, Y. K. | en_US |
| dc.contributor.author | Zalik, B. | en_US |
| dc.contributor.author | Yang, H. | en_US |
| dc.date.accessioned | 2015-02-19T07:36:29Z | |
| dc.date.available | 2015-02-19T07:36:29Z | |
| dc.date.issued | 2004 | en_US |
| dc.description.abstract | Voxel traversing along a line in a uniformly divided voxel space is frequently needed in different applications of computer graphics. The paper presents a new integer one-pass algorithm for this problem. In 2D, the proposed approach is based on a modification of the well-known Bresenham algorithm. The algorithm is then extended in 3D where a special case may occur. It is characterized by a simple discriminator. A derivation for this discriminator given in the paper confirms that all calculations can be realized using only integer arithmetic. In this way, the accumulation of rounding errors is completely eliminated, and a robust and compact implementation can be easily achieved. One of the main advantages of the proposed algorithm is that it visits 1-3 voxels during each iteration thus assuring its efficiency. The algorithm has been compared with other algorithms for voxel traversing by measuring spent CPU time. For comparison, Cleary and Wyvill's, Amanatides and Woo's, and Code-based algorithm have been used. The proposed algorithm is faster than the referenced algorithms. | en_US |
| dc.description.number | 2 | en_US |
| dc.description.seriesinformation | Computer Graphics Forum | en_US |
| dc.description.volume | 23 | en_US |
| dc.identifier.doi | 10.1111/j.1467-8659.2004.00750.x | en_US |
| dc.identifier.issn | 1467-8659 | en_US |
| dc.identifier.pages | 167-172 | en_US |
| dc.identifier.uri | https://doi.org/10.1111/j.1467-8659.2004.00750.x | en_US |
| dc.publisher | The Eurographics Association and Blackwell Publishing Ltd. | en_US |
| dc.title | An Integer One-Pass Algorithm for Voxel Traversal | en_US |