{"title":"有限体积网格中时空窗口的快速提取算法","authors":"Anton Alin-Adrian, V. Cretu","doi":"10.1109/SACI.2011.5873023","DOIUrl":null,"url":null,"abstract":"In our previous work, we introduced a method for reducing the storage requirements of large simulation results[1], [2]. The method usually requires repetitive mesh extraction for 103 − 105 time steps, making it essential that it works as fast as possible. Now we present a fast algorithm for extracting the space-time window from finite volume meshes in order to achieve practical performance. We take advantage of particular geometric properties for our extraction in order to speed-up the process. The results show that our approach is practical and can reduce computational time from days to minutes.","PeriodicalId":334381,"journal":{"name":"2011 6th IEEE International Symposium on Applied Computational Intelligence and Informatics (SACI)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Fast algorithm for the extraction of a space-time window in finite volume meshes\",\"authors\":\"Anton Alin-Adrian, V. Cretu\",\"doi\":\"10.1109/SACI.2011.5873023\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In our previous work, we introduced a method for reducing the storage requirements of large simulation results[1], [2]. The method usually requires repetitive mesh extraction for 103 − 105 time steps, making it essential that it works as fast as possible. Now we present a fast algorithm for extracting the space-time window from finite volume meshes in order to achieve practical performance. We take advantage of particular geometric properties for our extraction in order to speed-up the process. The results show that our approach is practical and can reduce computational time from days to minutes.\",\"PeriodicalId\":334381,\"journal\":{\"name\":\"2011 6th IEEE International Symposium on Applied Computational Intelligence and Informatics (SACI)\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-05-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 6th IEEE International Symposium on Applied Computational Intelligence and Informatics (SACI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SACI.2011.5873023\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 6th IEEE International Symposium on Applied Computational Intelligence and Informatics (SACI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SACI.2011.5873023","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Fast algorithm for the extraction of a space-time window in finite volume meshes
In our previous work, we introduced a method for reducing the storage requirements of large simulation results[1], [2]. The method usually requires repetitive mesh extraction for 103 − 105 time steps, making it essential that it works as fast as possible. Now we present a fast algorithm for extracting the space-time window from finite volume meshes in order to achieve practical performance. We take advantage of particular geometric properties for our extraction in order to speed-up the process. The results show that our approach is practical and can reduce computational time from days to minutes.