{"title":"克雷X-MP三维德劳内三角剖分","authors":"D. A. Field, K. Yarnall","doi":"10.1109/SUPERC.1988.74146","DOIUrl":null,"url":null,"abstract":"A software package for generation of tetrahedral finite-element mesh, whose kernel is a robust three-dimensional Delaunay triangulation algorithm, was ported to a CRAY X-MP for vector processing. The total execution time for the critical subroutines of the kernel decreased by a factor of six over scalar mode on the CRAY X-MP. The kernel is characterized by simple data structures and O(N/sup 2/) arithmetic operation counts, N being the number of finite-element nodes. Although the kernel is essentially a sequential algorithm, its simple data structures allow for key uses of vector processing and for streamlining sequential processing.<<ETX>>","PeriodicalId":103561,"journal":{"name":"Proceedings Supercomputing Vol.II: Science and Applications","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Three dimensional Delaunay triangulation on a Cray X-MP\",\"authors\":\"D. A. Field, K. Yarnall\",\"doi\":\"10.1109/SUPERC.1988.74146\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A software package for generation of tetrahedral finite-element mesh, whose kernel is a robust three-dimensional Delaunay triangulation algorithm, was ported to a CRAY X-MP for vector processing. The total execution time for the critical subroutines of the kernel decreased by a factor of six over scalar mode on the CRAY X-MP. The kernel is characterized by simple data structures and O(N/sup 2/) arithmetic operation counts, N being the number of finite-element nodes. Although the kernel is essentially a sequential algorithm, its simple data structures allow for key uses of vector processing and for streamlining sequential processing.<<ETX>>\",\"PeriodicalId\":103561,\"journal\":{\"name\":\"Proceedings Supercomputing Vol.II: Science and Applications\",\"volume\":\"59 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-11-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Supercomputing Vol.II: Science and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SUPERC.1988.74146\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Supercomputing Vol.II: Science and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SUPERC.1988.74146","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Three dimensional Delaunay triangulation on a Cray X-MP
A software package for generation of tetrahedral finite-element mesh, whose kernel is a robust three-dimensional Delaunay triangulation algorithm, was ported to a CRAY X-MP for vector processing. The total execution time for the critical subroutines of the kernel decreased by a factor of six over scalar mode on the CRAY X-MP. The kernel is characterized by simple data structures and O(N/sup 2/) arithmetic operation counts, N being the number of finite-element nodes. Although the kernel is essentially a sequential algorithm, its simple data structures allow for key uses of vector processing and for streamlining sequential processing.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
