Distance fields on unstructured grids: stable interpolation, assumed gradients, collision detection and gap function
From MaRDI portal
Publication:2449914
Recommendations
- Simple finite element-based computation of distance functions in unstructured grids
- A distance-function-based Cartesian (DIFCA) grid method for irregular geometries
- Approximate distance fields with non-vanishing gradients
- Level set methods based on distance function
- Robust, vectorized search algorithms for interpolation on unstructured grids
- A gradient augmented level set method for unstructured grids
- scientific article; zbMATH DE number 2064489
Cites work
- Cn continuous modelling of smooth contact surfaces using NURBS and application to 2D problems
- A 3D contact smoothing method using Gregory patches
- A C^1-continuous formulation for 3D finite deformation frictional contact
- A fast marching level set method for monotonically advancing fronts.
- A finite element method based on C0-continuous assumed gradients
- A monolithic smoothing-gap algorithm for contact-impact based on the signed distance function
- A mortar formulation for 3D large deformation contact using NURBS-based isogeometric analysis and the augmented Lagrangian method
- A mortar segment-to-segment contact method for large deformation solid mechanics.
- A single surface contact algorithm for the post-buckling analysis of shell structures
- An assumed-gradient finite element method for the level set equation
- Asynchronous collision integrators: explicit treatment of unilateral contact with friction and nodal restraints
- Contact treatment in isogeometric analysis with NURBS
- Decomposition contact response (DCR) for explicit finite element dynamics
- Efficient Collision Detection of Complex Deformable Models using AABB Trees
- Fast Marching Methods
- Finite element analysis of nonsmooth contact
- Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
- Gmsh: a 3-D finite element mesh generator with built-in pre- and post-processing facilities
- scientific article; zbMATH DE number 1349965 (Why is no real title available?)
- scientific article; zbMATH DE number 1161408 (Why is no real title available?)
- Isogeometric analysis: CAD, finite elements, NURBS, exact geometry and mesh refinement
- Mortar methods with curved interfaces
- Multidimensional binary search trees used for associative searching
- Numerical schemes for the Hamilton-Jacobi and level set equations on triangulated domains
- On the modelling of smooth contact surfaces using cubic splines
- On the solvability of closest point projection procedures in contact analysis: analysis and solution strategy for surfaces of arbitrary geometry
- Sliding interfaces with contact-impact in large-scale Lagrangian computations
- Smooth C^1-interpolations for two-dimensional frictional contact problems.
- Stable Lagrange multipliers for quadrilateral meshes of curved interfaces in 3D
- Subdivision schemes for smooth contact surfaces of arbitrary mesh topology in 3D
- The position code algorithm for contact searching
- Three-dimensional mortar-based frictional contact treatment in isogeometric analysis with NURBS
- Time-discretized variational formulation of non-smooth frictional contact
Cited in
(10)- Algebraic distance estimations for enriched isogeometric analysis
- A coupled finite volume method and Gilbert-Johnson-Keerthi distance algorithm for computational fluid dynamics modelling
- An implicit 3D corotational formulation for frictional contact dynamics of beams against rigid surfaces using discrete signed distance fields
- Signed distance field framework for unified DEM modeling of granular media with arbitrary particle shapes
- Simple finite element-based computation of distance functions in unstructured grids
- Continuous gap contact formulation based on the screened Poisson equation
- A contact formulation using local frame of SE(3) group for corotational beam against rigid solid via moving signed distance field
- Real-time collision detection between general SDFs
- Contact detection in computational mechanics: a signed distance field approach for convex superelliptical bodies
- Dynamic reconstruction of signed distance field for efficient contact analysis of irregular deformable bodies
This page was built for publication: Distance fields on unstructured grids: stable interpolation, assumed gradients, collision detection and gap function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2449914)
