v0.7.0

ImplicitBVH v0.7.0

Diff since v0.6.0

• Added new Leaf-vs-Tree contact and raytracing traversal algorithm which is more scalable
• Added alg as a new argument to traverse
• Made options, start_level, and cache keyword arguments
• Made Morton encoding algorithm-specific (for future e.g. extended Morton codes) and moved to BVHOptions
• Added optional narrow-phase checking function before considering a contact
• Bundled bounding volumes, their user-defined index and Morton code into a single BoundingVolume struct which allows in-place sorting; this makes BVH construction between frames faster when most bounding volumes are still roughly sorted

Breaking changes

• Old interfaces are kept for compatibility, but defaults are different: BBox{Float32} nodes, UInt32 Morton codes, Int32 indices.
• BVHTraversal can have different cache types depending on the algorithm; previous code which was not making use of internals should still work.
• Removed order from BVH as now vectors of BoundingVolume are sorted in-place

Merged pull requests:

• More scalable Leaf-vs-Tree traversal (#19) (@anicusan)