2007_autumn_mster_liuyu2007_autumn_master_liuyu2007_autumn_master_liuyu2007_autumn_master_liuyu.ppt
- 1、本文档共44页,可阅读全部内容。
- 2、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
2007_autumn_mster_liuyu2007_autumn_master_liuyu2007_autumn_master_liuyu2007_autumn_master_liuyu
Detection of closed sharp edges in point clouds Speaker: Liuyu Time:2007-09-27 Background Knowledge Realistic parts to point clouds: Point clouds to “realistic” parts: an important part in the reverse engineering of industrial parts Reference Detection of closed sharp edges in point clouds using normal estimation and graph theory Authors : Kris Demarsin, Denis Vanderstraeten, Tim Volodine, Dirk Roose Publish: CAD 39(2007) 276-283 Authors Kris Demarsin: K.U.Leuven, Belgium Department of Computer Science Promoter: D. Roose Co-Promoter: D. Vanderstaeten (Metris) Authors Tim Volodine research assistant Department of Computer Science Celestijnenlaan 200A 1.28 B-3001 Heverlee Promoter: D. Roose Co-Promoter: D. Vanderstaeten (Metris) Authors Dirk Roose : Professor at the department of Computer Science, Faculty of Applied Sciences, K.U.Leuven; Head of the research group Scientific Computing Email: Dirk.Roose@cs.kuleuven.ac.be Algorithm 1 1. Segment point cloud using the normals= point clusters(clusters); 2. Build graph Gall connecting neighboring clusters; 3. Add edges, indicating a piece of a sharp feature line, to Gall = Gextended; 4. Build the pruned minimum spanning tree of Gextended = Gextended; Algorithm 1 5. Prune short branches in Gpruned_mst = Gpruned_branches ; 6. Close the sharp feature lines in Gpruned_branches = Gclosed ; 7. Smooth the sharp feature lines in Gclosed = Gsmooth . Step 1 . Clusters Delaunay neighorhood of p Choose k(=20) nearest neighbors of p: The least square plane through the (k+1) points Step 1 . Clusters Project the points onto the plane Delaunay triangulate the projected points, Obtaining the Delaunay neighorhood of p Step 1. Clusters Normal estimation and First order segmentation of point cloud N(p) : the normal in p is estimated as the normal of the least squares plane through Delaunay neighhood of p p1, p2 are two ad
您可能关注的文档
- 1111言语理解与表达真题析1111言语理解与表达真题解析1111言语理解与表达真题解析1111言语理解与表达真题解析.ppt
- 352全站仪使用说明352站仪使用说明352全站仪使用说明352全站仪使用说明.ppt
- 611班班会——感恩ppt11班班会——感恩ppt611班班会——感恩ppt611班班会——感恩ppt.ppt
- 802.1x原理及测试80.1x原理及测试802.1x原理及测试802.1x原理及测试.doc
- 1207四级冲刺夺分班串讲207四级冲刺夺分班串讲1207四级冲刺夺分班串讲1207四级冲刺夺分班串讲.ppt
- 1500v验电器的使用方法500v验电器的使用方法1500v验电器的使用方法1500v验电器的使用方法.ppt
- 1835 财务报表分析185 财务报表分析1835 财务报表分析1835 财务报表分析.doc
- 1171 高一生物-海安高中学2014-2015学年高一上学期期末调研考试生物试题1171 高一生物-海安高级中学2014-2015学年高一上学期期末调研考试生物试题1171 高一生物-海安高级中学2014-2015学年高一上学期期末调研考试生物试题1171 高一生物-海安高级中学2014-2015学年高一上学期期末调研考试生物试题.doc
- 1835 财务报表分析(拼排序版本)2013071835 财务报表分析(拼音排序版本)2013071835 财务报表分析(拼音排序版本)2013071835 财务报表分析(拼音排序版本)201307.doc
- 1835 财务报表分析考核案1835 财务报表分析考核方案1835 财务报表分析考核方案1835 财务报表分析考核方案.doc
文档评论(0)