Bowyer Scheme三維非結構性網格點生成法研究
學年 85
學期 2
出版(發表)日期 1997-03-01
作品名稱 Bowyer Scheme三維非結構性網格點生成法研究
作品名稱(其他語言) The Study of 3 Dimensional Unstructured Grid Generation with Bowyer Scheme
著者 宛同; Wan, Tung; 葉暉; Yip, Fai
單位 淡江大學航空太空工程學系
出版者 臺南市:中國航空太空學會
著錄名稱、卷期、頁數 中國航空太空學會學刊=Transactions of the Aeronautical and Astronautical Society of the Republic of China 29(1),頁55-63
摘要 研究發現,三維空間非結構性格點生成法常遇到如遮蔽、空洞、邊界破壞、區域外格體去除等問題,Advancing Front Algorithm發生空洞格體機會很大,而遮蔽卻大部份發生在Bowyer Algorithm法中。邊界破壞,區域外格體則多數發生在Bowyer Scheme生成法中。 本文嘗試以Bowyer Algorithm建立不同外形。Bowyer Algorithm程序簡單,並擁有加點機制。文章中藉建立四種外形,證明Bowyer Algorithm在三維空間上的可行性,並提出防止遮蔽、空洞,檢查邊界破壞和區域格體去除的方法。由於非結構性網格的資料結構需求很大,作者採用C++程式語言作爲工具,可有效利用電腦資源及便利程序修改。 本文結果證明Bowyer Algorithm能於三維空間中,對任意外形生成網格。其網格可利用於流場計算、射出成形模擬、心臟血管模擬等。 Unstructured grid possess the ability to deal with complex configurations. It has been rapidly developed from the time of 80s and now can be used maturely in solving two dimensional flow field. There are totally four kinds of method: Quadtree Method, Sweepline/Sweeplane Method, Advancing Front Algorithm, and Bowyer Algorithm. While Advancing Front Algorithm is the most widely accepted method, it is believed that all four methods have some drawbacks. In this work, Bowyer Algorithm is chosen for its simplicity and recursive mechanism to develop a general program which generates grid for a number of different configurations successfully. Methods for solving problems of hidden, vacant, boundary breaking and removing invalid volumes, which are located outside of the domain, are discussed.
關鍵字 Bowyer方法;非結構性格點;Bowyer Algorithm;Unstructured Grid
語言 zh_TW
ISSN 1022-0666
期刊性質 國內
收錄於
產學合作
通訊作者
審稿制度
國別 TWN
公開徵稿
出版型式 ,紙本
相關連結

機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/46005 )

機構典藏連結