Automatic mesh generation and transformation for topology optimization methods

This paper presents automatic tools aimed at the generation and adaptation of unstructured tetrahedral meshes in the context of composite or heterogeneous geometry. These tools are primarily intended for applications in the domain of topology optimization methods but the approach introduced presents great potential in a wider context. Indeed, various fields of application can be foreseen for which meshing heterogeneous geometry is required, such as finite element simulations (in the case of heterogeneous materials and assemblies, for example), animation and visualization (medical imaging, for example). Using B-Rep concepts as well as specific adaptations of advancing front mesh generation algorithms, the mesh generation approach presented guarantees, in a simple and natural way, mesh continuity and conformity across interior boundaries when trying to mesh a composite domain. When applied in the context of topology optimization methods, this approach guarantees that design and non-design sub-domains are meshed so that finite elements are tagged as design and non-design elements and so that continuity and conformity are guaranteed at the interface between design and non-design sub-domains. The paper also presents how mesh transformation and mesh smoothing tools can be successfully used when trying to derive a functional shape from raw topology optimization results.     

Octree-based automatic mesh generation for non-manifold domains

Automatic mesh generation within the context of non-manifold geometric models is far from a commercial reality. While manifold objects are the most commonly encountered domains in many applications, other applications such as those requiring multiple material models and mixedmodel representations (combination of 1-D, 2-D and 3-D domains) fall beyond the realm of the existing automatic meshing procedures as they require a non-conventional modeling enviroment, namely the non-manifold topology (NMT) based environment. This paper focuses on automatic mesh generation issues in the context of two such applications: (i) finite element modeling for multiple material models and (ii) geometric abstractions requiring a mixed-model representation. Specifically, the paper describes a geometry utility system, built around an NMT data structure and geometry-based meshing algorithms that ensure the validity of the mesh for non-manifold domains.GE Consulting Services.     

A quantitative assessment of approaches to mesh generation for surgical simulation

In surgical simulation, it is common practice to use tetrahedral meshes as models for anatomy. These meshes are versatile, and can be used with a number of different physically based modelling schemes. A variety of mesh generators are available that can automatically create tetrahedral meshes from segmented anatomical volumes. Each mesh generation scheme offers its own set of unique attributes. However, few are readily available. When choosing a mesh generator for simulation, it is critical for it to output good-quality, patient-specific meshes that provide a good approximation of the shape or volume to be modelled. To keep computation time within the bounds required for real-time interaction, there is also a limit imposed on the number of elements in the mesh generated. To the authors knowledge, there has been little work directly assessing the suitability of mesh generators for surgical simulation. This paper seeks to address this issue by assessing the use of six mesh generators in a surgical simulation scenario, and examining how they affect simulation precision. This paper aims to perform these comparisons against high-resolution reference meshes, where we examine the precision of meshes from the same mesh generator at different levels of complexity.

A new approach to automatic and a priori mesh adaptation around circular holes for finite element analysis

Through our research on the integration of finite element analysis in the design and manufacturing process with CAD, we have proposed the concept of mesh pre-optimization. This concept consists in converting shape and analysis information in a size map (a mesh sizing function) with respect to various adaptation criteria (refining the mesh around geometric form features, minimizing the geometric discretization error, boundary conditions, etc.). This size map then represents a constraint that has to be respected by automatic mesh generation procedures. This paper introduces a new approach to automatic mesh adaptation around circular holes. This tool aims at optimizing, before any FEA, the mesh of a CAD model around circular holes. This approach, referred to as “a priori” mesh adaptation, should not be regarded as an alternative to adaptive a posteriori mesh refinement but as an efficient way to obtain reasonably accurate FEA results before a posteriori adaptation, which is particularly interesting when evaluating design scenarios. The approach is based on performing many offline FEA analyses on a reference case and deriving, from results and error distributions obtained, a relationship between mesh size and FEA error. This relationship can then be extended to target user specified FEA accuracy objectives in a priori mesh adaptation for any distribution of circular holes. The approach being purely heuristic, fulfilling FEA accuracy objectives, in all cases, cannot be theoretically guaranteed. However, results obtained using varying hole diameters and distributions in 2D show that this heuristic approach is reliable and useful. Preliminary results also show that extension of the method can be foreseen towards a priori mesh adaptation in 3D and mesh adaptation around other types of 2D features.     

