{"title":"关于球体的多面体近似","authors":"David E. Fox, K. Joy","doi":"10.1109/CGI.1998.694296","DOIUrl":null,"url":null,"abstract":"The authors investigate methods by which successive approximations to a sphere can be generated from polyhedra. Each approximation can be obtained by bevel-cutting each edge of the previous approximation with a plane tangent to the sphere. They show that each member of the sequence of polyhedra can be associated with a Voronoi tessellation of the sphere. Under this formulation, the bevel-cutting operation can be defined by the insertion of points into the Voronoi tessellation. The algorithm is defined such that affine combinations of the polyhedra will converge to affine operations of the sphere. The method is useful as a modeling operation and as a level-of-detail representation for a sphere.","PeriodicalId":434370,"journal":{"name":"Proceedings. Computer Graphics International (Cat. No.98EX149)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"On polyhedral approximations to a sphere\",\"authors\":\"David E. Fox, K. Joy\",\"doi\":\"10.1109/CGI.1998.694296\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors investigate methods by which successive approximations to a sphere can be generated from polyhedra. Each approximation can be obtained by bevel-cutting each edge of the previous approximation with a plane tangent to the sphere. They show that each member of the sequence of polyhedra can be associated with a Voronoi tessellation of the sphere. Under this formulation, the bevel-cutting operation can be defined by the insertion of points into the Voronoi tessellation. The algorithm is defined such that affine combinations of the polyhedra will converge to affine operations of the sphere. The method is useful as a modeling operation and as a level-of-detail representation for a sphere.\",\"PeriodicalId\":434370,\"journal\":{\"name\":\"Proceedings. Computer Graphics International (Cat. No.98EX149)\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-06-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. Computer Graphics International (Cat. No.98EX149)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CGI.1998.694296\",\"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. Computer Graphics International (Cat. No.98EX149)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CGI.1998.694296","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The authors investigate methods by which successive approximations to a sphere can be generated from polyhedra. Each approximation can be obtained by bevel-cutting each edge of the previous approximation with a plane tangent to the sphere. They show that each member of the sequence of polyhedra can be associated with a Voronoi tessellation of the sphere. Under this formulation, the bevel-cutting operation can be defined by the insertion of points into the Voronoi tessellation. The algorithm is defined such that affine combinations of the polyhedra will converge to affine operations of the sphere. The method is useful as a modeling operation and as a level-of-detail representation for a sphere.