minimun -> minimum

pull/275/head
hsjoihs 4 years ago
parent 928af6f074
commit 62c49ac84d

@ -16,7 +16,7 @@ Ce qui signifie qu'il va nous falloir itérer sur tous les points et conserver l
![](cell-00.png)
```glsl
float m_dist = 1.; // distance minimun
float m_dist = 1.; // distance minimum
for (int i = 0; i < TOTAL_POINTS; i++) {
float dist = distance(st, points[i]);
m_dist = min(m_dist, dist);

@ -23,7 +23,7 @@ void main() {
point[3] = vec2(0.31,0.26);
point[4] = u_mouse/u_resolution;
float m_dist = 1.; // minimun distance
float m_dist = 1.; // minimum distance
// Iterate through the points positions
for (int i = 0; i < 5; i++) {

@ -25,7 +25,7 @@ void main() {
vec2 i_st = floor(st);
vec2 f_st = fract(st);
float m_dist = 1.; // minimun distance
float m_dist = 1.; // minimum distance
for (int y= -1; y <= 1; y++) {
for (int x= -1; x <= 1; x++) {

@ -25,7 +25,7 @@ void main() {
vec2 i_st = floor(st);
vec2 f_st = fract(st);
float m_dist = 1.; // minimun distance
float m_dist = 1.; // minimum distance
for (int j= -1; j <= 1; j++ ) {
for (int i= -1; i <= 1; i++ ) {
// Neighbor place in the grid

@ -23,7 +23,7 @@ void main() {
point[3] = vec2(0.31,0.26);
point[4] = u_mouse/u_resolution;
float m_dist = 1.; // minimun distance
float m_dist = 1.; // minimum distance
vec2 m_point; // minimum position
// Iterate through the points positions

@ -25,7 +25,7 @@ void main() {
vec2 i_st = floor(st);
vec2 f_st = fract(st);
float m_dist = 10.; // minimun distance
float m_dist = 10.; // minimum distance
vec2 m_point; // minimum point
for (int j=-1; j<=1; j++ ) {

Loading…
Cancel
Save