{"title":"隐式曲面建模的增量技术","authors":"Eric Galin, S. Akkouche","doi":"10.1109/CGI.1998.694282","DOIUrl":null,"url":null,"abstract":"The paper describes an incremental polygonization technique for implicit surfaces built from skeletal elements. The method lends itself as an interactive modeling system as the mesh is updated locally in regions of space where changes in the potential field occurred. The authors rely on an octree decomposition of space combined with Lipschitz conditions to recursively subdivide cells until a given level of precision is reached. Timings show that the incremental algorithm dramatically speeds up the overall polygonization process for complex objects.","PeriodicalId":434370,"journal":{"name":"Proceedings. Computer Graphics International (Cat. No.98EX149)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Incremental techniques for implicit surface modeling\",\"authors\":\"Eric Galin, S. Akkouche\",\"doi\":\"10.1109/CGI.1998.694282\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper describes an incremental polygonization technique for implicit surfaces built from skeletal elements. The method lends itself as an interactive modeling system as the mesh is updated locally in regions of space where changes in the potential field occurred. The authors rely on an octree decomposition of space combined with Lipschitz conditions to recursively subdivide cells until a given level of precision is reached. Timings show that the incremental algorithm dramatically speeds up the overall polygonization process for complex objects.\",\"PeriodicalId\":434370,\"journal\":{\"name\":\"Proceedings. Computer Graphics International (Cat. No.98EX149)\",\"volume\":\"1 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.694282\",\"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.694282","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Incremental techniques for implicit surface modeling
The paper describes an incremental polygonization technique for implicit surfaces built from skeletal elements. The method lends itself as an interactive modeling system as the mesh is updated locally in regions of space where changes in the potential field occurred. The authors rely on an octree decomposition of space combined with Lipschitz conditions to recursively subdivide cells until a given level of precision is reached. Timings show that the incremental algorithm dramatically speeds up the overall polygonization process for complex objects.