Full metadata record
DC pole | Hodnota | Jazyk |
---|---|---|
dc.contributor.author | Popov, Eugene Vladimirovich | |
dc.contributor.author | Popova, Tatyana Petrovna | |
dc.contributor.author | Rotkov, Sergej Igorevich | |
dc.contributor.editor | Skala, Václav | |
dc.date.accessioned | 2017-10-10T06:03:02Z | |
dc.date.available | 2017-10-10T06:03:02Z | |
dc.date.issued | 2014 | |
dc.identifier.citation | WSCG 2014: communication papers proceedings: 21st International Conference in Central Europeon Computer Graphics, Visualization and Computer Visionin co-operation with EUROGRAPHICS Association, p. 1-10. | en |
dc.identifier.isbn | 978-80-86943-71-8 | |
dc.identifier.uri | wscg.zcu.cz/WSCG2014/!!_2014-WSCG-Communication.pdf | |
dc.identifier.uri | http://hdl.handle.net/11025/26371 | |
dc.format | 10 s. | cs |
dc.format.mimetype | application/pdf | |
dc.language.iso | en | en |
dc.publisher | Václav Skala - UNION Agency | cs |
dc.relation.ispartofseries | WSCG 2014: communication papers proceedings | en |
dc.rights | @ Václav Skala - UNION Agency | cs |
dc.subject | struktury tahových tkanin | cs |
dc.subject | geodetická linka | cs |
dc.subject | výstřižek materiálu | cs |
dc.subject | nejkratší cesty | cs |
dc.subject | polyhedrální povrch | cs |
dc.title | The shortest path finding between two points on a polyhedral surface | en |
dc.type | konferenční příspěvek | cs |
dc.type | conferenceObject | en |
dc.rights.access | openAccess | en |
dc.type.version | publishedVersion | en |
dc.description.abstract-translated | The paper describes the approximate method of the shortest path finding between two points on a surface. This problem occurs when generating a cutting pattern after the form of the fabric tensile surface is found. The shortest path finding is reduced to the problem of finding the geodesic line on the surface. However, the numerical problem solution of the form finding of fabric tensile structure leads to the fact that the final surface is represented by an arbitrary polyhedron. There is no analytical problem solution of finding shortest paths in this case. The described method allows finding the shortest path on a surface of any regular polyhedron form. | en |
dc.subject.translated | tensile fabric structures | en |
dc.subject.translated | geodesic line | en |
dc.subject.translated | cutting pattern | en |
dc.subject.translated | shortest paths | en |
dc.subject.translated | polyhedral surface | en |
dc.type.status | Peer-reviewed | en |
Vyskytuje se v kolekcích: | WSCG 2014: Communication Papers Proceedings |
Soubory připojené k záznamu:
Soubor | Popis | Velikost | Formát | |
---|---|---|---|---|
Popov.pdf | Plný text | 1,34 MB | Adobe PDF | Zobrazit/otevřít |
Použijte tento identifikátor k citaci nebo jako odkaz na tento záznam:
http://hdl.handle.net/11025/26371
Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.