-
Notifications
You must be signed in to change notification settings - Fork 96
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.
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
Better faces #1040
base: master
Are you sure you want to change the base?
Better faces #1040
Conversation
This could be a way to attach an edge-length refiner with collapse or subdivide done per polygon. |
Vec<TriPriority> triPriority(numTri); | ||
for_each_n(autoPolicy(numTri), countAt(0), numTri, | ||
[&triPriority, this](int tri) { | ||
meshRelation_.triRef[tri].faceID = -1; |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Is this causing the check in line 238 and 249 to always be false?
} else { | ||
interiorHalfedges.push_back(h); | ||
} | ||
const int hNext = NextHalfedge(h); |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Why are we also working with the front of the queue?
if (abs(dot(v - base, normal)) < tolerance_) { | ||
meshRelation_.triRef[h / 3].faceID = tp.tri; | ||
if (!interiorHalfedges.empty() && | ||
h == halfedge_[interiorHalfedges.back()].pairedHalfedge) { |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Considering h = NextHalfedge(halfedge_[interiorHalfedges.back()].pairedHalfedge)
, will this condition ever hold?
I'm replacing our
CreateFaces
algorithm. Our previous was based on connected components, but in the case of e.g. a high-res sphere, it would connect everything into one big face. So then we added an algorithm to check global tolerance of each face after the fact, and if that failed, it would just throw out all the faces and say each triangle was individual.This new algorithm skips all that and instead finds faces by starting with the largest triangle and searching its neighbors until none are within tolerance. Then it gets the next largest unprocessed triangle and does it again, serially, until all triangles have been assigned to faces. It's a bit arbitrary, but works decently.
Ideally we can eventually follow this on with some improved edge collapsing code.