优化spriteRenderer渲染方法

source/src/Physics/Shapes/Box.ts

@@ -1,4 +1,7 @@
 ///<reference path="./Polygon.ts" />
+/**
+ * 多边形的特殊情况。在进行SAT碰撞检查时，我们只需要检查2个轴而不是8个轴
+ */
 class Box extends Polygon {
     public width: number;
     public height: number;
@@ -9,7 +12,13 @@ class Box extends Polygon {
         this.height = height;
     }
 
+    /**
+     * 在一个盒子的形状中建立多边形需要的点的帮助方法
+     * @param width 
+     * @param height 
+     */
     private static buildBox(width: number, height: number): Vector2[]{
+        // 我们在(0,0)的中心周围创建点
         let halfWidth = width / 2;
         let halfHeight = height / 2;
         let verts = new Array(4);
@@ -21,11 +30,8 @@ class Box extends Polygon {
         return verts;
     }
 
-    /**
-     * 
-     * @param other 
-     */
     public overlaps(other: Shape){
+        // 特殊情况，这一个高性能方式实现，其他情况则使用polygon方法检测
         if (this.isUnrotated){
             if (other instanceof Box && other.isUnrotated)
                 return this.bounds.intersects(other.bounds);
@@ -37,11 +43,8 @@ class Box extends Polygon {
         return super.overlaps(other);
     }
 
-    /**
-     * 
-     * @param other 
-     */
     public collidesWithShape(other: Shape){
+        // 特殊情况，这一个高性能方式实现，其他情况则使用polygon方法检测
         if (this.isUnrotated && other instanceof Box && other.isUnrotated){
             return ShapeCollisions.boxToBox(this, other);
         }
@@ -51,10 +54,16 @@ class Box extends Polygon {
         return super.collidesWithShape(other);
     }
 
+    /**
+     * 更新框点，重新计算中心，设置宽度/高度
+     * @param width 
+     * @param height 
+     */
     public updateBox(width: number, height: number){
         this.width = width;
         this.height = height;
 
+        // 我们在(0,0)的中心周围创建点
         let halfWidth = width / 2;
         let halfHeight = height / 2;
 
@@ -69,7 +78,7 @@ class Box extends Polygon {
 
     public containsPoint(point: Vector2){
         if (this.isUnrotated)
-            return this.bounds.contains(point);
+            return this.bounds.containsInVec(point);
 
         return super.containsPoint(point);
     }

source/src/Physics/Shapes/Circle.ts

@@ -32,7 +32,7 @@ class Circle extends Shape {
     public recalculateBounds(collider: Collider) {
         this.center = collider.localOffset;
 
-        if (collider.shouldColliderScaleAndRotationWithTransform) {
+        if (collider.shouldColliderScaleAndRotateWithTransform) {
             let scale = collider.entity.scale;
             let hasUnitScale = scale.x == 1 && scale.y == 1;
             let maxScale = Math.max(scale.x, scale.y);

source/src/Physics/Shapes/Polygon.ts

@@ -103,6 +103,13 @@ class Polygon extends Shape {
         return new Vector2(x / points.length, y / points.length);
     }
 
+    /**
+     * 迭代多边形的所有边，并得到任意边上离点最近的点。
+     * 通过最近点的平方距离和它所在的边的法线返回。
+     * 点应该在多边形的空间中(点-多边形.位置)
+     * @param points 
+     * @param point 
+     */
     public static getClosestPointOnPolygonToPoint(points: Vector2[], point: Vector2): { closestPoint, distanceSquared, edgeNormal } {
         let distanceSquared = Number.MAX_VALUE;
         let edgeNormal = new Vector2(0, 0);
@@ -121,6 +128,7 @@ class Polygon extends Shape {
                 distanceSquared = tempDistanceSquared;
                 closestPoint = closest;
 
+                // 求直线的法线
                 let line = Vector2.subtract(points[j], points[i]);
                 edgeNormal.x = -line.y;
                 edgeNormal.y = line.x;
@@ -136,7 +144,13 @@ class Polygon extends Shape {
         return ShapeCollisions.pointToPoly(point, this);
     }
 
+    /**
+     * 本质上，这个算法所做的就是从一个点发射一条射线。
+     * 如果它与奇数条多边形边相交，我们就知道它在多边形内部。
+     * @param point 
+     */
     public containsPoint(point: Vector2) {
+        // 将点归一化到多边形坐标空间中
         point = Vector2.subtract(point, this.position);
 
         let isInside = false;
@@ -171,7 +185,7 @@ class Polygon extends Shape {
         // 如果我们没有旋转或不关心TRS我们使用localOffset作为中心，我们会从那开始
         this.center = collider.localOffset;
 
-        if (collider.shouldColliderScaleAndRotationWithTransform){
+        if (collider.shouldColliderScaleAndRotateWithTransform){
             let hasUnitScale = true;
             let tempMat: Matrix2D;
             let combinedMatrix = Matrix2D.createTranslation(-this._polygonCenter.x, -this._polygonCenter.y);
@@ -188,7 +202,7 @@ class Polygon extends Shape {
             }
 
             if (collider.entity.rotation != 0){
-                tempMat = Matrix2D.createRotation(collider.entity.rotation);
+                tempMat = Matrix2D.createRotation(collider.entity.rotation, tempMat);
                 combinedMatrix = Matrix2D.multiply(combinedMatrix, tempMat);
 
                 // 为了处理偏移原点的旋转我们只需要将圆心在(0,0)附近移动我们的偏移使角度为0
@@ -204,10 +218,6 @@ class Polygon extends Shape {
             // 最后变换原始点
             Vector2Ext.transform(this._originalPoints, combinedMatrix, this.points);
             this.isUnrotated = collider.entity.rotation == 0;
-
-            // 如果旋转的话，我们只需要重建边的法线
-            if (collider._isRotationDirty)
-                this._areEdgeNormalsDirty = true;
         }
 
         this.position = Vector2.add(collider.entity.position, this.center);

source/src/Physics/Shapes/ShapeCollisions/ShapeCollisions.ts

@@ -274,7 +274,7 @@ class ShapeCollisions {
         let result = new CollisionResult();
 
         let minkowskiDiff = this.minkowskiDifference(first, second);
-        if (minkowskiDiff.contains(new Vector2(0, 0))){
+        if (minkowskiDiff.containsInVec(new Vector2(0, 0))){
             // 计算MTV。如果它是零，我们就可以称它为非碰撞
             result.minimumTranslationVector = minkowskiDiff.getClosestPointOnBoundsToOrigin();