search

yuehaowang / convex_hull_3d

Incremental Convex Hull Algorithm and SAT Collision Detection for 3D Objects.
15 stars 2 forks source link

Collision is done between 2 convex hulls ? #3

Open jiapei-nexera opened 2 years ago

jiapei-nexera commented 2 years ago

What about concave hulls? For our application, we do prefer the collision is detected between two TIGHT 3D meshes, rather than the CONVEX HULL of two 3D objects.

I mean: if you can do two CONCAVE HULLs ?

Any suggestions?

jiapei100 commented 2 years ago

Can we increase the number of chunks to describe CONCAVE HULL ???

jiapei100 commented 2 years ago

Yeah.... __init()__ in https://github.com/yuehaowang/convex_hull_3d/blob/master/collision_detection.py shows everything ....

How can we deal with the collision between 2 concave hulls ??

yuehaowang commented 2 years ago

The underlying algorithm of collision detection in this repo is SAT, which only supports convex objects. A widely-used approach for handling non-convex objects is to first decompose non-convex objects into convex parts and then check intersection between those convex parts. I think you may refer to V-HACD (see this repo) for more details.