Outline
Optimize the current convex hull algorithm to improve robustness and efficiency.
Details
The current implementation (quickhull) have cases in which it cannot handle, and will resort to deleting those problematic points. We should try to look at alternative algorithms or improve on existing algorithm to make it more stable.
Also, we should try to perform parallelization to optimize convex hull performance.
Expected Outcome
A faster and/or more robust convex hull implementation
Project Properties
Skills
- C++
- Knowledge about algorithms
- Knowledge about graph data structure.
Difficulty
Size
Additional Information
Outline
Optimize the current convex hull algorithm to improve robustness and efficiency.
Details
The current implementation (quickhull) have cases in which it cannot handle, and will resort to deleting those problematic points. We should try to look at alternative algorithms or improve on existing algorithm to make it more stable.
Also, we should try to perform parallelization to optimize convex hull performance.
Expected Outcome
A faster and/or more robust convex hull implementation
Project Properties
Skills
Difficulty
Size
Additional Information