排序方式: 共有1条查询结果,搜索用时 15 毫秒
1
1.
In our previous work, we have given an algorithm for segmenting a simplex in the n-dimensional space into rt n+ 1 polyhedrons and provided map F which maps the n-dimensional unit cube to these polyhedrons. In this paper, we prove that the map F is a one to one correspondence at least in lower dimensional spaces (n _〈 3). Moreover, we propose the approximating subdivision and the interpolatory subdivision schemes and the estimation of computational complexity for triangular Bézier patches on a 2-dimensional space. Finally, we compare our schemes with Goldman's in computational complexity and speed. 相似文献
1