Julian Mazzitelli

## Using a Tree Based Structure See [Tree-based Data Structures for Triangle Mesh Connectivity Encoding](https://www.google.ca/url?sa=t&rct=j&q=&esrc=s&source=web&cd=1&cad=rja&uact=8&ved=0ahUKEwiS2eyO8J7MAhWqyIMKHQ5yAsYQFgggMAA&url=http%3A%2F%2Fwww.springer.com%2F%3FSGWID%3D4-102-45-101532-0&usg=AFQjCNHMWkj4Plwx5nR1U4LVaWV2C8nFtw&sig2=E7shoiJceLjlcfh-1zcpfw&bvm=bv.119745492,d.amc) There will be as many nodes as there are faces in the mesh. Each iteration...

## Use `overlap` from BVH tree in Blender [How to check if two meshes intersect in python with BVH Tree?](http://blender.stackexchange.com/questions/45827/how-to-check-if-two-meshes-intersect-in-python-with-bvh-tree) Same as ray intersecting approach, but in Blender.

## Using GJK + Octree - [GJK](https://en.wikipedia.org/wiki/Gilbert%E2%80%93Johnson%E2%80%93Keerthi_distance_algorithm) - [its in ammo.js](https://github.com/kripken/ammo.js/search?utf8=%E2%9C%93&q=gjk) - [bullet docs](http://bulletphysics.org/Bullet/BulletFull/structgjkepa2__impl_1_1GJK.html) - [gjk-js](https://github.com/d07RiV/gjk-js) - [Shiny Pixels | gjk](http://vec3.ca/gjk/) - [dyn4j | GJK ](http://www.dyn4j.org/2010/04/gjk-gilbert-johnson-keerthi/) - [EPA](http://www.dyn4j.org/2010/05/epa-expanding-polytope-algorithm/)

## Goblin [goblinphysics](https://www.npmjs.com/package/goblinphysics) ``` javascript const goblinBox = new Goblin.RigidBody(new Goblin.BoxShape(2,3,2)) goblinBox.position = new Goblin.Vector3(0, 0, 0) goblinBox.updateDerived() let collidee, contactDetails console.time('goblinRunNoCollision') collidee = new Goblin.RigidBody(new Goblin.BoxShape(2,3,2)) collidee.position = new...

10000 verts, GJK on every box added so far box, ~~~12 seconds~~~ 800-1000ms with octree and less object instanciation

Almost done

interacts with golgi apparatus #17 and vesicles #16 



note, pdbs are huge