|
摘要：
|
|
提出用相交交线法快速定位相交立方格以获取切片数据点,并用简化的Dijkstra算法对切片数据点进行曲线重建。实现了任意法向的切片平面与空间立方格相截,简捷和快速地找出切片平面与立方体所有相交的子立方格,并在此基础上获取落在切片平面上散乱数据点集。对平面点集进行Delaunay三角划分,构造带权连通图,利用Dijkstra最短路径逼近得到有序点集并构造多义线。算法可对单连通、多连通数据点集曲线重构。
|
|
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.
|
|
基金项目：
|
|
江西省教育厅科学技术研究项目——逆向工程与快速模具的开发研究(赣教技字2006-32)
|
|
作者简介：
|
|
|
|
参考文献：
|
[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.
|
|
服务与反馈：
|
|
【文章下载】【加入收藏】
|
|
|
|
