Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
xeonmc
5 months ago
|
parent
|
context
|
favorite
| on:
Sort, sweep, and prune: Collision detection algori...
Isn’t it just a matter of checking if two lines’ perigee fall within radius sum, and if so check if the respective segments’ closest points to the perigee are within radius sum?
Consider applying for YC's Spring batch! Applications are open till Feb 11.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
