~/Collision Detection Algorithms in Golang

Mar 13, 2019

Collision detection is crucial in game development and simulations using Go. Typical applications include 2D rectangle overlaps and circle collisions.

Rectangle Collision Example

 1
 2
 3
 4
 5
 6
 7
 8
 9
10

type Rect struct {
    X, Y, W, H float64
}

func Collides(a, b Rect) bool {
    return a.X < b.X+b.W &&
           a.X+a.W > b.X &&
           a.Y < b.Y+b.H &&
           a.Y+a.H > b.Y
}

Circle Collision Example

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12

import "math"

type Circle struct {
    X, Y, R float64
}

func CirclesCollide(a, b Circle) bool {
    dx := a.X - b.X
    dy := a.Y - b.Y
    distance := math.Sqrt(dx*dx + dy*dy)
    return distance < a.R + b.R
}

These simple techniques work for basic 2D games or physics engines. For advanced needs, see github.com/faiface/pixel or ebiten.dev, which provide more robust collision detection features.

For performance in large scenes, spatial partitioning like Quadtrees is recommended to avoid checking all object pairs.

Learn more from the Go Game Development Resources list.