A comparison of two optimization methods for mesh quality improvement

We compare inexact Newton and block coordinate descent optimization methods for improving the quality of a mesh by repositioning the vertices, where the overall quality is measured by the harmonic mean of the mean-ratio metric. The effects of problem size, element size heterogeneity, and various vertex displacement schemes on the performance of these algorithms are assessed for a series of tetrahedral meshes.

A new automated scheme of quadrilateral mesh generation for randomly distributed line constraints

This paper presents a new automated method of quadrilateral meshes with random line constraints which have not been fully considered in previous models. The authors developed a new looping scheme and a direct quadrilateral forming algorithm based on advanced front techniques. This generator overcomes the limitations of previous studies such as line constraint, unmeshed hole and mesh refinement. A qualitative test reveals that our algorithm is reliable and suitable at the field needed for very accurate results. The developed direct method to handle line-typed features automatically makes the multiple discretizations without any user interaction and modification.     

A grid-based algorithm for the generation of hexahedral element meshes

An algorithm for the generation of hexahedralelement meshes is presented. The algorithm works in two steps: first the interior of the volume is filled with a regular grid; then the boundary region is meshed by using basically twodimensional operations.The algorithm was designed for use in the fem-simulation of metal forming processes where a remeshing must be done very often. In principle, it can be used for meshing any geometry with hexahedral elements and examples of meshes for geometries arising from various applications are given. The algorithm is checked against the criteria proposed by Sabin [1] (Advances in Engineering Software, 13, 220–225).     

Automatic mesh generation and modification techniques for mixed quadrilateral and hexahedral element meshes of non-manifold models

A typical geometric model usually consists of both solid sections and thin-walled sections. Through using a suitable dimensional reduction algorithm, the model can be reduced to a non-manifold model consisting of solid portions and two-dimensional portions which represent the mid-surfaces of the thin-walled sections. It is desirable to mesh the solid entities using three-dimensional elements and the surface entities using two-dimensional elements. This paper proposes a robust scheme to automatically generate such a mesh of mixed two-dimensional and three-dimensional elements. It also ensures that the mesh is conforming at the interface of the non-manifold geometries. Different classes of problems are identified and their corresponding solutions are presented.     

A mapping-based approach to eliminating self-intersection of offset paths on mesh surfaces for CNC machining

Geometrically, a tool path can be generated by successively offsetting its adjacent path on the surface with a given path interval, which preferably starts from one of the surface boundaries or a primary curve. The key issues involved in offset path planning are the generation of raw offset paths and the elimination of the self-intersection of raw offset paths. Most researches available in this area are focused on how to generate the raw offset paths, however, the latter, especially how to eliminate the self-intersection of the offset paths on mesh surfaces, has not been sufficiently addressed. In this paper, a mapping-based approach to eliminating the self-intersection of offset paths is proposed for the CNC machining of mesh surfaces. The method first flattens the mesh surface onto a predefined plane by using a mesh mapping technique, and then taking the mapping as a guide, the offset paths are also naturally mapped onto the plane, from which those invalid self-intersection loops can be effectively identified and eliminated. To handle the issue of self-intersection for all types of offset path, a notion of local loop is introduced to detect and eliminate the invalid self-intersection loops. After that the planar paths are inversely mapped into the physical space and the final tool paths used for the machining of mesh surface are obtained. Meanwhile, in order to improve the kinematic and dynamic performance of the machine tool when machining along the generated offset paths, a method for rounding the sharp corners of tool paths, which result from the process of eliminating the self-intersection of raw offset paths, is also preliminarily investigated. Finally, the proposed method is validated by the results of simulations and machining experiments.     

A general framework for analysis and comparison of surface mesh optimization techniques

