undo mbp port

src/Marble.hx

@@ -1294,6 +1294,11 @@ class Marble extends GameObject {
 			var a = retf[1];
 			this.velocity = this.velocity.add(A.multiply(timeStep));
 			this.omega = this.omega.add(a.multiply(timeStep));
+			if (this.mode == Start) {
+				// Bruh...
+				this.velocity.y = 0;
+				this.velocity.x = 0;
+			}
 			stoppedPaths = this.velocityCancel(timeState.currentAttemptTime, timeStep, isCentered, true, stoppedPaths, pathedInteriors);
 			this._totalTime += timeStep;
 			if (contacts.length != 0) {
@@ -1367,30 +1372,6 @@ class Marble extends GameObject {
 				}
 			}
 
-			var pos = this.getAbsPos().getPosition();
-			this.prevPos = pos.clone();
-
-			if (mode == Start) {
-				var upVec = this.level.currentUp;
-				var startpadNormal = startPad.getAbsPos().up();
-				this.velocity = upVec.multiply(this.velocity.dot(upVec));
-				// Apply contact forces in startPad up direction if upVec is not startpad up, fixes the weird startpad shit in pinball wizard
-				if (upVec.dot(startpadNormal) < 0.95) {
-					for (contact in contacts) {
-						var normF = contact.normal.multiply(contact.normalForce);
-						var startpadF = startpadNormal.multiply(normF.dot(startpadNormal));
-						var upF = upVec.multiply(normF.dot(upVec));
-						this.velocity = this.velocity.add(startpadF.multiply(timeStep / 4));
-					}
-				}
-			}
-
-			// if (mode == Finish) {
-			// 	this.velocity = this.velocity.multiply(0.925);
-			// }
-
-			var newPos = pos.add(this.velocity.multiply(timeStep));
-			newPos = nudgeToContacts(newPos, _radius);
 			var rot = this.getRotationQuat();
 			var quat = new Quat();
 			quat.initRotation(omega.x * timeStep, omega.y * timeStep, omega.z * timeStep);

src/MarbleWorld.hx

@@ -971,16 +971,11 @@ class MarbleWorld extends Scheduler {
 				if (timeTravelSound == null) {
 					var ttsnd = ResourceLoader.getResource("data/sound/timetravelactive.wav", ResourceLoader.getAudio, this.soundResources);
 					timeTravelSound = AudioManager.playSound(ttsnd, null, true);
-
-					if (alarmSound != null)
-						alarmSound.pause = true;
 				}
 			} else {
 				if (timeTravelSound != null) {
 					timeTravelSound.stop();
 					timeTravelSound = null;
-					if (alarmSound != null)
-						alarmSound.pause = false;
 				}
 				if (this.timeState.currentAttemptTime >= 3.5)
 					this.timeState.gameplayClock += dt;
@@ -1063,8 +1058,6 @@ class MarbleWorld extends Scheduler {
 					val = Util.getKeyForButton(Settings.controlsSettings.powerup);
 				if (funcdata[1] == "freelook")
 					val = Util.getKeyForButton(Settings.controlsSettings.freelook);
-				if (funcdata[1] == "useblast")
-					val = Util.getKeyForButton(Settings.controlsSettings.blast);
 			}
 			start = val.length + pos;
 			text = pre + val + post;

src/collision/BVHTree.hx

@@ -1,5 +1,6 @@
 package collision;
 
+import h3d.Vector;
 import h3d.col.Bounds;
 
 interface IBVHObject {
@@ -17,217 +18,348 @@ class BVHNode<T:IBVHObject> {
 	var bounds:Bounds;
 	var object:T;
 
-	public function new(bounds:Bounds) {
-		this.bounds = bounds.clone();
-		surfaceArea = this.bounds.xSize * this.bounds.ySize + this.bounds.xSize * this.bounds.zSize + this.bounds.ySize * this.bounds.zSize;
+	public function new() {}
+}
+
+class BVHTree<T:IBVHObject> {
+	var nodeId:Int = 0;
+	var root:BVHNode<T>;
+
+	public function new() {}
+
+	function update() {
+		var invalidNodes = [];
+		this.traverse(node -> {
+			if (node.isLeaf) {
+				var entity = node.object;
+				var tightAABB = entity.boundingBox;
+
+				if (node.bounds.containsBounds(tightAABB)) {
+					return;
+				}
+
+				invalidNodes.push(node);
+			}
+		});
+		for (node in invalidNodes) {
+			this.remove(node);
+			this.add(node.object);
+		}
 	}
 
-	class BVHTree<T:IBVHObject> {
-		var nodeId:Int = 0;
-		var root:BVHNode<T>;
+	public function add(entity:T) {
+		// Enlarged AABB
+		var aabb = entity.boundingBox;
 
-		public function new() {}
+		var newNode = new BVHNode();
+		newNode.id = this.nodeId++;
+		newNode.bounds = aabb;
+		newNode.object = entity;
+		newNode.isLeaf = true;
 
-		function update() {
-			var invalidNodes = [];
-			this.traverse(node -> {
-				if (node.isLeaf) {
-					var entity = node.object;
-					var tightAABB = entity.boundingBox;
+		if (this.root == null) {
+			this.root = newNode;
+			return newNode;
+		}
 
-					if (node.bounds.containsBounds(tightAABB)) {
-						return;
+		// Find the best sibling for the new leaf
+		var bestSibling = this.root;
+		var bestCostBox = this.root.bounds.clone();
+		bestCostBox.add(aabb);
+		var bestCost = bestCostBox.xSize * bestCostBox.ySize + bestCostBox.xSize * bestCostBox.zSize + bestCostBox.ySize * bestCostBox.zSize;
+		var q = [{p1: this.root, p2: 0.0}];
+
+		while (q.length != 0) {
+			var front = q.shift();
+			var current = front.p1;
+			var inheritedCost = front.p2;
+
+			var combined = current.bounds.clone();
+			combined.add(aabb);
+			var directCost = combined.xSize * combined.ySize + combined.xSize * combined.zSize + combined.ySize * combined.zSize;
+
+			var costForCurrent = directCost + inheritedCost;
+			if (costForCurrent < bestCost) {
+				bestCost = costForCurrent;
+				bestSibling = current;
+			}
+
+			inheritedCost += directCost
+				- (current.bounds.xSize * current.bounds.ySize + current.bounds.xSize * current.bounds.zSize + current.bounds.ySize * current.bounds.zSize);
+
+			var aabbCost = aabb.xSize * aabb.ySize + aabb.xSize * aabb.zSize + aabb.ySize * aabb.zSize;
+			var lowerBoundCost = aabbCost + inheritedCost;
+			if (lowerBoundCost < bestCost) {
+				if (!current.isLeaf) {
+					if (current.child1 != null)
+						q.push({p1: current.child1, p2: inheritedCost});
+					if (current.child2 != null)
+						q.push({p1: current.child2, p2: inheritedCost});
+				}
+			}
+		}
+
+		// Create a new parent
+		var oldParent = bestSibling.parent;
+		var newParent = new BVHNode();
+		newParent.id = this.nodeId++;
+		newParent.parent = oldParent;
+		newParent.bounds = bestSibling.bounds.clone();
+		newParent.bounds.add(aabb);
+		newParent.isLeaf = false;
+
+		if (oldParent != null) {
+			if (oldParent.child1 == bestSibling) {
+				oldParent.child1 = newParent;
+			} else {
+				oldParent.child2 = newParent;
+			}
+
+			newParent.child1 = bestSibling;
+			newParent.child2 = newNode;
+			bestSibling.parent = newParent;
+			newNode.parent = newParent;
+		} else {
+			newParent.child1 = bestSibling;
+			newParent.child2 = newNode;
+			bestSibling.parent = newParent;
+			newNode.parent = newParent;
+			this.root = newParent;
+		}
+
+		// Walk back up the tree refitting ancestors' AABB and applying rotations
+		var ancestor = newNode.parent;
+
+		while (ancestor != null) {
+			var child1 = ancestor.child1;
+			var child2 = ancestor.child2;
+
+			ancestor.bounds = new Bounds();
+			if (child1 != null)
+				ancestor.bounds.add(child1.bounds);
+			if (child2 != null)
+				ancestor.bounds.add(child2.bounds);
+
+			this.rotate(ancestor);
+
+			ancestor = ancestor.parent;
+		}
+
+		return newNode;
+	}
+
+	function reset() {
+		this.nodeId = 0;
+		this.root = null;
+	}
+
+	// BFS tree traversal
+	function traverse(callback:(node:BVHNode<T>) -> Void) {
+		var q = [this.root];
+
+		while (q.length != 0) {
+			var current = q.shift();
+			if (current == null) {
+				break;
+			}
+
+			callback(current);
+
+			if (!current.isLeaf) {
+				if (current.child1 != null)
+					q.push(current.child1);
+				if (current.child2 != null)
+					q.push(current.child2);
+			}
+		}
+	}
+
+	public function remove(node:BVHNode<T>) {
+		var parent = node.parent;
+
+		if (parent != null) {
+			var sibling = parent.child1 == node ? parent.child2 : parent.child1;
+
+			if (parent.parent != null) {
+				sibling.parent = parent.parent;
+				if (parent.parent.child1 == parent) {
+					parent.parent.child1 = sibling;
+				} else {
+					parent.parent.child2 = sibling;
+				}
+			} else {
+				this.root = sibling;
+				sibling.parent = null;
+			}
+
+			var ancestor = sibling.parent;
+			while (ancestor != null) {
+				var child1 = ancestor.child1;
+				var child2 = ancestor.child2;
+
+				ancestor.bounds = child1.bounds.clone();
+				ancestor.bounds.add(child2.bounds);
+				ancestor = ancestor.parent;
+			}
+		} else {
+			if (this.root == node) {
+				this.root = null;
+			}
+		}
+	}
+
+	function rotate(node:BVHNode<T>) {
+		if (node.parent == null) {
+			return;
+		}
+		var parent = node.parent;
+		var sibling = parent.child1 == node ? parent.child2 : parent.child1;
+		var costDiffs = [];
+		var nodeArea = node.bounds.xSize * node.bounds.ySize + node.bounds.zSize * node.bounds.ySize + node.bounds.xSize * node.bounds.zSize;
+
+		var ch1 = sibling.bounds.clone();
+		ch1.add(node.child1.bounds);
+		costDiffs.push(ch1.xSize * ch1.ySize + ch1.zSize * ch1.ySize + ch1.xSize * ch1.zSize - nodeArea);
+		var ch2 = sibling.bounds.clone();
+		ch2.add(node.child2.bounds);
+		costDiffs.push(ch2.xSize * ch2.ySize + ch2.zSize * ch2.ySize + ch2.xSize * ch2.zSize - nodeArea);
+
+		if (!sibling.isLeaf) {
+			var siblingArea = sibling.bounds.xSize * sibling.bounds.ySize + sibling.bounds.zSize * sibling.bounds.ySize
+				+ sibling.bounds.xSize * sibling.bounds.zSize;
+			if (sibling.child1 != null) {
+				var ch3 = node.bounds.clone();
+				ch3.add(sibling.child1.bounds);
+				costDiffs.push(ch3.xSize * ch3.ySize + ch3.zSize * ch3.ySize + ch3.xSize * ch3.zSize - siblingArea);
+			}
+			if (sibling.child2 != null) {
+				var ch4 = node.bounds.clone();
+				ch4.add(sibling.child2.bounds);
+				costDiffs.push(ch4.xSize * ch4.ySize + ch4.zSize * ch4.ySize + ch4.xSize * ch4.zSize - siblingArea);
+			}
+		}
+
+		var bestDiffIndex = 0;
+		for (i in 1...costDiffs.length) {
+			if (costDiffs[i] < costDiffs[bestDiffIndex]) {
+				bestDiffIndex = i;
+			}
+		}
+
+		if (costDiffs[bestDiffIndex] < 0.0) {
+			switch (bestDiffIndex) {
+				case 0:
+					if (parent.child1 == sibling) {
+						parent.child1 = node.child2;
+					} else {
+						parent.child2 = node.child2;
 					}
 
-					public function split() {
-						// Splitting first time
-						// Calculate the centroids of all objects
-						var objs = objects.map(x -> {
-							x.generateBoundingBox();
-							return {obj: x, centroid: x.boundingBox.getCenter()};
-						});
-						for (node in invalidNodes) {
-							this.remove(node);
-							this.add(node.object);
-						}
+					if (node.child2 != null) {
+						node.child2.parent = parent;
+					}
 
-						public function add(entity:T) {
-							// Enlarged AABB
-							var aabb = entity.boundingBox;
+					node.child2 = sibling;
+					sibling.parent = node;
+					node.bounds = sibling.bounds.clone();
+					if (node.child1 != null) {
+						node.bounds.add(node.child1.bounds);
+					}
+				case 1:
+					if (parent.child1 == sibling) {
+						parent.child1 = node.child1;
+					} else {
+						parent.child2 = node.child1;
+					}
+					if (node.child1 != null) {
+						node.child1.parent = parent;
+					}
+					node.child1 = sibling;
+					sibling.parent = node;
+					node.bounds = sibling.bounds.clone();
+					if (node.child2 != null) {
+						node.bounds.add(node.child2.bounds);
+					}
+				case 2:
+					if (parent.child1 == node) {
+						parent.child1 = sibling.child2;
+					} else {
+						parent.child2 = sibling.child2;
+					}
+					if (sibling.child2 != null) {
+						sibling.child2.parent = parent;
+					}
+					sibling.child2 = node;
+					node.parent = sibling;
+					sibling.bounds = node.bounds.clone();
+					if (sibling.child2 != null) {
+						sibling.bounds.add(sibling.child2.bounds);
+					}
 
-							var newNode = new BVHNode();
-							newNode.id = this.nodeId++;
-							newNode.bounds = aabb;
-							newNode.object = entity;
-							newNode.isLeaf = true;
+				case 3:
+					if (parent.child1 == node) {
+						parent.child1 = sibling.child1;
+					} else {
+						parent.child2 = sibling.child1;
+					}
+					if (sibling.child1 != null) {
+						sibling.child1.parent = parent;
+					}
+					sibling.child1 = node;
+					node.parent = sibling;
+					sibling.bounds = node.bounds.clone();
+					if (sibling.child1 != null) {
+						sibling.bounds.add(sibling.child1.bounds);
+					}
+			}
+		}
+	}
 
-							if (this.root == null) {
-								this.root = newNode;
-								return newNode;
-							}
+	public function boundingSearch(searchbox:Bounds) {
+		var res = [];
+		if (this.root == null)
+			return res;
 
-							// Make the child nodes
-							var leftBounds = new Bounds();
-							var rightBounds = new Bounds();
-							for (o in leftObjs)
-								leftBounds.add(o.boundingBox);
-							for (o in rightObjs)
-								rightBounds.add(o.boundingBox);
-							left = new BVHNode(leftBounds);
-							right = new BVHNode(rightBounds);
-							left.objects = leftObjs;
-							right.objects = rightObjs;
-							this.objects = intersectObjs;
-							this.objectBounds = new Bounds();
-							for (o in intersectObjs)
-								this.objectBounds.add(o.boundingBox);
+		var q = [this.root];
 
-							left.split();
-							right.split();
-						}
+		while (q.length != 0) {
+			var current = q.shift();
 
-						public function boundingSearch(searchbox:Bounds) {
-							if (this.bounds.containsBounds(searchbox) || this.bounds.collide(searchbox)) {
-								var intersects = [];
-								if (this.left != null && this.right != null) {
-									intersects = intersects.concat(this.left.boundingSearch(searchbox));
-									intersects = intersects.concat(this.right.boundingSearch(searchbox));
-								}
-								if (this.objectBounds.collide(searchbox) || this.objectBounds.containsBounds(searchbox)) {
-									for (o in this.objects) {
-										if (o.boundingBox.containsBounds(searchbox) || o.boundingBox.collide(searchbox))
-											intersects.push(o);
-									}
-								}
-								return intersects;
-							} else {
-								return [];
-							}
-						}
+			if (current.bounds.containsBounds(searchbox) || current.bounds.collide(searchbox)) {
+				if (current.isLeaf) {
+					res.push(current.object);
+				} else {
+					if (current.child1 != null)
+						q.push(current.child1);
+					if (current.child2 != null)
+						q.push(current.child2);
+				}
+			}
+		}
 
-						function reset() {
-							this.nodeId = 0;
-							this.root = null;
-						}
+		return res;
+	}
 
-						// BFS tree traversal
-						function traverse(callback:(node:BVHNode<T>) -> Void) {
-							var q = [this.root];
+	public function rayCast(origin:Vector, direction:Vector) {
+		var res = [];
+		if (this.root == null)
+			return res;
 
-							while (q.length != 0) {
-								var current = q.shift();
-								if (current == null) {
-									break;
-								}
-
-								callback(current);
-
-								if (!current.isLeaf) {
-									if (current.child1 != null)
-										q.push(current.child1);
-									if (current.child2 != null)
-										q.push(current.child2);
-								}
-							}
-						}
-
-						public function remove(node:BVHNode<T>) {
-							var parent = node.parent;
-
-							if (parent != null) {
-								var sibling = parent.child1 == node ? parent.child2 : parent.child1;
-
-								if (parent.parent != null) {
-									sibling.parent = parent.parent;
-									if (parent.parent.child1 == parent) {
-										parent.parent.child1 = sibling;
-									} else {
-										parent.parent.child2 = sibling;
-									}
-								}
-								return intersects;
-							} else {
-								return [];
-							}
-						}
-
-						function rotate(node:BVHNode<T>) {
-							if (node.parent == null) {
-								return;
-							}
-							var parent = node.parent;
-							var sibling = parent.child1 == node ? parent.child2 : parent.child1;
-							var costDiffs = [];
-							var nodeArea = node.bounds.xSize * node.bounds.ySize + node.bounds.zSize * node.bounds.ySize
-								+ node.bounds.xSize * node.bounds.zSize;
-
-							class BVHTree {
-								public var bounds:Bounds;
-
-								var surfaces:Array<CollisionSurface> = [];
-
-								var root:BVHNode;
-
-								public function new(bounds:Bounds) {
-									this.bounds = bounds.clone();
-								}
-
-								public function insert(surf:CollisionSurface) {
-									surfaces.push(surf);
-								}
-
-								public function build() {
-									root = new BVHNode(bounds);
-									// Add all children
-									root.objects = this.surfaces;
-									root.split();
-								}
-
-								public function boundingSearch(searchbox:Bounds) {
-									var res = [];
-									if (this.root == null)
-										return res;
-
-									var q = [this.root];
-
-									while (q.length != 0) {
-										var current = q.shift();
-
-										if (current.bounds.containsBounds(searchbox) || current.bounds.collide(searchbox)) {
-											if (current.isLeaf) {
-												res.push(current.object);
-											} else {
-												if (current.child1 != null)
-													q.push(current.child1);
-												if (current.child2 != null)
-													q.push(current.child2);
-											}
-										}
-									}
-
-									return res;
-								}
-
-								public function rayCast(origin:Vector, direction:Vector) {
-									var res = [];
-									if (this.root == null)
-										return res;
-
-									var ray = h3d.col.Ray.fromValues(origin.x, origin.y, origin.z, direction.x, direction.y, direction.z);
-									var q = [this.root];
-									while (q.length != 0) {
-										var current = q.shift();
-										if (ray.collide(current.bounds)) {
-											if (current.isLeaf) {
-												res = res.concat(current.object.rayCast(origin, direction));
-											} else {
-												if (current.child1 != null)
-													q.push(current.child1);
-												if (current.child2 != null)
-													q.push(current.child2);
-											}
-										}
-									}
-									return res;
-								}
-							}
+		var ray = h3d.col.Ray.fromValues(origin.x, origin.y, origin.z, direction.x, direction.y, direction.z);
+		var q = [this.root];
+		while (q.length != 0) {
+			var current = q.shift();
+			if (ray.collide(current.bounds)) {
+				if (current.isLeaf) {
+					res = res.concat(current.object.rayCast(origin, direction));
+				} else {
+					if (current.child1 != null)
+						q.push(current.child1);
+					if (current.child2 != null)
+						q.push(current.child2);
+				}
+			}
+		}
+		return res;
+	}
+}

src/collision/CollisionEntity.hx

@@ -58,11 +58,11 @@ class CollisionEntity implements IOctreeObject implements IBVHObject {
 	// Generates the bvh
 	public function finalize() {
 		this.generateBoundingBox();
-		this.bvh = new BVHTree(this.boundingBox);
+		this.bvh = new BVHTree();
 		for (surface in this.surfaces) {
-			this.bvh.insert(surface);
+			this.bvh.add(surface);
 		}
-		this.bvh.build();
+		// this.bvh.build();
 	}
 
 	public function setTransform(transform:Matrix) {

src/gui/GuiImage.hx

@@ -9,7 +9,6 @@ import src.MarbleGame;
 @:publicFields
 class GuiImage extends GuiControl {
 	var bmp:Bitmap;
-	var bmpFlow:Flow;
 
 	public var pressedAction:GuiControl->Void = null;
 
@@ -25,23 +24,16 @@ class GuiImage extends GuiControl {
 		// bmp.scaleY = renderRect.extent.y / bmp.tile.height;
 		bmp.width = renderRect.extent.x;
 		bmp.height = renderRect.extent.y;
-		if (doClipping) {
-			bmpFlow.maxWidth = Std.int(hittestRect.extent.x);
-			bmpFlow.maxHeight = Std.int(hittestRect.extent.y);
+		if (scene2d.contains(bmp)) {
+			scene2d.removeChild(bmp); // Refresh "layer"
 		}
-		if (scene2d.contains(obj)) {
-			scene2d.removeChild(obj); // Refresh "layer"
-		}
-		scene2d.addChild(obj);
+		scene2d.addChild(bmp);
 		super.render(scene2d);
 	}
 
 	public override function dispose() {
 		super.dispose();
-		if (this.doClipping) {
-			bmpFlow.remove();
-		} else
-			this.bmp.remove();
+		this.bmp.remove();
 	}
 
 	public override function onMouseRelease(mouseState:MouseState) {
@@ -53,9 +45,6 @@ class GuiImage extends GuiControl {
 
 	public override function onRemove() {
 		super.onRemove();
-		if (MarbleGame.canvas.scene2d.contains(bmpFlow)) {
-			MarbleGame.canvas.scene2d.removeChild(bmpFlow); // Refresh "layer"
-		}
 		if (MarbleGame.canvas.scene2d.contains(bmp)) {
 			MarbleGame.canvas.scene2d.removeChild(bmp); // Refresh "layer"
 		}