开发者

Ray voxel intersection

开发者 https://www.devze.com 2023-02-17 17:36 出处:网络
I want to test for an intersection of a ray with a voxel field. I could naively crawl through the voxel field by cal开发者_开发知识库culating a ray-box intersection with the edge of the current voxel

I want to test for an intersection of a ray with a voxel field.

I could naively crawl through the voxel field by cal开发者_开发知识库culating a ray-box intersection with the edge of the current voxel, then doing the same for the next voxel until I hit something. But isn't there a faster way to trace through a voxel field? I was thinking something along the lines of Bresenham's line algorithm in 3D, something that could quickly give me all of the cells a given line intersects. Anyone done this before?

Due to certian limitations and the fact that these ray traces aren't happening that often, I do not want to build an octree or any other data structure.


Here's an implementation of Bresenham's in 3D. It's in matlab; if you don't speak that you can see a C implementation here.


I believe the octree-algorithm does what your asking for.

0

精彩评论

暂无评论...
验证码 换一张
取 消

关注公众号