Many different algorithms for surface mesh optimization (including smoothing, remeshing, simplification and subdivision), each giving different results, have recently been proposed. All these approaches affect vertices of the mesh. Vertex coordinates are modified, new vertices are added and some original ones are removed, with the result that the shape of the original surface is changed. The important question is how to evaluate the differences in shape between the input and output models. In this paper, we present a novel and versatile framework for analysis of various mesh optimization algorithms in terms of shape preservation. We depart from the usual strategy by measuring the changes in the approximated smooth surfaces rather than in the corresponding meshes. The proposed framework consists of two error metrics: normal-based and physically based. We demonstrate that our metrics allow more subtle changes in shape to be captured than is possible with some commonly used measures. As an example, the proposed tool is used to compare three different techniques, reflecting basic ideas on how to solve the surface mesh improvement problem.     

A comparison of location and token-based interaction techniques for point-of-care access to medical information

This paper compares the usability of some location and token-based interaction techniques for systems that provide point-of-care access to medical information. The investigation is based around a scenario from clinical work—administration of medicine to patients. Four interaction techniques that match the scenario are identified. We demonstrate how these techniques can be concretized through functional prototypes. The prototypes were tested with health workers in a full-scale model of a section of a hospital ward. The usability issues emerging from the tests were related to required user attention, predictability of system behavior, and integration with the work situation. We found that the usability of the interaction techniques to a large degree depended on specific physical and social conditions of the use situation. This result is an incentive to consider a broad set of sensor-based interaction techniques and devices for such systems, and to select the best few of these for implementation.     

A survey of CAD model simplification techniques for physics-based simulation applications

Automated CAD model simplification plays an important role in effectively utilizing physics-based simulation during the product realization process. Currently a rich body of literature exists that describe many successful techniques for fully-automatic or semi-automatic simplification of CAD models for a wide variety of applications. The purpose of this paper is to compile a list of the techniques that are relevant for physics-based simulations problems and to characterize them based on their attributes. We have classified them into the following four categories: techniques based on surface entity based operators, volume entity based operators, explicit feature based operators, and dimension reduction operators. This paper also presents the necessary background information in the CAD model representation to assist the new readers. We conclude the paper by outlining open research directions in this field.     

A machining potential field approach to tool path generation for multi-axis sculptured surface machining

This paper presents a machining potential field (MPF) method to generate tool paths for multi-axis sculptured surface machining. A machining potential field is constructed by considering both the part geometry and the cutter geometry to represent the machining-oriented information on the part surface for machining planning. The largest feasible machining strip width and the optimal cutting direction at a surface point can be found on the constructed machining potential field. The tool paths can be generated by following the optimal cutting direction. Compared to the traditional iso-parametric and iso-planar path generation methods, the generated MPF multi-axis tool paths can achieve better surface finish with shorter machining time. Feasible cutter sizes and cutter orientations can also be determined by using the MPF method. The developed techniques can be used to automate the multi-axis tool path generation and to improve the machining efficiency of sculptured surface machining.     

PAT: A pattern classification approach to automatic reference oracles for the testing of mesh simplification programs

Graphics applications often need to manipulate numerous graphical objects stored as polygonal models. Mesh simplification is an approach to vary the levels of visual details as appropriate, thereby improving on the overall performance of the applications. Different mesh simplification algorithms may cater for different needs, producing diversified types of simplified polygonal model as a result. Testing mesh simplification implementations is essential to assure the quality of the graphics applications. However, it is very difficult to determine the oracles (or expected outcomes) of mesh simplification for the verification of test results.A reference model is an implementation closely related to the program under test. Is it possible to use such reference models as pseudo-oracles for testing mesh simplification programs? If so, how effective are they?This paper presents a fault-based pattern classification methodology called PAT, to address the questions. In PAT, we train the C4.5 classifier using black-box features of samples from a reference model and its fault-based versions, in order to test samples from the subject program. We evaluate PAT using four implementations of mesh simplification algorithms as reference models applied to 44 open-source three-dimensional polygonal models. Empirical results reveal that the use of a reference model as a pseudo-oracle is effective for testing the implementations of resembling mesh simplification algorithms. However, the results also show a tradeoff: When compared with a simple reference model, the use of a resembling but sophisticated reference model is more effective and accurate but less robust.     

