{"title":"Model simplification using vertex-clustering","authors":"Kok-Lim Low, T. Tan","doi":"10.1145/253284.253310","DOIUrl":null,"url":null,"abstract":"This paper presents a practical technique to automaticallycompute approximations of polygonal representations of3D objects. It is based on a previously developed modelsimplification technique which applies vertex-clustering.Major advantages of the vertex-clustering technique are itslow computational cost and high data reduction rate, andthus suitable for use in interactive applications. This paperadvances the technique with careful consideration ofapproximation quality and smoothness in transitionsbetween different levels of simplification, whilemaintaining its efficiency and efb%iveness. Its majorcontributions include: accuracy in grading vertices forindication of their visual importance, robustness inclustering for better preservation of important fimtures andconsistencies between levels of simplification, thick-lineswith dynamic normals to maximize visual fidelity, andexploitation of object and image space relationship forlevels-of-simplificationdetermination.","PeriodicalId":308950,"journal":{"name":"Proceedings of the 1997 symposium on Interactive 3D graphics","volume":"123 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"241","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 1997 symposium on Interactive 3D graphics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/253284.253310","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 241
Abstract
This paper presents a practical technique to automaticallycompute approximations of polygonal representations of3D objects. It is based on a previously developed modelsimplification technique which applies vertex-clustering.Major advantages of the vertex-clustering technique are itslow computational cost and high data reduction rate, andthus suitable for use in interactive applications. This paperadvances the technique with careful consideration ofapproximation quality and smoothness in transitionsbetween different levels of simplification, whilemaintaining its efficiency and efb%iveness. Its majorcontributions include: accuracy in grading vertices forindication of their visual importance, robustness inclustering for better preservation of important fimtures andconsistencies between levels of simplification, thick-lineswith dynamic normals to maximize visual fidelity, andexploitation of object and image space relationship forlevels-of-simplificationdetermination.