Local mesh refinement is one of the key steps in the implementations of adaptive finite element methods. This paper presents a parallel algorithm for distributed memory parallel computers for adaptive local refinement...Local mesh refinement is one of the key steps in the implementations of adaptive finite element methods. This paper presents a parallel algorithm for distributed memory parallel computers for adaptive local refinement of tetrahedral meshes using bisection. This algorithm is used in PHG, Parallel Hierarchical Grid Chttp：//lsec. cc. ac. cn/phg/）, a toolbox under active development for parallel adaptive finite element solutions of partial differential equations. The algorithm proposed is characterized by allowing simukaneous refinement of submeshes to arbitrary levels before synchronization between submeshes and without the need of a central coordinator process for managing new vertices. Using the concept of canonical refinement, a simple proof of the independence of the resulting mesh on the mesh partitioning is given, which is useful in better understanding the behaviour of the biseetioning refinement procedure.展开更多
The Tetrahedral Network(TEN) is a powerful 3-D vector structure in GIS, which has a lot of advantages such as simple structure, fast topological relation processing and rapid visualization. The difficulty of TEN appli...The Tetrahedral Network(TEN) is a powerful 3-D vector structure in GIS, which has a lot of advantages such as simple structure, fast topological relation processing and rapid visualization. The difficulty of TEN application is automatic creating data structure. Although a raster algorithm has been introduced by some authors, the problems in accuracy, memory requirement, speed and integrity are still existent. In this paper, the raster algorithm is completed and a vector algorithm is presented after a 3-D data model and structure of TEN have been introducted. Finally, experiment, conclusion and future work are discussed.展开更多
Orebody-rendering techniques are developed using the marching cubes (MC) algorithm. The shape of an orebody is viv- idly displayed in real time and can be used to guide mining design as well. The MC algorithm has been...Orebody-rendering techniques are developed using the marching cubes (MC) algorithm. The shape of an orebody is viv- idly displayed in real time and can be used to guide mining design as well. The MC algorithm has been improved in two aspects. By analyzing the principles of the MC algorithm, as well as the features of the specific application, improvements were developed to: eliminate ambiguities by using a unified isosurface constructing method in the voxels, and improve the operating efficiency of the MC algorithm by incorporating an octree structure. The analytical results of the examples demonstrate the effectiveness of our proposal.展开更多
An implementation scheme of the marching cubes (MC) algorithm was presented for the visualization of mineral deposits. The basic principles, processes and pitfalls of the MC algorithm were discussed. The asymptotic de...An implementation scheme of the marching cubes (MC) algorithm was presented for the visualization of mineral deposits. The basic principles, processes and pitfalls of the MC algorithm were discussed. The asymptotic decider algorithm was employed to solve the ambiguity problem associated with the MC algorithm. The implementation scheme was applied to model and reconstruct the surfaces of mineral deposits, using the geological data obtained from an iron mine in China. Experimental results demonstrate the ability of the implementation scheme to solve the ambiguity problem, and illustrate the effectiveness and efficiency of the MC algorithm in the visualization of mineral deposits.展开更多
基金supported by the 973 Program of China 2005CB321702China NSF 10531080.
文摘Local mesh refinement is one of the key steps in the implementations of adaptive finite element methods. This paper presents a parallel algorithm for distributed memory parallel computers for adaptive local refinement of tetrahedral meshes using bisection. This algorithm is used in PHG, Parallel Hierarchical Grid Chttp：//lsec. cc. ac. cn/phg/）, a toolbox under active development for parallel adaptive finite element solutions of partial differential equations. The algorithm proposed is characterized by allowing simukaneous refinement of submeshes to arbitrary levels before synchronization between submeshes and without the need of a central coordinator process for managing new vertices. Using the concept of canonical refinement, a simple proof of the independence of the resulting mesh on the mesh partitioning is given, which is useful in better understanding the behaviour of the biseetioning refinement procedure.
基金Project supported by the National Natural Science Foundation of China (No.69833010)
文摘The Tetrahedral Network(TEN) is a powerful 3-D vector structure in GIS, which has a lot of advantages such as simple structure, fast topological relation processing and rapid visualization. The difficulty of TEN application is automatic creating data structure. Although a raster algorithm has been introduced by some authors, the problems in accuracy, memory requirement, speed and integrity are still existent. In this paper, the raster algorithm is completed and a vector algorithm is presented after a 3-D data model and structure of TEN have been introducted. Finally, experiment, conclusion and future work are discussed.
基金Projects 20020008006 supported by the Exclusive Research Foundation for Doctoral Programs by Ministry of Education of China2006BAK04B04 by the National Key Project of Scientific and Technical Supporting Programs Funded by Ministry of Science & Technology of China
文摘Orebody-rendering techniques are developed using the marching cubes (MC) algorithm. The shape of an orebody is viv- idly displayed in real time and can be used to guide mining design as well. The MC algorithm has been improved in two aspects. By analyzing the principles of the MC algorithm, as well as the features of the specific application, improvements were developed to: eliminate ambiguities by using a unified isosurface constructing method in the voxels, and improve the operating efficiency of the MC algorithm by incorporating an octree structure. The analytical results of the examples demonstrate the effectiveness of our proposal.
基金This study is financially supported by the Ph.D. Programs Foundation of the Ministry of Education of China (No. 20020008006).
文摘An implementation scheme of the marching cubes (MC) algorithm was presented for the visualization of mineral deposits. The basic principles, processes and pitfalls of the MC algorithm were discussed. The asymptotic decider algorithm was employed to solve the ambiguity problem associated with the MC algorithm. The implementation scheme was applied to model and reconstruct the surfaces of mineral deposits, using the geological data obtained from an iron mine in China. Experimental results demonstrate the ability of the implementation scheme to solve the ambiguity problem, and illustrate the effectiveness and efficiency of the MC algorithm in the visualization of mineral deposits.
