کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10358969 | 868688 | 2005 | 32 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Parallel Delaunay triangulation in E2 and E3 for computers with shared memory
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نرم افزارهای علوم کامپیوتر
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Parallel Delaunay triangulation in E2 and E3 for computers with shared memory Parallel Delaunay triangulation in E2 and E3 for computers with shared memory](/preview/png/10358969.png)
چکیده انگلیسی
This paper presents several parallel algorithms for the construction of the Delaunay triangulation in E2 and E3-one of the fundamental problems in computer graphics. The proposed algorithms are designed for parallel systems with shared memory and several processors. Such a hardware configuration (especially the case with two-processors) became widely spread in the last few years in the computer graphics area. Some of the proposed algorithms are easy to be implemented but not very efficient, while some of them prove opposite characteristics. Some of them are usable in E2 only, other work in E3 as well. The algorithms themselves were already published in computer graphics where the computer graphics criteria were highlighted. This paper concentrates on parallel and systematic point of view and gives detailed information about the parallelization of a computational geometry application to parallel and distributed computation oriented community.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Parallel Computing - Volume 31, Issue 5, May 2005, Pages 491-522
Journal: Parallel Computing - Volume 31, Issue 5, May 2005, Pages 491-522
نویسندگان
Josef Kohout, Ivana Kolingerová, JiÅà Žára,