FIRST HTML5 PYRO FOR MONKEY2 DEMO EVER!

[nerobotParticipant]

Sorry for belated answer about my poly checking function.

I wrote demo for demonstration. It contains Polygon class and some helpers.

Full code:

Monkey

Namespace polytest #Import "<std>" #Import "<mojo>" Using std.. Using mojo.. Function Main() New AppInstance Local wnd := New AppWindow("Polygon Test", 600, 600) Local game := New GameLogic wnd.OnRenderCallback += Lambda(canvas:Canvas) game.Draw(canvas) End App.Run() End ' AppWindow Class AppWindow Extends Window Field OnRenderCallback:Void(canvas:Canvas) Method New( title:String,width:Int,height:Int,flags:WindowFlags=Null ) Super.New( title,New Recti( 0,0,width,height ),flags|WindowFlags.Center ) End Method OnRender(canvas:Canvas) Override App.RequestRender() OnRenderCallback(canvas) End End ' GameLogic Class GameLogic Method New() Local poly := New Polygon(New Float[](0,0, 150,50, 200,100, 100,150)) poly.Origin = New Vec2f(100,50) polyObj = New PolyObject polyObj.poly = poly polyObj.pos = New Vec2f(300,300) End Method Update() Local p := Mouse.Location Local over := polyObj.PointIn(p.x, p.y) polyObj.color = over ? Color.Green Else Color.Blue polyObj.poly.Rotate(0.005) End Method Draw(canvas:Canvas) Update() 'hm, update in draw... polyObj.Draw(canvas) End Private Field polyObj:PolyObject End ' PolyObject Class PolyObject Field poly:Polygon Field pos:Vec2f Field color := Color.White Method Draw(canvas:Canvas) If poly = Null Return Local p := pos-poly.Origin canvas.Translate(p.x,p.y) canvas.Color = color canvas.DrawPoly(poly.Points) canvas.Color *= 0.25 canvas.DrawRect(poly.Bounds) canvas.Color = Color.Black canvas.DrawOval(poly.Origin.x-2, poly.Origin.y-2, 4, 4) End Method PointIn:Bool(px:Float, py:Float) px -= pos.x-poly.Origin.x 'bad place to get poly.Origin py -= pos.y-poly.Origin.y Return poly.PointIn(px, py) End End ' Polygon Class Polygon Method New(xyArray:Float[]) _points = New Float[xyArray.Length] For Local k := 0 Until xyArray.Length _points[k] = xyArray[k] Next UpdateBounds() End Method New(rect:Rectf) _points = New Float[8] _points[0] = rect.Left _points[1] = rect.Top _points[2] = rect.Right _points[3] = rect.Top _points[4] = rect.Right _points[5] = rect.Bottom _points[6] = rect.Left _points[7] = rect.Bottom _bounds = rect End Property Points:Float[]() Return _points End Property Bounds:Rectf() Return _bounds End Property Origin:Vec2f() Return _origin Setter(value:Vec2f) _origin = value End Property Rotation:Float() Return _rotation End Method Rotate(angle:Float) Local ox := _origin.x Local oy := _origin.y Local cos := Cos(angle) Local sin := Sin(angle) For Local k := 0 Until _points.Length Step 2 Local px := _points[k]-ox Local py := _points[k+1]-oy _points[k] = ox + px*cos - py*sin _points[k+1] = oy + px*sin + py*cos Next _rotation = (_rotation + angle) Mod 360.0 UpdateBounds() End Method Move(dx:Float, dy:Float) For Local k := 0 Until _points.Length Step 2 _points[k] += dx _points[k+1] += dy Next Local v := New Vec2f(dx,dy) _bounds += v _origin += v End Method PointIn:Bool(point:Vec2f) If Not _bounds.Contains(point) Then Return False Return PointIn(_points,point) End Method PointIn:Bool(px:Float, py:Float) Return PointIn(New Vec2f(px,py)) End Function PointIn:Bool(xy:Float[], point:Vec2f) Local px := point.x, py := point.y Local x1:Float, y1:Float, x2:Float, y2:Float Local koef:Float, koefA:Float Local cnt:Int = xy.Length Local sign:Int, sign2:Int For Local k := 0 Until cnt Step 2 x1 = xy[k] y1 = xy[k + 1] If k + 3 < cnt x2 = xy[k + 2] y2 = xy[k + 3] Else 'connect with first point x2 = xy[0] y2 = xy[1] Endif sign = Sgn(x2 - x1) sign2 = Sgn(px - x1) 'prevent division by zero If sign = 0 x2 += 0.0001 sign = 1 Endif If sign2 = 0 px += 0.0001 sign2 = 1 EndIf 'the slope coefficient (y = k*x + b) koef = (y1 - y2) / (x2 - x1) koefA = (y1 - py) / (px - x1) 'checking If (sign2 = sign And koefA > koef) Or (sign2 <> sign And koefA < koef) Return False Endif Next Return True End Function Private Field _points:Float[] 'xy pairs in one dimention array Field _bounds:Rectf 'bounds used for fast collision detection Field _origin := New Vec2f(0,0) Field _rotation:Float Method UpdateBounds() Local minX := _points[0] Local maxX := _points[0] Local minY := _points[1] Local maxY := _points[1] For Local k := 2 Until _points.Length Step 2 Local px := _points[k] Local py := _points[k+1] If px < minX minX = px Elseif px > maxX maxX = px Endif If py < minY minY = py Elseif py > maxY maxY = py Endif Next If _bounds = Null Then _bounds = New Rectf _bounds.Left = minX _bounds.Right = maxX _bounds.Top = minY _bounds.Bottom = maxY End End

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280

