Evaluate stateful LoD streaming
Nobody has claimed this yet.
- Dominant language
- Rust
- Stars
- 65
- Forks
- 6
- Avg merge
- 9h 47m
- Merged PRs (30d)
- 1
Description
The current design computes the desired set of tiles to load from scratch each frame. This is fast enough for most purposes, but there might be room for improvement:
On each update, for each resident chunk, evaluate whether it should be split or merged according to the LoD predicate. When a split or merge occurs, recursively evaluate the newly introduced chunks.
This avoids traversal of the quadtrees and perhaps hash-table lookups for coherent updates. Performance might be worse for incoherent updates, but those are of less interest.
Contributor guide
No contributing guide indexed for this repository
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
No files or tests are named. Start by locating the current per-frame computation of the desired tile set and the resident-chunk split/merge logic, then compare the proposed stateful evaluation on coherent and incoherent updates. Done means determining whether the approach improves the intended workloads without losing correct split and merge behavior.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- rust
- Domain
- computer-graphics, performance
- Issue type
- Refactor
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 28/100