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
$300 Free Credits to Build on Google Cloud Icon
$300 Free Credits to Build on Google Cloud

New customers can spin up VMs, build with AI, and query data at no cost.

Put your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
Start Free
Rate This Project
Login To Rate This Project

User Ratings

5.0 out of 5 stars
★★★★★
★★★★
★★★
★★
★
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

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
Read more reviews >

Additional Project Details

Registered

2011-02-28
Report inappropriate content