Namespace polytest     #Import "<std>" #Import "<mojo>"     Using std.. Using mojo..       Function Main()   New AppInstance   Local wnd := New AppWindow("Polygon Test", 600, 600) Local game := New GameLogic wnd.OnRenderCallback += Lambda(canvas:Canvas) game.Draw(canvas) End App.Run() End     ' AppWindow   Class AppWindow Extends Window   Field OnRenderCallback:Void(canvas:Canvas) Method New( title:String,width:Int,height:Int,flags:WindowFlags=Null ) Super.New( title,New Recti( 0,0,width,height ),flags|WindowFlags.Center ) End Method OnRender(canvas:Canvas) Override App.RequestRender() OnRenderCallback(canvas) End End     ' GameLogic   Class GameLogic   Method New() Local poly := New Polygon(New Float[](0,0, 150,50, 200,100, 100,150))         poly.Origin = New Vec2f(100,50) polyObj = New PolyObject polyObj.poly = poly polyObj.pos = New Vec2f(300,300) End Method Update() Local p := Mouse.Location                  Local over := polyObj.PointIn(p.x, p.y)         polyObj.color = over ? Color.Green Else Color.Blue                  polyObj.poly.Rotate(0.005) End Method Draw(canvas:Canvas) Update() 'hm, update in draw... polyObj.Draw(canvas) End Private Field polyObj:PolyObject End     ' PolyObject   Class PolyObject   Field poly:Polygon Field pos:Vec2f Field color := Color.White Method Draw(canvas:Canvas) If poly = Null Return Local p := pos-poly.Origin canvas.Translate(p.x,p.y) canvas.Color = color canvas.DrawPoly(poly.Points) canvas.Color *= 0.25 canvas.DrawRect(poly.Bounds) canvas.Color = Color.Black canvas.DrawOval(poly.Origin.x-2, poly.Origin.y-2, 4, 4) End Method PointIn:Bool(px:Float, py:Float) px -= pos.x-poly.Origin.x 'bad place to get poly.Origin py -= pos.y-poly.Origin.y Return poly.PointIn(px, py) End End     ' Polygon   Class Polygon   Method New(xyArray:Float[]) _points = New Float[xyArray.Length] For Local k := 0 Until xyArray.Length _points[k] = xyArray[k] Next UpdateBounds() End Method New(rect:Rectf) _points = New Float[8] _points[0] = rect.Left _points[1] = rect.Top _points[2] = rect.Right _points[3] = rect.Top _points[4] = rect.Right _points[5] = rect.Bottom _points[6] = rect.Left _points[7] = rect.Bottom _bounds = rect End Property Points:Float[]() Return _points End Property Bounds:Rectf() Return _bounds End Property Origin:Vec2f() Return _origin Setter(value:Vec2f) _origin = value End Property Rotation:Float() Return _rotation End Method Rotate(angle:Float) Local ox := _origin.x Local oy := _origin.y Local cos := Cos(angle) Local sin := Sin(angle) For Local k := 0 Until _points.Length Step 2 Local px := _points[k]-ox Local py := _points[k+1]-oy _points[k] = ox + px*cos - py*sin _points[k+1] = oy + px*sin + py*cos Next _rotation = (_rotation + angle) Mod 360.0 UpdateBounds() End Method Move(dx:Float, dy:Float) For Local k := 0 Until _points.Length Step 2 _points[k] += dx _points[k+1] += dy Next Local v := New Vec2f(dx,dy) _bounds += v _origin += v End Method PointIn:Bool(point:Vec2f) If Not _bounds.Contains(point) Then Return False Return PointIn(_points,point) End Method PointIn:Bool(px:Float, py:Float) Return PointIn(New Vec2f(px,py)) End Function PointIn:Bool(xy:Float[], point:Vec2f) Local px := point.x, py := point.y Local x1:Float, y1:Float, x2:Float, y2:Float Local koef:Float, koefA:Float Local cnt:Int = xy.Length Local sign:Int, sign2:Int For Local k := 0 Until cnt Step 2 x1 = xy[k] y1 = xy[k + 1] If k + 3 < cnt x2 = xy[k + 2] y2 = xy[k + 3] Else 'connect with first point x2 = xy[0] y2 = xy[1] Endif sign = Sgn(x2 - x1) sign2 = Sgn(px - x1) 'prevent division by zero If sign = 0 x2 += 0.0001 sign = 1 Endif If sign2 = 0 px += 0.0001 sign2 = 1 EndIf 'the slope coefficient (y = k*x + b) koef = (y1 - y2) / (x2 - x1) koefA = (y1 - py) / (px - x1) 'checking If (sign2 = sign And koefA > koef) Or (sign2 <> sign And koefA < koef) Return False Endif Next Return True End Function Private Field _points:Float[] 'xy pairs in one dimention array Field _bounds:Rectf 'bounds used for fast collision detection Field _origin := New Vec2f(0,0) Field _rotation:Float Method UpdateBounds() Local minX := _points[0] Local maxX := _points[0] Local minY := _points[1] Local maxY := _points[1] For Local k := 2 Until _points.Length Step 2 Local px := _points[k] Local py := _points[k+1] If px < minX minX = px Elseif px > maxX maxX = px Endif If py < minY minY = py Elseif py > maxY maxY = py Endif Next If _bounds = Null Then _bounds = New Rectf _bounds.Left = minX _bounds.Right = maxX _bounds.Top = minY _bounds.Bottom = maxY End End

