[REQ] User defined BVH traversals
Nobody has claimed this yet.
- Dominant language
- Python
- Stars
- 7.1k
- Forks
- 624
- Avg merge
- 3d 17h
- Merged PRs (30d)
- 5
Description
Description
Implement an API such that users can define their own BVH queries and traversals.
Context
Geometric primitive distance queries (line, triangle, cone, cylinder, aabb, obb, etc.). Spherecasting or other arbitrary shapes to enable continuous collision detection. Bvh vs bvh intersection which enables morphological and Boolean operations. Signed distance function contact generation (I am aware that there is related functionality in the sim folder using volumes but there are cases where a field requires too much memory to preserver small features on large SDFs).
Contributor guide
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start by reviewing the requested user-defined BVH queries and traversals, including primitive distance queries, spherecasting, BVH-versus-BVH intersection, and signed distance function contact generation. The issue mentions related functionality in the sim folder using volumes; compare that approach with the stated small-feature and memory requirements. No implementation files or tests are identified, so completion criteria need to be established.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- python
- Domain
- computer-graphics
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100