Volume 31 Issue 03
Mar.  2005
Turn off MathJax
Article Contents
Yu Yang, Liu Erli, Zhou Tietao, et al. Application of algorithm of intersection between lines and random curves in calculating grain size[J]. Journal of Beijing University of Aeronautics and Astronautics, 2005, 31(03): 316-320. (in Chinese)
Citation: Yu Yang, Liu Erli, Zhou Tietao, et al. Application of algorithm of intersection between lines and random curves in calculating grain size[J]. Journal of Beijing University of Aeronautics and Astronautics, 2005, 31(03): 316-320. (in Chinese)

Application of algorithm of intersection between lines and random curves in calculating grain size

  • Received Date: 08 Oct 2003
  • Publish Date: 31 Mar 2005
  • The feasibility of computerization problem of grain size measuration was discussed from the viewpoint of Material Science. The average diameter method was adopted to compute the grain size for an image processed about grain-edge. Based on the Freeman code principle, the differences between the method for seeking the intersection between lines and curves in Euclidean space and that in Pan-Euclidean space were analyzed, and the conception of pseudo-intersection was proposed, the solution for calculating intersection was advanced theoretically. the factors that influence the computation of the intersections between lines and curves were analyzed from the viewpoint of computer graphics, and the corresponding solution in algorithm was provided. The results of calculation are identical with the experimental result finally; the method is approved to be swift and efficient, and can be used in engineering analysis.

     

  • loading
  • [1] 秦国友. 定量金相[M] 成都:四川科学技术出版社,1987 Qin Guoyou. Quantitative metallography[M] Chengdu:Sichuan Science Technology Press,1987(in Chinese) [2] 徐建华. 图像处理与分析[M] 北京:科学出版社,1992 Xu Jianhua. Image process and analysis[M] Beijing:Science Press,1992(in Chinese) [3] Wu Lide. On the Freeman’s conjecture about the chain code of a line . In:Proc of 5th International Joint Conference on Pattern Recognition ,1980 [4] 杜江川,刘鸿健. 基于断码的直线求交[J] 计算机辅助设计与图形学学报, 1995,7(1):25~32 Du Jangchuang, Liu Hongjian. Algorithm for seeking intersection points for digital line based on segment codes[J] Chin J CAD & CG, 1995,7(1):25~32(in Chinese) [5] 邹荣金,蔡士杰,张福炎,等. 字符粘连及字线相交的分割与识别方法 . 软件学报, 1999,10(3):241~247 Zou Rongjin, Cai Shijie, Zhang Fuyan, et al. Segmentation and recognition methods of adhesion and intersection character string with the line[J] Journal of Software, 1999,10(3):241~247(in Chinese) [6] Chen J X, Wang Xusheng, Bresenham J E. The analysis and statistics of line distribution[J] Computer Graphics and Applications IEEE, 2002,22(6):100~107 [7] Bresenham J E. Algorithm for computer control of digital plotter . IBM Syst, 1965,4(1):25~30 [8] 何 斌,马天予,王运坚,等. Visual C+ + 数字图像处理[M] 北京:人民邮电出版社,2001 He Bin, Ma Tianyu, Wang Yunjian, et al. Visual C+ + digital image process[M] Beijing:People’s Posts & Telecommunications Publishing House,2001(in Chinese)
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views(1794) PDF downloads(1645) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return