Název: | Solving Multiple Layer Containment Problems Using Iterative Methods |
Autoři: | Marques, Nuno Capela, Pedro Bernardo, João |
Citace zdrojového dokumentu: | WSCG '2000: Conference proceeding: The 8th International Conference in Central Europe on Computers Graphics, Visualization and Interaktive Digital Media '2000 in cooperation with EUROGRAPHICS and IFIP WG 5.10: University of West Bohemia, Plzen, Czech republic, February 7 - 10, 2000, p. 204-211. |
Datum vydání: | 2000 |
Nakladatel: | University of West Bohemia |
Typ dokumentu: | konferenční příspěvek conferenceObject |
URI: | http://wscg.zcu.cz/wscg2000/Papers_2000/Q49.pdf http://hdl.handle.net/11025/15457 |
ISBN: | 80-7082-612-6 |
Klíčová slova: | Minkowského operátoři;evaluátory;containment algoritmus |
Klíčová slova v dalším jazyce: | Minkowski operators;evaluators;ontainment algorithm |
Abstrakt: | The footwear industry’s need for an automatic containment algorithm is becoming increasingly important within the manufacturing process. Irregular containers, such as hides, have many different quality regions and holes that must be taken into account when containment is done because they represent an important cost. Automatic containment processes should be aware of these factors and still perform in practical time. We present an iterative containment algorithm that uses Minkowski operators and can be applicable to such containment problems. Although the iterative solution is not the optimal one, it can reach a solution in practical running times and it can get results that approximate the human made containment process. |
Práva: | © University of West Bohemia |
Vyskytuje se v kolekcích: | WSCG '2000: Conference proceeding |
Soubory připojené k záznamu:
Soubor | Popis | Velikost | Formát | |
---|---|---|---|---|
Marques.pdf | Plný text | 161,57 kB | Adobe PDF | Zobrazit/otevřít |
Použijte tento identifikátor k citaci nebo jako odkaz na tento záznam:
http://hdl.handle.net/11025/15457
Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.