{"title":"三维数字物体表面积估算中相对凸壳的近似计算","authors":"Linjiang Yu, R. Klette","doi":"10.1109/ICPR.2002.10013","DOIUrl":null,"url":null,"abstract":"Relative convex hulls have been suggested for multigrid-convergent surface area estimation. Besides the existence of a convergence theorem there is no efficient algorithmic solution so far for calculating relative convex hulls. This article discusses an approximative solution based on minimum-length polygon calculations. It is illustrated that this approximative calculation also proves (experimentally) to provide a multigrid convergent measurement. 1 Center for Image Technology and Robotics Tamaki Campus, The University of Auckland, Auckland, New Zealand. lyu011@ec.auckland.ac.nz and r.klette@auckland.ac.nz You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the CITR Tamaki web site under terms that include this permission. All other rights are reserved by the author(s). An Approximative Calculation of Relative Convex Hulls for Surface Area Estimation Linjiang Yu and Reinhard Klette","PeriodicalId":74516,"journal":{"name":"Proceedings of the ... IAPR International Conference on Pattern Recognition. International Conference on Pattern Recognition","volume":"27 1","pages":"131-134"},"PeriodicalIF":0.0000,"publicationDate":"2002-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"An Approximative Calculation of Relative Convex Hulls for Surface Area Estimation of 3D Digital Objects\",\"authors\":\"Linjiang Yu, R. Klette\",\"doi\":\"10.1109/ICPR.2002.10013\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Relative convex hulls have been suggested for multigrid-convergent surface area estimation. Besides the existence of a convergence theorem there is no efficient algorithmic solution so far for calculating relative convex hulls. This article discusses an approximative solution based on minimum-length polygon calculations. It is illustrated that this approximative calculation also proves (experimentally) to provide a multigrid convergent measurement. 1 Center for Image Technology and Robotics Tamaki Campus, The University of Auckland, Auckland, New Zealand. lyu011@ec.auckland.ac.nz and r.klette@auckland.ac.nz You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the CITR Tamaki web site under terms that include this permission. All other rights are reserved by the author(s). An Approximative Calculation of Relative Convex Hulls for Surface Area Estimation Linjiang Yu and Reinhard Klette\",\"PeriodicalId\":74516,\"journal\":{\"name\":\"Proceedings of the ... IAPR International Conference on Pattern Recognition. International Conference on Pattern Recognition\",\"volume\":\"27 1\",\"pages\":\"131-134\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-08-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the ... IAPR International Conference on Pattern Recognition. International Conference on Pattern Recognition\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPR.2002.10013\",\"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 of the ... IAPR International Conference on Pattern Recognition. International Conference on Pattern Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPR.2002.10013","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An Approximative Calculation of Relative Convex Hulls for Surface Area Estimation of 3D Digital Objects
Relative convex hulls have been suggested for multigrid-convergent surface area estimation. Besides the existence of a convergence theorem there is no efficient algorithmic solution so far for calculating relative convex hulls. This article discusses an approximative solution based on minimum-length polygon calculations. It is illustrated that this approximative calculation also proves (experimentally) to provide a multigrid convergent measurement. 1 Center for Image Technology and Robotics Tamaki Campus, The University of Auckland, Auckland, New Zealand. lyu011@ec.auckland.ac.nz and r.klette@auckland.ac.nz You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the CITR Tamaki web site under terms that include this permission. All other rights are reserved by the author(s). An Approximative Calculation of Relative Convex Hulls for Surface Area Estimation Linjiang Yu and Reinhard Klette