2019-04-16 02:12:25 +00:00
|
|
|
package collision
|
|
|
|
|
|
|
|
import (
|
2019-05-29 04:43:30 +00:00
|
|
|
"errors"
|
2019-05-07 05:57:32 +00:00
|
|
|
"math"
|
|
|
|
|
2019-12-23 02:21:58 +00:00
|
|
|
"git.kirsle.net/go/render"
|
2019-04-16 02:12:25 +00:00
|
|
|
)
|
|
|
|
|
2019-05-07 05:57:32 +00:00
|
|
|
// BoxCollision holds the result of a collision BetweenBoxes.
|
|
|
|
type BoxCollision struct {
|
|
|
|
// A and B are the indexes of the boxes sent to BetweenBoxes.
|
|
|
|
A int
|
|
|
|
B int
|
|
|
|
|
|
|
|
// Overlap is the rect of how the boxes overlap.
|
|
|
|
Overlap render.Rect
|
|
|
|
}
|
|
|
|
|
2019-04-16 02:12:25 +00:00
|
|
|
// IndexTuple holds two integers used as array indexes.
|
|
|
|
type IndexTuple [2]int
|
|
|
|
|
|
|
|
// BetweenBoxes checks if there is a collision between any
|
|
|
|
// two bounding rectangles.
|
|
|
|
//
|
|
|
|
// This returns a generator that spits out indexes of the
|
|
|
|
// intersecting boxes.
|
2019-05-07 05:57:32 +00:00
|
|
|
func BetweenBoxes(boxes []render.Rect) chan BoxCollision {
|
|
|
|
generator := make(chan BoxCollision)
|
2019-04-16 02:12:25 +00:00
|
|
|
|
|
|
|
go func() {
|
|
|
|
// Outer loop: test each box for intersection with the others.
|
|
|
|
for i, box := range boxes {
|
Improve Collision Detection: More Active w/ Actors
* Improve the collision detection algorithm so that Actor OnCollide
scripts get called more often WHILE an actor is moving, to prevent a
fast-moving actor from zipping right through the "solid" hitbox and
not giving the subject actor time to protest the movement.
* It's implemented by adding a `Settled` boolean to the OnCollide event
object. When the game is testing out movement, Settled=false to give
the actor a chance to say "I'm solid!" and have the moving party be
stopped early.
* After all this is done, for any pair of actors still with overlapping
hitboxes, OnCollide is called one last time with Settled=true. This is
when the actor should run its actions (like publishing messages to
other actors, changing state as in a trapdoor, etc.)
* The new collision detection algorithm works as follows:
* Stage 1 is the same as before, all mobile actors are moved and
tested against level geometry. They record their Original and New
position during this phase.
* Stage 2 is where we re-run that movement but ping actors being
intersected each step of the way. We trace the steps between
Original and New position, test OnCollide handler, and if it returns
false we move the mobile actor to the Last Good Position along the
trace.
* Stage 3 we run the final OnCollide(Settled=true) to let actors run
actions they wanted to for their collide handler, WITHOUT spamming
those actions during Stage 2.
* This should now allow for tweaking of gravity speed and player speed
without breaking all actor collision checking.
2019-07-17 04:07:38 +00:00
|
|
|
for j, other := range boxes {
|
|
|
|
if i == j {
|
|
|
|
continue
|
|
|
|
}
|
2019-05-29 04:43:30 +00:00
|
|
|
collision, err := CompareBoxes(box, other)
|
|
|
|
if err == nil {
|
|
|
|
collision.A = i
|
|
|
|
collision.B = j
|
|
|
|
generator <- collision
|
2019-04-16 02:12:25 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
close(generator)
|
|
|
|
}()
|
|
|
|
|
|
|
|
return generator
|
|
|
|
}
|
2019-05-07 05:57:32 +00:00
|
|
|
|
2019-05-29 04:43:30 +00:00
|
|
|
// CompareBoxes checks if two boxes overlaps and returns information about
|
|
|
|
// the overlap. The boxes are bounding rectangles like those given to
|
|
|
|
// BetweenBoxes().
|
|
|
|
func CompareBoxes(box, other render.Rect) (BoxCollision, error) {
|
|
|
|
if box.Intersects(other) {
|
|
|
|
var (
|
|
|
|
overlap = OverlapRelative(box, other)
|
|
|
|
topLeft = overlap.TopLeft()
|
|
|
|
bottomRight = overlap.BottomRight()
|
|
|
|
)
|
|
|
|
return BoxCollision{
|
|
|
|
Overlap: render.Rect{
|
|
|
|
X: topLeft.X,
|
|
|
|
Y: topLeft.Y,
|
|
|
|
W: bottomRight.X,
|
|
|
|
H: bottomRight.Y,
|
|
|
|
},
|
|
|
|
}, nil
|
|
|
|
}
|
|
|
|
return BoxCollision{}, errors.New("boxes do not intersect")
|
|
|
|
}
|
|
|
|
|
2019-05-07 05:57:32 +00:00
|
|
|
/*
|
|
|
|
OverlapRelative returns the Overlap box using coordinates relative
|
|
|
|
to the source rect instead of absolute coordinates.
|
|
|
|
*/
|
|
|
|
func OverlapRelative(source, other render.Rect) CollisionBox {
|
|
|
|
var (
|
|
|
|
// Move the source rect to 0,0 and record the distance we need
|
|
|
|
// to go to get there, so we can move the other rect the same.
|
|
|
|
deltaX = 0 - source.X
|
|
|
|
deltaY = 0 - source.Y
|
|
|
|
)
|
|
|
|
|
|
|
|
source.X = 0
|
|
|
|
source.Y = 0
|
|
|
|
other.X += deltaX
|
|
|
|
other.Y += deltaY
|
|
|
|
|
|
|
|
return Overlap(source, other)
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
Overlap returns the overlap rectangle between two boxes.
|
|
|
|
|
|
|
|
The two rects given have an X,Y coordinate and their W,H are their
|
|
|
|
width and heights.
|
|
|
|
|
|
|
|
The returned CollisionBox uses absolute coordinates in the same space
|
|
|
|
as the passed-in rects.
|
|
|
|
*/
|
|
|
|
func Overlap(a, b render.Rect) CollisionBox {
|
2019-12-28 03:16:34 +00:00
|
|
|
max := func(x, y int) int {
|
|
|
|
return int(math.Max(float64(x), float64(y)))
|
2019-05-07 05:57:32 +00:00
|
|
|
}
|
2019-12-28 03:16:34 +00:00
|
|
|
min := func(x, y int) int {
|
|
|
|
return int(math.Min(float64(x), float64(y)))
|
2019-05-07 05:57:32 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
var (
|
|
|
|
A = GetCollisionBox(a)
|
|
|
|
B = GetCollisionBox(b)
|
|
|
|
|
|
|
|
ATL = A.TopLeft()
|
|
|
|
ABR = A.BottomRight()
|
|
|
|
BTL = B.TopLeft()
|
|
|
|
BBR = B.BottomRight()
|
|
|
|
|
|
|
|
// Coordinates of the intersection box.
|
|
|
|
X1, Y1 = max(ATL.X, BTL.X), max(ATL.Y, BTL.Y)
|
|
|
|
X2, Y2 = min(ABR.X, BBR.X), min(ABR.Y, BBR.Y)
|
|
|
|
)
|
|
|
|
|
|
|
|
return NewBox(render.NewPoint(X1, Y1), render.NewPoint(X2, Y2))
|
|
|
|
}
|