| 注册
首页|期刊导航|国防科技大学学报|高效计算网格壁面距离的KD树方法

高效计算网格壁面距离的KD树方法

郭中州 何志强 夏陈超 陈伟芳

国防科技大学学报2017,Vol.39Issue(4):21-25,5.
国防科技大学学报2017,Vol.39Issue(4):21-25,5.DOI:10.11887/j.cn.201704004

高效计算网格壁面距离的KD树方法

KD tree method for efficient wall distance computation of mesh

郭中州 1何志强 1夏陈超 2陈伟芳1

作者信息

  • 1. 浙江大学 航空航天学院,浙江 杭州 310027
  • 2. 上海宇航系统工程研究所,上海 201109
  • 折叠

摘要

Abstract

In some fields of computational fluid dynamics, the nearest distance from a certain point in the flow field to the wall surface is usually required.In order to improve the precision as well as the efficiency of the computation result, the KD tree method was applied to the wall distance computation of unstructured mesh, and then the wall distances of several three dimensional configurations were computed.Results show that the method computing wall distances based on KD tree can achieve the capability of great robustness, high efficiency and precision, and is suitable for complex configuration.Besides, the method has good universality so that it can be applied to many other types of mesh.

关键词

KD树/壁面距离/非结构网格

Key words

KD tree/wall distance/unstructured mesh

分类

航空航天

引用本文复制引用

郭中州,何志强,夏陈超,陈伟芳..高效计算网格壁面距离的KD树方法[J].国防科技大学学报,2017,39(4):21-25,5.

基金项目

国家重点基础研究发展计划资助项目(2014CB340201) (2014CB340201)

国防科技大学学报

OA北大核心CSCDCSTPCD

1001-2486

访问量0
|
下载量0
段落导航相关论文