Zgadzam się
Nasza strona zapisuje niewielkie pliki tekstowe, nazywane ciasteczkami (ang. cookies) na Twoim urządzeniu w celu lepszego dostosowania treści oraz dla celów statystycznych. Możesz wyłączyć możliwość ich zapisu, zmieniając ustawienia Twojej przeglądarki. Korzystanie z naszej strony bez zmiany ustawień oznacza zgodę na przechowywanie cookies w Twoim urządzeniu.
The work was co-financed by the Department of Computer Science Lublin University of Technology and Lublin University of Technology Scientific Fund FD-IT-001.
The paper presents an approach to solving the problem of assembling broken, flat elements us-
ing a letter notation of the elements’ contours and checking their matching using linguistic methods.
Previous studies with the use of exhaustive search have shown effectiveness in finding possible connections, but
they are burdened with a large number of calculations and the time needed to carry them out. In order to accelerate
the process of searching for solutions, the possibility of using a fail-fast method of fuzzy assessment of potential
combinations of elements was checked, as well as the method of cutting off potential, but not effective connections.
The numerical experiment carried out showed a significant reduction in the number of trials and total computation
time while maintaining the quality of the potential solutions found.
