agargaro / BVH.js Public

Notifications You must be signed in to change notification settings
Fork 2
Star 20

Dynamic BVH implementation based on Erin Catto's paper and three-mesh-bvh (WIP)

20 stars 2 forks Branches Tags Activity

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 24 Commits
src		src
.gitignore		.gitignore
LICENSE		LICENSE
README.md		README.md
package.json		package.json
tsconfig.json		tsconfig.json
vite.config.js		vite.config.js

Repository files navigation

Dynamic BVH

Work in progress... will be released soon :)

Live example: https://stackblitz.com/edit/three-ezinstancedmesh2-dynamic-bvh?file=index.ts

Create a BVH from a AABB array. You can set whetever value to each node.

Build method: top-down or insertion one by one.

Implemented API:

createFromArray
insert
insertRange
move
delete
clear

traverse
rayIntersections
frustumCulling
frustumCullingLOD
closestPointToPoint
intersectsBox
intersectsSphere
intersectsRay
isNodeIntersected

TODO:

traverseByScore
intersectsRayFirst
intersectsBVH
closestPointToGeometry
getAllCollision
getNearestObject

experiment rotation with N leaves and max depth

References

About

Dynamic BVH implementation based on Erin Catto's paper and three-mesh-bvh (WIP)

performance acceleration graphics intersection bvh bounds 3d acceleration-data-structures bounds-hierarchy

Report repository

Releases

No releases published

Languages