Parallel mesh generation: Difference between revisions

Revision as of 17:39, 28 July 2008

Revision as of 02:26, 1 August 2008

Line 24:

Another parallel mesh generator is '''D3D''' <ref>D3D Mesh Generator Web page, http://mech.fsv.cvut.cz/~dr/d3d.html</ref> was developed by Daniel Rypl<ref>University Web page of Daniel Rypl, http://mech.fsv.cvut.cz/~dr/</ref> at Czech Technical University in Prague. '''D3D''' is a mesh generator capable to discretize in parallel (or sequentially) 3D domains into mixed meshes.

== Challenges in parallel mesh generation ==

It takes about ten to fifteen years to develop the algorithmic and software infrastructure for sequential industrial strength mesh generation libraries. Moreover, improvements in terms of quality, speed, and functionality are open

ended and permanent which makes the task of delivering state-of-the-art parallel mesh generation codes even more diffcultdifficult.

An area with immediate high benefits to parallel mesh generation is ___domain decomposition. The DD problem as it is posed in <ref>Chrisochoides N., A Survey of Parallel Mesh Generation Methods, Brown University, Providence RI - 2005.</ref>is still open for 3D geometries and its solution will help to deliver stable and scalable methods that rely on off-the-shelf mesh generation codes for Delaunay and Advancing Front Techniques.

Line 32:

Finally, a long term investment to parallel mesh generation is to attract the attention of mathematicians with open problems in mesh generation and broader impact in mathematics.

== References ==

{{reflist}}

<references/>

[[Category:Numerical differential equations]]