https://github.com/francisengelmann/fast_voxel_traversal
Fast and simple voxel traversal algorithm through a 3D space partition.
https://github.com/francisengelmann/fast_voxel_traversal
Last synced: 7 months ago
JSON representation
Fast and simple voxel traversal algorithm through a 3D space partition.
- Host: GitHub
- URL: https://github.com/francisengelmann/fast_voxel_traversal
- Owner: francisengelmann
- License: mit
- Created: 2015-10-14T14:11:40.000Z (almost 10 years ago)
- Default Branch: master
- Last Pushed: 2019-12-18T19:34:01.000Z (almost 6 years ago)
- Last Synced: 2024-10-27T21:51:33.994Z (11 months ago)
- Language: C++
- Size: 9.77 KB
- Stars: 141
- Watchers: 2
- Forks: 24
- Open Issues: 2
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
### Fast Voxel Traversal Algorithm
This is an implementation of Amanatides et al. [1]: Given a 3D voxel grid, a starting position and an ending position in 3D space, we shoot a ray from the starting position to the ending position. This algorithm then lists all the voxel ID's being traversed by the ray.
#### License
This project is licensed under the terms of the MIT license.
#### References
[1] J. Amanatides and A. Woo, A Fast Voxel Traversal Algorithm for Ray Tracing, Eurographics, 1987.