Results 241 to 250 of about 579,579 (293)
Some of the next articles are maybe not open access.
Proceedings of the 1994 ACM/IEEE conference on Supercomputing - Supercomputing '94, 1994
Building complex meshes for large-scale numerical simulations presents immense difficulties in exploiting high-performance computers. Industry and research leaders will describe the current state of the art for generating meshes for such large scientific problems.
Christon, M. +3 more
openaire +1 more source
Building complex meshes for large-scale numerical simulations presents immense difficulties in exploiting high-performance computers. Industry and research leaders will describe the current state of the art for generating meshes for such large scientific problems.
Christon, M. +3 more
openaire +1 more source
Simultaneous mesh generation and partitioning for Delaunay meshes
Mathematics and Computers in Simulation, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nikos Chrisochoides, Démian Nave
openaire +2 more sources
A Simple Mesh Generator in MATLAB
SIAM Review, 2004Summary: Creating a mesh is the first step in a wide range of applications, including scientific computing and computer graphics. An unstructured simplex mesh requires a choice of meshpoints (vertex nodes) and a triangulation. We want to offer a short and simple MATLAB code, described in more detail than usual, so the reader can experiment (and add to ...
Per-Olof Persson, Gilbert Strang
openaire +2 more sources
ACM Transactions on Mathematical Software, 2015 CGALmesh is the mesh generation software package of the Computational Geometry Algorithm Library (CGAL). It generates isotropic simplicial meshes—surface triangular meshes or volume tetrahedral meshes—from input surfaces, 3D domains, and 3D multidomains, with or without sharp features.
Pierre Alliez +2 more
exaly +4 more sources
2016
Written by authors at the forefront of modern algorithms research, Delaunay Mesh Generation demonstrates the power and versatility of Delaunay meshers in tackling complex geometric domains ranging from polyhedra with internal boundaries to piecewise smooth surfaces.
Cheng, Siu Wing +2 more
openaire +3 more sources
Written by authors at the forefront of modern algorithms research, Delaunay Mesh Generation demonstrates the power and versatility of Delaunay meshers in tackling complex geometric domains ranging from polyhedra with internal boundaries to piecewise smooth surfaces.
Cheng, Siu Wing +2 more
openaire +3 more sources
2005
Die generative Modellierung ist ein alternativer Ansatz zur Beschreibung von dreidimensionaler Form. Zugrunde liegt die Idee, ein Modell nicht wie üblich durch eine Ansammlung geometrischer Primitive (Dreiecke, Punkte, NURBS-Patches) zu beschreiben, sondern durch Funktionen.
openaire +3 more sources
Die generative Modellierung ist ein alternativer Ansatz zur Beschreibung von dreidimensionaler Form. Zugrunde liegt die Idee, ein Modell nicht wie üblich durch eine Ansammlung geometrischer Primitive (Dreiecke, Punkte, NURBS-Patches) zu beschreiben, sondern durch Funktionen.
openaire +3 more sources
A Generic Algorithm for Mesh Optimisation
The International Journal of Advanced Manufacturing Technology, 2001The method presented in this paper optimises a given triangular mesh surface with respect to prescribed criteria to obtain a unit surface mesh. Two criteria are defined to guide the mesh optimisation scheme. In the procedure, we use three optimisation operators (edge split, edge collapse, and edge swap), and a local spherical surface is defined to ...
Wang, CCL, Yuen, MMF
openaire +4 more sources
Hexahedral mesh generation constraints
Engineering with Computers, 2008For finite element analyses within highly elastic and plastic structural domains, hexahedral meshes have historically offered some benefits over tetrahedral finite element meshes in terms of reduced error, smaller element counts, and improved reliability.
Jason F. Shepherd, Chris R. Johnson 0001
openaire +1 more source
1997
The efficient parallelisation of the finite element method is based on non-overlapping partitioning of the computational domain into an appropriate number of subdaomins. The problem size required for efficient application of parallel solution techniques is considerably large.
openaire +1 more source
The efficient parallelisation of the finite element method is based on non-overlapping partitioning of the computational domain into an appropriate number of subdaomins. The problem size required for efficient application of parallel solution techniques is considerably large.
openaire +1 more source
PARMESH — A parallel mesh generator
Parallel Computing, 1995zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources