Computing practical solutions for rotational containment problems

• Autorzy: Marques N. , Capela P. , Bernardo J.
• Konferencja: Conference on Computer Graphics and Image Processing, GKPO' 2000 (6 ; 15-19.05.2000 ; Polesie, Poland)
• Języki publikacji: EN

Abstrakty

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.

Słowa kluczowe

EN

computational geometry; containment problems; Minkowski operators

• Wydawca: Institute of Information Technology of the Warsaw University of Life Sciences – SGGW
• Czasopismo: Machine Graphics and Vision
• Rocznik: 2000
• Tom: Vol. 9, No. 1/2
• Strony: 31--40
• Opis fizyczny: Bibliogr. 7 poz.

Twórcy

autor

Marques N.

autor

Capela P.

autor

Bernardo J.