[DiffrenzyKeymaster]

@nerobot: here’s another PointInPoly() , not that it seems you need it

 

Monkey

Function IsInsidePoly:Int(polypoints:Float[],x:Float,y:Float) Local j:Int = polypoints.Length()-2 Local oddNodes:Int For Local i:Int =0 Until polypoints.Length() Step 2 If (polypoints[i+1]< y And polypoints[j+1]>=y ) Or (polypoints[j+1]< y And polypoints[i+1]>=y) If (polypoints[i]<=x Or polypoints[j]<=x) If (polypoints[i]+(y-polypoints[i+1])/(polypoints[j+1]-polypoints[i+1])*(polypoints[j]-polypoints[i])<x) oddNodes = 1 ~ oddNodes Endif Endif Endif j=i Next Return oddNodes End Function

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

Function IsInsidePoly:Int(polypoints:Float[],x:Float,y:Float)   Local  j:Int = polypoints.Length()-2    Local oddNodes:Int   For Local i:Int =0 Until polypoints.Length() Step 2 If (polypoints[i+1]< y And polypoints[j+1]>=y )   Or   (polypoints[j+1]< y And polypoints[i+1]>=y) If  (polypoints[i]<=x Or polypoints[j]<=x) If (polypoints[i]+(y-polypoints[i+1])/(polypoints[j+1]-polypoints[i+1])*(polypoints[j]-polypoints[i])<x) oddNodes = 1 ~ oddNodes Endif Endif Endif j=i Next     Return oddNodes   End Function

[nerobotParticipant]

Your formula looks like a magic for me.

And it’s offtopic here.:)

[DiffrenzyKeymaster]

@playniax: Since this ( https://github.com/blitz-research/monkey2/issues/82 ) rendering bug looks somewhat similar to the one I reported on the  monkey1 forum ( http://www.monkey-x.com/Community/posts.php?topic=12629&post=124043&view=all#124043 ) , I’d be happy to test spiral again, if you would like to recomplie it with MX 1.07

@Evgenly Goroshkin : As I remember it, it’s from http://alienryderflex.com/polygon/ , Nathan Mercer’s version

[gcmartijnParticipant]

Monkey

' returns ' 0 = no collision ' 1 = line collion ' 2 = point inside Function PolyCollision:Int(polypoints:Float[],x:Float,y:Float) Local j:Int = polypoints.Length-2 Local cn:Int = 0 Local cn2:Int = 0 For Local i:Int=0 Until polypoints.Length Step 2 If i<=polypoints.Length-3 And (((polypoints[i+1] <= y) And (polypoints[i+3] > y)) Or ((polypoints[i+1] > y) And (polypoints[i+3] <= y))) Then Local vt:Float = (y - polypoints[i+1]) / (polypoints[i+3] - polypoints[i+1]) If (x < polypoints[i] + vt * (polypoints[i+2] - polypoints[i])) Then cn = 1 ~ cn End Elseif (polypoints[i+1]<y And polypoints[j+1]>=y) Or (polypoints[j+1]< y And polypoints[i+1]>=y) If (polypoints[i]<=x Or polypoints[j]<=x) If (polypoints[i]+(y-polypoints[i+1])/(polypoints[j+1]-polypoints[i+1])*(polypoints[j]-polypoints[i])<x) cn2 = 1 ~ cn2 Endif Endif End ' corners at the bottem If polypoints[i]=x And polypoints[i+1]=y Then cn = 1 ~ cn End j=i Next Return (cn&1)+(cn2&1) End Function

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30

' returns ' 0 = no collision ' 1 = line collion ' 2 = point inside Function PolyCollision:Int(polypoints:Float[],x:Float,y:Float) Local j:Int = polypoints.Length-2    Local cn:Int = 0   Local cn2:Int = 0   For Local i:Int=0 Until polypoints.Length Step 2 If i<=polypoints.Length-3 And (((polypoints[i+1] <= y) And (polypoints[i+3] > y)) Or ((polypoints[i+1] > y) And (polypoints[i+3] <=  y))) Then             Local vt:Float = (y  - polypoints[i+1]) / (polypoints[i+3] - polypoints[i+1])             If (x < polypoints[i] + vt * (polypoints[i+2] - polypoints[i])) Then                 cn = 1 ~ cn             End         Elseif (polypoints[i+1]<y And polypoints[j+1]>=y) Or (polypoints[j+1]< y And polypoints[i+1]>=y) If (polypoints[i]<=x Or polypoints[j]<=x) If (polypoints[i]+(y-polypoints[i+1])/(polypoints[j+1]-polypoints[i+1])*(polypoints[j]-polypoints[i])<x) cn2 = 1 ~ cn2 Endif Endif End ' corners at the bottem If polypoints[i]=x And polypoints[i+1]=y Then cn = 1 ~ cn End j=i Next     Return (cn&1)+(cn2&1)   End Function

I use that one, I dunno which one is faster.

[PlayniaxParticipant]

I’d be happy to test spiral again, if you would like to recomplie it with MX 1.07

Yeah, I will do some recompiles and let you know when I have done it. Thank you!

[PlayniaxParticipant]

Ok, I recompiled Spiral: http://www.playniax.com/SAF/spiral/ with the latest Monkey2!

Maybe this solves previous problems… Please, let me know!

Use mouse to drag the ball!

[DiffrenzyKeymaster]

Now works in Safari, MacOS Sierra, Mac Mini lastest gen

Google Chrome says: “Exception thrown, see JavaScript console” that says:

Monkey

Uncaught abort() at Error at jsStackTrace (http://www.playniax.com/SAF/spiral/spiral.js:1:28519) at stackTrace (http://www.playniax.com/SAF/spiral/spiral.js:1:28702) at Object.abort (http://www.playniax.com/SAF/spiral/spiral.js:36:30558) at _abort (http://www.playniax.com/SAF/spiral/spiral.js:1:221083) at Array.Ooa (http://www.playniax.com/SAF/spiral/spiral.js:17:76866) at allocate (http://www.playniax.com/SAF/spiral/spiral.js:1:19287) at Object.callMain (http://www.playniax.com/SAF/spiral/spiral.js:36:28561) at doRun (http://www.playniax.com/SAF/spiral/spiral.js:36:29524) at http://www.playniax.com/SAF/spiral/spiral.js:36:29674 If this abort() is unexpected, build with -s ASSERTIONS=1 which can give more information.

1 2 3 4 5 6 7 8 9 10 11

Uncaught abort() at Error at jsStackTrace (http://www.playniax.com/SAF/spiral/spiral.js:1:28519) at stackTrace (http://www.playniax.com/SAF/spiral/spiral.js:1:28702) at Object.abort (http://www.playniax.com/SAF/spiral/spiral.js:36:30558) at _abort (http://www.playniax.com/SAF/spiral/spiral.js:1:221083) at Array.Ooa (http://www.playniax.com/SAF/spiral/spiral.js:17:76866) at allocate (http://www.playniax.com/SAF/spiral/spiral.js:1:19287) at Object.callMain (http://www.playniax.com/SAF/spiral/spiral.js:36:28561) at doRun (http://www.playniax.com/SAF/spiral/spiral.js:36:29524) at http://www.playniax.com/SAF/spiral/spiral.js:36:29674 If this abort() is unexpected, build with -s ASSERTIONS=1 which can give more information.

[EDIT] : A reload of the page solved the error… ?

[gasmonsoParticipant]

Works just fine on Windows 10 using Chrome.

[Mark SiblyKeymaster]

That would look great with some bumpmapping I think, not that it doesn’t look great already!

You’d just have to bumpmap the backdrop and use AddLight instead of DrawImage for the slowly rotating light/shadow image. Maybe set LightDepth quite high too.

[PlayniaxParticipant]

That would look great with some bumpmapping I think, not that it doesn’t look great already!

It probably would. I will ask Peter if we can pimp it up a bit… I am porting the Duel demo from Pyro  MX1 right now this will be using your new lightning system

Anyway, I recompiled the other demos with the latest version of Monkey2 as well so please be my guest and test them. Hopefully like the Spiral demo they run without problems now…

http://www.playniax.com/SAF/jungle/
http://www.playniax.com/SAF/gz/
http://www.playniax.com/SAF/isotest/

[Author]

Posts