A New Algorithm for Generating Tetrahedral Grids
| Autor: | D.Yu. Sychugov, A. S. Zhilkin |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Control and Optimization
Computer science Structure (category theory) 010103 numerical & computational mathematics 02 engineering and technology Grid 01 natural sciences Human-Computer Interaction Computational Mathematics Personal computer 0202 electrical engineering electronic engineering information engineering Tetrahedron 020201 artificial intelligence & image processing 0101 mathematics Algorithm |
| Zdroj: | Moscow University Computational Mathematics and Cybernetics. 42:63-68 |
| ISSN: | 1934-8428 0278-6419 |
| Popis: | A new algorithm is presented for generating tetrahedral grids for bound domains of complicated structure and form that consist of the union of several subdomains. The grids obtained using the algorithm have regularity, in that there is no tetrahedron whose vertices lie at different sides of the subdomain boundaries. The algorithm has high fast-action: the time needed to generate a grid consisting of 105−106 tetrahedrons is approximately 20–40 seconds of the work of a standard personal computer. All steps of the algorithm are described in detail, and examples of generated grids are given. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink