QuickTrace: a fast algorithm to detect contact

DOI10.1002/NME.428zbMATH Open1098.74649OpenAlexW2147598214MaRDI QIDQ4785124FDOQ4785124

Authors: Herman C. J. Bruneel, Igor de Rycke 

Publication date: 17 December 2002

Published in: International Journal for Numerical Methods in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nme.428

Recommendations

• scientific article; zbMATH DE number 1161408
• An augmented spatial digital tree algorithm for contact detection in computational mechanics
• A contact searching algorithm for general contact problems
• FFS contact searching algorithm for dynamic finite element analysis.
• MR linear contact detection algorithm

zbMATH Keywords

computational complexityfinite elementscontact detectionforming

Mathematics Subject Classification ID

Contact in solid mechanics (74M15) Finite element methods applied to problems in solid mechanics (74S05)

Cites Work

• Contact‐impact by the pinball algorithm with penalty and Lagrangian methods
• The position code algorithm for contact searching
• A contact searching algorithm for general contact problems
• A three-dimensional impact-penetration algorithm with erosion
• Title not available (Why is that?)

Cited In (6)

• A fast contact detection algorithm insensitive to object sizes
• Performance comparisons of tree‐based and cell‐based contact detection algorithms
• Title not available (Why is that?)
• QuickTrace
• An augmented spatial digital tree algorithm for contact detection in computational mechanics
• LC-grid: a linear global contact search algorithm for finite element analysis

This page was built for publication: QuickTrace: a fast algorithm to detect contact

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4785124)