跳到主要內容

臺灣博碩士論文加值系統

(44.200.27.215) 您好!臺灣時間:2024/04/13 18:07
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:郭韋克
研究生(外文):We-Ker Guo
論文名稱:3-D模型重建及有限元素法軟體前處理發展
論文名稱(外文):3-D Model Reconstruction and Pre-Processing Software Development for Finite Element Analysis
指導教授:黃聖杰黃聖杰引用關係
指導教授(外文):Sheng-Jye Hwang
學位類別:碩士
校院名稱:國立成功大學
系所名稱:機械工程學系碩博士班
學門:工程學門
學類:機械工程學類
論文種類:學術論文
論文出版年:2003
畢業學年度:91
語文別:中文
論文頁數:119
中文關鍵詞:狄勞尼網格
外文關鍵詞:delaunayadvancing frontmeshSTEP
相關次數:
  • 被引用被引用:7
  • 點閱點閱:228
  • 評分評分:
  • 下載下載:33
  • 收藏至我的研究室書目清單書目收藏:1
隨著電腦效能不斷的提升,CAD/CAE/CAM軟體的運用也愈加廣泛,愈來愈多的工程師在設計時需要CAE分析與協助,以尋求在應用上所遭遇之問題的解答。然而CAE軟體雖有強大的分析功能,但大部分的CAE軟體前處理的建模功能並不夠強,往往要建構出分析的幾何模型時,必須經過繁雜的步驟,甚至要做過多不必要的簡化。如果我們能借重CAD軟體強大的建模功能來運用,將CAD軟體建構完成的圖檔,匯入CAE軟體中作分析,不僅可將分析模型完整的呈現,更可大大縮短作分析時花在前處理的時間。
本文即針對這個問題,專為處理CAD實體模型重建與模型網格產生的模組,可用來處理網格化的工作。由於模具的外型千變萬化,軟體利用CAD軟體轉出的STEP幾何模型交換檔,將幾何模型重建出來,然後對這些實體進行有限元素網格,即可產生合適的網格元素,如此一來可大幅的降低前處理流程的困難度及提升分析模擬的準確性。
With the rapid development of computer technology, more and more CAD/CAM/CAE tools are used in product design. However, the model construction capability of CAE tools is often not powerful and convenient enough for the construction of complex models. Therefore, the CAD tools are used to construct the solid models of products instead. In this way, the model construction time will be less, and the total analysis time is shorter.
Therefore, this thesis is focusing on the solid model reconstruction and solid mesh generation. For the solid model reconstruction function, the standard data exchange file of geometry model created by CAD tools, STEP, is imported and reconstructed. As to the solid mesh generation, the tetrahedral and hexahedral mesh generation techniques are discussed. The generated solid mesh is more suitable for further computer simulation. With the two functions, the difficulty of pre-processor can be reduced and the efficiency and accuracy of simulation is much improved.
目錄
論文摘要Ⅰ
ABSTRACTⅡ
誌謝Ⅲ
目錄Ⅳ
表目錄Ⅶ
圖目錄Ⅸ
第一章 緒論
1-1.前言1
1-2.研究背景1
1-3.研究目的及方法3
1-4.文獻回顧3
1-5.本文架構12
第二章 CAD系統物件結構
2-1.CAD系統幾何模型結構14
2-2.Solid Model資料結構15
2-3.CAD系統間的資料交換19
2-4.STEP19
2-4.1EXPRESS20
2-4.2Part 4221
2-4.3STEP檔的ASCII格式介紹22
2-4.4STEP檔的各圖元介紹23
第三章 STEP檔案幾何模型重建
3-1.幾何模型重建流程42
3-2.幾何模型資料結構43
3-3.曲線及模型邊界處理45
3-4.曲面的繪製48
3-5.曲面的剪裁51
3-6.幾何模型重建結果與討論69
第四章 有限元素前處理網格化
4-1.有限元素法基本介紹72
4-2.四邊形網格的產生73
4-2.1定義邊界輪廓定義74
4-2.2網格頂部邊界的回復76
4-2.3區域的平滑化處理77
4-2.4縫合邊界78
4-3.四邊形網格的結果與討論80
4-4.四面體網格的產生82
4-4.1表面網格化83
4-4.2四面體網格的流程85
4-4.3四面體網格平滑化89
4-5.四面體網格的結果與討論90
4-6.六面體網格的產生93
4-6.1Mapped Meshing93
4-6.2Sweeping94
4-6.3Hex-Morph94
4-6.4六面體網格的流程95
4-7.六面體網格的結果與討論97
第五章 結論與未來展望
5-1.研究成果與討論100
5-2.未來展望101
參考文獻102
[1]Litke, Nathan, Adi Levin and Peter Schröder, “Trimming for subdivision surfaces,” Computer Aided Geometric Design, Vol.18, No.5, 463-481(2001).
[2]Ravi, G.V.V. Kumar, Prabha Srinivasan, K.G. Shastry and B.G. Prakash, “Geometry based triangulation of multiple trimmed NURBS surfaces,” Computer-aided Design, Vol.33, No.6, 439-454 (2001).
[3]Piegl, Leslie A. and Arnaud M Richard, “Tessellating trimmed nurbs surfaces,” Computer-aided Design, Vol.27, No.1, 16-26(1995).
[4]Piegl, Les A. and Arnaud M. Richard, “Algorithm and data structure for triangulating multiply connected polygonal domains,” Comput. & Graphics, Vol.17, No.5, 563-574(1993).
[5]Piegl, Les A. and Wayne Tiller, “Geometry-based triangulation of trimmed NURBS surfaces,” Computer-aided Design, Vol.30, No.1, 11-18(1998).
[6]Foley, J. D., A. van Dam, S. K. Feiner and J. F. Hughes, “Computer Graphics Principles and Practice,” Addison-Wesley(1990).
[7]Piegl, Les A. and Wayne Tiller, “The NURBS Book,” 2ed edition, Springer-Verlag New York(1997).
[8]Lee, Kunwoo, “Principles of CAD/CAM/CAE System.” Addison Wesley Longman(1999).
[9]Toriya, H. and H. Chiyokura, “3D CAD Principals and Applications,” Springer-Verlag New York(1991).
[10]Folwell, Nathan T. and Scott A. Mitchell, “Reliable Whisker Weaving via Curve Contraction,” 7th International Meshing Roundtable Proceedings, pp.365-378(1998).
[11]Frey, Pascal J., Houman Borouchaki and Paul-Louis George, “Delaunay Tetrahedralization using an Advancing-Front Approach,” 5th International Meshing Roundtable Proceedings, pp.31-46(1996).
[12]Garimella, Rao V. and Mark S. Shephard, “Boundary Layer Meshing for Viscous Flows in Complex Domains,” 7th International Meshing Roundtable Proceedings, pp.107-118(1998).
[13]Khawaja, Aly, Yannis Kallinderis and Harlan McMorris, “Adaptive Hybrid Grids for Diverse Industrial Applications,” 7th International Meshing Roundtable Proceedings, pp.167-184(1998).
[14]Laug, Patrick and Houman Borouchaki, “Molecular Surface Modeling and Meshing,” 10th International Meshing Roundtable Proceedings, pp.31-41(2001).
[15]Li, Xiang-Yang, Shang-Hua Teng and Alper Ungor, “Biting Ellipses to Generate Anisotropic Mesh,” 8th International Meshing Roundtable Proceedings, pp.97-108(1999).
[16]Li, Xiang-Yang, Shang-Hua Teng and Alper Ungor, “Biting Spheres in 3D,” 8th International Meshing Roundtable Proceedings, pp.85-95(1999).
[17]Lohner, Rainald and Juan R. Cebral, “Parallel Advancing Front Grid Generation,” 8th International Meshing Roundtable Proceedings, pp.67-74(1999).
[18]Lohner, Rainald and Juan R. Cebral, “Surface Gridding from Discrete Data,” 4th International Meshing Roundtable Proceedings, pp.29-44(1995).
[19]Miranda, Antonio C. O. and Luiz F. Martha, “Mesh Generation on High-Curvature Surfaces Based on a Background Quadtree Structure,” 11th International Meshing Roundtable Proceedings, pp.333-342(2002).
[20]Marcum, David L. and Adam Gaither, “Unstructured Surface Grid Generation Using Global Mapping and Physical Space Approximation,” 8th International Meshing Roundtable Proceedings, pp.397-406(1999).
[21]Rees and Matthew, “Combining Quadrilateral and Triangular Meshing Using the Advancing Front Approach,” 6th International Meshing Roundtable Proceedings, pp.337-348(1997).
[22]Seveno and Eric, “Towards an adaptive advancing front method,” 6th International Meshing Roundtable Proceedings, pp.349-360(1997).
[23]Thompson, David S. and Bharat K. Soni, “Generation of Quad and Hex Dominant Semistructured Meshes Using An Advancing Layer Scheme,” 8th International Meshing Roundtable Proceedings, pp.171-178(1999).
[24]Thompson, David S., Satish Chalasani and Bharat K. Soni, “Generation of Volume Meshes by Extrusion from Surface Meshes of Arbitrary Topology,” 9th International Meshing Roundtable Proceedings, pp.385-393(2000).
[25]Tristano, Joseph R., Steven J. Owen, and Scott A. Canann, “Advancing Front Surface Mesh Generation in Parametric Space Using a Riemannian Surface Definition,” 7th International Meshing Roundtable Proceedings, pp.429-445(1998).
[26]Yamakawa, Soji and Kenji Shimada, “High Quality Anisotropic Tetrahedral Mesh Generation Via Ellipsoidal Bubble Packing,” 9th International Meshing Roundtable Proceedings, pp.263-273(2000).
[27]Fang, Tsung-Pao and Les A. Piegl, “Delaunay triangulation using a uniform grid,” IEEE Computer Graphics & Applications, Vol.13, No.3, 36-47(1993).
[28]Cignoni, P., C. Montani and R. Scopigno, “DeWall: A fast divide and conquer Delaunay triangulation algorithm in Ed,” Computer-aided Design, Vol.30, No.5, 333-341(1998).
[29]Weatherill, N. P. and O. Hassan, “Efficient three-dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints,” International Journal for Numerical Methods in Engineering, Vol.37, 2005-2039(1994).
[30]Kondo, Koichi, “Three-dimensional finite element meshing by incremental node insertion,” International Journal for Numerical Methods in Engineering, Vol.39, 3519-3534(1996).
[31]George, P. L. and F. Hermeline, “Delaunay’s mesh of a convex polyhedron in dimension d. application to arbitrary polyhedra,” International Journal for Numerical Methods in Engineering, Vol.33, 975-995(1992).
[32]Zheng, Yao, Roland W. Lewis and David T. Gethin, “Three- dimensional unstructured mesh generation: Part 1. Fundamental aspects of triangulation and point creation,” Computer Methods in Applied Mechanics and Engineering, Vol.134, 249-268(1996).
[33]Zheng, Yao, Roland W. Lewis and David T. Gethin, “Three- dimensional unstructured mesh generation: Part 2. Surface meshes,” Computer Methods in Applied Mechanics and Engineering, Vol.134, 269-284(1996).
[34]Zheng, Yao, Roland W. Lewis and David T. Gethin, “Three- dimensional unstructured mesh generation: Part 3. Volume meshes,” Computer Methods in Applied Mechanics and Engineering, Vol.134, 285-310(1996).
[35]Borouchaki, H., F. Hecht, E. Saltel and P. L. George, “Reasonably Efficient Delaunay Based Mesh Generator in 3 Dimensions,” 4th International Meshing Roundtable Proceedings, pp.3-14(1995).
[36]Chen, Hao and Jonathan Bishop, “Delaunay Triangulation for Curved Surfaces,” 6th International Meshing Roundtable Proceedings, pp.115-127(1997).
[37]Edelsbrunner, Herbert and Damrong Guoy, “An Experimental Study of Sliver Exudation,” 10th International Meshing Roundtable Proceedings, pp.307-316(2001).
[38]Fuchs and Alexander, “Automatic Grid Generation with Almost regular Delaunay Tetrahedra,” 7th International Meshing Roundtable Proceedings, pp.133-148(1998).
[39]Galtier, Jerome and Paul Louis George, “Prepartitioning as a way to mesh subdomains in parallel,” 5th International Meshing Roundtable Proceedings, pp.107-122(1996).
[40]George and Paul Louis, “Tet Meshing: Construction, Optimization, And Adaptation,” 8th International Meshing Roundtable Proceedings, pp.133-141(1999).
[41]Krysl, Petr and Michael Ortiz, “Generation of Tetrahedral Finite Element Meshes: Variational Delaunay Approach,” 7th International Meshing Roundtable Proceedings, pp.273-284(1998).
[42]Li, Xiang-Yang, “Spacing Control and Sliver-free Delaunay Mesh,” 9th International Meshing Roundtable Proceedings, pp.295-306(2000).
[43]Li, Xiang-Yang, Shang-Hua Teng and Alper Ungor, “Simultaneous Refinement and Coarsening Adaptive Meshing with Moving Boundaries,” 7th International Meshing Roundtable Proceedings, pp.201-210(1998).
[44]Liu, Anwei and Mazen Baida, “How far flipping can go towards 3D conforming/constrained triangulation,” 9th International Meshing Roundtable Proceedings, pp.307-315(2000).
[45]Mello, Ulisses T. and Paulo Roma Cavalcanti, “A Point Creation Strategy for Mesh Generation Using Crystal Lattices as Templates,” 9th International Meshing Roundtable Proceedings, pp.253-261(2000).
[46]Miller, Gary L., Dafna Talmor, Shang-Hua Teng, Noel Walkington and Han Wang, “Control Volume Meshes using Sphere Packing: Generation, Refinement and Coarsening,” 5th International Meshing Roundtable Proceedings, pp.47-62(1996).
[47]Miller, Gary L., Steven E. Pav and Noel J. Walkington, “Fully Incremental 3D Delaunay Refinement Mesh Generation,” 11th International Meshing Roundtable Proceedings, pp.75-86(2002).
[48]Murphy, Michael, Carl W. Gable, “Strategies for Nonobtuse Boundary Delaunay Triangulations,” 7th International Meshing Roundtable Proceedings, pp.309-320(1998).
[49]Pebay, Philippe P. and Pascal J. Frey, “A-priori Delaunay-conformity,” 7th International Meshing Roundtable Proceedings, pp.321-333(1998).
[50]Rivara, Maria-Cecilia and Nancy Hitschfeld, “LEPP-Delaunay algorithm: a robust tool for producing size-optimal quality triangulations,” 8th International Meshing Roundtable Proceedings, pp.205-220(1999).
[51]Rivara, Maria-Cecilia and Patricio Inostroza, “A Discussion on Mixed (Longest-Side Midpoint Insertion) Delaunay Techniques for the Triangulation Refinement Problem,” 4th International Meshing Roundtable Proceedings, pp.335-346(1995).
[52]Shewchuk, Jonathan Richard, “Constrained Delaunay Tetrahedralizations and Provably Good Boundary Recovery,” 11th International Meshing Roundtable Proceedings, pp.193-204(2002).
[53]Shimada, Kenji, Jia-Huei Liao and Takayuki Itoh, “Quadrilateral Meshing with Directionality Control through the Packing of Square Cells,” 7th International Meshing Roundtable Proceedings, pp.61-76(1998).
[54]Simpson, Bruce R., “Isolating Geometry in Mesh Programming,” 8th International Meshing Roundtable Proceedings, pp.45-54(1999).
[55]Spielman, Daniel A., Shang-Hua Teng, Alper Ungor, “Parallel Delaunay Refinement:Algorithms And Analyses,” 11th International Meshing Roundtable Proceedings, pp.205-218(2002).
[56]Owen, Steven J., Matthew L. Staten, Scott A. Canann, and Sunil Saigal, “Advancing Front Quadrilateral Meshing Using Triangle Transformations,” 7th International Meshing Roundtable Proceedings, pp.409-428(1998).
[57]Owen, Steve J, “Constrained Triangulation: Application to Hex-Dominant Mesh Generation,” 8th International Meshing Roundtable Proceedings, pp.31-41(1999).
[58]Lo, S. H., “Generating quadrilateral elements on plane and over curved surface,” Comput. Struct., Vol.31, 421-426(1989).
[59]Lee, C. K. and Lo, S. H., “A new scheme for the generation of a graded quadrilateral mesh,”Comput. Struct., Vol.52, 847-857(1994).
[60]Blacker T.D., M.B. Stephenson and S. Canann, “Analysis automation with paving: A new quadrilateral meshing technique,” Advances in Engineering Software, Elsevier, Vol.56, 332-337(1991).
[61]Blacker T.D., “Paving: A New Approach To Automated Quadrilateral Mesh Generation,” International Journal For Numerical Methods in Engineering, John Wiley, Num 32, 811-847(1991).
[62]Lober, Randy R., Timothy J. Tautges and Rich A. Cairncross, “The Parallelization of an Advancing-Front, All-Quadrilateral Meshing Algorithm for Adaptive Analysis,” 4th International Meshing Roundtable Proceedings, pp.59-70(1995).
[63]White, David R. and Paul Kinney, “Redesign of the Paving Algorithm: Robustness Enhancements through Element by Element Meshing,” 6th International Meshing Roundtable Proceedings, pp.323-335(1997).
[64]Mark A.Yerry and Mark S. Shephard, “Three-Dimensional Mesh Generation by Modified Octree Technique,” International Journal for Numerical Methods in Engineering, 20, 1965-1990(1984).
[65]Mark S. Shephard and Marcel K. Georges, “Three-Dimensional Mesh Generation by Finite Octree Technique,” International Journal for Numerical Methods in Engineering, 32, 709-749(1991).
[66]Frey, Pascal J. and Loic Marechal, “Fast Adaptive Quadtree Mesh Generation,” 7th International Meshing Roundtable Proceedings, pp.211-224(1998).
[67]Owen, Steven J., “A Survey of Unstructured Mesh Generation Technology,” 7th International Meshing Roundtable Proceedings, pp.239-267(1998).
[68]Perucchio, Renato, Makul Saxena and Ajay Kela, “Automatic Mesh Generation From Solid Models Based On Recursive Spatial Decompositions,” International Journal For Numerical Methods In Engineering, John Wiley, Num 28,, pp.2469-2501(1989).
[69]Robert Schneiders, “An Algorithm for the Generation of Hexahedral Element Meshes based on an Octree Technique,” 6th International Meshing Roundtable Proceedings, pp.183-194(1997).
[70]Wake, Dan, Kias Lilja and Victor Moroz, “A Hybrid Mesh Generation Method for Two and Three Dimensional Simulation of Semiconductor Processes and Devices,” 7th International Meshing Roundtable Proceedings, pp.159-166(1998).
[71]Yerry, Mark A. and Mark S. Shephard, “Automatic Three-Dimensional Mesh Generation By The Modified Octree Technique,” International Journal For Numerical Methods in Engineering, John Wiley, Num 20, pp.1965-1990(1984).
[72]Yerry, Mark A. and Mark S. Shephard, “Trends in Engineering Software and Hardware: Automatic Mesh Generation for Three-Dimensional Solids,” Computers and Structures, Pergammon, Vol. 20, Num 1, pp.31-39(1985).
[73]Armstrong, C.G., D.J. Robinson , R.M. McKeag, T.S. Li, S.J. Bridgett, R.J. Donaghy and C.A. McGleenan, “Medials for Meshing and More,” 4th International Meshing Roundtable Proceedings, pp.277-288(1995).
[74]Liu, Shang-Sheng and Rajit Gadh, “Automatic Hexahedral Mesh Generation by Recursive Convex and Swept Volume Decomposition,” 6th International Meshing Roundtable Proceedings, pp.217-231(1997).
[75]Blacker, Ted, “The Cooper Tool,” 5th International Meshing Roundtable Proceedings, pp.13-30(1996).
[76]Borden, Michael, Steven Benzley, Scott A. Mitchell, David R. White and Ray Meyers, “The Cleave and Fill Tool: An All-Hexahedral Refinement Algorithm for Swept Meshes,” 9th International Meshing Roundtable Proceedings, pp.69-76(2000).
[77]Jankovich, Steven R., Steven E. Benzley, Jason F. Shepherd and Scott A. Mitchell, “The Graft Tool: An All-Hexahedral Transition Algorithm for Creating a Multi-Directional Swept Volume Mesh,” 8th International Meshing Roundtable Proceedings, pp.387-392(1999).
[78]Knupp, Patrick M., “Next-Generation Sweep Tool: A Method For Generating All-Hex Meshes On Two-And-One-Half Dimensional Geomtries,” 7th International Meshing Roundtable Proceedings, pp.505-513(1998).
[79]Mingwu, Lai, Steven E. Benzley, Greg Sjaardema and Tim Tautges, “A Multiple Source and Target Sweeping Method for Generating All-Hexahedral Finite Element Meshes,” 5th International Meshing Roundtable Proceedings, pp.217-228(1996).
[80]Miyoshi, Katsuhiro and Ted Blacker, “Hexahedral Mesh Generation Using Multi-Axis Cooper Algorithm,” 9th International Meshing Roundtable Proceedings, pp.89-97(2000).
[81]Shepherd, Jason, Scott A. Mitchell, Patrick Knupp, and David White, “Methods for Multisweep Automation,” 9th International Meshing Roundtable Proceedings, pp.77-87(2000).
[82]Shih, Bih-Yaw and Hiroshi Sakurai, “Automated Hexahedral Mesh Generation by Swept Volume Decomposition and Recomposition,” 5th International Meshing Roundtable Proceedings, pp.273-280(1996).
[83]Staten, Matthew L., Scott A. Canann, and Steve J. Owen, “BMSWEEP: Locating Interior Nodes During Sweeping,” 7th International Meshing Roundtable Proceedings, pp.7-18(1998).
[84]White, David R., Lai Mingwu, Steven E. Benzley, and Gregory D. Sjaardema, “Automated Hexahedral Mesh Generation by Virtual Decomposition,” 4th International Meshing Roundtable Proceedings, pp.165-176(1995).
連結至畢業學校之論文網頁點我開啟連結
註: 此連結為研究生畢業學校所提供,不一定有電子全文可供下載,若連結有誤,請點選上方之〝勘誤回報〞功能,我們會盡快修正,謝謝!
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top