I have always wanted to write a fluid simulation, and with the help of a paper and some StackOverflow users I've got something that works. My goal is to have a program that someone can run right away without having to install anything.

My plans:

  • Fix framerate (eventually)
  • More configurable user input
  • Have almost all constants configurable by the user at runtime, so not const
  • Have starting velocity and density outside the main loop

Beginning Code

#include <SDL2/SDL.h>
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <chrono>
#include <thread>

typedef std::vector<float> vfloat;

// Constants
const int SCREEN_WIDTH = 800;
const int SCREEN_HEIGHT = 800;  // Should match SCREEN_WIDTH
const int N = 50;               // Grid size
const int SIM_LEN = 3000;       // Based on actual framerate

// Locks framerate at ~64, see stackoverflow.com/q/23258650/3163618
const std::chrono::milliseconds DELAY_LENGTH(5);

const float VISC = 0.01;
const float dt = 0.005;
const float DIFF = 0.01;

const bool DISPLAY_CONSOLE = false; // Console or graphics
const bool DRAW_GRID = false; // implement later
const bool DRAW_VEL = true;

const float MOUSE_DENS = 100.0;

// Code begins here
const int nsize = (N+2)*(N+2);

inline int IX(int i, int j){return i + (N+2)*j;}

Math routines (If anyone can suggest a method to implement boundaries correctly in advect, please do so!)

// Bounds (currently a box with solid walls)
void set_bnd(const int b, vfloat &x, std::vector<bool> &bound)

    for (int i=1; i<=N; i++)
        x[IX(0  ,i)] = b==1 ? -x[IX(1,i)] : x[IX(1,i)];
        x[IX(N+1,i)] = b==1 ? -x[IX(N,i)] : x[IX(N,i)];
        x[IX(i,  0)] = b==2 ? -x[IX(i,1)] : x[IX(i,1)];
        x[IX(i,N+1)] = b==2 ? -x[IX(i,N)] : x[IX(i,N)];

    x[IX(0  ,0  )] = 0.5*(x[IX(1,0  )] + x[IX(0  ,1)]);
    x[IX(0  ,N+1)] = 0.5*(x[IX(1,N+1)] + x[IX(0  ,N)]);
    x[IX(N+1,0  )] = 0.5*(x[IX(N,0  )] + x[IX(N+1,1)]);
    x[IX(N+1,N+1)] = 0.5*(x[IX(N,N+1)] + x[IX(N+1,N)]);

    // Boundaries should be 2+ cells thick
    for (int i=1; i<=N; i++)
        for (int j=1; j<=N; j++)
            if (bound[IX(i,j)])
                if (b==1)
                    x[IX(i,j)] = (bound[IX(i-1,j)] && bound[IX(i+1,j)]) ? 0 : - x[IX(i-1,j)] - x[IX(i+1,j)];
                else if (b==2)
                    x[IX(i,j)] = (bound[IX(i,j-1)] && bound[IX(i,j+1)]) ? 0 : - x[IX(i,j-1)] - x[IX(i,j+1)];

                else if (b==0)
                    // Distribute density from bound to surrounding cells
                    int nearby_count = !bound[IX(i+1,j)] + !bound[IX(i-1,j)] + !bound[IX(i,j+1)] + !bound[IX(i,j-1)];
                    float spread = x[IX(i,j)] / nearby_count;
                    if (!bound[IX(i+1,j)]) x[IX(i+1,j)] += spread;
                    if (!bound[IX(i-1,j)]) x[IX(i-1,j)] += spread;
                    if (!bound[IX(i,j+1)]) x[IX(i,j+1)] += spread;
                    if (!bound[IX(i,j-1)]) x[IX(i,j-1)] += spread;

                    x[IX(i,j)] = 0;

inline void lin_solve(int b, vfloat &x, const vfloat &x0, float a, float c, std::vector<bool> &bound)
    for (int k=0; k<20; k++)
        for (int i=1; i<=N; i++)
            for (int j=1; j<=N; j++)
                x[IX(i,j)] = (x0[IX(i,j)] +
                              a*(x[IX(i-1,j)]+x[IX(i+1,j)]+x[IX(i,j-1)]+x[IX(i,j+1)])) / c;

        set_bnd (b, x, bound);

// Add forces
void add_source(vfloat &x, const vfloat &s, float dt)
    for (int i=0; i<nsize; i++) x[i] += dt*s[i];

// Diffusion with Gauss-Seidel relaxation
void diffuse(int b, vfloat &x, const vfloat &x0, float diff, float dt, std::vector<bool> &bound)
    float a = dt*diff*N*N;
    lin_solve(b, x, x0, a, 1+4*a+dt, bound); // Amazing fix due to Iwillnotexist Idonotexist


