Marching cubes patent (again)
Hi!
I'm working on a 3d rendering algorithm where I'm dividing a cube with a plane, potentially subdividing depending on how the cube has been cut and then triangulizing the remaining part. The triangulizing part reminded me of the marching cubes algorithm so I started to wonder: What's the state of the marching cubes patent? I can't seem to find any info - only a link to an IBM page. I guess this isn't touched by that patent since it's based on cutting a cube with a plane, but I'm thinking about using the marching cubes algo later on so it would be nice to know if I'll have to pay for it...
I think it's set to expire soon, but I don't recall the exact date. That said, marching tetrahedra is better and patent free. Also look for dual-space contouring, which appeared to be a better technique than either of these two.
The marching cubes patent has indeed expired recently, I didn't know it until I looked it up just now. That's excellent. In my opinion the marching cubes algo looks better than the tetrahedra, especially if the field gradient is steep. The errors it produces are more "symmetrical", and it uses fewer polygons.
edit: FYI the expiration date was 6/5/2005, ie. last month.
edit: FYI the expiration date was 6/5/2005, ie. last month.
I've also been watching the calendar on MC ;). And speaking of it, does anyone know of a good, simple implementation of it besides VTK?
This topic is closed to new replies.
Advertisement
Popular Topics
Advertisement