Computational Technology Resources - CCP

F. Neugebauer and R. Diekmann

University of Paderborn, Paderborn, Germany

doi:10.4203/ccp.45.2.2

F. Neugebauer, R. Diekmann, "Improved Mesh Generation: Not Simple But Good", in B.H.V. Topping, (Editor), "Advances in Computational Mechanics for Parallel and Distributed Processing", Civil-Comp Press, Edinburgh, UK, pp 25-35, 1997. doi:10.4203/ccp.45.2.2

Abstract

An improved algorithm for two-dimensional triangular mesh generation in arbitrary polygonally bounded domains with holes and isolated interior points is presented. The algorithm is quad-tree based and follows the ideas of Bern, Eppstein and Gilbert. Using a rhomboid structure of the quad-tree and a number of new ideas for warping and centering points and for shifting grids, we are able to generate meshes with provably good angle bounds between 30° and 90° (except probably smaller angles of the polygonal boundary given as input).

purchase the full-text of this paper (price £20)

go to the previous paper
go to the next paper
return to the table of contents
return to the book description
purchase this book (price £66 +P&P)

	Computational & Technology Resources an online resource for computational, engineering & technology publications
	not logged in - login
Front Page Browse CCP CSETS CTR IJRT Other Authors Search Purchase Guide FAQ Contact us	Civil-Comp Proceedings ISSN 1759-3433 CCP: 45 ADVANCES IN COMPUTATIONAL MECHANICS FOR PARALLEL AND DISTRIBUTED PROCESSING Edited by: B.H.V. Topping Paper II.2 Improved Mesh Generation: Not Simple But Good F. Neugebauer and R. Diekmann University of Paderborn, Paderborn, Germany doi:10.4203/ccp.45.2.2 purchase the full-text of this paper Full Bibliographic Reference for this paper F. Neugebauer, R. Diekmann, "Improved Mesh Generation: Not Simple But Good", in B.H.V. Topping, (Editor), "Advances in Computational Mechanics for Parallel and Distributed Processing", Civil-Comp Press, Edinburgh, UK, pp 25-35, 1997. doi:10.4203/ccp.45.2.2 Abstract An improved algorithm for two-dimensional triangular mesh generation in arbitrary polygonally bounded domains with holes and isolated interior points is presented. The algorithm is quad-tree based and follows the ideas of Bern, Eppstein and Gilbert. Using a rhomboid structure of the quad-tree and a number of new ideas for warping and centering points and for shifting grids, we are able to generate meshes with provably good angle bounds between 30° and 90° (except probably smaller angles of the polygonal boundary given as input). purchase the full-text of this paper (price £20) go to the previous paper go to the next paper return to the table of contents return to the book description purchase this book (price £66 +P&P)
Back to top	©Civil-Comp Limited 2023 - terms & conditions