Full metadata record
DC FieldValueLanguage
dc.contributor.authorPopov, Eugene Vladimirovich
dc.contributor.authorPopova, Tatyana Petrovna
dc.contributor.authorRotkov, Sergej Igorevich
dc.contributor.editorSkala, Václav
dc.identifier.citationWSCG 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.format10 s.cs
dc.publisherVáclav Skala - UNION Agencycs
dc.relation.ispartofseriesWSCG 2014: communication papers proceedingsen
dc.rights@ Václav Skala - UNION Agencycs
dc.subjectstruktury tahových tkanincs
dc.subjectgeodetická linkacs
dc.subjectvýstřižek materiálucs
dc.subjectnejkratší cestycs
dc.subjectpolyhedrální povrchcs
dc.titleThe shortest path finding between two points on a polyhedral surfaceen
dc.typekonferenční příspěvekcs
dc.description.abstract-translatedThe 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.translatedtensile fabric structuresen
dc.subject.translatedgeodesic lineen
dc.subject.translatedcutting patternen
dc.subject.translatedshortest pathsen
dc.subject.translatedpolyhedral surfaceen
Appears in Collections:WSCG 2014: Communication Papers Proceedings

Files in This Item:
File Description SizeFormat 
Popov.pdfPlný text1,34 MBAdobe PDFView/Open

Please use this identifier to cite or link to this item: http://hdl.handle.net/11025/26371

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.