A domain-specific language for model mutation and its application to the automated generation of exercises

Model-Driven Engineering (MDE) is a software engineering paradigm that uses models as main assets in all development phases. While many languages for model manipulation exist (e.g., for model transformation or code generation), there is a lack of frameworks to define and apply model mutations.A model mutant is a variation of an original model, created by the application of specific model mutation operations. Model mutation has many applications, for instance, in the areas of model transformation testing, model-based testing or education.In this paper, we present a domain-specific language called Wodel for the specification and generation of model mutants. Wodel is domain-independent, as it can be used to generate mutants of models conformant to arbitrary meta-models. Its development environment is extensible, permitting the incorporation of post-processors for different applications. In particular, we describe Wodel-Edu, a post-processing extension directed to the automated generation of exercises for particular domains and their automated correction. We show the application of Wodel-Edu to the generation of exercises for deterministic automata, and report on an evaluation of the quality of the generated exercises, obtaining overall good results.     

A mobile query service for integrated access to large numbers of online semantic web data sources

From the Semantic Web’s inception, a number of concurrent initiatives have given rise to multiple segments: large semantic datasets, exposed by query endpoints; online Semantic Web documents, in the form of RDF files; and semantically annotated web content (e.g., using RDFa), semantic sources in their own right. In various mobile application scenarios, online semantic data has proven to be useful. While query endpoints are most commonly exploited, they are mainly useful to expose large semantic datasets. Alternatively, mobile RDF stores are utilized to query local semantic data, but this requires the design-time identification and replication of relevant data. Instead, we present a mobile query service that supports on-the-fly and integrated querying of semantic data, originating from a largely unused portion of the Semantic Web, comprising online RDF files and semantics embedded in annotated webpages. To that end, our solution performs dynamic identification, retrieval and caching of query-relevant semantic data. We explore several data identification and caching alternatives, and investigate the utility of source metadata in optimizing these tasks. Further, we introduce a novel cache replacement strategy, fine-tuned to the described query dataset, and include explicit support for the Open World Assumption. An extensive experimental validation evaluates the query service and its alternative components.     

A comprehensive comparison of two variable importance analysis techniques in high dimensions: Application to an environmental multi-indicators system

Permutation variable importance measure (PVIM) based on random forest and Morris' screening design are two effective techniques for measuring the variable importance in high dimensions. The former technique is developed in the machine learning discipline and widely used in bioinformatics, while the latter technique is popular in scientific computing. We present three main contributions to variable importance analysis (VIA). First, through theoretical derivation, we show that the PVIM converges to double the non-standardized Sobol' total effect index. This observation indicates that the PVIM is especially useful for variable screening as it captures both the individual and interaction effects. Second, three numerical examples with different types of model behavior are presented for comparing the performances of these two techniques. The main conclusions are as follows. For high-dimensional additive or approximately additive models, the PVIM is much more efficient than Morris' screening design when used for both variable importance ranking and variable screening. For high-dimensional models mainly governed by interaction effects, the performance of PVIM degrades, but it is still a competitive technique. Finally, the two techniques are applied to an environmental multi-indicators system for improving the robustness of the partial order structure of this system.     

A comparison of techniques for automatic detection of stiction: simulation and application to industrial data

This paper illustrates the effect of stiction in actuators on closed loop performance and the importance of techniques, to be incorporated in the monitoring system, for automatic detection of the onset of this phenomenon. Three different techniques are compared on the basis of simulation by means of stiction models and it is shown how loop variables are affected by stiction parameters and by process characteristics. A major finding is that every technique has an uncertainty region where no decision can be taken in the absence of further information about the process. The application on industrial data, recorded on loops affected by stiction during routine plant operation, allows to confirm this result and to assess relative efficiency of the techniques. A simple test to be performed directly on the plant is also proposed to solve the remaining uncertain cases.