Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

When I tried marching cubes and dual contouring against SDFs I ended up with a ton of performance issues that I was unable to resolve in the time I had allotted for experimenting. To get the resolution I needed I ended up with way too many triangles which used a lot of memory. I could later simplify the meshes but given the high number of initial triangles that process was quite slow. What I would like to explore (and hope that someone else does before me) would be a SDF optimized meshing algorithm that would make use of the extra distance and normal information.


Were you using OpenVDB? I'm not sure it solves that particular problem, but I found it to be a great library for dealing with this sort of data.


I did not, I'm away from my notes at the moment so I don't remember which libraries I used. I used a couple of different ones but not OpenVDB. Next time I try this task I'll try OpenVDB and see how far I get. Thanks for the recommendation.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: