Skip to content

Hotfix702 remapping #705

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
tdcwilliams merged 9 commits into from
Mar 19, 2026
Merged

Hotfix702 remapping #705

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
9 commits
Select commit Hold shift + click to select a range
dc486d8
New checkIfInside
einola Mar 18, 2026
4d6d593
Add uncertainty to checkIfIntersecting
einola Mar 18, 2026
5721238
Limit the reach of the intersection algorithm
einola Mar 18, 2026
d6f6c17
Replace sub-optimal push-back in ConservativeRemappingWeights
einola Mar 18, 2026
9442f5b
Throw in a lot of 'const's
einola Mar 18, 2026
afa7b4d
Formatting changes
einola Mar 18, 2026
927a472
Add . to doubles
einola Mar 18, 2026
ddc13c8
Replace two continues with breaks
einola Mar 18, 2026
595eb16
fix typo in contrib/bamg/src/ConservativeRemapping.cpp
tdcwilliams Mar 19, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion contrib/bamg/include/ConservativeRemapping.hpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -39,7 +39,7 @@ inline void checkTriangle(BamgMesh* bamgmesh, std::vector<double> const &gridCor
inline bool visited(int current_triangle, std::vector<int> const &triangles);

// Check if points are inside polygon
inline bool checkIfInside(std::vector<double> const &vertx, std::vector<double> const &verty, double testx, double testy);
inline bool checkIfInside(const std::vector<double>& vertx, const std::vector<double>& verty, double testx, double testy, bool inclusive);

// Check for intersection and add intersecting points to the list
inline bool checkIfIntersecting(double X, double Y, double Xnext, double Ynext, std::vector<double> const &gridCornerX, std::vector<double> const &gridCornerY, // inputs
Expand Down
Loading