CNF:Monte Carlo Event Generator using a Tessellation: Difference between revisions
Jump to navigation
Jump to search
Spyridon97 (talk | contribs) |
Spyridon97 (talk | contribs) |
||
| Line 12: | Line 12: | ||
## [https://math.stackexchange.com/questions/18686/uniform-random-point-in-triangle Generate Random Points in a triangle] ✔ | ## [https://math.stackexchange.com/questions/18686/uniform-random-point-in-triangle Generate Random Points in a triangle] ✔ | ||
## [http://vcg.isti.cnr.it/jgt/tetra.htm Generate Random Points in a tetrahedron] ✔ | ## [http://vcg.isti.cnr.it/jgt/tetra.htm Generate Random Points in a tetrahedron] ✔ | ||
# Replace linear search (O(n)) of tetrahedrons with given weight threadhold with binary search (O(log(n))) | # Replace linear search (O(n)) of tetrahedrons with given weight threadhold with binary search (O(log(n))) ✔ | ||
# Parallelize code using OpenMP | # Parallelize code using OpenMP ✔ | ||
= References = | = References = | ||
[https://github.com/gavalian/clas12ai/blob/add-crtc-ml/cnf/main.cc Gagik's MC kernel] | [https://github.com/gavalian/clas12ai/blob/add-crtc-ml/cnf/main.cc Gagik's MC kernel] | ||
Revision as of 20:54, 13 July 2020
Repository
Code
Summer 2020
- Organize Gagik's code ✔
- Add README.md file ✔
- Add command-line interface ✔
- Template code for 2-3 dimensions using:
- Replace linear search (O(n)) of tetrahedrons with given weight threadhold with binary search (O(log(n))) ✔
- Parallelize code using OpenMP ✔