Uploaded October 2026 | Updated November 2026, 6 hours ago
This is a 3D representation of the simulation youtu.be/KfebH5d-6Uc comparing the effect of Dirichlet boundary conditions (bottom left at the beginning of the video) and Neumann boundary conditions (top right at the beginning) for waves generated in the middle of a ring of obstacles on a "sunflower" pattern, used before in the video youtu.be/ErSkuNelMU8 . This pattern is obtained in polar coordinates by placing the points at angles increasing by the golden angle, and gradually increasing the radius in a way keeping the density constant.
Dirichlet boundary conditions are very easy to implement in a finite difference scheme: it suffices to keep the wave height equal to zero outside the domain, and use this zero value when computing the discrete Laplacian. For Neumann boundary conditions, however, one has to implement the condition that the normal derivative of the wave height is zero at the boundary. This is implemented here by adding "ghost" points next to the grid points in the domain, and computing their value in such a way that the normal derivative is approximately zero. These points are then used to compute the discrete Laplacian at points in the domain next to the boundary.
The color hue and the z-coordinate depend on the wave height.
Render time: 1 hour 57 seconds
Compression: crf 25
Color scheme: Turbo, by Anton Mikhailov
gist.github.com/mikhailov-work/6a308c20e494d9e0ccc29036b28faa7a
Music: "Extra Steps" by Jimmy Fontanez/Media Rights Productions
See also
https://images.math.cnrs.fr/des-ondes-dans-mon-billard-partie-i/ for more explanations (in French) on a few previous simulations of wave equations.
The simulation solves the wave equation by discretization. The algorithm is adapted from the paper hplgit.github.io/fdm-book/doc/pub/wave/pdf/wave-4print.pdf
C code: github.com/nilsberglund-orleans/YouTube-simulations
https://www.idpoisson.fr/berglund/software.html
Many thanks to Marco Mancini and Julian Kauth for helping me to accelerate my code!
#wave #obstacles #diffraction
This is a 3D representation of the simulation youtu.be/KfebH5d-6Uc comparing the effect of Dirichlet boundary conditions (bottom left at the beginning of the video) and Neumann boundary conditions (top right at the beginning) for waves generated in the middle of a ring of obstacles on a "sunflower" pattern, used before in the video youtu.be/ErSkuNelMU8 . This pattern is obtained in polar coordinates by placing the points at angles increasing by the golden angle, and gradually increasing the radius in a way keeping the density constant.
Dirichlet boundary conditions are very easy to implement in a finite difference scheme: it suffices to keep the wave height equal to zero outside the domain, and use this zero value when computing the discrete Laplacian. For Neumann boundary conditions, however, one has to implement the condition that the normal derivative of the wave height is zero at the boundary. This is implemented here by adding "ghost" points next to the grid points in the domain, and computing their value in such a way that the normal derivative is approximately zero. These points are then used to compute the discrete Laplacian at points in the domain next to the boundary.
The color hue and the z-coordinate depend on the wave height.
Render time: 1 hour 57 seconds
Compression: crf 25
Color scheme: Turbo, by Anton Mikhailov
gist.github.com/mikhailov-work/6a308c20e494d9e0ccc29036b28faa7a
Music: "Extra Steps" by Jimmy Fontanez/Media Rights Productions
See also
https://images.math.cnrs.fr/des-ondes-dans-mon-billard-partie-i/ for more explanations (in French) on a few previous simulations of wave equations.
The simulation solves the wave equation by discretization. The algorithm is adapted from the paper hplgit.github.io/fdm-book/doc/pub/wave/pdf/wave-4print.pdf
C code: github.com/nilsberglund-orleans/YouTube-simulations
https://www.idpoisson.fr/berglund/software.html
Many thanks to Marco Mancini and Julian Kauth for helping me to accelerate my code!
#wave #obstacles #diffraction










