摘要
对于存在碎部点,且矢量化后间距较大的等高线图,给出了一种加密等高线算法,该算法以任意直线与B-样条曲线求交算法为基础;加密等高线算法利用图纸给定的等高线和碎部点等客观信息在间距较大的等高线之间形成新的等高线,等高线加密效果好,并对等高线图的三维可视化有重要意义。
A novel method was proposed to get a detailed vector contour map. With the given information of the known scatter points and the existing contours, a series of points with particular height could be got by interpolation formula. Then a new contour could be made between the existing contours. The base of the method is a novel algorithm. The algorithms can get the intersection point of an arbitrary line and a B-spline curve. The new contours are on the base of objective information. The method shortens interval of the contours, and the result is preferable. The work is contributed to the 3-D visualization of a contour map.
出处
《系统仿真学报》
CAS
CSCD
北大核心
2006年第z1期319-321,共3页
Journal of System Simulation
关键词
等高线
B样条
求交
插值
contour
B-spline
intersection
interpolation
