A data structure for efficient collision detection in a 2D space
-
Updated
Jan 23, 2018 - Java
A data structure for efficient collision detection in a 2D space
My solution for udacity path planning project. This makes the car drive > 20 miles without collision without constraint violation
This repository shows how to build a quad tree in a squared map. This data structure can be used to check for collisions super efficiently. Used mainly in games.
CudaSoftCollisions is a library that allow you to detect self collisions in a tetrahedrical mesh that is deformed over time.
Motion Planner for Self Driving Cars
Tile based collision detection and response in MonoGame. Handles solid tiles, ground detection, platforms and slopes.
Wrapper for Stephen Cameron's Enhanced GJK code
Canvas animation basics
Code for our ICRA paper "Autonomous Navigation in Unknown Environments with Sparse Kernel-based Occupancy Mapping"
Code for our paper "Autonomous Navigation in Unknown Environments with Sparse Bayesian Kernel-based Occupancy Mapping".
A collision detection algorithm using smart space division to improve detection speed.
List of commonly used robotics libraries and packages
A browser based game inspired by the 1980 Atari arcade classic.
RRT (Rapidly-Exploring Random Trees) using Dubins curve, with collision check in MATLAB
This is a structure allowing you to find suitable collision-candidates out of a bulk of sprites or similar very fast.
The official repo for NeurIPS 2021 paper 'Reducing Collision Checking for Sampling-Based Motion Planning Using Graph Neural Networks'
Add a description, image, and links to the collision-checking topic page so that developers can more easily learn about it.
To associate your repository with the collision-checking topic, visit your repo's landing page and select "manage topics."