dc.citation.endPage |
32 |
- |
dc.citation.number |
1-2 |
- |
dc.citation.startPage |
13 |
- |
dc.citation.title |
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS |
- |
dc.citation.volume |
27 |
- |
dc.contributor.author |
Cheng, Siu-Wing |
- |
dc.contributor.author |
Chiu, Man-Kwun |
- |
dc.contributor.author |
Jin, Jiongxin |
- |
dc.contributor.author |
Vigneron, Antoine |
- |
dc.date.accessioned |
2023-12-21T21:44:55Z |
- |
dc.date.available |
2023-12-21T21:44:55Z |
- |
dc.date.created |
2017-10-12 |
- |
dc.date.issued |
2017-09 |
- |
dc.description.abstract |
We propose an algorithm for finding a (1 + ϵ)-approximate shortest path through a weighted 3D simplicial complex τ. The weights are integers from the range [1,W] and the vertices have integral coordinates. Let N be the largest vertex coordinate magnitude, and let n be the number of tetrahedra in τ. Let ρ be some arbitrary constant. Let Κ be the size of the largest connected component of tetrahedra whose aspect ratios exceed Κ. There exists a constant C dependent on Κ but independent of such that if Κ ≤ 1 Cloglog n + O(1), the running time of our algorithm is polynomial in n, 1/ and log(NW). If Κ = O(1), the running time reduces to O(nϵ-O(1)(log(NW))O(1)). |
- |
dc.identifier.bibliographicCitation |
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, v.27, no.1-2, pp.13 - 32 |
- |
dc.identifier.doi |
10.1142/S0218195917600020 |
- |
dc.identifier.issn |
0218-1959 |
- |
dc.identifier.scopusid |
2-s2.0-85029381856 |
- |
dc.identifier.uri |
https://scholarworks.unist.ac.kr/handle/201301/22741 |
- |
dc.identifier.url |
http://www.worldscientific.com/doi/abs/10.1142/S0218195917600020 |
- |
dc.language |
영어 |
- |
dc.publisher |
WORLD SCIENTIFIC PUBL CO PTE LTD |
- |
dc.title |
Navigating weighted regions with scattered skinny tetrahedra |
- |
dc.type |
Article |
- |
dc.description.isOpenAccess |
FALSE |
- |
dc.description.journalRegisteredClass |
scopus |
- |