Tag Info

New answers tagged

1

Here how I 've done it (c#) private static float[] grad = new float[256]; private static int[] p = {151,160,137,91,90,15, 131,13,201,95,96,53,194,233,7,225,140,36,103,30,69,142,8,99,37,240,21,10,23, 190, 6,148,247,120,234,75,0,26,197,62,94,252,219,203,117,35,11,32,57,177,33, 88,237,149,56,87,174,20,125,136,171,168, ...


2

Checking all the voxels should not be that bad - modern CPUs can often do brute force processing faster than 'clever' solutions because those clever solutions often contain a lot of branching and jumping around in memory which is very costly compared to simple arithmetic or iterating over an array. If youre using a low level enough language, you can try ...


0

marching cubes deals with voxel densities between -1 and 1 and alters the geometry of each cube based on its own density compared to the densities around it. this mean that it can actually put faces(triangles) within sections of space that contain less than zero density. In such cases trying to change the value at that section (using a FloorToInt function or ...



Top 50 recent answers are included