6 items across game development
6 results
Box2D details a new inscribed-sphere culling scheme for SAT that can cut expensive convex-hull contact work before edge-pair tests even run. The approach uses cheap dot products and Gauss-map arcs …
arXiv cs.GR details CuACD, a fully GPU-resident approximate convex decomposition pipeline that turns triangle meshes into convex parts much faster. The authors say it can cut preprocessing from tens of …
arXiv cs.GR details S4R, a scale-continuation method that repairs rigid-body interpenetration in large procedural scenes. It shrinks bodies to a collision-free state, then restores full size through shallow convex QP …
A new collision-handling method for deformable simulation builds explicit convex “safe” regions around each vertex before penetration happens. That makes it easier to catch primary, secondary, and codimensional contacts without …
SIMD is paying off in Box3D’s collision pipeline, especially once convex hulls get complex enough that edge-edge SAT tests dominate. On a 32-point “boulder” hull, wide SIMD cut full-simulation time …
A new O(n log n) method simplifies convex hulls while keeping them conservative, which is the part that matters for collision, ray tests, and distance queries. Instead of just decimating …
With your permission, GameDev.net uses analytics cookies to understand how people use the platform. You can accept analytics or continue with necessary cookies only. Learn more
