NVIDIAGameWorks / NVIDIAGameWorks/kaolin
Efficient Dual Octree Construction
Nobody has claimed this yet.
- Dominant language
- Python
- Stars
- 5.2k
- Forks
- 629
- Avg merge
- 53m
- Merged PRs (30d)
- 2
Description
Right now we support trilinear interpolation of SPC but we don’t officially support the creation of the dual octree (trinkets), which you need to perform interpolation. Current implementation I have (https://github.com/nv-tlabs/nglod/blob/6cb8d10cc4b44f709f855dc98fa8e6e58ba7c1fd/sdf-net/app/spc/spc_utils.py#L107) is Pandas and CPU based, and runs fast but is not ideal.
Not sure what the right algorithm is, need time (or equivalently find time) to think about it.
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 with sdf-net/app/spc/spc_utils.py around line 107 and review the current Pandas and CPU-based dual-octree construction. Compare it with the existing SPC trilinear-interpolation support, then determine an appropriate algorithm; done means dual-octree (trinket) creation is officially supported without relying on the current implementation.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- pandas, python
- Domain
- computer-graphics
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Active
- Clarity
- Needs clarification
- Newbie friendliness
- 35/100