Finding adjacent triangles

dilevin / computer-graphics-meshes

Computer Graphics Assignment about Meshes

1 stars 5 forks source link

Finding adjacent triangles #34

Open amirhmk opened 4 years ago

amirhmk commented 4 years ago

As I understand for per vertex normals, we need to find the 0/1/2 adjacent triangles that a particular vertex forms, and calculate the weighted normal. Though my question is how are we supposed to find the adjacent triangles if we don't know how the vertex indices were added?

I''m actually a little confused about the difference between per-vertex normal and per-corner normal and the different process to get them?

songfeil commented 4 years ago

You can use a dict/map/hashmap to memorize how much vertices you've met.......

amirhmk commented 4 years ago

Okay to clarify though, we don't use vertex_triangle_adjacency in per_vertex normal right?

songfeil commented 4 years ago

Yes.

2020年2月22日下午10:11，Amir Mousavi notifications@github.com 写道：

Okay to clarify though, we don't use vertex_triangle_adjacency in per_vertex normal right?

— You are receiving this because you commented. Reply to this email directly, view it on GitHub https://github.com/dilevin/computer-graphics-meshes/issues/34?email_source=notifications&email_token=AGHOR65IEQTA7AXCWBRDK6TREHSOPA5CNFSM4KZWYJ6KYY3PNVWWK3TUL52HS4DFVREXG43VMVBW63LNMVXHJKTDN5WW2ZLOORPWSZGOEMVQHEI#issuecomment-590021521, or unsubscribe https://github.com/notifications/unsubscribe-auth/AGHOR625TET6ZIZPQEYZLDTREHSOPANCNFSM4KZWYJ6A.