genpark-gjk-convex-collision-detection-skill

mcp
Guvenlik Denetimi
Uyari
Health Uyari
  • 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 Gecti
  • Code scan — Scanned 6 files during light audit, no dangerous patterns found
Permissions Gecti
  • Permissions — No dangerous permissions requested

Bu listing icin henuz AI raporu yok.

SUMMARY

Gilbert-Johnson-Keerthi (GJK) convex polytope collision detector using Minkowski difference support mappings

README.md

GJK Convex Collision Detection Skill

Robust, zero-dependency Python implementation of the Gilbert-Johnson-Keerthi (GJK) algorithm for convex polygon collision detection.

Features

  • Minkowski Difference Simplex: Reductively searches for origin inclusion within Minkowski difference polytope.
  • Support Mapping Generalization: Evaluates arbitrary convex hulls without explicit vertex mesh boolean intersections.
  • 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
    ShapeA & ShapeB --> Minkowski["Minkowski Difference A - B"]
    Minkowski --> Simplex["Build Iterative Simplex"]
    Simplex --> OriginCheck{"Origin Included in Simplex?"}
    OriginCheck -- Yes --> Collided["Collision Detected"]
    OriginCheck -- No --> Disjoint["Disjoint Convex Shapes"]

Yorumlar (0)

Sonuc bulunamadi