Transactions of Materials and Heat Treatment

Title：Research on slicing technique and rapid curve reconstruction in reverse engineering

Authors： ZHU Gen-song1 2 ZHOU Tian-rui1 (1.School of Mechanical and Electrical Engineering Nanchang University Nanchang 330029 China 2.College of Application and Science Jiangxi University of Science and Technology Ganzhou 341000 China)

Unit：

KeyWords： reverse engineering slicing curve reconstruction delaunay triangulation

ClassificationCode：TP391.7

year,vol(issue):pagenumber：2008,33(3):137-140

Abstract：

A new method named Intersection-Line was presented to locate intersected cubes quickly,get slices points,and reconstruct curves form slices points with simplified Dijkstra algorithm.The intersection of an arbitrary plane and three-dimensional cube-network was realized,and all the subordinate cubes intersected with the plane were got rapidly and briefly.Based on it,all the scattered points on the slicing plane were got quickly.This method built a weighted graph from given slicing scattered points using delaunay triangulation of these points.And ordered data points were got by computing shortest path in weighted graph using Dijkstra algorithm.The method can reconstruct from data sets with arbitrary topology,such as simply connected,multiple connected and closed scattered points.

Funds：

江西省教育厅科学技术研究项目——逆向工程与快速模具的开发研究(赣教技字2006-32)

Reference：

[1]钟纲.曲线曲面重建方法研究[D].杭州:浙江大学,2002.
[2]刘丽,伯彭波,张彩明.散乱数据点集曲线重构的最短路逼近算法[J].计算机学报,2006,29(12):2172-2179.
[3]柯映林,王青.反求工程中的点云切片算法研究[J].计算机辅助设计与图形学学报,2005,17(8):1798-1802.
[4]肖位枢.图论及其算法[M].北京:航空工业出版社,1993.
[5]Althaust E.Curve reconstruction and the traveling salemanproblem[D].Saarland:Saarland University,2001.
[6]周培德.计算几何-算法设计与分析[M].北京:清华大学出版社,2005.
[7]Lee I K.Curve reconstruction from unorganized points[J].Computer Aided Geometric Design,2000,17(2):161-172.

Service：

【This site has not yet opened Download Service】【Add Favorite】