#Glass cutting optimizer how to
I'm not sure how to do this operation in processing. Now those two (if they have both non-zero width and height) have to be inserted into List_Spaces. The one to the right -> (x+width_of_occupying_space, y_occupied, Width_initial_space-width_occupying, height_of_initial_space) List_Spaces = for (n=0, n (x_occupied, y_initial_space+height_of_occupying_space, Width_of_occupying, height_initial_space-height_occupying)
Start with a list of spaces containing just one sheet - the array should be of the form: Okay I've been having a look and designed the logic of a first-fit decreasing algorithm, but I would like some help implementing it in processing. My issue is how to practically approach drawing the rectangles and the lines in the right positions? :-S If anyone can offer some step by step guidance about how to conceptualise the problem I'd greatly appreciate! Thanks! I figured that I can take user inputs by using the controlP5 library. The drawing should look similar to Figure 1 from this paper: The program must take as input the size of glass sheets, the dimensions of needed pieces and their numbers, and then produce a drawing of the optimal arrangement (which minimises the amount of material wasted). Basically I need to design a program solving the 2D bin packing problem involved in glass cutting optimization by the most basic greedy algorithm. I've done some programming before (including designing things like brownian motion simulators, and the like in Processing, which yielded data that could be exported to excel) but I have trouble figuring out how to approach this new problem.
0 kommentar(er)
