@alexbol99/collision_distance
Advanced tools
Algorithm to calculate one-dimensional collision distance between two shapes
Algorithm to calculate one-dimensional collision distance between two shapes
Let we have 2 not intersecting arbitrary polygons A and B in 2-d plane so that x-distance between two bounding boxes is d > 0. We want to find minimal translation vector t(x,0) so that polygon B after translation will collide with polygon A at least in one point.
FAQs
Algorithm to calculate one-dimensional collision distance between two shapes
We found that @alexbol99/collision_distance demonstrated a not healthy version release cadence and project activity because the last version was released a year ago. It has 1 open source maintainer collaborating on the project.
Did you know?
Socket for GitHub automatically highlights issues in each pull request and monitors the health of all your open source dependencies. Discover the contents of your packages and block harmful activity before you install or update your dependencies.
Security News
Socket's package search now displays weekly downloads for npm packages, helping developers quickly assess popularity and make more informed decisions.
Security News
A Stanford study reveals 9.5% of engineers contribute almost nothing, costing tech $90B annually, with remote work fueling the rise of "ghost engineers."
Research
Security News
Socket’s threat research team has detected six malicious npm packages typosquatting popular libraries to insert SSH backdoors.
