{"title":"有限元网格的通用Delaunay三角剖分算法","authors":"D.A. Field","doi":"10.1016/0961-3552(91)90031-X","DOIUrl":null,"url":null,"abstract":"<div><p>A mathematical framework for the construction of k dimensional meshes embedded in n dimensions is provided. By extending Delaunay triangulations a generic triangulation algorithm is stated along with methods for assessing the shapes of simplices. Planar, surface and solid meshes illustrate the algorithm.</p></div>","PeriodicalId":100044,"journal":{"name":"Advances in Engineering Software and Workstations","volume":"13 5","pages":"Pages 263-272"},"PeriodicalIF":0.0000,"publicationDate":"1991-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0961-3552(91)90031-X","citationCount":"21","resultStr":"{\"title\":\"A generic Delaunay triangulation algorithm for finite element meshes\",\"authors\":\"D.A. Field\",\"doi\":\"10.1016/0961-3552(91)90031-X\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>A mathematical framework for the construction of k dimensional meshes embedded in n dimensions is provided. By extending Delaunay triangulations a generic triangulation algorithm is stated along with methods for assessing the shapes of simplices. Planar, surface and solid meshes illustrate the algorithm.</p></div>\",\"PeriodicalId\":100044,\"journal\":{\"name\":\"Advances in Engineering Software and Workstations\",\"volume\":\"13 5\",\"pages\":\"Pages 263-272\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/0961-3552(91)90031-X\",\"citationCount\":\"21\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Advances in Engineering Software and Workstations\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/096135529190031X\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Advances in Engineering Software and Workstations","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/096135529190031X","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A generic Delaunay triangulation algorithm for finite element meshes
A mathematical framework for the construction of k dimensional meshes embedded in n dimensions is provided. By extending Delaunay triangulations a generic triangulation algorithm is stated along with methods for assessing the shapes of simplices. Planar, surface and solid meshes illustrate the algorithm.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
