GML Skript portieren

  • Java

Diese Seite verwendet Cookies. Durch die Nutzung unserer Seite erklären Sie sich damit einverstanden, dass wir Cookies setzen. Weitere Informationen

  • GML Skript portieren

    Dieser Code erstellt ein Polygon basierend auf dem Umriss eines Image. Er stammt aus GMPhysics by Chris Giles.
    Hat jemand von Euch Lust und Zeit (ich nämlich gerade nicht), in Java umzusetzen?

    Spoiler anzeigen

    GML-Quellcode

    1. //creates an instance of a polygon with verticies automatically added
    2. //arg0 - sprite name
    3. //arg1 - detail (lower = better)
    4. //arg2 - angle threshold in degrees (will remove points with angle differences below this level; 15 is a good value)
    5. // making this larger will make the body faster but less accurate;
    6. //arg3 - filename (optional); if specefied, a file with the vertex infromation will be created
    7. //returns new polygon ID
    9. d = argument1;
    10. spr = argument0;
    11. w = sprite_get_width(spr);
    12. h = sprite_get_height(spr);
    13. xoff = sprite_get_xoffset(spr);
    14. yoff = sprite_get_yoffset(spr);
    15. sprite_set_offset(spr,0,0);
    16. s = surface_create(w,h);
    17. surface_set_target(s);
    18. draw_set_blend_mode(bm_normal);
    19. draw_set_color(make_color_rgb(128,0,128));
    20. draw_set_alpha(1);
    21. draw_rectangle(0,0,w,h,false);
    22. draw_set_color(c_white);
    23. draw_sprite(spr,0,0,0);
    24. poly = create_polygon();
    25. trans = make_color_rgb(128,0,128);
    27. numPoints = 0
    28. vertex_x[0] = 0;
    29. vertex_y[0] = 0;
    30. vertex_k[0] = 1;
    31. tx = 0;
    32. ty = 0;
    33. fy = -1;
    34. for (tx=0;tx<w;tx+=d)
    35. {
    36. for (ty=0;ty<h;ty+=1)
    37. {
    38. if (surface_getpixel(s,tx,ty) != trans)
    39. {
    40. vertex_x[numPoints] = tx-xoff;
    41. vertex_y[numPoints] = h-ty-yoff;
    42. vertex_k[numPoints] = 1;
    43. numPoints += 1;
    44. if (fy < 0)
    45. fy = ty;
    46. lx = tx;
    47. ly = ty;
    48. break;
    49. }
    50. }
    51. }
    52. for (ty=0;ty<h;ty+=d)
    53. {
    54. for (tx=w-1;tx>=0;tx-=1)
    55. {
    56. if (surface_getpixel(s,tx,ty) != trans && ty > ly)
    57. {
    58. vertex_x[numPoints] = tx-xoff;
    59. vertex_y[numPoints] = h-ty-yoff;
    60. vertex_k[numPoints] = 1;
    61. numPoints += 1;
    62. lx = tx;
    63. ly = ty;
    64. break;
    65. }
    66. }
    67. }
    68. for (tx=w-1;tx>=0;tx-=d)
    69. {
    70. for (ty=h-1;ty>=0;ty-=1)
    71. {
    72. if (surface_getpixel(s,tx,ty) != trans && tx < lx)
    73. {
    74. vertex_x[numPoints] = tx-xoff;
    75. vertex_y[numPoints] = h-ty-yoff;
    76. vertex_k[numPoints] = 1;
    77. numPoints += 1;
    78. lx = tx;
    79. ly = ty;
    80. break;
    81. }
    82. }
    83. }
    84. for (ty=h-1;ty>=0;ty-=d)
    85. {
    86. for (tx=0;tx<w;tx+=1)
    87. {
    88. if (surface_getpixel(s,tx,ty) != trans && ty < ly && ty > fy)
    89. {
    90. vertex_x[numPoints] = tx-xoff;
    91. vertex_y[numPoints] = h-ty-yoff;
    92. vertex_k[numPoints] = 1;
    93. numPoints += 1;
    94. lx = tx;
    95. ly = ty;
    96. break;
    97. }
    98. }
    99. }
    102. for (i=0;i<numPoints-2;i+=1)
    103. {
    104. ang1 = point_direction(vertex_x[i],vertex_y[i], vertex_x[i+1],vertex_y[i+1]);
    105. ang2 = point_direction(vertex_x[i+1],vertex_y[i+1], vertex_x[i+2],vertex_y[i+2]);
    106. if (abs(ang1-ang2) <= argument2)
    107. vertex_k[i+1] = 0;
    108. }
    109. ang1 = point_direction(vertex_x[numPoints-2],vertex_y[numPoints-2], vertex_x[numPoints-1],vertex_y[numPoints-1]);
    110. ang2 = point_direction(vertex_x[numPoints-1],vertex_y[numPoints-1], vertex_x[0],vertex_y[0]);
    111. if (abs(ang1-ang2) <= argument2)
    112. vertex_k[numPoints-1] = 0;
    113. ang1 = point_direction(vertex_x[numPoints-1],vertex_y[numPoints-1], vertex_x[0],vertex_y[0]);
    114. ang2 = point_direction(vertex_x[0],vertex_y[0], vertex_x[1],vertex_y[1]);
    115. if (abs(ang1-ang2) <= argument2)
    116. vertex_k[0] = 0;
    118. fl = -1;
    119. if (is_string(argument3))
    120. {
    121. fl = file_text_open_write(argument3);
    122. file_text_write_string(fl, "poly = create_polygon();");
    123. file_text_writeln(fl);
    124. }
    126. for (i=0;i<numPoints;i+=1)
    127. if (vertex_k[i] == 1)
    128. {
    129. if (fl >= 0)
    130. {
    131. file_text_write_string(fl, "add_vertex( poly, " + string(vertex_x[i]) + ", " + string(vertex_y[i]) + " );");
    132. file_text_writeln(fl);
    133. }
    134. add_vertex(poly, vertex_x[i], vertex_y[i]);
    135. }
    137. if (fl >= 0)
    138. file_text_close(fl);
    140. sprite_set_offset(spr,xoff,yoff);
    141. surface_reset_target();
    142. surface_free(s);
    144. return poly;
    Alles anzeigen

  • Ich hab zwar auch keine Lust ^^

    aber sieh dir das mal an :) , ist ein gm to java converter

    oder auch das

    ancient-pixel.com
    youtube.com/user/SebastianMerkl <<< ich freu mich über einen Besuch ;)

    Dieser Beitrag wurde bereits 1 mal editiert, zuletzt von Aku_Ryou ()

  • Lösung

    Hab's doch selber gemacht. Jetzt werde ich probieren, wie sich area.intersect für Kollisionsabfragen eignet.

    Spoiler anzeigen

    Quellcode

    1. //creates an outline of a transparent image, points are stored in an array
    2. //arg0 - BufferedImage source image
    3. //arg1 - Int detail (lower = better)
    4. //arg2 - Int angle threshold in degrees (will remove points with angle differences below this level; 15 is a good value)
    5. // making this larger will make the body faster but less accurate;
    7. Point[] MakePoly(BufferedImage spr,int d,int angle){
    9. int w= spr.getWidth(null); int h= spr.getHeight(null);
    10. int[] vertex_x=new int[255], vertex_y=new int[255], vertex_k=new int[255];
    11. int numPoints=0, tx=0,ty=0,fy=-1,lx=0,ly=0; vertex_x[0]=0; vertex_y[0]=0; vertex_k[0]=1;
    12. for (tx=0;tx<w;tx+=d) for (ty=0;ty<h;ty+=1) if((spr.getRGB(tx,ty)>>24) != 0x00 )
    13. {vertex_x[numPoints]=tx; vertex_y[numPoints]=h-ty; vertex_k[numPoints]=1; numPoints++; if (fy<0) fy=ty; lx=tx; ly=ty; break; }
    14. for (ty=0;ty<h;ty+=d) for (tx=w-1;tx>=0;tx-=1) if((spr.getRGB(tx,ty)>>24) != 0x00 && ty > ly)
    15. {vertex_x[numPoints]=tx; vertex_y[numPoints]=h-ty; vertex_k[numPoints]=1; numPoints++; lx=tx; ly=ty; break; }
    16. for (tx=w-1;tx>=0;tx-=d) for (ty=h-1;ty>=0;ty-=1) if((spr.getRGB(tx,ty)>>24) != 0x00 && tx < lx)
    17. {vertex_x[numPoints]=tx; vertex_y[numPoints]=h-ty; vertex_k[numPoints]=1; numPoints ++; lx=tx; ly=ty; break; }
    18. for (ty=h-1;ty>=0;ty-=d) for (tx=0;tx<w;tx+=1) if((spr.getRGB(tx,ty)>>24) != 0x00 && ty < ly && ty > fy)
    19. {vertex_x[numPoints]=tx; vertex_y[numPoints]=h-ty; vertex_k[numPoints]=1; numPoints ++; lx=tx; ly=ty; break; }
    20. double ang1,ang2; for (int i=0;i<numPoints-2;i++) {
    21. ang1 = PointDirection(vertex_x[i],vertex_y[i], vertex_x[i+1],vertex_y[i+1]);
    22. ang2 = PointDirection(vertex_x[i+1],vertex_y[i+1], vertex_x[i+2],vertex_y[i+2]);
    23. if (Math.abs(ang1-ang2) <= angle) vertex_k[i+1] = 0; }
    24. ang1 = PointDirection(vertex_x[numPoints-2],vertex_y[numPoints-2], vertex_x[numPoints-1],vertex_y[numPoints-1]);
    25. ang2 = PointDirection(vertex_x[numPoints-1],vertex_y[numPoints-1], vertex_x[0],vertex_y[0]);
    26. if (Math.abs(ang1-ang2) <= angle) vertex_k[numPoints-1] = 0;
    27. ang1 = PointDirection(vertex_x[numPoints-1],vertex_y[numPoints-1], vertex_x[0],vertex_y[0]);
    28. ang2 = PointDirection(vertex_x[0],vertex_y[0], vertex_x[1],vertex_y[1]);
    29. if (Math.abs(ang1-ang2) <= angle) vertex_k[0] = 0;
    30. int n=0;for (int i=0;i<numPoints;i++)if(vertex_k[i]==1)n++;
    31. Point[] poly= new Point[n]; n=0; for (int i=0;i<numPoints;i++) if (vertex_k[i]==1)
    32. { poly[n]=new Point(); poly[n].x=vertex_x[i]; poly[n].y=h-vertex_y[i];n++;} return poly;
    33. }
    35. double PointDirection(double xfrom,double yfrom,double xto,double yto){
    36. return Math.atan2(yto-yfrom,xto-xfrom)*180/Math.PI ;
    37. }
    Alles anzeigen
    Bilder

    • screen.JPG

      175,57 kB, 1.200×676, 308 mal angesehen

    Dieser Beitrag wurde bereits 9 mal editiert, zuletzt von Melancor ()