burning algorithm
Recently Published Documents


TOTAL DOCUMENTS

2
(FIVE YEARS 0)

H-INDEX

0
(FIVE YEARS 0)

Insects ◽  
2020 ◽  
Vol 11 (8) ◽  
pp. 546
Author(s):  
Shahab Eshghi ◽  
Vahid Nooraeefar ◽  
Abolfazl Darvizeh ◽  
Stanislav N. Gorb ◽  
Hamed Rajabi

The finite element (FE) method is one of the most widely used numerical techniques for the simulation of the mechanical behavior of engineering and biological objects. Although very efficient, the use of the FE method relies on the development of accurate models of the objects under consideration. The development of detailed FE models of often complex-shaped objects, however, can be a time-consuming and error-prone procedure in practice. Hence, many researchers aim to reach a compromise between the simplicity and accuracy of their developed models. In this study, we adapted Distmesh2D, a popular meshing tool, to develop a powerful application for the modeling of geometrically complex objects, such as insect wings. The use of the burning algorithm (BA) in digital image processing (DIP) enabled our method to automatically detect an arbitrary domain and its subdomains in a given image. This algorithm, in combination with the mesh generator Distmesh2D, was used to develop detailed FE models of both planar and out-of-plane (i.e., three-dimensionally corrugated) domains containing discontinuities and consisting of numerous subdomains. To easily implement the method, we developed an application using the Matlab App Designer. This application, called WingMesh, was particularly designed and applied for rapid numerical modeling of complicated insect wings but is also applicable for modeling purposes in the earth, engineering, mathematical, and physical sciences.



2003 ◽  
Vol DMTCS Proceedings vol. AB,... (Proceedings) ◽  
Author(s):  
Arnaud Dartois ◽  
Clémence Magnien

International audience In this paper we study the identity of the Abelian Sandpile Model on a rectangular lattice.This configuration can be computed with the burning algorithm, which, starting from the empty lattice, computes a sequence of configurations, the last of which is the identity.We extend this algorithm to an infinite lattice, which allows us to prove that the first steps of the algorithm on a finite lattice are the same whatever its size.Finally we introduce a new configuration, which shares the intriguing properties of the identity, but is easier to study.



Sign in / Sign up

Export Citation Format

Share Document