Yuen-Shan Leung, Xiaoning Wang, Ying He, Yong-Jin Liu, Charlie C. L. Wang
{"title":"基于窄带欧氏距离变换的鲁棒且gpu友好的各向同性网格划分","authors":"Yuen-Shan Leung, Xiaoning Wang, Ying He, Yong-Jin Liu, Charlie C. L. Wang","doi":"10.2312/PG.20151273","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a simple-yet-effective method for isotropic meshing via Euclidean distance transformation based Centroidal Voronoi Tessellation (CVT). The proposed approach aims at improving the performance as well as robustness of computing CVT on curved domains while simultaneously maintaining the high-quality of the output meshes. In contrast to the conventional extrinsic methods which compute CVTs in the entire volume bounded by the input model, our idea is to restrict the computation in a 3D shell space with user-controlled thickness. Taking the voxels which contain the surface samples as the sites, we compute the exact Euclidean distance transform on the GPU. Our algorithm is fully parallel and memory-efficient, and it can construct the shell space with resolution up to 20483 at interactive speed. Since the shell space is able to bridge holes and gaps up to a certain tolerance, and tolerate non-manifold edges and degenerate triangles, our algorithm works well on models with such defects, whereas the conventional remeshing methods often fail.","PeriodicalId":88304,"journal":{"name":"Proceedings. Pacific Conference on Computer Graphics and Applications","volume":"56 1","pages":"7-12"},"PeriodicalIF":0.0000,"publicationDate":"2015-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Robust and GPU-friendly Isotropic Meshing Based on Narrow-banded Euclidean Distance Transformation\",\"authors\":\"Yuen-Shan Leung, Xiaoning Wang, Ying He, Yong-Jin Liu, Charlie C. L. Wang\",\"doi\":\"10.2312/PG.20151273\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a simple-yet-effective method for isotropic meshing via Euclidean distance transformation based Centroidal Voronoi Tessellation (CVT). The proposed approach aims at improving the performance as well as robustness of computing CVT on curved domains while simultaneously maintaining the high-quality of the output meshes. In contrast to the conventional extrinsic methods which compute CVTs in the entire volume bounded by the input model, our idea is to restrict the computation in a 3D shell space with user-controlled thickness. Taking the voxels which contain the surface samples as the sites, we compute the exact Euclidean distance transform on the GPU. Our algorithm is fully parallel and memory-efficient, and it can construct the shell space with resolution up to 20483 at interactive speed. Since the shell space is able to bridge holes and gaps up to a certain tolerance, and tolerate non-manifold edges and degenerate triangles, our algorithm works well on models with such defects, whereas the conventional remeshing methods often fail.\",\"PeriodicalId\":88304,\"journal\":{\"name\":\"Proceedings. Pacific Conference on Computer Graphics and Applications\",\"volume\":\"56 1\",\"pages\":\"7-12\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. Pacific Conference on Computer Graphics and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2312/PG.20151273\",\"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. Pacific Conference on Computer Graphics and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2312/PG.20151273","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Robust and GPU-friendly Isotropic Meshing Based on Narrow-banded Euclidean Distance Transformation
In this paper, we propose a simple-yet-effective method for isotropic meshing via Euclidean distance transformation based Centroidal Voronoi Tessellation (CVT). The proposed approach aims at improving the performance as well as robustness of computing CVT on curved domains while simultaneously maintaining the high-quality of the output meshes. In contrast to the conventional extrinsic methods which compute CVTs in the entire volume bounded by the input model, our idea is to restrict the computation in a 3D shell space with user-controlled thickness. Taking the voxels which contain the surface samples as the sites, we compute the exact Euclidean distance transform on the GPU. Our algorithm is fully parallel and memory-efficient, and it can construct the shell space with resolution up to 20483 at interactive speed. Since the shell space is able to bridge holes and gaps up to a certain tolerance, and tolerate non-manifold edges and degenerate triangles, our algorithm works well on models with such defects, whereas the conventional remeshing methods often fail.