| Grant number: | 08/11132-7 |
| Support Opportunities: | Regular Research Grants |
| Start date: | April 01, 2009 |
| End date: | March 31, 2011 |
| Field of knowledge: | Engineering - Mechanical Engineering - Manufacturing Processes |
| Principal Investigator: | Marcos de Sales Guerra Tsuzuki |
| Grantee: | Marcos de Sales Guerra Tsuzuki |
| Host Institution: | Escola Politécnica (EP). Universidade de São Paulo (USP). São Paulo , SP, Brazil |
Abstract
A fundamental problem in the irregular packing problem is the determination of the no-fit polygon. The no-fit polygon is created from two polygons, determining a region where a polygon can be placed without overlap with a fixed polygon. The no-fit polygon is not popularly used by the packing problems community because it is quite difficult to be implemented robustly. In one of our researches, a first version of such algorithm was implemented by Thiago de Castro Martins in his doctorate. Several comparatives researches exist in the literature, and they are similar to puzzles. It is necessary to implement the non regularized Boolean operations over polygons to process puzzles or problems similar to puzzles. In this research work it will be implemented an algorithm for non regularized Boolean operations. According to our results, the placement of the polygons in the vertexes of the no-fit polygon reduces the processing time and increase the convergence probability to the global optimum. (AU)
| Articles published in Agência FAPESP Newsletter about the research grant: |
| More itemsLess items |
| TITULO |
| Articles published in other media outlets ( ): |
| More itemsLess items |
| VEICULO: TITULO (DATA) |
| VEICULO: TITULO (DATA) |