Hacker News new | ask | show | jobs
by Animats 2085 days ago
It's a very basic intro. Polygon/polygon is brute force, O(N^2). There's no coarse filtering so that only nearby objects are checked. There's nothing that points out that concave objects are much harder to check efficiently than convex ones. Plus it's 2D only.

An intro is nice, but this is like writing about sorting and only showing bubble sort.

2 comments

IMO it is too basic. No broad phase, no smart polygon intersections, and far from touching Bezier curves and paths. But the tutorial is well made.
It looks it intends not to touch broad phase things.