GMU:Processing im Park/Dirk Wäsch/Code Finale Aufgabe: Difference between revisions

GMU:Processing im Park/Dirk Wäsch/Code Finale Aufgabe (view source)

Revision as of 15:31, 1 April 2016

55 bytes removed , 1 April 2016

no edit summary

Cive4563

344

edits

@@ Line 4: / Line 4: @@
 <source lang="java">
 float[] pixefs;
-ArrayList< Integer > neighbours;
+ArrayList< Integer > Farbe;
 int area = 1;
@@ Line 14: / Line 14: @@
    size( 1366,768 );
-   PImage im = loadImage( "beispiel2.jpg" );
+   PImage im = loadImage( "bild.jpg" );
    background( 255 );
    image( im, 0, 0, width, height );
-   neighbours = new ArrayList< Integer >();
+   Farbe = new ArrayList< Integer >();
    loadPixels();
@@ Line 37: / Line 37: @@
          continue;
        if ( active( x, y ) ) {
-         // println( x +" / "+ y + " has at least one neighbours who is not black" );
+         // println( x +" / "+ y + "hat die letzte angrenzende Farbe schwarz" );
-         getNeighbours( x, y, area );
+         getFarbe( x, y, area );
-         float inf = influence / neighbours.size();
+         float inf = influence / Farbe.size();
-         for ( int i = 0; i < neighbours.size(); i++ ) {
+         for ( int i = 0; i < Farbe.size(); i++ ) {
-           int nid = neighbours.get( i );
+           int nid = Farbe.get( i );
            pixefs[ nid ] -= inf * pow( ( 255.f / pixefs[ nid ] ), power );
            if ( pixefs[ nid ] < 0 )
@@ Line 69: / Line 69: @@
 }
-void getNeighbours( int x, int y, int range ) {
+void getFarbe( int x, int y, int range ) {
-   neighbours.clear();
+   Farbe.clear();
    for ( int ty = y-range; ty <= y+range; ty++ ) {
      if ( ty < 0 )
@@ Line 83: / Line 83: @@
        if ( tx == x && ty == y )
          continue;
-       neighbours.add( tx + ty * width );
+       Farbe.add( tx + ty * width );
      }
    }