東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Algorithmic Improvements to Sweeping...

Cai, Shengyong.

Linked to FindBook

Google Book

Amazon

博客來

Algorithmic Improvements to Sweeping and Multi-Sweeping Volume Mesh Generation.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Algorithmic Improvements to Sweeping and Multi-Sweeping Volume Mesh Generation./
Author:	Cai, Shengyong.
Description:	232 p.
Notes:	Source: Dissertation Abstracts International, Volume: 76-08(E), Section: B.
Contained By:	Dissertation Abstracts International76-08B(E).
Subject:	Engineering. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3689122
ISBN:	9781321681789

Algorithmic Improvements to Sweeping and Multi-Sweeping Volume Mesh Generation.
Cai, Shengyong.

Algorithmic Improvements to Sweeping and Multi-Sweeping Volume Mesh Generation. - 232 p.

Source: Dissertation Abstracts International, Volume: 76-08(E), Section: B.

Thesis (Ph.D.)--The University of Wisconsin - Madison, 2015.

Due to numerical properties, hexahedral meshes are preferred and widely used for numerical simulations in several engineering domains. One of the most robust and widely used algorithms for all-hexahedral meshes is the sweeping algorithm which can generate the hexahedral meshes by sweeping the surface meshes on the source surfaces to the target surfaces. In addition, sweeping is also useful for generating other swept volume meshes besides hexahedral meshes such as tri-prism for alignment. The sweeping algorithm consists of four main steps: surface mesh generation on the source surfaces, projection of source surface meshes onto the target surfaces, structured mesh generation on the linking surfaces and interior node placement inside volumes. Current state of the art suffers from either low robustness or poor mesh quality: surface mesh mapping between concave or multiply-connected domains with inverted elements, poor interior node placement inside volumes with complicated internal structures, poor imprinting algorithm for multi-sweeping problems and failed corner assignment for vertices with ambiguous angles on the linking surfaces. Therefore, in this work, an improved and robust sweeping tool has been developed, which consists of several things: surface mesh mapping between the s/t surfaces has been developed based on Harmonic Mapping which works for convex, concave and multiply-connected surfaces; interior node placement method inside volumes has been developed based on the Cage-based Morphing which can deal with local deformation from the linking surfaces and relocate interior nodes accordingly; an improved imprinting algorithm for multi-sweeping has been developed where edge patches are imprinted between the source and target surfaces; an optimal corner assignment method on the linking surfaces has been developed based on templates and LP. Finally, the sweepability assessment problems are discussed based on the topological constraints, geometric constraints and some constraints from users' specified matchings. Overall, our improved sweeping algorithm can generate a swept volume mesh with good mesh quality and O(nlogn) time complexity.

ISBN: 9781321681789Subjects--Topical Terms:

586835
Engineering.

Algorithmic Improvements to Sweeping and Multi-Sweeping Volume Mesh Generation.
LDR:03109nmm a2200289 4500 001 2066771
005 20160204121816.5
008 170521s2015 ||||||||||||||||| ||eng d
020 $a 9781321681789
035 $a (MiAaPQ)AAI3689122
035 $a AAI3689122
040 $a MiAaPQ $c MiAaPQ
100 1 $a Cai, Shengyong. $3 3181617
245 1 0 $a Algorithmic Improvements to Sweeping and Multi-Sweeping Volume Mesh Generation.
300 $a 232 p.
500 $a Source: Dissertation Abstracts International, Volume: 76-08(E), Section: B.
500 $a Advisers: James P. Blanchard; Timothy J. Tautges.
502 $a Thesis (Ph.D.)--The University of Wisconsin - Madison, 2015.
520 $a Due to numerical properties, hexahedral meshes are preferred and widely used for numerical simulations in several engineering domains. One of the most robust and widely used algorithms for all-hexahedral meshes is the sweeping algorithm which can generate the hexahedral meshes by sweeping the surface meshes on the source surfaces to the target surfaces. In addition, sweeping is also useful for generating other swept volume meshes besides hexahedral meshes such as tri-prism for alignment. The sweeping algorithm consists of four main steps: surface mesh generation on the source surfaces, projection of source surface meshes onto the target surfaces, structured mesh generation on the linking surfaces and interior node placement inside volumes. Current state of the art suffers from either low robustness or poor mesh quality: surface mesh mapping between concave or multiply-connected domains with inverted elements, poor interior node placement inside volumes with complicated internal structures, poor imprinting algorithm for multi-sweeping problems and failed corner assignment for vertices with ambiguous angles on the linking surfaces. Therefore, in this work, an improved and robust sweeping tool has been developed, which consists of several things: surface mesh mapping between the s/t surfaces has been developed based on Harmonic Mapping which works for convex, concave and multiply-connected surfaces; interior node placement method inside volumes has been developed based on the Cage-based Morphing which can deal with local deformation from the linking surfaces and relocate interior nodes accordingly; an improved imprinting algorithm for multi-sweeping has been developed where edge patches are imprinted between the source and target surfaces; an optimal corner assignment method on the linking surfaces has been developed based on templates and LP. Finally, the sweepability assessment problems are discussed based on the topological constraints, geometric constraints and some constraints from users' specified matchings. Overall, our improved sweeping algorithm can generate a swept volume mesh with good mesh quality and O(nlogn) time complexity.
590 $a School code: 0262.
650 4 $a Engineering. $3 586835
650 4 $a Mechanical engineering. $3 649730
650 4 $a Mechanics. $3 525881
690 $a 0537
690 $a 0548
690 $a 0346
710 2 $a The University of Wisconsin - Madison. $b Engineering Mechanics. $3 3181618
773 0 $t Dissertation Abstracts International $g 76-08B(E).
790 $a 0262
791 $a Ph.D.
792 $a 2015
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3689122