Full metadata record
DC pole | Hodnota | Jazyk |
---|---|---|
dc.contributor.author | Novotni, Marcin | |
dc.contributor.author | Klein, Reinhard | |
dc.contributor.editor | Skala, Václav | |
dc.date.accessioned | 2013-07-17T10:07:22Z | - |
dc.date.available | 2013-07-17T10:07:22Z | - |
dc.date.issued | 2002 | |
dc.identifier.citation | Journal of WSCG. 2002, vol. 10, no. 1-2, p. 341-347. | en |
dc.identifier.issn | 1213-6972 (print) | |
dc.identifier.issn | 1213-6980 (CD-ROM) | |
dc.identifier.issn | 1213-6964 (online) | |
dc.identifier.uri | http://wscg.zcu.cz/wscg2002/Papers_2002/G31.zip | |
dc.identifier.uri | http://hdl.handle.net/11025/5998 | |
dc.description.abstract | We present an approximation method to compute geodesic distances on triangulated domains in the three dimensional space. Our particular approach is based on the Fast Marching Method for solving the Eikonal equation on triangular meshes. As such, the algorithm is a wavefront propagation method, a reminiscent of the Dijkstra algorithm, which runs in O(n log n) steps. | en |
dc.format | 7 s. | cs |
dc.format.mimetype | application/pdf | |
dc.language.iso | en | en |
dc.publisher | UNION Agency | cs |
dc.relation.ispartofseries | Journal of WSCG | en |
dc.rights | © UNION Agency | cs |
dc.subject | geodetické vzdálenosti | cs |
dc.subject | počítačová geometrie | cs |
dc.title | Gomputing geodesic distances on triangular meshes | en |
dc.type | článek | cs |
dc.type | article | en |
dc.rights.access | openAccess | en |
dc.type.version | publishedVersion | en |
dc.subject.translated | geodesic distances | en |
dc.subject.translated | computational geometry | en |
dc.type.status | Peer-reviewed | en |
Vyskytuje se v kolekcích: | Volume 10, number 1-2 (2002) |
Soubory připojené k záznamu:
Soubor | Popis | Velikost | Formát | |
---|---|---|---|---|
G31.pdf | Plný text | 679,01 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/5998
Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.