1,626 research outputs found
Data-driven tetrahedral mesh subdivision
Given a tetrahedral mesh immersed in a voxel model, we present a method to refine the mesh to reduce the discrepancy between interpolated values based on either scheme at arbitrary locations. An advantage of the method presented is that it requires few subdivisions and all decisions are made locally at each tetrahedron. We discuss the algorithm's performance and applications.Postprint (published version
A hierarchical structure for automatic meshing and adaptive FEM analysis
A new algorithm for generating automatically, from solid models of mechanical parts, finite element meshes that are organized as spatially addressable quaternary trees (for 2-D work) or octal trees (for 3-D work) is discussed. Because such meshes are inherently hierarchical as well as spatially addressable, they permit efficient substructuring techniques to be used for both global analysis and incremental remeshing and reanalysis. The global and incremental techniques are summarized and some results from an experimental closed loop 2-D system in which meshing, analysis, error evaluation, and remeshing and reanalysis are done automatically and adaptively are presented. The implementation of 3-D work is briefly discussed
3D mesh refinement procedure using the bisection and rivara algorithms with mesh quality assessment
Mesh refinement procedures for the solution of three dimensional problems are described. The computational\ud
domain is represented by an assembly of tetrahedral elements and the mesh refinement is acheived by the bisection\ud
and Rivara methods using an explicit mesh density function coupled with an automatic 3D mesh generator.\ud
A couple of benchmark examples is used to compare the performance of both refinement methods in terms of mesh\ud
and size qualities, number of generated elements and CPU time consume
Phase-field boundary conditions for the voxel finite cell method: surface-free stress analysis of CT-based bone structures
The voxel finite cell method employs unfitted finite element meshes and voxel quadrature rules to seamlessly
transfer CT data into patient-specific bone discretizations. The method, however, still requires the explicit
parametrization of boundary surfaces to impose traction and displacement boundary conditions, which
constitutes a potential roadblock to automation. We explore a phase-field based formulation for imposing
traction and displacement constraints in a diffuse sense. Its essential component is a diffuse geometry model
generated from metastable phase-field solutions of the Allen-Cahn problem that assumes the imaging data as
initial condition. Phase-field approximations of the boundary and its gradient are then employed to transfer
all boundary terms in the variational formulation into volumetric terms. We show that in the context of the
voxel finite cell method, diffuse boundary conditions achieve the same accuracy as boundary conditions
defined over explicit sharp surfaces, if the inherent length scales, i.e., the interface width of the phase-field,
the voxel spacing and the mesh size, are properly related. We demonstrate the flexibility of the new method
by analyzing stresses in a human femur and a vertebral body
The diffuse Nitsche method: Dirichlet constraints on phase-field boundaries
We explore diffuse formulations of Nitsche's method for consistently imposing Dirichlet boundary conditions on phase-field approximations of sharp domains. Leveraging the properties of the phase-field gradient, we derive the variational formulation of the diffuse Nitsche method by transferring all integrals associated with the Dirichlet boundary from a geometrically sharp surface format in the standard Nitsche method to a geometrically diffuse volumetric format. We also derive conditions for the stability of the discrete system and formulate a diffuse local eigenvalue problem, from which the stabilization parameter can be estimated automatically in each element. We advertise metastable phase-field solutions of the Allen-Cahn problem for transferring complex imaging data into diffuse geometric models. In particular, we discuss the use of mixed meshes, that is, an adaptively refined mesh for the phase-field in the diffuse boundary region and a uniform mesh for the representation of the physics-based solution fields. We illustrate accuracy and convergence properties of the diffuse Nitsche method and demonstrate its advantages over diffuse penalty-type methods. In the context of imaging based analysis, we show that the diffuse Nitsche method achieves the same accuracy as the standard Nitsche method with sharp surfaces, if the inherent length scales, i.e., the interface width of the phase-field, the voxel spacing and the mesh size, are properly related. We demonstrate the flexibility of the new method by analyzing stresses in a human vertebral body
Real-time Error Control for Surgical Simulation
Objective: To present the first real-time a posteriori error-driven adaptive
finite element approach for real-time simulation and to demonstrate the method
on a needle insertion problem. Methods: We use corotational elasticity and a
frictional needle/tissue interaction model. The problem is solved using finite
elements within SOFA. The refinement strategy relies upon a hexahedron-based
finite element method, combined with a posteriori error estimation driven local
-refinement, for simulating soft tissue deformation. Results: We control the
local and global error level in the mechanical fields (e.g. displacement or
stresses) during the simulation. We show the convergence of the algorithm on
academic examples, and demonstrate its practical usability on a percutaneous
procedure involving needle insertion in a liver. For the latter case, we
compare the force displacement curves obtained from the proposed adaptive
algorithm with that obtained from a uniform refinement approach. Conclusions:
Error control guarantees that a tolerable error level is not exceeded during
the simulations. Local mesh refinement accelerates simulations. Significance:
Our work provides a first step to discriminate between discretization error and
modeling error by providing a robust quantification of discretization error
during simulations.Comment: 12 pages, 16 figures, change of the title, submitted to IEEE TBM
Unwind: Interactive Fish Straightening
The ScanAllFish project is a large-scale effort to scan all the world's
33,100 known species of fishes. It has already generated thousands of
volumetric CT scans of fish species which are available on open access
platforms such as the Open Science Framework. To achieve a scanning rate
required for a project of this magnitude, many specimens are grouped together
into a single tube and scanned all at once. The resulting data contain many
fish which are often bent and twisted to fit into the scanner. Our system,
Unwind, is a novel interactive visualization and processing tool which
extracts, unbends, and untwists volumetric images of fish with minimal user
interaction. Our approach enables scientists to interactively unwarp these
volumes to remove the undesired torque and bending using a piecewise-linear
skeleton extracted by averaging isosurfaces of a harmonic function connecting
the head and tail of each fish. The result is a volumetric dataset of a
individual, straight fish in a canonical pose defined by the marine biologist
expert user. We have developed Unwind in collaboration with a team of marine
biologists: Our system has been deployed in their labs, and is presently being
used for dataset construction, biomechanical analysis, and the generation of
figures for scientific publication
- âŠ