【摘要】 <正>In our previous work,we have given an algorithm for segmenting a sim- plex in the n-dimensional space into 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 Gold- man’s in computational complexity and speed.更多还原

【Abstract】 In our previous work,we have given an algorithm for segmenting a sim- plex in the n-dimensional space into 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 Gold- man’s in computational complexity and speed.更多还原