Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 1

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote Computing practical solutions for rotational containment problems
EN
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.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.