Czasopismo
2000
|
Vol. 9, No. 1/2
|
31-40
Tytuł artykułu
Autorzy
Wybrane pełne teksty z tego czasopisma
Warianty tytułu
Konferencja
Conference on Computer Graphics and Image Processing, GKPO' 2000 (6 ; 15-19.05.2000 ; Polesie, Poland)
Języki publikacji
Abstrakty
A containment problem can be defined as a way of placing a set of shapes into another shapes without overlapping. Most containment problem solvers often try to reach a solution by finding a local or global maximum. Although theoretically they are correct, when one needs to apply those to a practical situation such as the footwear industry they fail to given results in acceptable time. Intertive solvers can take advantage of some shortcuts and still produce acceptable final results. We present one iterative algorithm, which uses Minkowski operators to solve multiple layer rotational containment problems. We use some AI concepts and simplify them by taking some assumptions on the layout.
Słowa kluczowe
Czasopismo
Rocznik
Tom
Strony
31-40
Opis fizyczny
Bibliogr. 7 poz.
Twórcy
Bibliografia
Typ dokumentu
Bibliografia
Identyfikatory
Identyfikator YADDA
bwmeta1.element.baztech-article-BWA1-0001-0800