Graph Theory Based Approach to Characterize Self Interstitial Defect Morphology
arXiv:2009.14147 · doi:10.1016/j.commatsci.2021.110474
Abstract
The defect morphology is an essential aspect of the evolution of crystals' microstructure and its response to stress. Existing methods either only report defect concentration or characterize only some of the defect morphologies. The need for an efficient and comprehensive algorithm to study defects is becoming more evident with the increase in the amount of simulation data and improvements in data-driven algorithms. We present a method to characterize a defect's morphology precisely by reducing the problem into graph theoretical concepts of finding connected components and cycles. The algorithm can identify the different homogenous components within a defect cluster having mixed morphology. We apply the method to classify morphologies of over a thousand point defect clusters formed in high energy W collision cascades. We highlight our method's comparative advantage for its completeness, computational speed, and quantitative details.
arXiv commentsource-code and results (with web-app) at: http://github.com/haptork/csaransh
References in corpus (6)
- High energy collision cascades in tungsten: dislocation loops structure and clustering scaling laws
- Displacement cascades and defects annealing in tungsten, Part I: defect database from molecular dynamics simulations
- Direct observation of size scaling and elastic interaction between nano-scale defects in collision cascades
- Atomistic-Object Kinetic Monte Carlo simulations of irradiation damage in tungsten
- Pattern Matching and Classification of Clusters in Collision Cascades
- FaVAD: A software workflow for characterisation and visualizing of defects in crystalline structures