摘要
从离散点列构造一条曲线出发 ,提出了一种可以处理散乱数据点的曲面重构方法 ,其主要思想是逐步逼近 ,即分别用平面三角形和三角 Bézier曲面片逼近 .详细介绍了空间点的三角划分、离散点的参数化、三角 Bézier曲面片逼近以及两曲面片的拼接等算法 ;最后 。
D unorganized sample points are first preprocessed to generate triangular facets within the established tolerance of accuracy. Then the faceted surface is refined by creating triangular Bézier patches over the faceted meshes. The inner vertices of each Bézier patch are optimized to fit the given data points located inside each mesh at a tighter tolerance. Adjacent triangular patches are modified locally to get smooth joining of them along the common boundary. Some experiments are given to illustrate that the proposed approach is feasible and produces good results of surface reconstruction.
出处
《计算机辅助设计与图形学学报》
EI
CSCD
北大核心
2001年第7期622-625,共4页
Journal of Computer-Aided Design & Computer Graphics
基金
"九五"航空软件工程化项目资助