// Backwards advection
void advect(int b, vfloat &d, const vfloat &d0, const vfloat &u, const vfloat &v, float dt, std::vector<bool> &bound)
    float dt0 = dt*N;
    for (int i=1; i<=N; i++)
        for (int j=1; j<=N; j++)
            float x = i - dt0*u[IX(i,j)];
            float y = j - dt0*v[IX(i,j)];
            if (x<0.5) x=0.5; if (x>N+0.5) x=N+0.5;
            int i0=(int)x; int i1=i0+1;
            if (y<0.5) y=0.5; if (y>N+0.5) y=N+0.5;
            int j0=(int)y; int j1=j0+1;

            float s1 = x-i0; float s0 = 1-s1; float t1 = y-j0; float t0 = 1-t1;
            d[IX(i,j)] = s0*(t0*d0[IX(i0,j0)] + t1*d0[IX(i0,j1)]) +
                         s1*(t0*d0[IX(i1,j0)] + t1*d0[IX(i1,j1)]);
    set_bnd(b, d, bound);

// Force velocity to be mass-conserving (Poisson equation black magic)
void project(vfloat &u, vfloat &v, vfloat &p, vfloat &div, std::vector<bool> bound)
    float h = 1.0/N;
    for (int i=1; i<=N; i++)
        for (int j=1; j<=N; j++)
            div[IX(i,j)] = -0.5*h*(u[IX(i+1,j)] - u[IX(i-1,j)] +
                                   v[IX(i,j+1)] - v[IX(i,j-1)]);
            p[IX(i,j)] = 0;
    set_bnd(0, div, bound); set_bnd(0, p, bound);

    lin_solve(0, p, div, 1, 4, bound);

    for (int i=1; i<=N; i++)
        for (int j=1; j<=N; j++)
            u[IX(i,j)] -= 0.5*(p[IX(i+1,j)] - p[IX(i-1,j)])/h;
            v[IX(i,j)] -= 0.5*(p[IX(i,j+1)] - p[IX(i,j-1)])/h;
    set_bnd(1, u, bound); set_bnd(2, v, bound);


// Density solver
void dens_step(vfloat &x, vfloat &x0, vfloat &u, vfloat &v, float diff, float dt, std::vector<bool> &bound)
    add_source(x, x0, dt);
    swap(x0, x); diffuse(0, x, x0, diff, dt, bound);
    swap(x0, x); advect(0, x, x0, u, v, dt, bound);

// Velocity solver: addition of forces, viscous diffusion, self-advection
void vel_step(vfloat &u, vfloat &v, vfloat &u0, vfloat &v0, float visc, float dt, std::vector<bool> &bound)
    add_source(u, u0, dt); add_source(v, v0, dt);
    swap(u0, u); diffuse(1, u, u0, visc, dt, bound);
    swap(v0, v); diffuse(2, v, v0, visc, dt, bound);
    project(u, v, u0, v0, bound);
    swap(u0, u); swap(v0, v);
    advect(1, u, u0, u0, v0, dt, bound); advect(2, v, v0, u0, v0, dt, bound);
    project(u, v, u0, v0, bound);

Input, output

void console_write(vfloat &x)
    for (int j=N+1; j>=0; j--)
        for (int i=0; i<=N+1; i++)
            printf("%.3f\t", x[IX(i,j)]);
        std::cout << '\n';
    std::cout << '\n';

void screen_draw(SDL_Renderer *renderer, vfloat &dens, vfloat &u, vfloat &v, std::vector<bool> &bound)
    const float r_size = (SCREEN_WIDTH / float(N+2));
    for (int i=0; i<=N+1; i++)
        for (int j=0; j<=N+1; j++)
            SDL_Rect r;
            r.w = r_size+1;
            r.h = r_size+1;
            r.x = round(i*r_size);
            r.y = round((N+1-j)*r_size);

            if (bound[IX(i,j)] == 0)
                //if (dens[IX(i,j)] < 2.0)
                    int color = std::min(int(dens[IX(i,j)] * 255), 255);
                    SDL_SetRenderDrawColor(renderer, color, color, color, 0);
                //else // Negative density (error)
                //    SDL_SetRenderDrawColor(renderer, 255, 200, 255, 0);

            else // Object boundary
                SDL_SetRenderDrawColor(renderer, 0, 100, 100, 0);

            // Render rect
            SDL_RenderFillRect(renderer, &r);

            if (DRAW_VEL)
                SDL_SetRenderDrawColor(renderer, 255, 0, 0, 0);

                int x1 = round((i+0.5)*r_size);
                int y1 = round((N+1-j+0.5)*r_size);
                int x2 = x1 + r_size*u[IX(i,j)];
                int y2 = y1 + r_size*v[IX(i,j)];
                SDL_RenderDrawLine(renderer, x1, y1, x2, y2);

    // Render the rect to the screen

