genpark-sweep-and-prune-broadphase-collision-skill
mcp
Warn
Health Warn
- No license — Repository has no license file
- Description — Repository has a description
- Active repo — Last push 0 days ago
- Low visibility — Only 7 GitHub stars
Code Pass
- Code scan — Scanned 6 files during light audit, no dangerous patterns found
Permissions Pass
- Permissions — No dangerous permissions requested
No AI report is available for this listing yet.
Sweep-and-Prune broadphase collision algorithm sorting axis-aligned bounding boxes (AABBs)
README.md
Sweep-and-Prune Broadphase Collision Skill
Robust, zero-dependency Python implementation of the Sweep-and-Prune (SAP) algorithm for broadphase collision filtering.
Features
- Early Rejection Pruning: Rapidly skips disjoint objects along sorted 1D coordinate intervals.
- Dimension Reduction: Cuts quadratic (O(N^2)) narrowphase tests down to (O(N \log N)) candidate pairs.
- Zero External Dependencies: Pure Python standard library.
- Native MCP Protocol: JSON-RPC 2.0 stdio server compatible with Claude Desktop, Cursor, and Windsurf.
Architecture
graph TD
Boxes["N Bounding Boxes (AABBs)"] --> Sort["Sort Intervals on X-Axis"]
Sort --> Sweep["Sweep Line: Active Interval Tracking"]
Sweep --> OverlapCheck["Check Y-Axis Overlap"]
OverlapCheck --> Pairs["Filtered Potential Collision Pairs"]
Reviews (0)
Sign in to leave a review.
Leave a reviewNo results found