JuliaGeometry / JuliaGeometry/Meshing.jl
Interpolation Mechanisms
Nobody has claimed this yet.
- Dominant language
- Julia
- Stars
- 67
- Forks
- 13
- PR merge metrics
- No merged PRs in 30d
Description
Currently each algorithm has its own mechanism for interpolating the edge crossing in a voxel. It may be useful in some visualization paradigms to just deliver the midpoint in each scenario for higher performance. Conversely, in the function variants we can use root finding for even higher precision.
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 locating the interpolation logic used by each meshing algorithm and the function variants mentioned in the issue. Compare the current edge-crossing behavior with the proposed midpoint and root-finding alternatives, then clarify the intended API and algorithms covered. Done should be defined by an agreed, tested way to select the interpolation behavior.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- julia
- Domain
- computer-graphics
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100