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
Our Free Plans just got better! | Auth0 Icon
Our Free Plans just got better! | Auth0

With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.

You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
Try free now
Rate This Project
Login To Rate This Project

User Ratings

★★★★★
★★★★
★★★
★★
2
0
0
0
0
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

  • 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.
  • Excellent meshing algorithm. perfect replacement for marching cubes
Read more reviews >

Additional Project Details

Registered

2011-02-28