dc.citation.conferencePlace |
JA |
- |
dc.citation.conferencePlace |
Nagoya |
- |
dc.citation.endPage |
45 |
- |
dc.citation.startPage |
35 |
- |
dc.citation.title |
26th International Symposium on Algorithms and Computation, ISAAC 2015 |
- |
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-19T21:11:19Z |
- |
dc.date.available |
2023-12-19T21:11:19Z |
- |
dc.date.created |
2016-06-21 |
- |
dc.date.issued |
2015-12-09 |
- |
dc.description.abstract |
We propose an algorithm for finding a (1 + ε)-approximate shortest path through a weighted 3D simplicial complex T. 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 T. 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 T such that if κ ≤ 1 C log log 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 |
26th International Symposium on Algorithms and Computation, ISAAC 2015, pp.35 - 45 |
- |
dc.identifier.doi |
10.1007/978-3-662-48971-0_4 |
- |
dc.identifier.issn |
0302-9743 |
- |
dc.identifier.scopusid |
2-s2.0-84951939167 |
- |
dc.identifier.uri |
https://scholarworks.unist.ac.kr/handle/201301/34354 |
- |
dc.identifier.url |
http://www.al.cm.is.nagoya-u.ac.jp/isaac2015/ |
- |
dc.identifier.wosid |
000375151300004 |
- |
dc.language |
영어 |
- |
dc.publisher |
26th International Symposium on Algorithms and Computation, ISAAC 2015 |
- |
dc.title |
Navigating Weighted Regions with Scattered Skinny Tetrahedra |
- |
dc.type |
Conference Paper |
- |
dc.date.conferenceDate |
2015-12-09 |
- |