首页> 外文会议>Eleventh International Conference on Geometry and Graphics >AN APPROXIMATING SUBDIVISION SCHEME BY CUTTING AND UPHEAVING THE CORNER OF CONTROL POLYGON
【24h】

AN APPROXIMATING SUBDIVISION SCHEME BY CUTTING AND UPHEAVING THE CORNER OF CONTROL POLYGON

机译:通过剪切和提升控制多边形的拐角来近似划分方案

获取原文
获取原文并翻译 | 示例

摘要

In this paper, we aim at generating a stationary subdivision algorithm over arbitrary topology networks by either cutting or upheaving the corner of control polygon in order to approximate the control nets. We consider of the two basic curve subdivision schemes: Chaikin algorithm and 4-point interpolatory algorithm. We combine these two schemes together and propose a new curve and surface subdivision scheme. So the curves and surfaces generated by our proposed algorithm are more approximating the control polygon model than those generated only by Chaikin algorithm. And the speed of shrinkage of our scheme is also faster than the one of 4-point scheme. The limit curve or surface is C1 continuous and the refinement process is simple and effective.
机译:在本文中,我们旨在通过切割或上移控制多边形的角来生成任意拓扑网络上的固定细分算法,以近似控制网络。我们考虑两种基本的曲线细分方案:Chaikin算法和4点插值算法。我们将这两种方案结合在一起,并提出了一种新的曲线和曲面细分方案。因此,与仅由Chaikin算法生成的曲线和曲面相比,我们提出的算法生成的曲线和曲面更接近控制多边形模型。而且我们方案的收缩速度也快于四点方案之一。极限曲线或曲面是C1连续的,细化过程简单有效。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号