Linear Complexity Hexahedral Mesh Generation

We show that any polyhedron forming a topological ball with an even number of quadrilateral sides can be partitioned into O(n) topological cubes, meeting face to face. The result generalizes to non-simply-connected polyhedra satisfying an additional bipartiteness condition. The same techniques can also be used to reduce the geometric version of the hexahedral mesh generation problem to a finite case analysis amenable to machine solution.Comment: 12 pages, 17 figures. A preliminary version of this paper appeared at the 12th ACM Symp. on Computational Geometry. This is the final version, and will appear in a special issue of Computational Geometry: Theory and Applications for papers from SCG '9

A local, un-structured, re-meshing technique capable of handling large body-motion in rotating machinery

In this paper we propose a simple, unstructured mesh generation technique that is capable of handling the large and complex blade motion that is encountered in certain rotating machines, such as vertical axis wind turbines or cycloidal propellers. The technique is characterised by localised re-meshing and interpolation, so as to keep the mesh generation cost and interpolation error as low as possible

A fast and robust patient specific Finite Element mesh registration technique: application to 60 clinical cases

Finite Element mesh generation remains an important issue for patient specific biomechanical modeling. While some techniques make automatic mesh generation possible, in most cases, manual mesh generation is preferred for better control over the sub-domain representation, element type, layout and refinement that it provides. Yet, this option is time consuming and not suited for intraoperative situations where model generation and computation time is critical. To overcome this problem we propose a fast and automatic mesh generation technique based on the elastic registration of a generic mesh to the specific target organ in conjunction with element regularity and quality correction. This Mesh-Match-and-Repair (MMRep) approach combines control over the mesh structure along with fast and robust meshing capabilities, even in situations where only partial organ geometry is available. The technique was successfully tested on a database of 5 pre-operatively acquired complete femora CT scans, 5 femoral heads partially digitized at intraoperative stage, and 50 CT volumes of patients' heads. The MMRep algorithm succeeded in all 60 cases, yielding for each patient a hex-dominant, Atlas based, Finite Element mesh with submillimetric surface representation accuracy, directly exploitable within a commercial FE software

Exact asymptotics of the uniform error of interpolation by multilinear splines

The question of adaptive mesh generation for approximation by splines has been studied for a number of years by various authors. The results have numerous applications in computational and discrete geometry, computer aided geometric design, finite element methods for numerical solutions of partial differential equations, image processing, and mesh generation for computer graphics, among others. In this paper we will investigate the questions regarding adaptive approximation of C2 functions with arbitrary but fixed throughout the domain signature by multilinear splines. In particular, we will study the asymptotic behavior of the optimal error of the weighted uniform approximation by interpolating and quasi-interpolating multilinear splines