| 1 | class Ray |
| 2 | { |
| 3 | static Cast(scene, origin, direction, maxLength = -1) |
| 4 | { |
| 5 | direction = direction.normalize(); |
| 6 | let hits = [] // {hitObj, hitPoint} |
| 7 | for(var i = 0; i < scene.activeObjects.length; i++) |
| 8 | { |
| 9 | let castAngle = direction.toAngle(); |
| 10 | |
| 11 | if(scene.activeObjects[i] != this && scene.activeObjects[i].collider.enabled) |
| 12 | { |
| 13 | var hw = scene.activeObjects[i].transform.size.x / 2; |
| 14 | var hh = scene.activeObjects[i].transform.size.y / 2; |
| 15 | |
| 16 | let points = |
| 17 | [ |
| 18 | new vector(scene.activeObjects[i].transform.position.x - hw, scene.activeObjects[i].transform.position.y - hh), |
| 19 | new vector(scene.activeObjects[i].transform.position.x + hw, scene.activeObjects[i].transform.position.y - hh), |
| 20 | new vector(scene.activeObjects[i].transform.position.x - hw, scene.activeObjects[i].transform.position.y + hh), |
| 21 | new vector(scene.activeObjects[i].transform.position.x + hw, scene.activeObjects[i].transform.position.y + hh) |
| 22 | ] |
| 23 | |
| 24 | points.sort((p1,p2) => p1.subtract(origin).length - p2.subtract(origin).length).pop(); |
| 25 | |
| 26 | for(let p = 0; p < points.length; p++) |
| 27 | { |
| 28 | let point = points[p]; |
| 29 | let deltaDistance = point.subtract(origin).length; |
| 30 | |
| 31 | let stretched = direction.stretch(Math.min(deltaDistance, maxLength > 0? maxLength : deltaDistance)) |
| 32 | |
| 33 | let calcPoint = origin.add(stretched); |
| 34 | |
| 35 | if(scene.activeObjects[i].collider.isInBounds(calcPoint)) |
| 36 | { |
| 37 | //determine in between which vector angles ray is |
| 38 | var angles = points.map(p => Ray.mapPointToPointAndAngle(p, origin)) |
| 39 | |
| 40 | pointLoop: |
| 41 | for(let pa = 0; pa < angles.length; pa++) |
| 42 | { |
| 43 | for(let pb = 0; pb < angles.length; pb++) |
| 44 | { |
| 45 | if(angles[pa].angle - angles[pb].angle > 270 || angles[pb].angle - angles[pa].angle > 270) { |
| 46 | |
| 47 | castAngle = (castAngle + 180) % 360; |
| 48 | angles.forEach(pIn => pIn.angle = (pIn.angle + 180) % 360); |
| 49 | break pointLoop; |
| 50 | } |
| 51 | } |
| 52 | } |
| 53 | |
| 54 | angles = angles.sort((a,b) => b.angle - a.angle); |
| 55 | |
| 56 | if(angles[1].length > angles[0].length && angles[1].length > angles[2].length) |
| 57 | { |
| 58 | //only one face can be hit at this time, which is between angles[0] and angles[2] |
| 59 | angles.removeAt(1); //remove the center, connecting to the un-hittable face |
| 60 | } |
| 61 | else |
| 62 | { |
| 63 | //one of two faces can be hit at this time, either angles[0]-angles[1] or angles[1]-angles[2] |
| 64 | (castAngle > angles[1].angle) ? angles.pop() : angles.shift(); //figure out on which side we are, and remove the furthest |
| 65 | } |
| 66 | |
| 67 | //calc % of angle in relation to the angles it is between |
| 68 | let smallAngle = Math.min(angles[1].angle, angles[0].angle); |
| 69 | let percent = (castAngle - smallAngle) / (Math.max(angles[1].angle, angles[0].angle) - smallAngle); |
| 70 | |
| 71 | hits.push({hitObj: scene.activeObjects[i], hitPoint: angles[1].point.lerpTo(angles[0].point, percent)}) |
| 72 | break; |
| 73 | } |
| 74 | } |
| 75 | } |
| 76 | } |
| 77 | |
| 78 | let shortest = hits[0]; |
| 79 | |
| 80 | for(let i = 0; i < hits.length; i++) |
| 81 | { |
| 82 | if(hits[i].length < shortest.length) |
| 83 | { |
| 84 | shortest = hits[i]; |
| 85 | } |
| 86 | } |
| 87 | |
| 88 | return shortest; |
| 89 | } |
| 90 | |
| 91 | static mapPointToPointAndAngle(point, origin) |
| 92 | { |
| 93 | let delta = point.subtract(origin); |
| 94 | |
| 95 | return { |
| 96 | point: point, |
| 97 | angle: delta.toAngle(), |
| 98 | length: delta.length |
| 99 | }; |
| 100 | } |
| 101 | } |