KAUST DepartmentComputer Science Program
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Visual Computing Center (VCC)
Online Publication Date2015-11-27
Print Publication Date2015
Permanent link to this recordhttp://hdl.handle.net/10754/622224
MetadataShow full item record
AbstractWe 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ε(log(NW))).
CitationCheng S-W, Chiu M-K, Jin J, Vigneron A (2015) Navigating Weighted Regions with Scattered Skinny Tetrahedra. Lecture Notes in Computer Science: 35–45. Available: http://dx.doi.org/10.1007/978-3-662-48971-0_4.
Conference/Event name26th International Symposium on Algorithms and Computation, ISAAC 2015