| 基于k-邻域密度的离散点云简化算法与实现 |
| |
| 引用本文： | 车翔玖,刘杨,赵义武,车娜,高占恒.基于k-邻域密度的离散点云简化算法与实现[J].吉林大学学报(理学版),2009,47(5):994-998. |
| |
| 作者姓名： | 车翔玖 刘杨 赵义武 车娜 高占恒 |
| |
| 作者单位： | 1. 吉林大学 计算机科学与技术学院, 长春 130012,2. 吉林大学 数学研究所, 长春 130012 |
| |
| 基金项目： | 国家自然科学基金，教育部博士学科点专项基金 |
| |
| 摘 要： | 提出一种基于k-邻域密度(即k-邻域中的点云密度)的离散点云简化算法, 并给出了在三角网格重构中的实现. 该方法不仅可以保证实物模型重建后的整体轮廓, 而且在细节部分也较好地保持了局部形状特征. 三角网格重构的实验结果表明, 所给方法简单、 高效, 同时, 在实物模型平滑处与曲率变化较大处均取得了理想效果.
|
| 关 键 词： | k-邻域 离散点云 点云密度 点云简化 三角网格重构 |
| 收稿时间： | 2009-03-06 |
Simplification and Implementation of Scattered Point Cloud Based on the Density in k-Nearest Neighbors |
| |
| CHE Xiang-jiu,LIU Yang,ZHAO Yi-wu,CHE Na,GAO Zhan-heng.Simplification and Implementation of Scattered Point Cloud Based on the Density in k-Nearest Neighbors[J].Journal of Jilin University: Sci Ed,2009,47(5):994-998. |
| |
| Authors: | CHE Xiang-jiu LIU Yang ZHAO Yi-wu CHE Na GAO Zhan-heng |
| |
| Institution: | 1. College of Computer Science and Technology, Jilin University, Changchun 130012, China;2. Institute of Mathematics, Jilin University, Changchun 130012, China |
| |
| Abstract: | This paper presents a simplification method for scattered point cloud based on the density of the points in k-nearest neighbors as well as a concrete algorithm and the effect of its implementation on triangulation.This method ensures that reconstruction of triangular mesh maintains the figure contour of an object,but also does well on the details of a local part.The examples show that the method in this paper is easy to implement,and holds high efficiency.Meanwhile,this method holds satisfied effect on the ... |
| |
| Keywords: | k-nearest neighbors scattered point cloud density of point cloud simplification of point cloud reconstruction of triangular mesh |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《吉林大学学报(理学版)》浏览原始摘要信息 |
| 点击此处可从《吉林大学学报(理学版)》下载免费的PDF全文 |
|
