E. Ovreiu, Alina Sultana, Juan Gabriel Riveros, L. Florez-Valencia
{"title":"使用自适应细分的三角网格简化","authors":"E. Ovreiu, Alina Sultana, Juan Gabriel Riveros, L. Florez-Valencia","doi":"10.1109/ISSCS.2013.6651257","DOIUrl":null,"url":null,"abstract":"In this paper we present a triangular mesh simplification algorithm which produces accurate approximations of the original models. The simplification is realized using iterative edge contractions. The accuracy is obtained using a symmetric error metric and generating sample points over the simplified mesh. The sample points are generated using iterative 1 : 4 subdivisions of each triangle. The number of subdivisions for each triangle depends on the area of the triangle.","PeriodicalId":260263,"journal":{"name":"International Symposium on Signals, Circuits and Systems ISSCS2013","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Triangular mesh simplification using an adaptive subdivision\",\"authors\":\"E. Ovreiu, Alina Sultana, Juan Gabriel Riveros, L. Florez-Valencia\",\"doi\":\"10.1109/ISSCS.2013.6651257\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we present a triangular mesh simplification algorithm which produces accurate approximations of the original models. The simplification is realized using iterative edge contractions. The accuracy is obtained using a symmetric error metric and generating sample points over the simplified mesh. The sample points are generated using iterative 1 : 4 subdivisions of each triangle. The number of subdivisions for each triangle depends on the area of the triangle.\",\"PeriodicalId\":260263,\"journal\":{\"name\":\"International Symposium on Signals, Circuits and Systems ISSCS2013\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-07-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Symposium on Signals, Circuits and Systems ISSCS2013\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISSCS.2013.6651257\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium on Signals, Circuits and Systems ISSCS2013","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSCS.2013.6651257","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Triangular mesh simplification using an adaptive subdivision
In this paper we present a triangular mesh simplification algorithm which produces accurate approximations of the original models. The simplification is realized using iterative edge contractions. The accuracy is obtained using a symmetric error metric and generating sample points over the simplified mesh. The sample points are generated using iterative 1 : 4 subdivisions of each triangle. The number of subdivisions for each triangle depends on the area of the triangle.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
