Dual Contouring

Here are implementations of the Dual Contouring algorithm (SIGGRAPH 2002, see http://www1.cse.wustl.edu/~taoju/research/dualContour.pdf). The C++ code was co-developed by Tao Ju and Scott Schaefer, and Java port is done by Jean-Denis Boudreault.

Project Activity

See All Activity >

Follow Dual Contouring

Dual Contouring Web Site

Other Useful Business Software

Enterprise-grade ITSM, for every business

Give your IT, operations, and business teams the ability to deliver exceptional services—without the complexity.

Freshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.

Try it Free

Rate This Project

User Ratings

5.0 out of 5 stars

★★★★★

★★★★

★★★

★★

★

ease 1 of 5 2 of 5 3 of 5 4 of 5 5 of 5 0 / 5

features 1 of 5 2 of 5 3 of 5 4 of 5 5 of 5 0 / 5

design 1 of 5 2 of 5 3 of 5 4 of 5 5 of 5 0 / 5

support 1 of 5 2 of 5 3 of 5 4 of 5 5 of 5 0 / 5

User Reviews

Filter Reviews:

All

saucistophe Posted 2012-07-05

Nice One. I am very pleased to find this implementation, it will help me a lot... ...But, have you ever heard of code conventions? :D Plus, some klugdes (e.g: sg = ~(arr[0])) won't even compile on netBeans. But, hey, great to have some computer-hero stuff. Thank you.
captdc Posted 2011-02-28

Excellent meshing algorithm. perfect replacement for marching cubes

Additional Project Details

Registered

2011-02-28

Report inappropriate content