科技回声

Does there not exist some ridiculously parallel equivalent of Bresenham or Wu? I imagine with the right datastructure you should be able to do pixel/line intersection tests in the pixel shader?

A couple of earlier discussions:<p><a href="https://news.ycombinator.com/item?id=13671016" rel="nofollow">https://news.ycombinator.com/item?id=13671016</a><p><a href="https://news.ycombinator.com/item?id=9179336" rel="nofollow">https://news.ycombinator.com/item?id=9179336</a>

It's easy to extend Bresenham's algorithm (and probably Wu's too) to work in a 3D voxel space. But I don't know if it would solve the problems in TFA or whether the speed penalty of working with voxels would be worth it. Might be an interesting experiment.

It's hard to draw 2D lines using a 3D API? Doesn't sound like a revelation.

Does there not exist some ridiculously parallel equivalent of Bresenham or Wu? I imagine with the right datastructure you should be able to do pixel/line intersection tests in the pixel shader?

It's hard to draw 2D lines using a 3D API? Doesn't sound like a revelation.

Drawing Lines is Hard (2015)

4 条评论

Drawing Lines is Hard (2015)

4 条评论