JuliaGeometry / JuliaGeometry/DistMesh.jl
Sorting Techniques
Open
Nobody has claimed this yet.
- Dominant language
- Julia
- Stars
- 28
- Forks
- 7
- PR merge metrics
- No merged PRs in 30d
Description
Ideas to reduce the cache pressure during point lookup:
where:
- Perform initially
- Perform between iterations upon some criteria being met
what:
- binning
- KD Trees
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
Start by tracing the point-lookup iterations and identifying where sorting could occur initially or between iterations. Compare the proposed binning and KD-tree approaches, using cache pressure and lookup behavior as evaluation criteria; done means a selected approach with evidence that it improves the lookup path.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- julia
- Domain
- performance
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100