Good morning everyone, today I bring you a very particular question. It turns out that I must do a project in Python 2.7 in which I am asked to design regular polyhedra (specifically cubes). I do not want to be taught the code to develop, but rather, you can help me with ideas about the algorithm that could be used for the development of the project, because even though I searched for information in books and the internet, I found almost nothing.
According to the requirements and limitations that were given to me in the class, it will probably be a program that will take me a long time to complete, then I will detail the requirements that I am asked for:
In this project, polyhedra must be represented in two-dimensional matrices of whole numbers. Each cell of the matrix has an integer N representing a parallelepiped of 1 x 1 x N. For example, a 2x2 matrix with all its cells with value 2 represents a polyhedron with side 2. However, if one of the values of that same matrix is 1, then the resulting polyhedron is that same cube but with one of its corners cut.
Program entry: A text file containing the matrix that represents the polyhedron. Each row of the file represents a row of the matrix. The values of each column are separated by commas.
Program output: Must show on screen: matrix, orthogonal view of the polyhedron and the number of faces of said polyhedron.
Again, I do not want to be given the exact codes that I should use in the program, since I want to use it myself to create the program's code lines; I just need information on how to approach the algorithm, for example: where should I start, what libraries should I use and etc ...
Here is a picture of what my program should show on screen, in advance, thank you very much for your help 