A Parallel Algorithm for Surface Triangulation
نویسندگان
چکیده
In many scientiic elds, three dimensional surfaces must be reconstructed from a given collection of its surface points. Applications for surface reconstruction exist in medical research and diagnosis as well as in design intensive disciplines. Fuchs, Kedem, and Uselton and Keppel show that surface reconstruction via triangulation can be reduced to the problem of nding a path in a toroidal graph. This paper presents a parallel algorithm to nd the minimum cost acceptable path in an m by n toroidal graph. We then show an implementation of the parallel algorithm on a parallel architecture, using a message passing approach. Results are shown, along with suggestions for future enhancements.
منابع مشابه
Selected Problems of Parallel Computer Graphics
This thesis gives an overview of parallel techniques used in computer graphics. It investigates the problems of work distribution, load balancing, communication traffic reduction and merging of subsolutions. These problems are discussed in the relation to parallel rendering, the representative of traditional computer graphics, and the Delaunay triangulation, the representative of the computatio...
متن کاملFast CUDA-Based Triangulation of Molecular Surfaces
Modeling molecular surfaces enables us to extract useful information about interactions with other molecules and measurements of areas and volumes. Over the years many types of algorithms have been developed to represent and rendering molecular surfaces, but all these algorithms have problems related to time performance in triangulating molecular surfaces. One possible solution to solve this pr...
متن کاملA Distributed Parallel Algorithm for Delaunay Triangulation Based on Self-Adaptive Partitioning
متن کامل
Variational Delaunay approach to the generation of tetrahedral nite element meshes
We describe an algorithm which generates tetrahedral decomposition of a general solid body, whose surface is given as a collection of triangular facets. The principal idea is to modify the constraints in such a way as to make them appear in an unconstrained triangulation of the vertex set a priori. The vertex set positions are randomized to guarantee existence of a unique triangulation which sa...
متن کاملSet a bi-objective redundancy allocation model to optimize the reliability and cost of the Series-parallel systems using NSGA II problem
With the huge global and wide range of attention placed upon quality, promoting and optimize the reliability of the products during the design process has turned out to be a high priority. In this study, the researcher have adopted one of the existing models in the reliability science and propose a bi-objective model for redundancy allocation in the series-parallel systems in accordance with th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Parallel Algorithms Appl.
دوره 3 شماره
صفحات -
تاریخ انتشار 1994