| 基于坐标变换的曲线曲面求交算法 | |
| 陈晓霞 ; 雍俊海 ; 陈玉健 ; 刘辉 ; CHEN Xiao-xia ; YONG Jun-hai ; CHEN Yu-jian ; LIU Hui | |
| 2010-06-09 ; 2010-06-09 | |
| 关键词 | 曲线曲面求交 坐标变换 拉格朗日乘子法 最小距离 curve and surface intersection coordinate transformation Lagrange multiplier method minimum distance TP391.72 |
| 其他题名 | Intersection algorithm based on coordinate transformation |
| 中文摘要 | 利用坐标变换的方法,给出了二次曲线和二次曲面求交的解析算法。利用拉格朗日乘子法求解二次曲线和二次曲面之间的最小距离,给出了曲线与曲面相切的条件。算法表明,坐标变换可以简化求交运算表达式,使求交算法易于实现。根据得出的相切条件,可以有效地判断曲线、曲面是否有交,对相切情况的计算结果进行修正,可提高奇异情况下的求交稳定性。算法已在清软英泰公司开发的自主版权3维CAD软件GEMS中得到应用。; A method to solve the intersection of conic and conicoid based on the coordinate transformation was presented. With the Lagrange multiplier method, the minimum distance of the center of a circle and a quadric surface was provided and the tangency condition of curve and surface was given. Experience showed that the coordinate transformation could significantly simplify the method to intersection calculation. The location of the tangent point was revised by using the tangency condition. It could improve the stability of the intersection of given curves and surfaces in singularity cases. The new algorithm was applied in a three-dimensional Computer Aided Design (CAD) software, GEMS, which was produced by Tsinghua University.; 国家高技术研究发展计划(2003AA4Z1010); 国家重点基础研究发展计划(2002CB312106); 留学回国人员科研启动基金(041501004); 高等学校全国优秀博士学位论文作者专项资金(200342)的资助。~~ |
| 语种 | 中文 ; 中文 |
| 内容类型 | 期刊论文 |
| 源URL | [http://hdl.handle.net/123456789/56712]  |
| 专题 | 清华大学 |
| 推荐引用方式 GB/T 7714 | 陈晓霞,雍俊海,陈玉健,等. 基于坐标变换的曲线曲面求交算法[J],2010, 2010. |
| APA | 陈晓霞.,雍俊海.,陈玉健.,刘辉.,CHEN Xiao-xia.,...&LIU Hui.(2010).基于坐标变换的曲线曲面求交算法.. |
| MLA | 陈晓霞,et al."基于坐标变换的曲线曲面求交算法".(2010). |
| 个性服务 |
| 查看访问统计 |
| 相关权益政策 |
| 暂无数据 |
| 收藏/分享 |
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论