Assignment:
Implement “marching tetrahedrons.” It is similar to the “marching quads” of project
5, but it will require that you extend this algorithm to three dimensions, specifically
for tetrahedrons. (Tetrahedrons are the simplest cell type – 4 vertices.)
You will need to make your own conventions for edge numbering, build your own
lookup tables, etc.
The skeleton code I provide:
- Has a Tetrahedron class
- Has an empty implementation of “IsosurfaceTet(…)”
- Has the code that loads data and calls IsosurfaceTet
Note this prompt is sparser than previous ones. I figure you all are getting the hang
of this by now.
What to upload?:
- Your proj6.cxx file with a working IsosurfaceTet function.
- A screenshot of you running your code and getting the correct outpu
