引用本文:解本怀,王国瑾.参数曲线导矢界估计及在曲线绘制中的应用.软件学报,2003,14(12):2106-2112
【打印本页】   【下载PDF全文】   查看/发表评论  【EndNote】   【RefMan】   【BibTex】
←前一篇|后一篇→ 过刊浏览    高级检索
本文已被:浏览 4070次   下载 6371 本文二维码信息
码上扫一扫!
分享到: 微信 更多
参数曲线导矢界估计及在曲线绘制中的应用
解本怀1, 王国瑾1
浙江大学,计算机图像图形研究所,浙江,杭州,310027
摘要:
对CAGD中常见的多项式曲线和有理多项式曲线的导矢的界提出了新的估计公式.基于这些公式,对参数曲线的逐点绘制法进行了研究,提出了新的插值规则,较好地解决了以往绘制算法中出现的重复绘制问题和不连续性问题.这些结果可以明显地提高曲线造型、求交、逼近、显示和绘制的效率.
关键词:  参数曲线  导矢界的估计  逐点绘制
DOI:
分类号:
基金项目:Supported by the National Natural Science Foundation of China under Grant No.60173034 (国家自然科学基金); the National Grand Fundamental Research 973 Program of China under Grant No.2002CB312101 (国家重点基础研究发展规划(973))
Approximating the Derivative Bounds of Parametric Curves and Applying to Curve Rasterization
XIE Ben-Huai,WANG Guo-Jin
Abstract:
Some new formulae for the derivative bounds of parametric curves, such as the general polynomial curves and rational polynomial curves in CAGD, are presented. Based on these new formulae, the point-by-point algorithm for rasterizing parametric curves is developed in this paper. To solve the problem of repetition and discontinuity arising from the previous algorithms, a new rule of interpolation is given. Without doubt, these results will remarkably improve the efficiency of modeling, intersection, approximation, rendering and rasterizing of curves.
Key words:  parametric CAD  geometric constraint solving  bigraph  DM-decomposition  maximum match