Skip to content
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

MeshGroups. #103

Draft
wants to merge 6 commits into
base: main
Choose a base branch
from
Draft

MeshGroups. #103

wants to merge 6 commits into from

Conversation

Richardn2002
Copy link
Collaborator

@Richardn2002 Richardn2002 commented Sep 30, 2024

Me handing off existing work after the final merge of ECS refactor. Here provides math for implementing meshgroups.

Three parts:

  • Testing whether a point is in a triangle.
  • Efficient (but not guaranteed correct) testing of a point is in which triangle among those in a given mesh, with a bitmask constructed for the mesh.
  • Given parent mesh and parent deformation, deform child mesh. Essentially letting one parent triangle drag a child vertex that is contained in it, and this drag can be chacterized by an inverse matrix, which can be reused for efficiency.

Intensive test for bitmask included (with a .png depicting the base test case), testing that bitmask yields correct test results for points with the whole test space transforming.
However, as mentioned, this bitmask method is not guaranteed to be correct, thus it is hard to define a "good enough" test case. It is easy to construct counterexamples.
An experimental attempt on dynamic bitmask step size is commented out cause test suites do not like it. A step size of 1 should be usable in actual rendering anyways.

To load Grillo's model properly.
Three parts:
- Testing whether a point is in a triangle.
- Efficient (but not guaranteed correct) testing of a point is in which triangle among those in a given mesh, with a bitmask constructed for the mesh.
- Given parent mesh and parent deformation, deform child mesh. Essentially letting one parent triangle drag a child vertex that is contained in it, and this drag can be chacterized by an inverse matrix, which can be reused for efficiency.
Intensive test for bitmask included (with a .png depicting the base test case), testing that bitmask yields correct test results for points with the whole test space transforming.
However, as mentioned, this bitmask method is not guaranteed to be correct, thus it is hard to define a "good enough" test case. It is easy to construct counterexamples.
An experimental attempt on dynamic bitmask step size is commented out cause test suites do not like it. A step size of `1` should be usable in actual rendering anyways.
@Richardn2002 Richardn2002 changed the title Math required to implement MeshGroup. MeshGroups. Sep 30, 2024
@Richardn2002 Richardn2002 marked this pull request as draft September 30, 2024 13:50
@Richardn2002
Copy link
Collaborator Author

Out first step should be bothering Luna and try to get the 0.9 spec on meshgroups (now called "Mesh Deformer", with the legacy one named "Deformer") out.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant