{"title":"从分散数据点重建b样条曲面","authors":"B. Gregorski, B. Hamann, K. Joy","doi":"10.1109/CGI.2000.852331","DOIUrl":null,"url":null,"abstract":"We present a new approach for reconstructing a smooth surface from a set of scattered points in 3D space. Our algorithm first decomposes a given point set into a quadtree-like data structure known as a strip tree. The strip tree is used to fit a set of least squares quadratic surfaces to the data points. These quadratic surfaces are then degree-elevated to bi-cubic surfaces and blended together to form a set of B-spline surfaces that approximates the given point set.","PeriodicalId":357548,"journal":{"name":"Proceedings Computer Graphics International 2000","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"59","resultStr":"{\"title\":\"Reconstruction of B-spline surfaces from scattered data points\",\"authors\":\"B. Gregorski, B. Hamann, K. Joy\",\"doi\":\"10.1109/CGI.2000.852331\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a new approach for reconstructing a smooth surface from a set of scattered points in 3D space. Our algorithm first decomposes a given point set into a quadtree-like data structure known as a strip tree. The strip tree is used to fit a set of least squares quadratic surfaces to the data points. These quadratic surfaces are then degree-elevated to bi-cubic surfaces and blended together to form a set of B-spline surfaces that approximates the given point set.\",\"PeriodicalId\":357548,\"journal\":{\"name\":\"Proceedings Computer Graphics International 2000\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-06-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"59\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Computer Graphics International 2000\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CGI.2000.852331\",\"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 2000","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CGI.2000.852331","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Reconstruction of B-spline surfaces from scattered data points
We present a new approach for reconstructing a smooth surface from a set of scattered points in 3D space. Our algorithm first decomposes a given point set into a quadtree-like data structure known as a strip tree. The strip tree is used to fit a set of least squares quadratic surfaces to the data points. These quadratic surfaces are then degree-elevated to bi-cubic surfaces and blended together to form a set of B-spline surfaces that approximates the given point set.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
