检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]中南大学,长沙410004
出 处:《交通与计算机》2004年第6期68-71,共4页Computer and Communications
摘 要:依据道路线路设计成果计算出道路模型与地形模型的拼合交线 ,用设计点 (特征线 )数据替换拼合交线内的地形点 (特征线 )数据 ,形成道路建模所需的原始点集和约束边集。针对原始点集采用逐点插入算法进行 Delaunay三角剖分 ,将约束边嵌入初始三角网中 。Using the road alignment design fruits, the authors work out the merging intersection lines between the road model and the terrain model. Then, those terrain points and feature lines, which are located in the area covered by the merging intersection lines, are replaced by the design feature points and feature lines. As a result, the collection of points and constraining edges needed by modeling are formed. The authors apply the incremental insertion algorithm to make the points form standard Delaunay triangular net. In the following step, the authors adjust the previous triangular net with constraining edges and create constrained Delaunay triangular net. Thus, the road 3D model, whose appearance and inner topological relationship are both integrated, is created successfully.
关 键 词:约束边 DELAUNAY三角剖分 插入 拼合 建模 算法 特征线 道路 线路设计 路线
分 类 号:U412[交通运输工程—道路与铁道工程] TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28