NSSC OpenIR  > 运控部/科学卫星综合运控中心
An improved seeding algorithm of magnetic flux lines based on data in 3D space
Zhong, Jia; Hu, Xiaoyan; Zou, Ziming
Department运控部/科学卫星综合运控中心
2015
Language英语
AbstractThis paper will propose an approach to increase the accuracy and efficiency of seeding algorithmsof magnetic flux lines in magnetic field visualization. To obtain accurate and reliable visualization results, the density of the magnetic flux lines should map the magnetic induction intensity, and seed points should determine the density of the magnetic flux lines. However, the traditional seeding algorithm, which is a statistical algorithm based on data, will produce errors when computing magnetic flux through subdivision of the plane. To achieve higher accuracy, more subdivisions should be made, which will reduce efficiency. This paper analyzes the errors made when the traditional seeding algorithm is used and gives an improved algorithm. It then validates the accuracy and efficiency of the improved algorithm by comparing the results of the two algorithms with results from the equivalent magnetic flux algorithm. © 2015 The Author(s).
Indexed ByEI
Document Type会议论文
Identifierhttp://ir.nssc.ac.cn/handle/122/6321
Collection运控部/科学卫星综合运控中心
Recommended Citation
GB/T 7714
Zhong, Jia,Hu, Xiaoyan,Zou, Ziming. An improved seeding algorithm of magnetic flux lines based on data in 3D space[C],2015.
Files in This Item:
File Name/Size DocType Version Access License
2015548-1087-1-PB.pd(650KB)会议论文 开放获取CC BY-NC-SAApplication Full Text
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Zhong, Jia]'s Articles
[Hu, Xiaoyan]'s Articles
[Zou, Ziming]'s Articles
Baidu academic
Similar articles in Baidu academic
[Zhong, Jia]'s Articles
[Hu, Xiaoyan]'s Articles
[Zou, Ziming]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Zhong, Jia]'s Articles
[Hu, Xiaoyan]'s Articles
[Zou, Ziming]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.