⚡ Optimize AABB and Circle intersection calculations

[johnstrand]

🎯 What: Optimized AABB.Intersects(Vector2, float) by reusing direct vector math instead of allocating temporary object instances, and removed redundant $O(N)$ vertex loop bounds check in AABB.Intersects(Polygon2D) which was already guarded by polygon.BoundingBox.

📊 Coverage: All 410 unit tests pass without regressions.

✨ Result: Benchmark measurements show up to 63% speed improvements (IntersectsIntersecting dropped from 20.6 ns to 7.5 ns; IntersectsInside dropped from 18.5 ns to 7.7 ns) with zero memory allocations across all intersection test paths.

---

PR created automatically by Jules for task 11788773102843922203 started by @johnstrand

[google-labs-jules]

👋 Jules, reporting for duty! I'm here to lend a hand with this pull request.

When you start a review, I'll add a 👀 emoji to each comment to let you know I've read it. I'll focus on feedback directed at me and will do my best to stay out of conversations between you and other bots or reviewers to keep the noise down.

I'll push a commit with your requested changes shortly after. Please note there might be a delay between these steps, but rest assured I'm on the job!

For more direct control, you can switch me to Reactive Mode. When this mode is on, I will only act on comments where you specifically mention me with @jules. You can find this option in the Pull Request section of your global Jules UI settings. You can always switch back!

New to Jules? Learn more at jules.google/docs.

---

For security, I will only act on instructions from the user who triggered this task.