2018
DOI: 10.1155/2018/4827810
|View full text |Cite|
|
Sign up to set email alerts
|

Combined Acceleration Methods for Solid Rocket Motor Grain Burnback Simulation Based on the Level Set Method

Abstract: A detailed study of a set of combined acceleration methods is presented with the objective of accelerating the solid rocket motor grain burnback simulation based on the level set method. Relevant methods were improved by making use of unique characteristics of the grains, and graphical processing unit (GPU) parallelization is utilized to perform the computationally intensive operations. The presented flow traced the expansion of burning surfaces, and then Boolean operations were applied on the resulting surfac… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
10
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
4
1

Relationship

2
3

Authors

Journals

citations
Cited by 6 publications
(10 citation statements)
references
References 25 publications
0
10
0
Order By: Relevance
“…Both Havoc and DiFi rely on the Voronoi diagram [19] to query the minimum distance. In this article, only the points on H are of our concern, so there are fewer points to process compared to full burnback simulations [10,12]. Our tests show that the AABB tree method outperforms the Voronoi-type methods when the number of points to be queried is relatively small.…”
Section: Mathematical Modelmentioning
confidence: 98%
See 4 more Smart Citations
“…Both Havoc and DiFi rely on the Voronoi diagram [19] to query the minimum distance. In this article, only the points on H are of our concern, so there are fewer points to process compared to full burnback simulations [10,12]. Our tests show that the AABB tree method outperforms the Voronoi-type methods when the number of points to be queried is relatively small.…”
Section: Mathematical Modelmentioning
confidence: 98%
“…where D x , B is the length of the shortest line segment connecting B to x . There have been some highperformance minimum distance algorithms, including the Havoc algorithm [16] employed in [10], the DiFi algorithm [17] employed in [12], and the Axis-Aligned Bounding Box (AABB) tree method [18]. Both Havoc and DiFi rely on the Voronoi diagram [19] to query the minimum distance.…”
Section: Mathematical Modelmentioning
confidence: 99%
See 3 more Smart Citations