کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
5776333 1631974 2017 12 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Multiple shooting approach for computing approximately shortest paths on convex polytopes
ترجمه فارسی عنوان
روش تصویربرداری چندگانه برای محاسبه تقریبا کوتاهترین مسیرها در چند جمله ای محدب
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات کاربردی
چکیده انگلیسی
In this paper, we use a multiple shooting approach in solving boundary value problems for ODE to introduce a novel iterative algorithm for computing an approximate shortest path between two points on the surface of a convex polytope in 3D. Namely, the polytope is partitioned into subpolytopes, shooting points and a Straightness condition are established. The algorithm specifies how to combine shortest paths between shooting points in subpolytopes to become the required shortest path by the Straightness condition. In particular, the algorithm does not rely on Steiner points and graph tools on the entire polytope. It is implemented in C++ and a comparison with Agarwal, Har-Peled, and Karia's algorithm, on the accurate construction of the shortest path, is presented.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Computational and Applied Mathematics - Volume 317, June 2017, Pages 235-246
نویسندگان
, , ,