Abstract
We study the following problem. Given a simple polytope S in R <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">3</sup> , with a total of n edges, and a query point s on S, find a shortest path from s to the boundary of the convex hull, CH(S), of S, that does not go through the interior of S. The problem appears in structural proteomics in the computation of shape descriptors for measuring the depth of a point on a surface. We present an algorithm with running time O(n <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">3</sup> (λ(n)log(n/∈)/∈ <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">4</sup> +log(nρ) log(n log ρ))), that can find a path from s to the boundary of CH(S) that has length at most (1+∈) times the length of a shortest path from s to the boundary of CH(S).
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call