{"title":"使用二次误差度量简化带有颜色和纹理的表面","authors":"Michael Garland, Paul S. Heckbert","doi":"10.1109/VISUAL.1998.745312","DOIUrl":null,"url":null,"abstract":"There are a variety of application areas in which there is a need for simplifying complex polygonal surface models. These models often have material properties such as colors, textures, and surface normals. Our surface simplification algorithm, based on iterative edge contraction and quadric error metrics, can rapidly produce high quality approximations of such models. We present a natural extension of our original error metric that can account for a wide range of vertex attributes.","PeriodicalId":399113,"journal":{"name":"Proceedings Visualization '98 (Cat. No.98CB36276)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"575","resultStr":"{\"title\":\"Simplifying surfaces with color and texture using quadric error metrics\",\"authors\":\"Michael Garland, Paul S. Heckbert\",\"doi\":\"10.1109/VISUAL.1998.745312\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"There are a variety of application areas in which there is a need for simplifying complex polygonal surface models. These models often have material properties such as colors, textures, and surface normals. Our surface simplification algorithm, based on iterative edge contraction and quadric error metrics, can rapidly produce high quality approximations of such models. We present a natural extension of our original error metric that can account for a wide range of vertex attributes.\",\"PeriodicalId\":399113,\"journal\":{\"name\":\"Proceedings Visualization '98 (Cat. No.98CB36276)\",\"volume\":\"79 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-10-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"575\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Visualization '98 (Cat. No.98CB36276)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/VISUAL.1998.745312\",\"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 Visualization '98 (Cat. No.98CB36276)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VISUAL.1998.745312","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Simplifying surfaces with color and texture using quadric error metrics
There are a variety of application areas in which there is a need for simplifying complex polygonal surface models. These models often have material properties such as colors, textures, and surface normals. Our surface simplification algorithm, based on iterative edge contraction and quadric error metrics, can rapidly produce high quality approximations of such models. We present a natural extension of our original error metric that can account for a wide range of vertex attributes.