亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频

蟲(chóng)蟲(chóng)首頁(yè)| 資源下載| 資源專輯| 精品軟件
登錄| 注冊(cè)

您現(xiàn)在的位置是:蟲(chóng)蟲(chóng)下載站 > 資源下載 > 數(shù)學(xué)計(jì)算 > When working with mathematical simulations or engineering problems, it is not unusual to handle curv

When working with mathematical simulations or engineering problems, it is not unusual to handle curv

資 源 簡(jiǎn) 介

When working with mathematical simulations or engineering problems, it is not unusual to handle curves that contains thousands of points. Usually, displaying all the points is not useful, a number of them will be rendered on the same pixel since the screen precision is finite. Hence, you use a lot of resource for nothing! This article presents a fast 2D-line approximation algorithm based on the Douglas-Peucker algorithm (see [1]), well-known in the cartography community. It computes a hull, scaled by a tolerance factor, around the curve by choosing a minimum of key points. This algorithm has several advantages: 這是一個(gè)基于Douglas-Peucker算法的二維估值算法。

相 關(guān) 資 源

主站蜘蛛池模板: 光泽县| 湘潭县| 大理市| 鸡西市| 华蓥市| 茂名市| 慈溪市| 岳阳市| 仁怀市| 封开县| 祥云县| 通榆县| 云和县| 肥西县| 和硕县| 常宁市| 镶黄旗| 安仁县| 黄山市| 泉州市| 上犹县| 淳安县| 黔江区| 长葛市| 吉林省| 印江| 桑日县| 霍州市| 汝南县| 黄冈市| 郁南县| 甘泉县| 冷水江市| 台安县| 华蓥市| 瓮安县| 徐汇区| 垣曲县| 富顺县| 资源县| 北京市|