English  |  正體中文  |  简体中文  |  Items with full text/Total items : 73032/73032 (100%)
Visitors : 23242233      Online Users : 531
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version

    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/7793

    Title: 遞迴網格生成法;Recursive Grid Generation Methods
    Authors: 劉文正;Weng-Zing Liu
    Contributors: 數學研究所
    Keywords: 網格生成;遞迴;尤拉公式;內點插入;權函數;分割線;物件導向;非結構性網格生成法;Recursive;grid generation;Euler's formula;object-oriented;weight function;unstructured grid generation
    Date: 2002-06-05
    Issue Date: 2009-09-22 11:05:34 (UTC+8)
    Publisher: 國立中央大學圖書館
    Abstract: 本論文是研究如何用物件導向設計遞迴方法來產生三角網格,其目的是要建立一套遞迴式網格生成法。應用以C++撰寫的網格生成物件,在寫程式時只需專注於遞迴生成法即可,由此可看出C++物件導向語言及其標準程式庫STL所寫的程式可適應性、可擴充性和簡便等強大的弁? 在現有的三角網格程式的架構下擴充一個生成網格的子弁?因為是以物件導向方式撰寫程式,所以除了遞迴生成法要正確快速外,更要注意複雜多層繼承物件對程式效率所造成的影響。 In the dissertation, an object-oriented recursion scheme is developed to generate a triangular mesh on a two-dimensional domain. We emphasize to develop object-oriented programming strategy to generate triangular mesh recursively. By using the C++ programming language and its powerful standard template library(STL), we are able to generate the triangular grid rather easily. In this dissertation , we also develop a scheme so as to generate the grid with prescribed cell numbers. A numerical result is shown to demonstrate our arguments.
    Appears in Collections:[數學研究所] 博碩士論文

    Files in This Item:

    File SizeFormat

    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback  - 隱私權政策聲明