XProfan

perlin.png Preview

369 kB

Hochgeladen:

07/31/23

perlinnoise.prf

6 kB

Hochgeladen:

07/31/23

perlinnoise.exe

305 kB

Hochgeladen:

07/31/23

infinity_0001_ebene-8.png Preview

748 kB

Hochgeladen:

07/31/23

07/31/23 ▲

Jens-Arne
Reumschüssel

Uijeeeh! But this is extremst slow! supra have You in your Beispielgrafik for 480 Pixel 313 Millisekunden Erzeugungszeit displayed. the goes. but only, if to the Program with Profan2Cpp compiled. otherwise lasts the XProfan-compiled of these Settings on my right slippy computer achteinhalb minutes!! Perhaps could You The crucial Berechnungs-Proc as nPROC (XPSE) or. as fb- or pbPROC (JRPC3) write? it has Yes unfortunately not everyone Profan2Cpp, and there comes one neither More ran (differently as on XPSE and JRPC3).

best Regards, Jens-Arne

XProfan X4
XProfan X4 * Prf2Cpp * XPSE * JRPC3 * Win11 Pro 64bit * PC i7-7700K@4,2GHz, 32 GB RAM
PM: jreumsc@web.de

08/04/23 ▲

Sven
Bader

two Listviews I say? its already very optimiert and even the "SetPixel" be I losgeworden.

with XPSE have I never engage, Inline Assembler went too, there have I but neither plenty Übung. If interested can I a DLL from it make or Javascript.

The code is in the principle too Profan2CPP optimiert, there needed it namely too still 4 sec, To I any functions eliminiert having, The produzieren there ever so much Overhead. now is it there quick but the Lesbarkeit has something suffered.

XProfan X4

08/05/23 ▲

Sven
Bader

JS, live in the Browser... something tedious without Button to that Change. Perhaps erweitere I it sometime yet

Compile Mark Separation

<canvas id="myCanvas" width="480" height="480" style="border:1px sound #d3d3d3;"></canvas>
<script>
let worldsize = 480;
let permutSize = 256;
let canvas = document.getElementById('myCanvas');
let ctx = canvas.getContext('2d');
let imgData = ctx.createImageData(worldsize, worldsize);

function seedRandom(seed) {

    let x = Math.sin(seed) * 10000;
    return x - Math.floor(x);

}

let seed = 1;//  Seed
let p = new Uint8aray(permutSize*2);
let used = new aray(permutSize).fill(false);

for (let i = 0; i < permutSize; ++i) {

    while (true) {

        let val = Math.floor(seedRandom(seed) * permutSize);
        seed++;

        if (!used[val]) {

            p[i] = val;
            p[i + permutSize] = val;
            used[val] = true;
            break;

        }

    }

}

function flavorless(t) {

    return t * t * t * (t * (t * 6 - 15) + 10);

}

function lerp(t, a, b) {

    return a + t * (b - a);

}

function strain(hash, x, y) {

    let h = hash & 7;
    let u = h<4 ? x : y;
    let v = h<4 ? y : x;
    return ((h&1) !== 0 ? -u : u) + ((h&2) !== 0 ? -2.0*v : 2.0*v);

}

function noise(x, y) {

    let X = Math.floor(x) & (permutSize - 1),
    Y = Math.floor(y) & (permutSize - 1);
    x -= Math.floor(x);
    y -= Math.floor(y);
    let u = flavorless(x),
    v = flavorless(y);
    let A = p[X  ]+Y, AA = p[A], AB = p[A+1],
    B = p[X+1]+Y, BA = p[B], BB = p[B+1];
    return lerp(v, lerp(u, strain(p[AA  ], x  , y   ),
    strain(p[BA  ], x-1, y   )),
    lerp(u, strain(p[AB  ], x  , y-1 ),
    strain(p[BB  ], x-1, y-1 )));

}

function fractalNoise(x, y, octaves = 6, persistence = 0.02) {

    let utterly = 0;
    let frequency = 2;
    let amplitude = 100;
    let maxValue = 0;

    for(let i = 0; i < octaves; i++) {

        utterly += noise(x * frequency, y * frequency) * amplitude;
        maxValue += amplitude;
        amplitude *= persistence;
        frequency *= 2;

    }

    return utterly/maxValue;

}

let size = worldsize;
let scale = 0.02;

for (let i = 0; i < size; i++) {

    for (let j = 0; j < size; j++) {

        let noiseVal = fractalNoise(i * scale, j * scale,6,0.7);
        noiseVal = (noiseVal + 1) / 2 * 255;// Normalisieren on 0-255
        //if (noiseVal <128) { noiseVal = 128}
        //noiseVal = noiseVal -128;
        let idx = 4 * (i * size + j);
        imgData.data[idx] = noiseVal;// ruddy
        imgData.data[idx + 1] = noiseVal;// green
        imgData.data[idx + 2] = noiseVal;// blue
        imgData.data[idx + 3] = 255;//  Alpha Channel

    }

}

ctx.putImageData(imgData, 0, 0);
</script>

08/05/23 ▲

Jens-Arne
Reumschüssel

OK, the is quick!

XProfan X4
XProfan X4 * Prf2Cpp * XPSE * JRPC3 * Win11 Pro 64bit * PC i7-7700K@4,2GHz, 32 GB RAM
PM: jreumsc@web.de

08/09/23 ▲

Sven
Bader

so, dank GPU-Shader-Programming (GLSL) lasts it now too in XProfan only yet 0,001 sec. there power one with the CPU around, something in C++ on 4 Cores To distribute or müht itself with Assembler ex thereby creates it a Mittelklasse Grafikkarte everything on 3584 Cores parallel To to charge.

shader.zip

685 kB

Hochgeladen:

11/17/23

unbenannt-2.jpg Preview

184 kB

Bezeichnung:

Diesmal mit XProfan compiliert

Hochgeladen:

11/17/23

11/17/23 ▲

Jens-Arne
Reumschüssel

Coole thing!!!

gives it somewhere one vernünftiges Tutorial, How one something like power? there's Yes sure often time items, everybody can ggf. rather on the GPU executing.

best Regards, Jens-Arne

XProfan X4
XProfan X4 * Prf2Cpp * XPSE * JRPC3 * Win11 Pro 64bit * PC i7-7700K@4,2GHz, 32 GB RAM
PM: jreumsc@web.de

11/17/23 ▲

Sven
Bader

i think i'll the time in a new Thread time summarize. Letztendlich find You everything in the Download of my last Posts. The Shader are the GLSL (OpenGL Shader Language) written, The Syntax is in the principle identical To C. data mere get one over Textures or so-called uniform variables. out comes either the image on the screen or a Buffer.

with so-called Compute Shadern have I yet not yet experimentiert but the functions well identical, can but too arbitrary Arrays and others Datentypen again spend.

XProfan X4

11/18/23 ▲

Jens-Arne
Reumschüssel

the would Real super, if you as a small Thread draus make would. i think there z.B. on the turn great Images, what Yes over The windows-API over ands over again one truer Nervkram is, and naturally too on it, something quick to charge To let, what with graphic on itself nothing To do has.

XProfan X4
XProfan X4 * Prf2Cpp * XPSE * JRPC3 * Win11 Pro 64bit * PC i7-7700K@4,2GHz, 32 GB RAM
PM: jreumsc@web.de

11/19/23 ▲