Research on Test Method of Bullet Dispersion Uniformity Based on Delaunay Algorithm

GONG Huiyuan; SONG Aiping

doi:10.15892/j.cnki.djzdxb.2023.02.010

Journal of Projectiles, Rockets, Missiles and Guidance >

2023 , Vol. 43 >Issue 2: 53 - 56

DOI: https://doi.org/10.15892/j.cnki.djzdxb.2023.02.010

Research on Test Method of Bullet Dispersion Uniformity Based on Delaunay Algorithm

GONG Huiyuan ,
SONG Aiping

Expand

No.63850 Unit, Baicheng 137001, Jilin, China

Received date: 2022-05-29

Online published: 2025-02-24

Fold

Abstract

The evaluation of dispersion uniformity of submunitions is an important content in the design and test of submunitions. The existing evaluation methods have not been widely used due to their strong subjectivity, blind spots in testing and complex calculation. The uniformity evaluation method based on DeIaunay trianglation subdivision proposed in this paper overcomes the shortcomings of existing evaluation methods and can meet the engineering application of submunitions ground dispersion uniformity test.

Key words： distribution of bomblet; homogeneity check; Delaunay triangulation

Cite this article

GONG Huiyuan , SONG Aiping . Research on Test Method of Bullet Dispersion Uniformity Based on Delaunay Algorithm[J]. Journal of Projectiles, Rockets, Missiles and Guidance, 2023 , 43(2) : 53 -56 . DOI: 10.15892/j.cnki.djzdxb.2023.02.010

[an error occurred while processing this directive]

References

Publishing order | Descend order by publishing year | Descend order by cited within

[1]	李海生. Delaunay三角剖分理论及可视化应用研究[M]. 哈尔滨: 哈尔滨工业大学出版社, 2010. LI H S. Delaunay triangulation algorithm and visualization application[M]. Harbin:Harbin Institute of Technology Press, 2010.

[2]	杨钦, 徐永安, 陈其明, 等. 任意平面域离散点集的三角化方法[J]. 软件学报, 1998, 9(4): 241-245. YANG Q, XU Y A, CHEN Q M, et al. Triangulation algorithm of scattered data on arbitrary planar domain[J]. Journal of Software, 1998, 9(4): 241-245.

[3]	AURENHAMMER F. Voronoi diagrams : a survey of a fundamental data structure[J]. ACM Computing Surveys, 1991, 23(3): 345-405

[4]	EDELSBRUNNER H, SHAH N R. Incremental topological flipping works for regular triangulations[C]// SOCG. Proceedings of the 8th Annual ACM Symposium on Computational Geometry. New York: ACM, 1992: 43-52.

[5]	谷斌, 靳艳峰, 王力娟, 等. 基于贪心算法与多边形剖分的印鉴匹配算法[J]. 计算机工程与设计, 2008, 29 (12): 3136-3137. GU B, JIN Y F, Wang L J, et al. Seal identification based on cupidity algorithm and polygon triangulation cutting algorithm[J]. Computer Engineering and Design, 2008, 29 (12): 3136-3137.

[6]	周知. 三角剖分算法研究[D]. 哈尔滨: 哈尔滨理工大学, 2007. ZHOU Z. Research on triangulation algorithm abstract[D]. Harbin:Harbin University of Science and Technology, 2007.

[7]	周培德. 平面线段集三角剖分的算法[J]. 计算机工程与科学, 2003, 25(1): 20-22. ZHOU P D. Algorithms for the triangulation of plane line-segment sets[J]. Computer Engineering and Science, 2003, 25(1): 20-22.

[8]	TANG Q, REN Y. Preliminary discussion on the refinement mesh generation for adaptive analysis[J]. Journal of Applied Mathematics and Physics, 2020, 8(8): 1560-1567.

[9]	吴壮志. regular三角化的性质、算法和应用研究[D]. 北京: 北京航空航天大学, 2001. WU Z Z. Research on the properties, algorithms, and applications of regular triangulation[D]. Beijing: Beihang University, 2001.

Options

Outlines