// Add density (or velocity) based on user input
void process_input(vfloat &dens_prev, vfloat &dens)
    int x, y;
    int *ptr_x = &x, *ptr_y = &y;

    float r_size = (SCREEN_WIDTH / float(N+2));

    unsigned int mouse_state = SDL_GetMouseState(ptr_x, ptr_y);

        int grid_x = round(x/r_size);
        int grid_y = N+2 - round(y/r_size);
        if (mouse_state & SDL_BUTTON(SDL_BUTTON_LEFT))
            std::cout << "Left ";
            dens_prev[IX(grid_x,grid_y)] += MOUSE_DENS;

        if (mouse_state & SDL_BUTTON(SDL_BUTTON_RIGHT))
            std::cout << "Right ";
            dens[IX(grid_x,grid_y)] = 0.0f;
            if (1<=grid_x && grid_x<=N && 1<=grid_y && grid_y<=N)
                dens[IX(grid_x-1,grid_y)] = 0.0f;
                dens[IX(grid_x+1,grid_y)] = 0.0f;
                dens[IX(grid_x,grid_y+1)] = 0.0f;
                dens[IX(grid_x,grid_y-1)] = 0.0f;

        std::cout << "mouse: " << x << ' ' << y << '|' << grid_x << ' ' << grid_y << std::endl;

Main loop

int main(int, char **)
    static vfloat u(nsize, 0), v(nsize, 0), u_prev(nsize, 0), v_prev(nsize, 0); // Horizontal, vertical velocity
    static vfloat dens(nsize, 0), dens_prev(nsize, 0);
    static std::vector<bool> bounds(nsize, 0);
    //fill_n(dens_prev, nsize, 0.0);

    // SDL initialize
    SDL_Window* window = NULL;

    if ( SDL_Init( SDL_INIT_VIDEO ) < 0 )
        printf( "SDL could not initialize! SDL_Error: %s\n", SDL_GetError() );

                              SCREEN_WIDTH, SCREEN_HEIGHT,
                              SDL_WINDOW_SHOWN );
    if( window == NULL )
        printf( "Window could not be created! SDL_Error: %s\n", SDL_GetError() );

    SDL_Renderer* renderer = NULL;
    renderer = SDL_CreateRenderer(window, 0, SDL_RENDERER_ACCELERATED);

    SDL_SetRenderDrawColor(renderer, 255, 0, 255, 255); // Background color, should not see this

    //timeBeginPeriod(1); // Set period to 1ms
    std::chrono::time_point<std::chrono::system_clock> t_start, t_end;
    std::chrono::duration<double, std::milli> elapsed_ms;

    // Create boundary objects
    for (int i=15; i<=20; i++)
        for (int j=20; j<=30; j++)
            bounds[IX(i,j)] = 1;

    // Main loop
    for (int t=0; t<SIM_LEN; t++)
        t_start = std::chrono::system_clock::now();

        process_input(dens_prev, dens);

        // Add some velocity
        for (int j=2*N/10.0; j<8*N/10.0; j++)
            for (int i=0; i<10; i++)
                u_prev[IX(i,j)] = 200.0;

        // Add some density
        for (int j=4*N/10.0; j<6*N/10.0;j++)
            dens_prev[IX(3,j)] = (t<100) ? 100.0 : 0.0;

        vel_step(u, v, u_prev, v_prev, VISC, dt, bounds);
        dens_step(dens, dens_prev, u, v, DIFF, dt, bounds);

        if (DISPLAY_CONSOLE)
            std::cout << "dens" << std::endl;
            std::cout << "u, v" << std::endl;
            console_write(u); console_write(v);
            std::cout << "dens_prev" << std::endl;

        screen_draw(renderer, dens, u, v, bounds);

        t_end = std::chrono::system_clock::now();
        elapsed_ms = t_end - t_start;

        //if (elapsed_ms.count())
        //    std::cout << "ms: " << elapsed_ms.count() << '\n';

        std::this_thread::sleep_for(DELAY_LENGTH - elapsed_ms);
    return 0;

It's your choice whether you want to actually run it or not. It comes out at about 370 lines.

  • \$\begingroup\$ I don't suppose the bottom-left of the box is meant to be producing limitless quantities of white smoke, is it? \$\endgroup\$
    – Veedrac
    Dec 28, 2015 at 17:29
  • 1
    \$\begingroup\$ You can pass SDL_RENDERER_PRESENTVSYNC flag to SDL_CreateRenderer call to limit frame rate by your display sync rate. \$\endgroup\$
    – Ilya Popov
    Dec 28, 2015 at 19:03
  • \$\begingroup\$ @Veedrac That's a result of my simplistic bound checking program: if density is on a boundary, push it out. Getting boundaries to work properly requires changing advect, which is not trivial since advect traces density backwards and then interpolates. \$\endgroup\$
    – qwr
    Dec 28, 2015 at 20:31

1 Answer 1


I won't comment on the things you already mentioned you are planning to implement in the future, except that as Ilya Popov already said, you can use SDL_RENDERER_PRESENTVSYNC to have SDL limit the frame rate for you.

Don't abbreviate names too much

Computers have enough RAM and storage space nowadays that you don't have to skimp on characters for variable and function names. Try to only use abbreviations that are so common that there is little chance that someone would not understand what is meant. While N is a common abbreviation for "number-of-things", and i is standard idiom for a loop iterator, someone who isn't familiar with fluid dynamics might not know that VISC is short for viscosity or DIFF for diffusion. Just spell them out. If names get very long, there might be good reasons to abbreviate. But resist removing just a few vowel here and there for no good reason; write set_bounds() instead of set_bnd(), and so on.

If you do need to abbreviate a name to keep the code readable, such as with IX(), then add a comment to explain what this function is supposed to do.

Use descriptive names

Some variables don't make sense to me at all. They are not even abbreviations, just one-character placeholders. For example, in set_bnd(), what is b? What is x? Even for a physicist or mathematician, x usually means the x-coordinate, so having this be a two-dimensional array is very confusing.

Another example is nsize. I know N is the grid size (it said so in the comments, and it's not too uncommon a name for a size, and we are simulating a grid here), the name nsize looks kind of redundant. But actually, it's the number of elements in the simulation grid with an added border. If there is no better name for it, describe this constant in a comment.

Use ALL_CAPS names only for macros

Using ALL_CAPS names is normally only used to warn the reader that something is not a regular variable or function, but a macro. Since you are declaring const variables, use lower case for all of them.

Don't put multiple statements on one line

It's easy to miss that a line consists of multiple statements. And especially when a line contains if-statements, it becomes hard to see what is part of the if-statement and what not.

Add spaces around operators, after commas

Whitespace around operators and between elements of a comma-separated lists really help readability of the code.

Use a code formatter

Try to use a code formatter such as indent, astyle or clang-format to automatically reformat your code. Have a look at the output of those tools with their default settings.

Make variables and functions static if possible

If a variable or function is only used in the same file as where it is declared, then make them static. This prevents the names of those variables and functions from clobbering the global namespace, and can help the compiler produce more efficient code.

Use SDL_PollEvent()

Instead of calling SDL_PumpEvents() and ignoring all events (you are just querying the mouse state), you should call SDL_PollEvent() process the events. Indeed, most events are not important for your program and you can ignore them, and in this case the mouse handling is probably fine, but at least handle SDL_QUIT events so the user can stop your program by closing the window.

The proper way to do this is to do this in process_input():

SDL_Event event;

while (SDL_PollEvent(&event)) {
    switch(event.type) {
        case SDL_QUIT:
            // signal the main loop to quit somehow

Consider making a struct for all grid element properties

Each grid element has several properties, such as velocity, density, whether it is part of the boundary or not, and so on. You have split the grid into several arrays, one for each property. It is usually much better to then create a class or struct that describes all the properties of a grid element, and then make an single array out of that struct. This reduces the number of pointers you have to pass around to the various functions. And if you are dealing with vectors, you might want to make a struct for that too. For example:

// A 2-dimensional vector
struct vec2 {
    float x;
    float y;

struct grid_element {
    vec2 velocity = {};
    float density = {};
    bool bound = {};

std::vector<grid_element> grid(nsize);

Use a library for vectors and/or multidimensional arrays

You can make your life easier by using one of the many C++ libraries around that implement vector types and multidimensional arrays. The only issue is that there are many to choose from, each with their own pros and cons.

Don't mix stdio and iostream

In console_write(), you use both printf() and std::cout << "\n";. The problem is that printf() is a C stdio function, and std::cout is a C++ iostream. These are two different things, they can each have their own implementation of buffering. The resulting output might not be what you expect. So be consistent and use only one of them.

(I personally recommend you either using printf(), or use fmtlib. The latter is pure C++, is very similar to printf() except that it uses the Python way of format string notation, and it will become standard in C++20.)

  • 1
    \$\begingroup\$ Thanks for taking the time to answer this old question. The weird variable names and C-like code come from the original paper, which iirc did not use vectors at all. I don't know if I want to fix my old code because I really don't understand the math behind the paper. \$\endgroup\$
    – qwr
    Aug 9, 2019 at 0:31

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.