基于几何基元的点模型处理关键技术研究
|
摘要
点模型以离散点为表面表达方式,比较于传统的三角网格模型,点模型具有如下优点：数据获取方便、数据结构简单及无需维护拓扑结构等。在计算机图形学领域中,点模型的数字几何处理已成为一个新兴的研究热点。
本文以点模型为研究对象,以几何基元为基本几何描述方式,探索有效的几何基元的探测方法及其若干关键应用。
本文的主要的工作内容有：
1.提出了一种新的基于RANSAC范型的几何基元探测方法,并通过实验结果分析验证了方法的有效性及健壮性；定义了面向局部采样策略的模型分析方法,对于大规模点模型,局部采样策略可确保稳健地提取高概率值的几何基元；在进一步融合惰性评分估计模式的基础上,开发出一套高效实用的算法。
2.针对大规模点模型,提出了一种基于分解模式的点模型压缩方法；由于几何基元具有良好的逼近属性,故可有效地将图像技术应用于压缩位移映射；点模型交互式绘制时,可实现面向GPU的快速数据解压缩。
3.提出了基于几何基元导引的点模型分割与匹配方法,旨在自动探测到点模型中蕴含的实体对象；该方法将探测简化为一个图匹配问题：实体对象由其对应的几何基元进行描述,并将实体对象映射为图节点,对象之间的几何关系映射为图边；鉴于几何基元数远低于点数量,故对于大规模点模型,上述图匹配是非常有效的；图匹配过程中,若未满足关联于图边的几何约束,则可快速地检索并删除非法匹配。
4.基于已探测到的几何基元,可将探测到的几何基元延伸至点模型缺失区域,进而完成几何体上未观测到部分的有效修补。针对包含复合边界的复杂空洞修补问题,本文提出了新的处理策略：极小化一个新的曲面能量,利用该能量可优先选择依附于几何基元的曲面,旨在使修补完成的曲面部分能够与延伸的几何基元完成有效闭合；针对未采用合适几何基元描述的曲面部分,本文方法将自动地选择极小曲面完成修补。
综上所述,本文对基于几何基元的点模型处理的若干关键环节提出了新的设想及新的算法,为反求工程提供了新的方法与技术,其在计算辅助设计和图形学的工程实际中具有广阔的应用前景。
Point model adopts discrete point as surface presentation. In comparison with triangle mesh model, Point model has following properties:convenient data acquisition, simple data structure, and no need to maintaining topological structure. In consequence, digital geometry processing in point model has been an emerging research focus in computer graphics.
The paper serves point model as reseach object, and serves geometry primitives as basic geometry presentation. It aims to develop efficient and robust methods for detection of geometry primitives and several key applications.
The main researches are as follows:
1. A RANSAC based detection method has been introduced, discussed and analyzed. A theoretical analysis of the employed local sampling strategy has been given. The local sampling allows robust extraction of geometry primitives with high probability even in large point model. In conjunction with the lazy score evaluation scheme this leads to an efficient and effective algorithm.
2. An algorithm for compression of the decomposed point model has been presented. Due to the good approximation quality of the geometry primitives it is possible to efficiently compress displacement maps using image-based techniques.This even allows for fast decompression on the GPU during interactive rendering.
3. The segmentation and matching provided by the geometry primitives has been exploited to automatically detect user specified entities in the point model.Detection is reduced to a graph matching problem:Entities are described by their comprising geometry primitives, represented as graph nodes, and their geometrical relations, represented by graph edges. The matching is efficient even on large point model since the number of geometry primitives is much lower than the number of points and invalid matches can be quickly pruned if geometric constraints associated with the edges are not met.
4. Completion of unobserved parts of geometry has been approached by extending detected geometry primitives in the empty areas. In order to allow the completion of even very complex holes with possibly multiple boundaries the proposed method minimizes a novel surface energy. The energy prefers surfaces that follow the geometry primitives such that the completed parts are effectively closed by extended geometry primitives. However, in case no suitable geometry primitives exist the method automatically and gracefully resorts to a completion by minimal surfaces.
In a word, this paper proposes new ideas and methods to key procedures in efficient point model processing with geometry primitives, and presented new means and techniques for reverse engineering. It indicated that they have wide application in computer aided design and computer graphics.
本文以点模型为研究对象,以几何基元为基本几何描述方式,探索有效的几何基元的探测方法及其若干关键应用。
本文的主要的工作内容有：
1.提出了一种新的基于RANSAC范型的几何基元探测方法,并通过实验结果分析验证了方法的有效性及健壮性；定义了面向局部采样策略的模型分析方法,对于大规模点模型,局部采样策略可确保稳健地提取高概率值的几何基元；在进一步融合惰性评分估计模式的基础上,开发出一套高效实用的算法。
2.针对大规模点模型,提出了一种基于分解模式的点模型压缩方法；由于几何基元具有良好的逼近属性,故可有效地将图像技术应用于压缩位移映射；点模型交互式绘制时,可实现面向GPU的快速数据解压缩。
3.提出了基于几何基元导引的点模型分割与匹配方法,旨在自动探测到点模型中蕴含的实体对象；该方法将探测简化为一个图匹配问题：实体对象由其对应的几何基元进行描述,并将实体对象映射为图节点,对象之间的几何关系映射为图边；鉴于几何基元数远低于点数量,故对于大规模点模型,上述图匹配是非常有效的；图匹配过程中,若未满足关联于图边的几何约束,则可快速地检索并删除非法匹配。
4.基于已探测到的几何基元,可将探测到的几何基元延伸至点模型缺失区域,进而完成几何体上未观测到部分的有效修补。针对包含复合边界的复杂空洞修补问题,本文提出了新的处理策略：极小化一个新的曲面能量,利用该能量可优先选择依附于几何基元的曲面,旨在使修补完成的曲面部分能够与延伸的几何基元完成有效闭合；针对未采用合适几何基元描述的曲面部分,本文方法将自动地选择极小曲面完成修补。
综上所述,本文对基于几何基元的点模型处理的若干关键环节提出了新的设想及新的算法,为反求工程提供了新的方法与技术,其在计算辅助设计和图形学的工程实际中具有广阔的应用前景。
Point model adopts discrete point as surface presentation. In comparison with triangle mesh model, Point model has following properties:convenient data acquisition, simple data structure, and no need to maintaining topological structure. In consequence, digital geometry processing in point model has been an emerging research focus in computer graphics.
The paper serves point model as reseach object, and serves geometry primitives as basic geometry presentation. It aims to develop efficient and robust methods for detection of geometry primitives and several key applications.
The main researches are as follows:
1. A RANSAC based detection method has been introduced, discussed and analyzed. A theoretical analysis of the employed local sampling strategy has been given. The local sampling allows robust extraction of geometry primitives with high probability even in large point model. In conjunction with the lazy score evaluation scheme this leads to an efficient and effective algorithm.
2. An algorithm for compression of the decomposed point model has been presented. Due to the good approximation quality of the geometry primitives it is possible to efficiently compress displacement maps using image-based techniques.This even allows for fast decompression on the GPU during interactive rendering.
3. The segmentation and matching provided by the geometry primitives has been exploited to automatically detect user specified entities in the point model.Detection is reduced to a graph matching problem:Entities are described by their comprising geometry primitives, represented as graph nodes, and their geometrical relations, represented by graph edges. The matching is efficient even on large point model since the number of geometry primitives is much lower than the number of points and invalid matches can be quickly pruned if geometric constraints associated with the edges are not met.
4. Completion of unobserved parts of geometry has been approached by extending detected geometry primitives in the empty areas. In order to allow the completion of even very complex holes with possibly multiple boundaries the proposed method minimizes a novel surface energy. The energy prefers surfaces that follow the geometry primitives such that the completed parts are effectively closed by extended geometry primitives. However, in case no suitable geometry primitives exist the method automatically and gracefully resorts to a completion by minimal surfaces.
In a word, this paper proposes new ideas and methods to key procedures in efficient point model processing with geometry primitives, and presented new means and techniques for reverse engineering. It indicated that they have wide application in computer aided design and computer graphics.
引文
[1]Moenning C, Dodgson N A.Intrinsic Point cloud simplification[C]//In:Proeeedings of GraphiCon'04,2004:1147-1154.
[2]Szymon Rusinkiewicz, Marc Levoy. Qsplat:a multiresolution point rendering system for large meshes[C]//Proceedings of SIGGRAPH'00,2000:343-352.
[3]ZWicker M, Pfister H, Baar J V, et al. Surface splatting[C]//In:Proceedings of SIGGRAPH'01,2001:371-378.
[4]Ruwen Schnabel, Roland Wahl, Reinhard Klein. Efficient ransack for point-cloud shape detection[J]. Computer Graphics Forum,2007,26(2):214-226.
[5]Bao Li, Ruwen Schnabel, Jin Shiyao, et al. Variational surface approximation and model selection[J]. Computer Graphics Forum,2009,28(7):1985-1994.
[6]Ruwen Schnabel, Sebastian Moser, Reinhard Klein. A parallelly decodeable compression scheme for efficient point-cloud rendering[C]//In Symposium on Point-Based Graphics 2007,2007:214-226.
[7]Ruwen Schnabel, Sebastian Moser, Reinhard Klein. Fast vector quantization for efficient rendering of compressed point-clouds[J]. Computers and Graphics,2008,32(2): 246-259.
[8]Ruwen Schnabel, Raoul Wessel, Roland Wahl, et al. Shape recognition in 3d point-clouds[C]//Computer Graphics,Visualization and Computer Vision'2008. 2008:135-147.
[9]Ruwen Schnabel, Patrick Degener, Reinhard Klein. Completion and reconstruction with primitive shapes[J]. Computer Graphics Forum,2009,28(2):503-512.
[10]邱航,陈雷霆.基于点的计算机图形学研究与进展[J].计算机科学,2009,36(6)：10-15.
[11]王仁芳。点模型数字几何处理若干技术研究[D].杭州：浙江大学,2007。
[12]Martin A. Fischler, Robert C. Bolles. Random sample consensus:a paradigm for model fitting with applications to image analysis and automated cartography[J]. Commun. ACM,1981,24(6):381-395.
[13]Hough P V C. Method and means for recognizing complex patterns[M]. US:IEEE press,1962.
[14]Illingworth J, Kittler J. A survey of the hough transform[J]. Comput.Vision Graph. Image Process,1988,44(1):87-116.
[15]Illingworth J and Kittler J V. The adaptive hough transform[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence,1987,9(5):690-698.
[16]Lei Xu, Erkki Oja. Randomized hough transform (RHT):basic mechanisms, algorithms, and computational complexities[J]. CVGIP,1993,57(2):131-154.
[17]丁益洪,平西建,胡敏.基于随机Hough变换的深度图像分割.计算机辅助设计与图形学学报,2005,17(5)：902-907.
[18]Vosselman G, Gorte B G H, Sithole G, et al. Recognising structure in laser scanner point clouds[J]. International Archives of Photogrammetry, Remote Sensing and Spatial Information Sciences,2004,46(8):33-38.
[19]Andrew W Fitzgibbon, David W Eggert, Robert Fisher. High-level CAD model acquisition from range images[J]. Computer aided Design,1997,29(4):321-330.
[20]Paulo F U Gotardo, Olga R P Bellon, Luciano Silva. Range image segmentation by surface extraction using an improved robust estimator[C]//CVPR2003,2003:345-356.
[21]王英惠,吴维勇.基于分段与识别技术的平面轮廓的精确重构[J].工程图学学报,2007,28(5)：43-48.
[22]Leonardis, Alok Gupta. Segmentation of range images as the search for geometric parametric models [J]. Int.J.Comput. Vision,1995,14(3):253-277.
[23]Ales Leonardis, Ales Jaklis, Franc Solina. Superquadrics for segmenting and modeling range data[J]. IEEE Trans.Pattern Anal.Mach.Intell,1997,19(11):1289-1295.
[24]David Marshall, Gabor Lukacs, Ralph Martin. Robust segmentation of primitives from range data in the presence of geometric degeneracy[J]. IEEE Trans.Pattern Anal.Mach.Intell,2001,23(3):304-314.
[25]Medioni G, Lee M S, Tang C K. A Computational Framework for Segmentation and Grouping[M]. Holland:Elsevier,2000.
[26]邵晓芳,孙即祥.改进的张量投票算法[J].计算机辅助设计与图形学学报,2006,18(7)：1028-1031.
[27]Tamas Varady, Ralph R. Martin, Jordan Cox. Reverse engineering of geometric models-an introduction[J]. Computer Aided Design,1997,29(4):255-268.
[28]Nickolas S. Sapidis, Paul J. Besl. Direct construction of polynomial surfaces from dense range images through region growing[J]. ACM Trans. Graph,1995,14(2):171-200.
[29]Benko P, Geza K, Varady T, et al. Constrained fitting in reverse engineering[J]. Comput. Aided Geom. Des,2002,19(3):173-205.
[30]田建磊,刘旭敏,关永.三角网格模型的补洞算法研究[J].计算机应用,2009,29(8)： 2035-2037,2059.
[31]庞旭芳,庞明勇,肖春霞.点云模型谷脊特征的提取与增强算法[J].自动化学报,2010,36(8)：1073-1083.
[32]Pal Benko, Ralph R. Martin, Tamas Varady. Algorithms for reverse engineering boundary representation models[J].Computer Aided Design,2001,33(11):839-851.
[33]David Cohen Steiner, Pierre Alliez, Mathieu Desbrun. Variational shape approximation [J]. ACM Trans. Graph.,2004,23(3):905-914.
[34]万华根,金小刚,刘刚,等.基于变分隐式曲面的网格融合[J].软件学报,2005,16(11)：2000-2007.
[35]Wu J, Kobbelt L. Structure recovery via hybrid variational surface approximation J]. Computer Graphics Forum,2005,24(2):277-284.
[36]Xavier Decoret, Fredo Durand, Francois Sillion, et al. Billboard clouds for extreme model simplification[J]//In Proceedings of the ACM Siggraph2003,2003:478-489.
[37]冀俊峰,李胜,刘学慧,等.基于参数空间的混合多分辨率绘制[J].软件学报,2004,15(10)：1515-1521.
[38]Wahl R, Guthe M, Klein R. Identifying planes in point-clouds for efficient hybrid rendering[C]//In The 13th Pacific Conference on Computer Graphics and Applications, 2005:56-70.
[39]Natasha Gelfand, Leonidas J. Guibas. Shape segmentation using local slippage analysis[C]//Proceedings of SIGGRAPH'04,2004:214-223.
[40]Hofer M, Odehnal B, Pottmann H, et al.3d shape recognition and reconstruction based on line element geometry[C]//In Tenth IEEE International Conference on Computer Vision,2005,2:1532-1538.
[41]何荣,李际军.逆向工程中特征曲面的识别方法[J].计算机应用,2007,27(8)：2018-2024.
[42]权勇,李文辉,庞云阶.利用表面元素绘制图形的方法[J].吉林大学学报(理学版),2004,42(4)：554-558.
[43]沈旭昆,赵学伟,赵沁平.一种保留特征的网格简化和压缩递进传输方法.计算机研究与发展,2007,44(7)：1097-1104.
[44]Mario Botsch, AndreasWiratanaya, Leif Kobbelt. Efficient high quality rendering of point sampled geometry[C]//In EGRW'02,2002:53-64.
[45]Aravind Kalaiah, Amitabh Varshney. Statistical geometry representation for efficient transmission and rendering[J]. ACM Trans.Graph.,2005,24(2):348-373.
[46]苗兰芳.点模型的表面几何建模和绘制[D].杭州：浙江大学,2005.
[47]Jens Kruger, Jens Schneider, Rudiger Westermann. Duodecim-a structure for point scan compression and rendering[C]//In Proceedings of the Symposium on Point-Based Graphics 2005,2005:129-137.
[48]葛军,姜小明,舒华忠.基于GPU的交互式体数据切割[J].计算机辅助设计与图形学学报,2010,22(3)：428-433.
[49]Hubo E, Mertens T, Haber T, et al. The quantized kdtree:Efficient ray tracing of compressed point clouds[C]//In IEEE Symposium on Interactive Ray Tracing, 2006:105-113.
[50]Erik Hubo, Tom Mertens, Tom Haber, et al. Self-Similarity-Based Compression of Point Clouds, with Application to Ray Tracing[C]//In Eurographics Symposium on Point-Based Graphics,2007:129-137.
[51]Tilo Ochotta, Dietmar Saupe. Compression of point-based 3d models by shape-adaptive wavelet coding of multi-height fields[C]//In Proceedings of the Eurographics Symposium on Point-Based Graphics,2004:103-112.
[52]Tilo Ochotta, Dietmar Saupe. Image-based surface compression[J]. Comput. Graph. Forum,2008,27(6):1647-1663.
[53]Huang Y, Peng J, Jay Kuo, et al. Octree-based progressive geometry coding of point clouds[C]//In Symposium on Point-Based Graphics 2006,2006:34-46.
[54]Schnabel R, Klein R. Octree-based point-cloud compression[C]//In Symposium on Point-Based Graphics 2006,2006:178-189.
[55]陈为,马瑞金,郑文庭,等.基于OBB树的无网格几何数据处理[J].计算机学报,2007,30(2)：330-336.
[56]Waschbusch M, Gross M, Eberhard F, et al. Progressive compression of point-sampled models[C]//In Proceedings of the Eurographics Symposium on Point-Based Graphics, 2004:95-102.
[57]邹万红,陈志杨,潘翔,等.多分辨率层次点模型分片[J].计算机辅助设计与图形学学报,2008,20(1)：1-5.
[58]Stefan Gumhold, Zachi Karni, Martin Isenburg, et al. Predictive point-cloud compression[C]//In Sketch in Visual Proceedings of ACM SIGGRAPH,2005:12-18.
[59]Bruce Merry, Patrick Marais, James Gain. Compression of dense and regular point clouds[J]. Computer Graphics Forum,2006,25(4):709-716.
[60]Mark Pauly, Markus Gross. Spectral processing of point sampled geometry[C]//In Proceedings of SIGGRAPH'01,2001:379-386.
[61]Tamy Boubekeur, Wolfgang Heidrich, Xavier Granier, et al. Volume-surface trees[J]. Computer Graphics Forum,2006,25(3):399-406.
[62]张军,戴霞.一种针对基于图像的3D重建网格的简化算法.计算机工程与应用,2006,42(8)：60-62,86.
[63]张荣华.基于多分辨率遮挡剔除的复杂地形绘制框架的研究.系统仿真学报.2009,21(17)：5462-5466.
[64]Ivanov D, Kuzmin Y. Spatial patches-a primitive for 3d model representation[J]. Computer Graphics Forum,2001,20(11):511-521.
[65]Tilo Ochotta, Stefan Hiller. Hardware rendering of 3d geometry with elevation maps[C]//In SMI'06,2006:10-18.
[66]Tangelder J W, Veltkamp R C.A survey of content based 3d shape retrieval methods[C]//In SMI'04,2004:145-156.
[67]George Vosselman. Fusion of laser scanning data, maps, and aerial photographs for building reconstruction[J]. In Geoscience and Remote Sensing Symposium, 2002,22(3):425-436.
[68]Vivek Verma, Rakesh Kumar, Stephen Hsu.3d building detection and modeling from aerial lidar data[C]//In CVPR'06,2006:2213-2220.
[69]El-Mehalawi M. A database system of mechanical components based on geometric and topological similarity, part ii indexing, retrieval,matching, and similarity assessment[J]. Computer-Aided Design,2003,35(1):95-105.
[70]El-Mehalawi M, Allen. A database system of mechanical components based on geometric and topological similarity. Part i:representation[J]. Computer-Aided Design, 2003,35(1):83-94.
[71]何洋,欧宗瑛.基于局部细节邻接图的指纹匹配算法研究[J].哈尔滨工业大学学报,2005,37(10)：1455-1458.
[72]David McWherter, Mitchell Peabody, Ali C. Shokoufandeh, et al. Database techniques for archival of solid models[C]//In SMA'01,2001:78-87.
[73]Emanoil Zuckerberger, Ayellet Tal, Shymon Shlafman. Polyhedral surface decomposition with applications[J]. Computers and Graphics,2002,26(5):733-743.
[74]Hilaga M, Shinagawa Y, Kohmura T, et al. Topology matching for fully automatic similarity estimation of 3D shapes[C]//In Proceedings of ACM SIGGRAPH'01, 2001:210-221.
[75]Gary K. L. Tam, Rynson W. H. Lau. Deformable model retrieval based on topological and geometric signatures[J]. IEEE TVCG,2007,13(3):470-482.
[76]Valerio Pascucci, Giorgio Scorzelli, Peer-Timo Bremer, et al. Robust on-line computation of reeb graphs:simplicity and speed[J]. ACM Trans. Graph.,2007,26(3): 58-68.
[77]Gunilla Borgefors, Ingela Nystrom, Gabriella Sanniti di Baja. Computing skeletons in three dimensions[J]. Pattern Recognition,1999,32(7):1225-1236.
[78]宋婷,刘文予,刘俊涛.基于骨架树的线性骨架拓扑相似性度量算法[J].红外与激光工程,2005,34(1)：74-79.
[79]Nicu D. Cornea, Deborah Silver, Patrick Min. Curve-skeleton applications[J]. In IEEE Visualization,2005,27(2):13-24.
[80]Andrei Sharf, Thomas Lewiner, Ariel Shamir, et al. On-the-fly curve-skeleton computation for 3d shapes[C]//In Eurographics'07,2007:323-328.
[81]薛峰,丁晓青.基于形状匹配变形模型的三维人脸重构[J].电子学报,2006,34(10)：1896-1899.
[82]Sundar H, Silver D, Gagvani N, et al. Skeleton based shape matching and retrieval[J]. ACM Transactions on Graphics,2003,22(3):181-198.
[83]Lou K, Janyanti S, Iyer N, et al. A reconfigurable 3d engineering shape search system part ii:database indexing, retrieval and clusturing[C]//In DETC,2003:267-278.
[84]Ran Gal, Daniel Cohen. Salient geometric features for partial shape matching and similarity[J]. ACM Transactions on Graphics,2006,25(1):130-150.
[85]Mitra N J, Guibas L, Giesen J, et al. Probabilistic fingerprints for shapes[C]//In Symposium on Geometry Processing,2006:121-130.
[86]Niloy J. Mitra, Leonidas J. Guibas, Mark Pauly. Partial and approximate symmetry detection for 3d geometry[J]. ACM Trans.Graph.,2006,25(3):560-568.
[87]Philip Shilane, Thomas Funkhouser. Selecting distinctive 3D shape descriptors for similarity retrieval[C]//In Shape Modeling International,2006:301-316.
[88]Funkhouser T,Shilane P. Partial matching of 3d shapes with priority-driven search[C]//In Proceedings of ACM SIGGRAPH'06,2006:131-142.
[89]Philip Shilane, Thomas Funkhouser. Distinctive regions of 3D surfaces[J]. ACM Transactions on Graphics,2007,26(2):78-92.
[90]郭凯,郭延文,陈晔.三维曲面的特征描述和特征匹配[J].微计算机信息,2009,25(8)：171-174.
[91]Alexander Berner, Martin Bokeloh, Michael Wand, et al. A graph-based approach to symmetry detection[C]//In Symposium on Volume and Point-Based Graphics,2008:1-8.
[92]刘晓平,吴敏,金灿.采用图分解的特征识别算法研究[J].工程图学学报,2010,22(1)：67-71.
[93]Martin Bokeloh, Alexander Berner, Michael Wand, et al. Symmetry detection using line features[J]. Computer Graphics Forum,2009,28(2):697-706.
[94]Hugues Hoppe, Tony DeRose, Tom Duchamp, et al. Piecewise smooth surface reconstruction[C]//In Proceedings of ACM SIGGRAPH'94,1994:295-302.
[95]Philipp Jenke, Michael Wand, Martin Bokeloh, et al. Bayesian point cloud reconstruction[J]. Comput.Graph. Forum,2006,25(3):379-388.
[96]Jenke P, Kruckeberg B, et al. Surface reconstruction from fitted shape primitives[C]//In 13th International FallWorkshop Vision, Modeling and Visualization,2008:31-40.
[97]Ran Gal, Ariel Shamir, Tal Hassner,et al. Surface reconstruction using local shape priors[C]//In Eurographics SGP,2007:253-262.
[98]杜中义,肖春霞.基于保特征无参数投影的快速几何重建[J].计算机辅助设计与图形学学报,2010,22(7)：1138-1144.
[99]计忠平,刘利刚,王国瑾.基于割角的保特征网格简化算法[J].计算机研究与发展,2006,43(12)：2144-2151.
[100]Michael Kazhdan, Matthew Bolitho, Hugues Hoppe. Poisson surface reconstruction[C]//In Eurographics SGP,2006:61-70.
[101]Alexander Hornung, Leif Kobbelt. Robust reconstruction of watertight 3D models from non-uniformly sampled point clouds without normal information[C]//In Eurographics SGP,2006:41-50.
[102]Victor S. Lempitsky,Yuri Boykov. Global optimization for shape fitting[C]//In CVPR, 2007:1-8.
[103]Curless B, Levoy M. A volumetric method for building complex models from range images[C]//In SIGGRAPH,1996:303-312.
[104]Marcelo Bertalmio, Guillermo Sapiro, Vincent Caselles, et al. Image inpainting[C]//In SIGGRAPH,2000:417-424.
[105]Iddo Drori, Daniel Cohen, Hezy Yeshurun. Fragment-based image completion[J]. ACM Trans. Graph.,2003,22(3):303-312.
[106]路平,陈敏刚,马利庄,等.快速结构化图像修补[J].中国图象图形学报,2010,15(6)：931-935.
[107]Davis J, Marschner S R, Garr M, et al. Filling holes in complex surfaces using volumetric diffusion[C]//In 3DPVT,2002:428-861.
[108]Joan Verdera, Vicent Caselles, Marcelo Bertalmio, et al. Inpainting surface holes[C]//In ICIP (2),2003:903-906.
[109]周世生,孙帮勇.一种基于LevelSet方法的图像修补技术[J].计算机应用研究, 2006,25(2)：258-260.
[110]Ulrich Clarenz, Udo Diewald, Dziuk G, et al. A finite element method for surface restoration with smooth boundary conditions[J]. CAGD,2004,12(1):427-445.
[111]周海,周来水.基于能量优化和细分的参数曲面混合和孔洞填充[J].中国机械工程,2004,15(17)：1515-1519.
[112]Andrei Sharf, Marc Alexa, Daniel Cohen. Context-based surface completion[J]. ACM Trans. on Graph.,2004,23(3):878-887.
[113]Pauly M, Mitra N J, Wallner J, et al. Discovering structural regularity in 3D geometry[J]. ACM Trans. On Graph.,2008,27(3):1-11.
[114]JianningWang, Manuel M. Oliveira. Improved scene reconstruction from range images[J]. Computer Graphics Forum,2002,21(3):521-530.
[115]肖双九,张树生,马利庄,等.基于网格的重构曲面再设计中的模板匹配[J].西北工业大学学报,2003,21(4)：495-498.
[116]Joshua Podolak, Szymon Rusinkiewicz. Atomic Volumes for Mesh Completion[C]//In Eurographics SGP,2005:33-41.
[117]Tao Ju. Robust repair of polygonal models[J]. ACM Trans. Graph., 2004,23(3):888-895.
[118]Peter Liepa. Filling holes in meshes[C]//In Eurographics SGP,2003:200-205.
[119]Stephan Bischoff, Darko Pavic, Leif Kobbelt. Automatic restoration of polygon models[J]. ACM Trans. Graph.,2005,24(4):1332-1352.
[120]李根,陈志杨,张三元,等.网格曲面中复杂孔洞的自动修补算法[J].浙江大学学报(工学版),2007,41(3)：407-411.
[121]Freek Stulp, Fabio Dell'Acqua, Robert Fisher. Reconstruction of surfaces behind occlusions in range images[C]//In 3D Digital Imaging and Modeling,2001:232-239.
[122]Umberto Castellani, Salvatore Livatino, Robert B. Fisher. Improving environment modelling by edge occlusion surface completion[C]//3DPVT,2002:672-675.
[123]Jiaya Jia, Chi-Keung Tang. Inference of segmented color and texture description by tensor voting[J]. IEEE Trans. Pattern Anal.Mach. Intell.,2004,26(6):771-786.
[124]史文中,田岩,黄应,等.基于张量投票的激光扫描数据修复方法[J].系统工程与电子技术,2009,31(11)：2723-2727.
[125]Helmut Pottmann, Stefan Leopoldseder, Michael Hofer, et al. Industrial geometry: recent advances and applications in CAD[J]. Computer-Aided Design,2005,37(7): 751-766.
[126]Gerhard Roth, Martin D. Levine. Extracting geometric primitives[J]. CVGIP:Image Underst.,1993,58(1):1-22.
[127]Mark Pauly, Markus Gross, Leif P. Kobbelt. Efficient simplification of point-sampled surfaces[C]//In Proceedings of IEEE Visualization 2002,2002,163-170.
[128]JainhuaWu, Leif Kobbelt. Optimized sub-sampling of point sets for surface splatting[J]. Computer Graphics Forum,2004,23(3):643-652.
[129]王仁芳,张三元,叶修梓.点模型的几何图像简化法[J].计算机辅助设计与图形学学报,2007,19(8)：1022-1027.
[130]Hugues Hoppe, Tony DeRose, Tom Duchamp, et al. Surface reconstruction from unorganized points[C]//In SIGGRAPH'92,1992:71-78.
[131]Mitra N J, Nguyen A, Guibas L. Estimating surface normals in noisy point cloud data[J]. In special issue of International Journal of Computational Geometry and Applications,2004,14(2):261-276.
[132]Mark Pauly, Niloy J. Mitra, Joachim Giesen, et al. Example-Based 3D Scan Completion[C]//In Eurographics SGP,2005:23-32.
[133]谭晓阳,孙正兴,张福炎.交互式图像检索中的相关反馈技术研究进展[J].南京大学学报(自然科学),2004,40(5)：639-648.
[134]Tamal K. Dey, Samrat Goswami. Provable surface reconstruction from noisy samples[C]//In Proceedings of the 20th ACM Symposium on Computational Geometry, 2004:330-339.
[135]Tamal K. Dey, Gang Li, Jian Sun. Normal estimation for point clouds:A comparison study for a voronoi based method[C]//Symposium on Point-Based Graphics,2005: 39-46.
[136]Shachar Fleishman, Daniel Cohen, Claudio T. Silva. Robust moving least squares fitting with sharp features[J]. ACM Transactions on Graphics,2005,24(3):544-552.
[137]Oztireli C, Guennebaud G, Gross M. Feature preserving point set surfaces based on non-linear kernel regression[J]. Computer Graphics Forum,2009,28(2):493-501.
[138]桑爱军,陈贺新.基于稳健统计的矢量量化器设计算法[J].中国图象图形学报,2003,8(A)(7)：829-833.
[139]徐全元,邵玉斌,鲁莹.基本矢量量化器的性能研究[J].昆明理工大学学报(理工版),2004,29(6)：75-78.
[140]Stewart C V. Bias in robust estimation caused by discontinuities and multiple structures[J]. IEEE Trans. Pattern Analysis and Machine Intelligence, 1997,19(8):818-833.
[141]Alexa M, Behr J, Cohen D, et al. Point set surfaces[C]//IEEE Visualization 2001,2001: 21-28.
[142]Marc Alexa, Johannes Behr, Daniel Cohen, et al. Computing and rendering point set surfaces[J]. IEEE Transactions on Visualization and Computer Graphics, 2003,9(1):3-15.
[143]David Levin. Mesh-independent surface interpolation[C]//Geometric Modeling for Scientific Visualization,2003:37-49.
[144]Nina Amenta, Yong Joo Kil. Defining point-set surfaces[J]. ACM Transactions on Graphics,2004,23(3):264-270.
[145]Gideon Guy, Gerard G. Medioni. Inference of surfaces,3D curves, and junctions from sparse, noisy,3D data[J]. IEEE Trans. Pattern Anal. Mach. Intell,1997,19(11): 1265-1277.
[146]Anders Adamson, Marc Alexa. Approximating and intersecting surfaces from points[C]//In Proceedings of the Eurographics/ACM SIGGRAPH symposium on Geometry processing,2003:230-239.
[147]Marc Alexa, Anders Adamson. On normals and projection operators for surfaces defined by point sets[C]//In Symposium on Point-Based Graphics,2004:149-155.
[148]赵爽,李学军.复杂场景的快速光线跟踪算法[J].计算机工程,2006,32(1)：224-225,272.
[149]Matthias Zwicker, Mark Pauly, Oliver Knoll, et al.Pointshop 3D:an interactive system for point-based surface editing[J]. ACM Transactions on Graphics,2002,21(3): 322-329.
[150]Mark Pauly. Point Primitives for Interactive Modeling and Processing of 3D Geometry[D]. Switzerland:ETH Zurich,2003.
[151]Nina Amenta, Yong J. Kil. The domain of a point set surface[C]//In Symposium on Point-Based Graphics,2004:139-147.
[152]Ravikrishna Kolluri. Provably good moving least squares[C]//In SIGGRAPH'05,2005: 213-312.
[153]Dey T K, Goswami S, Sun T. Extremal surface based projections converge and reconstruct with isotopy[R]. German:Springer,2005.
[154]Tamal K. Dey, Jian Sun. An adaptive MLS surface for reconstruction with guarantees[C]//In EG Symposium on Geometry Processing,2005:43-52.
[155]顾步云,周来水,刘胜兰,等.基于平面散乱点集的曲线重建算法[J].机械科学与技术,2007,26(4)：455-458.
[156]Gael Guennebaud, Markus Gross. Algebraic point set surfaces[J].ACM Transactions on Graphics,2007,26(3):231-239.
[157]Gael Guennebaud, Marcel Germann, Markus H. Gross. Dynamic sampling and rendering of algebraic point set surfaces[J]. Comput.Graph. Forum,2008,27(2): 653-662.
[158]Bolles R C, Fischler M A. A ransac-based approach to model fitting and its application to finding cylinders in range data[C]//In Proceedings of the 7th International Joint Conference on Artificial Intelligence,1981:637-643.
[159]Chaperon T, Goulette F. Extracting cylinders in full 3d data using a random sampling method and the gaussian image[C]//In VMV01,2001:35-42.
[160]Torr P, Zisserman A. MLESAC:A new robust estimator with application to estimating image geometry[J]. Computer Vision and Image Understanding,2000,78(10): 138-156.
[161]Phil Torr, Andrew Zisserman. Robust computation and parametrization of multiple view relations[C]//In ICCV'98,1998:727-735.
[162]Jiri Matas, Ondrej Chum. Randomized RANSAC with ttd test[C]//In Proceedings of the British Machine Vision Conference 2002(BMVC),2002:15-24.
[163]Capel D P. An effective bail-out test for RANSAC consensus scoring[C]//In Proc. British Machine Vision Conf.,2005:629-638.
[164]Jiri Matas, Ondrej Chum. Randomized RANSAC with sequential probability ratio test[C]//In ICCV,2005:1727-1732.
[165]Ondrej Chum, Jiri Matas. Optimal randomized RANSAC[J]. IEEE Trans. Pattern Anal. Mach. Intell,2008,30(8):1472-1482.
[166]Rahul Raguram, Jan-Michael Frahm, Marc Pollefeys. A comparative analysis of RANSAC techniques leading to adaptive realtime random sample consensus[C]//In Computer Vision-ECCV2008,2008:12-18.
[167]Ond n ej Chum, Jiri Matas. Matching with PROSAC-progressive sample consensus[C]//In Proc. of Conference on Computer Vision and Pattern Recognition (CVPR),2005,1:220-226.
[168]程志全.三维几何的流式传输[D].长沙：国防科技大学,2008.
[169]Ben Tordoff, David W. Murray. Guided sampling and consensus for motion estimation[C]//In Computer Vision-ECCV 2002,2002:28-31.
[170]Ondnej Chum, Jiri Matas, Josef Kittler. Locally optimized RANSAC[C]//In DAGM 2003,2003:236-243.
[171]David Nister. Preemptive RANSAC for live structure and motion estimation[J]. Mach. Vision Appl.,2005,16(5):321-329.
[172]Myatt D R, Torr P H S, Nasuto S J, et al. Napsac:High noise, high dimensional robust estimation-it's in the bag[C]//In BMVC,2002:876-885.
[173]Kenneth P. Burnham, David R. Anderson. Model Selection and Multi-Model Inference: A Practical Information-Theoretic Approach[M]. German:Springer,2002.
[174]李云仙,王学仁.带有有序变量的结构方程模型中的模型选择[J].统计与决策,2009,26(14)：15-18.
[175]Akaike H. Information theory and an extension of the maximum likelihood principle[C]//In Second International Symposium on Information Theory,1973: 267-281.
[176]Leontaritis I J, Billings S A. Model selection and validation methods for nonlinear systems[J]. Int. J. Control,1987,45(1):311-341.
[177]Wallace C S, Boulton D M. An information measure for classification[J]. The Computer Journal,1968,11(2):185-194.
[178]Rissanen J. Modeling by shortest data description[J]. Automatica,1978,14(2): 465-471.
[179]Schwarz G. Estimating the dimension of a model[J]. The Annals of Statistics, 1978,8(6):461-464.
[180]Alireza Bab-Hadiashar, Niloofar Gheissari. Range image segmentation using surface selection criterion[J]. IEEE Transactions on Image Processing,2006,15(7): 2006-2018.
[181]Hugues Hoppe, Tony DeRose, Tom Duchamp, et al. Mesh optimization[C]//In SIGGRAPH,1993,27:19-26.
[182]MarkW. Powell, KevinW. Bowyer, Xiaoyi Jiang, et al. Comparing curved-surface range image segmenters[C]//In ICCV'98,1998:286-299.
[183]Xiaoyi Jiang, Horst Bunke. Range image segmentation:Adaptive grouping of edges into regions[C]//In ACCV'98,1998,2:299-306.
[184]Besl P J, Jain R C. Segmentation through variable-order surface fitting[J]. IEEE Trans. Pattern Anal. Mach. Intell.,1998,10(2):167-192.
[185]Heiko Hirschmuller. Stereo processing by semiglobal matching and mutual information[J]. IEEE Trans. Pattern Anal. Mach. Intell.,2008,30(2):328-341.
[186]Anders Adamson, Marc Alexa. Ray tracing point set surfaces[C]//In SMI'03,2003: 272-279.
[187]曹巨明,吾守尔.斯拉木,梁晋,等.移动最小二乘增量式多视点云数据融合算法[J]. 西安交通大学学报,2009,43(9)：46-50.
[188]Adelson E H, Burt P J. Image data compression with the laplacian pyramid[C]//In Pattern Recognition and Image Processing,1981:218-223.
[189]Cohen A, Daubechies I, Feauveau J C. Biorthogonal bases for compactly supported wavelets[J]. Comm. Pure & Applied Math,1997,45(2):485-560.
[190]Gersho A, Gray R M. Vector Quantization and Signal Compression[M]. Boston: Kluwer Academic,1999.
[191]陈雨时,张晔,谷延锋.基于特征选择的高光谱图像快速矢量量化算法[J].哈尔滨工业大学学报,2007,39(11)：1748-1750.
[192]Andrew C. Beers, Maneesh Agrawala, Navin Chaddha. Rendering from compressed textures[C]//In SIGGRAPH'06,2006,373-378.
[193]Marc Levoy, Pat Hanrahan. Light field rendering[C]//In SIGGRAPH'96,1996:31-42.
[194]Jens Schneider, RudigerWestermann. Compression domain volume rendering[C]//In VIS'03,2003,39-52.
[195]Linde Y, Buzo A, Gray R M. An algorithm for vector quantizer design[J]. IEEE Trans, on Communications,1990,28(1):84-95.
[196]Kanungo T, Mount D, Netanyahu N, et al. An efficient k-means clustering algorithm: Analysis and implementation[J]. IEEE Transactions on Pattern Analysis and MachineIntelligence,2002,24(7):881-892.
[197]Alsabti K, Ranka S, Singh V. An efficient space-partitioning based algorithm for the k-means clustering[J]. Lecture Notes in Computer Science,1999,1574:355-359.
[198]Dan Pelleg, Andrew W. Moore. Accelerating exact k-means algorithms with geometric reasoning[C]//In KDD,1999,277-281.
[199]George Kollios, Dimitrios Gunopulos, Nick Koudas, et al. Efficient biased sampling for approximate clustering and outlier detection in large data sets[J]. IEEE Trans. Knowl. Data Eng.,2003,15(5):1170-1187.
[200]Gereon Frahling, Christian Sohler. A fast k-means implementation using corsets[C]//In SCG'06,2006:135-143.
[201]张玉伦,余宁梅,王冬芳.一种压缩比自适应的快速矢量量化算法[J].计算机工程与应用,2006,23(19)：44-46,118.
[202]Ratko Orlandic, Ying Lai, Wai Gen Yee. Clustering highdimensional data using an efficient and effective data space reduction[C]//In Proceedings of the 2005 ACM CIKM International Conference on Information and Knowledge Management,2005,201-208.
[203]李晔,崔慧娟,唐昆.加权平方误差测度下的快速矢量量化算法[J].清华大学学报 (自然科学版),2007,47(7)：1130-1132.
[204]Kevin Beyer, Jonathan Goldstein, Raghu Ramakrishnan, et al. When is "nearest neighbor" meaningful?[J]. Lecture Notes in Computer Science,1999,1540:217-235.
[205]Charu C. Aggarwal, Alexander Hinneburg, Daniel A. Keim. On the surprising behavior of distance metrics in high dimensional space[J]. Lecture Notes in Computer Science,2006,1973:420-436.
[206]Timothy Mattson, Beverly Sanders, Berna Massingill. Patterns for Parallel Programming[M]. Amsterdam:Addison-Wesley Longman,2004.
[207]Witten I, Neal R, Cleary J. Arithmetic coding for data compression[J]. Communications of the ACM,1997,30:520-541.
[208]Mario Botsch, Leif Kobbelt. High-quality point-based rendering on modern gpus[C]//In PG'03,2003:335-346.
[209]Grossman J P, William J. Dally. Point sample rendering[M]. German:Springer,1998.
[210]Stephen A. Cook. The complexity of theorem-proving procedures[C]//In STOC'71, 1971:151-158.
[211]Vladimir Kolmogorov, Yuri Boykov. What metrics can be approximated by geo-cuts, or global optimization of length/area and flux[C]//In ICCV,2005:564-571.
[212]孙晓鹏,李华.三维网格模型的分割及应用技术综述[J].计算机辅助设计与图形学学报,2005,17(8)：1647-1655.
[213]Yuri Boykov, Vladimir Kolmogorov. Computing geodesics and minimal surfaces via graph cuts[C]//In ICCV,2003:26-33.
[214]Kolmogorov V, Zabin R. What energy functions can be minimized via graph cuts?[J]. IEEE Trans. on Pattern Anal. and Mach.Intell.,2004,26(2):147-159.
[215]William E. Lorensen, Harvey E. Cline. Marching cubes:A high resolution 3d surface construction algorithm[J]. SIGGRAPH,1997,21(4):163-169.
[216]Leif P. Kobbelt, Mario Botsch, Ulrich Schwanecke, et al. Feature sensitive surface extraction from volume data[C]//In SIGGRAPH,2004:57-66.
[217]Richard Szeliski, Ramin Zabih, Daniel Scharstein, et al. A comparative study of energy minimization methods for markov random fields with smoothness-based priors[J]. IEEE Trans. Pattern Anal. Mach. Intell.,2008,30(6):1068-1080.
[218]Yuri Boykov, Olga Veksler, Ramin Zabih. Fast approximate energy minimization via graph cuts[J]. IEEE Trans. Pattern Anal. Mach. Intell.,2001,23(11):1222-1239.
[219]张慧杰,孙吉贵,刘雪洁,等.大规模三维地形可视化算法研究进展[J].计算机科学,2007,34(3)：10-16.
[220]李宏华,程志全,李俊,等.一种基于深度域SIFT特征建立网格对应关系的算法[J].系统仿真学报,2009,21(1)：15-18.
[221]Toby P. Breckon, Robert B. Fisher. Plausible 3D colour surface completion using non-parametric techniques[J]. Lecture Notes in Computer Science,2007,3604: 102-120.
[222]李晋江,张彩明,范辉,等.基于分形的图像修复算法[J].电子学报,2010,38(10)：2430-2435.
[223]Kolev K, Klodt M, Brox T, et al. Continuous global optimization in multiview 3d reconstruction[J]. International Journal of Computer Vision,2010,84(1):80-96.
[2]Szymon Rusinkiewicz, Marc Levoy. Qsplat:a multiresolution point rendering system for large meshes[C]//Proceedings of SIGGRAPH'00,2000:343-352.
[3]ZWicker M, Pfister H, Baar J V, et al. Surface splatting[C]//In:Proceedings of SIGGRAPH'01,2001:371-378.
[4]Ruwen Schnabel, Roland Wahl, Reinhard Klein. Efficient ransack for point-cloud shape detection[J]. Computer Graphics Forum,2007,26(2):214-226.
[5]Bao Li, Ruwen Schnabel, Jin Shiyao, et al. Variational surface approximation and model selection[J]. Computer Graphics Forum,2009,28(7):1985-1994.
[6]Ruwen Schnabel, Sebastian Moser, Reinhard Klein. A parallelly decodeable compression scheme for efficient point-cloud rendering[C]//In Symposium on Point-Based Graphics 2007,2007:214-226.
[7]Ruwen Schnabel, Sebastian Moser, Reinhard Klein. Fast vector quantization for efficient rendering of compressed point-clouds[J]. Computers and Graphics,2008,32(2): 246-259.
[8]Ruwen Schnabel, Raoul Wessel, Roland Wahl, et al. Shape recognition in 3d point-clouds[C]//Computer Graphics,Visualization and Computer Vision'2008. 2008:135-147.
[9]Ruwen Schnabel, Patrick Degener, Reinhard Klein. Completion and reconstruction with primitive shapes[J]. Computer Graphics Forum,2009,28(2):503-512.
[10]邱航,陈雷霆.基于点的计算机图形学研究与进展[J].计算机科学,2009,36(6)：10-15.
[11]王仁芳。点模型数字几何处理若干技术研究[D].杭州：浙江大学,2007。
[12]Martin A. Fischler, Robert C. Bolles. Random sample consensus:a paradigm for model fitting with applications to image analysis and automated cartography[J]. Commun. ACM,1981,24(6):381-395.
[13]Hough P V C. Method and means for recognizing complex patterns[M]. US:IEEE press,1962.
[14]Illingworth J, Kittler J. A survey of the hough transform[J]. Comput.Vision Graph. Image Process,1988,44(1):87-116.
[15]Illingworth J and Kittler J V. The adaptive hough transform[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence,1987,9(5):690-698.
[16]Lei Xu, Erkki Oja. Randomized hough transform (RHT):basic mechanisms, algorithms, and computational complexities[J]. CVGIP,1993,57(2):131-154.
[17]丁益洪,平西建,胡敏.基于随机Hough变换的深度图像分割.计算机辅助设计与图形学学报,2005,17(5)：902-907.
[18]Vosselman G, Gorte B G H, Sithole G, et al. Recognising structure in laser scanner point clouds[J]. International Archives of Photogrammetry, Remote Sensing and Spatial Information Sciences,2004,46(8):33-38.
[19]Andrew W Fitzgibbon, David W Eggert, Robert Fisher. High-level CAD model acquisition from range images[J]. Computer aided Design,1997,29(4):321-330.
[20]Paulo F U Gotardo, Olga R P Bellon, Luciano Silva. Range image segmentation by surface extraction using an improved robust estimator[C]//CVPR2003,2003:345-356.
[21]王英惠,吴维勇.基于分段与识别技术的平面轮廓的精确重构[J].工程图学学报,2007,28(5)：43-48.
[22]Leonardis, Alok Gupta. Segmentation of range images as the search for geometric parametric models [J]. Int.J.Comput. Vision,1995,14(3):253-277.
[23]Ales Leonardis, Ales Jaklis, Franc Solina. Superquadrics for segmenting and modeling range data[J]. IEEE Trans.Pattern Anal.Mach.Intell,1997,19(11):1289-1295.
[24]David Marshall, Gabor Lukacs, Ralph Martin. Robust segmentation of primitives from range data in the presence of geometric degeneracy[J]. IEEE Trans.Pattern Anal.Mach.Intell,2001,23(3):304-314.
[25]Medioni G, Lee M S, Tang C K. A Computational Framework for Segmentation and Grouping[M]. Holland:Elsevier,2000.
[26]邵晓芳,孙即祥.改进的张量投票算法[J].计算机辅助设计与图形学学报,2006,18(7)：1028-1031.
[27]Tamas Varady, Ralph R. Martin, Jordan Cox. Reverse engineering of geometric models-an introduction[J]. Computer Aided Design,1997,29(4):255-268.
[28]Nickolas S. Sapidis, Paul J. Besl. Direct construction of polynomial surfaces from dense range images through region growing[J]. ACM Trans. Graph,1995,14(2):171-200.
[29]Benko P, Geza K, Varady T, et al. Constrained fitting in reverse engineering[J]. Comput. Aided Geom. Des,2002,19(3):173-205.
[30]田建磊,刘旭敏,关永.三角网格模型的补洞算法研究[J].计算机应用,2009,29(8)： 2035-2037,2059.
[31]庞旭芳,庞明勇,肖春霞.点云模型谷脊特征的提取与增强算法[J].自动化学报,2010,36(8)：1073-1083.
[32]Pal Benko, Ralph R. Martin, Tamas Varady. Algorithms for reverse engineering boundary representation models[J].Computer Aided Design,2001,33(11):839-851.
[33]David Cohen Steiner, Pierre Alliez, Mathieu Desbrun. Variational shape approximation [J]. ACM Trans. Graph.,2004,23(3):905-914.
[34]万华根,金小刚,刘刚,等.基于变分隐式曲面的网格融合[J].软件学报,2005,16(11)：2000-2007.
[35]Wu J, Kobbelt L. Structure recovery via hybrid variational surface approximation J]. Computer Graphics Forum,2005,24(2):277-284.
[36]Xavier Decoret, Fredo Durand, Francois Sillion, et al. Billboard clouds for extreme model simplification[J]//In Proceedings of the ACM Siggraph2003,2003:478-489.
[37]冀俊峰,李胜,刘学慧,等.基于参数空间的混合多分辨率绘制[J].软件学报,2004,15(10)：1515-1521.
[38]Wahl R, Guthe M, Klein R. Identifying planes in point-clouds for efficient hybrid rendering[C]//In The 13th Pacific Conference on Computer Graphics and Applications, 2005:56-70.
[39]Natasha Gelfand, Leonidas J. Guibas. Shape segmentation using local slippage analysis[C]//Proceedings of SIGGRAPH'04,2004:214-223.
[40]Hofer M, Odehnal B, Pottmann H, et al.3d shape recognition and reconstruction based on line element geometry[C]//In Tenth IEEE International Conference on Computer Vision,2005,2:1532-1538.
[41]何荣,李际军.逆向工程中特征曲面的识别方法[J].计算机应用,2007,27(8)：2018-2024.
[42]权勇,李文辉,庞云阶.利用表面元素绘制图形的方法[J].吉林大学学报(理学版),2004,42(4)：554-558.
[43]沈旭昆,赵学伟,赵沁平.一种保留特征的网格简化和压缩递进传输方法.计算机研究与发展,2007,44(7)：1097-1104.
[44]Mario Botsch, AndreasWiratanaya, Leif Kobbelt. Efficient high quality rendering of point sampled geometry[C]//In EGRW'02,2002:53-64.
[45]Aravind Kalaiah, Amitabh Varshney. Statistical geometry representation for efficient transmission and rendering[J]. ACM Trans.Graph.,2005,24(2):348-373.
[46]苗兰芳.点模型的表面几何建模和绘制[D].杭州：浙江大学,2005.
[47]Jens Kruger, Jens Schneider, Rudiger Westermann. Duodecim-a structure for point scan compression and rendering[C]//In Proceedings of the Symposium on Point-Based Graphics 2005,2005:129-137.
[48]葛军,姜小明,舒华忠.基于GPU的交互式体数据切割[J].计算机辅助设计与图形学学报,2010,22(3)：428-433.
[49]Hubo E, Mertens T, Haber T, et al. The quantized kdtree:Efficient ray tracing of compressed point clouds[C]//In IEEE Symposium on Interactive Ray Tracing, 2006:105-113.
[50]Erik Hubo, Tom Mertens, Tom Haber, et al. Self-Similarity-Based Compression of Point Clouds, with Application to Ray Tracing[C]//In Eurographics Symposium on Point-Based Graphics,2007:129-137.
[51]Tilo Ochotta, Dietmar Saupe. Compression of point-based 3d models by shape-adaptive wavelet coding of multi-height fields[C]//In Proceedings of the Eurographics Symposium on Point-Based Graphics,2004:103-112.
[52]Tilo Ochotta, Dietmar Saupe. Image-based surface compression[J]. Comput. Graph. Forum,2008,27(6):1647-1663.
[53]Huang Y, Peng J, Jay Kuo, et al. Octree-based progressive geometry coding of point clouds[C]//In Symposium on Point-Based Graphics 2006,2006:34-46.
[54]Schnabel R, Klein R. Octree-based point-cloud compression[C]//In Symposium on Point-Based Graphics 2006,2006:178-189.
[55]陈为,马瑞金,郑文庭,等.基于OBB树的无网格几何数据处理[J].计算机学报,2007,30(2)：330-336.
[56]Waschbusch M, Gross M, Eberhard F, et al. Progressive compression of point-sampled models[C]//In Proceedings of the Eurographics Symposium on Point-Based Graphics, 2004:95-102.
[57]邹万红,陈志杨,潘翔,等.多分辨率层次点模型分片[J].计算机辅助设计与图形学学报,2008,20(1)：1-5.
[58]Stefan Gumhold, Zachi Karni, Martin Isenburg, et al. Predictive point-cloud compression[C]//In Sketch in Visual Proceedings of ACM SIGGRAPH,2005:12-18.
[59]Bruce Merry, Patrick Marais, James Gain. Compression of dense and regular point clouds[J]. Computer Graphics Forum,2006,25(4):709-716.
[60]Mark Pauly, Markus Gross. Spectral processing of point sampled geometry[C]//In Proceedings of SIGGRAPH'01,2001:379-386.
[61]Tamy Boubekeur, Wolfgang Heidrich, Xavier Granier, et al. Volume-surface trees[J]. Computer Graphics Forum,2006,25(3):399-406.
[62]张军,戴霞.一种针对基于图像的3D重建网格的简化算法.计算机工程与应用,2006,42(8)：60-62,86.
[63]张荣华.基于多分辨率遮挡剔除的复杂地形绘制框架的研究.系统仿真学报.2009,21(17)：5462-5466.
[64]Ivanov D, Kuzmin Y. Spatial patches-a primitive for 3d model representation[J]. Computer Graphics Forum,2001,20(11):511-521.
[65]Tilo Ochotta, Stefan Hiller. Hardware rendering of 3d geometry with elevation maps[C]//In SMI'06,2006:10-18.
[66]Tangelder J W, Veltkamp R C.A survey of content based 3d shape retrieval methods[C]//In SMI'04,2004:145-156.
[67]George Vosselman. Fusion of laser scanning data, maps, and aerial photographs for building reconstruction[J]. In Geoscience and Remote Sensing Symposium, 2002,22(3):425-436.
[68]Vivek Verma, Rakesh Kumar, Stephen Hsu.3d building detection and modeling from aerial lidar data[C]//In CVPR'06,2006:2213-2220.
[69]El-Mehalawi M. A database system of mechanical components based on geometric and topological similarity, part ii indexing, retrieval,matching, and similarity assessment[J]. Computer-Aided Design,2003,35(1):95-105.
[70]El-Mehalawi M, Allen. A database system of mechanical components based on geometric and topological similarity. Part i:representation[J]. Computer-Aided Design, 2003,35(1):83-94.
[71]何洋,欧宗瑛.基于局部细节邻接图的指纹匹配算法研究[J].哈尔滨工业大学学报,2005,37(10)：1455-1458.
[72]David McWherter, Mitchell Peabody, Ali C. Shokoufandeh, et al. Database techniques for archival of solid models[C]//In SMA'01,2001:78-87.
[73]Emanoil Zuckerberger, Ayellet Tal, Shymon Shlafman. Polyhedral surface decomposition with applications[J]. Computers and Graphics,2002,26(5):733-743.
[74]Hilaga M, Shinagawa Y, Kohmura T, et al. Topology matching for fully automatic similarity estimation of 3D shapes[C]//In Proceedings of ACM SIGGRAPH'01, 2001:210-221.
[75]Gary K. L. Tam, Rynson W. H. Lau. Deformable model retrieval based on topological and geometric signatures[J]. IEEE TVCG,2007,13(3):470-482.
[76]Valerio Pascucci, Giorgio Scorzelli, Peer-Timo Bremer, et al. Robust on-line computation of reeb graphs:simplicity and speed[J]. ACM Trans. Graph.,2007,26(3): 58-68.
[77]Gunilla Borgefors, Ingela Nystrom, Gabriella Sanniti di Baja. Computing skeletons in three dimensions[J]. Pattern Recognition,1999,32(7):1225-1236.
[78]宋婷,刘文予,刘俊涛.基于骨架树的线性骨架拓扑相似性度量算法[J].红外与激光工程,2005,34(1)：74-79.
[79]Nicu D. Cornea, Deborah Silver, Patrick Min. Curve-skeleton applications[J]. In IEEE Visualization,2005,27(2):13-24.
[80]Andrei Sharf, Thomas Lewiner, Ariel Shamir, et al. On-the-fly curve-skeleton computation for 3d shapes[C]//In Eurographics'07,2007:323-328.
[81]薛峰,丁晓青.基于形状匹配变形模型的三维人脸重构[J].电子学报,2006,34(10)：1896-1899.
[82]Sundar H, Silver D, Gagvani N, et al. Skeleton based shape matching and retrieval[J]. ACM Transactions on Graphics,2003,22(3):181-198.
[83]Lou K, Janyanti S, Iyer N, et al. A reconfigurable 3d engineering shape search system part ii:database indexing, retrieval and clusturing[C]//In DETC,2003:267-278.
[84]Ran Gal, Daniel Cohen. Salient geometric features for partial shape matching and similarity[J]. ACM Transactions on Graphics,2006,25(1):130-150.
[85]Mitra N J, Guibas L, Giesen J, et al. Probabilistic fingerprints for shapes[C]//In Symposium on Geometry Processing,2006:121-130.
[86]Niloy J. Mitra, Leonidas J. Guibas, Mark Pauly. Partial and approximate symmetry detection for 3d geometry[J]. ACM Trans.Graph.,2006,25(3):560-568.
[87]Philip Shilane, Thomas Funkhouser. Selecting distinctive 3D shape descriptors for similarity retrieval[C]//In Shape Modeling International,2006:301-316.
[88]Funkhouser T,Shilane P. Partial matching of 3d shapes with priority-driven search[C]//In Proceedings of ACM SIGGRAPH'06,2006:131-142.
[89]Philip Shilane, Thomas Funkhouser. Distinctive regions of 3D surfaces[J]. ACM Transactions on Graphics,2007,26(2):78-92.
[90]郭凯,郭延文,陈晔.三维曲面的特征描述和特征匹配[J].微计算机信息,2009,25(8)：171-174.
[91]Alexander Berner, Martin Bokeloh, Michael Wand, et al. A graph-based approach to symmetry detection[C]//In Symposium on Volume and Point-Based Graphics,2008:1-8.
[92]刘晓平,吴敏,金灿.采用图分解的特征识别算法研究[J].工程图学学报,2010,22(1)：67-71.
[93]Martin Bokeloh, Alexander Berner, Michael Wand, et al. Symmetry detection using line features[J]. Computer Graphics Forum,2009,28(2):697-706.
[94]Hugues Hoppe, Tony DeRose, Tom Duchamp, et al. Piecewise smooth surface reconstruction[C]//In Proceedings of ACM SIGGRAPH'94,1994:295-302.
[95]Philipp Jenke, Michael Wand, Martin Bokeloh, et al. Bayesian point cloud reconstruction[J]. Comput.Graph. Forum,2006,25(3):379-388.
[96]Jenke P, Kruckeberg B, et al. Surface reconstruction from fitted shape primitives[C]//In 13th International FallWorkshop Vision, Modeling and Visualization,2008:31-40.
[97]Ran Gal, Ariel Shamir, Tal Hassner,et al. Surface reconstruction using local shape priors[C]//In Eurographics SGP,2007:253-262.
[98]杜中义,肖春霞.基于保特征无参数投影的快速几何重建[J].计算机辅助设计与图形学学报,2010,22(7)：1138-1144.
[99]计忠平,刘利刚,王国瑾.基于割角的保特征网格简化算法[J].计算机研究与发展,2006,43(12)：2144-2151.
[100]Michael Kazhdan, Matthew Bolitho, Hugues Hoppe. Poisson surface reconstruction[C]//In Eurographics SGP,2006:61-70.
[101]Alexander Hornung, Leif Kobbelt. Robust reconstruction of watertight 3D models from non-uniformly sampled point clouds without normal information[C]//In Eurographics SGP,2006:41-50.
[102]Victor S. Lempitsky,Yuri Boykov. Global optimization for shape fitting[C]//In CVPR, 2007:1-8.
[103]Curless B, Levoy M. A volumetric method for building complex models from range images[C]//In SIGGRAPH,1996:303-312.
[104]Marcelo Bertalmio, Guillermo Sapiro, Vincent Caselles, et al. Image inpainting[C]//In SIGGRAPH,2000:417-424.
[105]Iddo Drori, Daniel Cohen, Hezy Yeshurun. Fragment-based image completion[J]. ACM Trans. Graph.,2003,22(3):303-312.
[106]路平,陈敏刚,马利庄,等.快速结构化图像修补[J].中国图象图形学报,2010,15(6)：931-935.
[107]Davis J, Marschner S R, Garr M, et al. Filling holes in complex surfaces using volumetric diffusion[C]//In 3DPVT,2002:428-861.
[108]Joan Verdera, Vicent Caselles, Marcelo Bertalmio, et al. Inpainting surface holes[C]//In ICIP (2),2003:903-906.
[109]周世生,孙帮勇.一种基于LevelSet方法的图像修补技术[J].计算机应用研究, 2006,25(2)：258-260.
[110]Ulrich Clarenz, Udo Diewald, Dziuk G, et al. A finite element method for surface restoration with smooth boundary conditions[J]. CAGD,2004,12(1):427-445.
[111]周海,周来水.基于能量优化和细分的参数曲面混合和孔洞填充[J].中国机械工程,2004,15(17)：1515-1519.
[112]Andrei Sharf, Marc Alexa, Daniel Cohen. Context-based surface completion[J]. ACM Trans. on Graph.,2004,23(3):878-887.
[113]Pauly M, Mitra N J, Wallner J, et al. Discovering structural regularity in 3D geometry[J]. ACM Trans. On Graph.,2008,27(3):1-11.
[114]JianningWang, Manuel M. Oliveira. Improved scene reconstruction from range images[J]. Computer Graphics Forum,2002,21(3):521-530.
[115]肖双九,张树生,马利庄,等.基于网格的重构曲面再设计中的模板匹配[J].西北工业大学学报,2003,21(4)：495-498.
[116]Joshua Podolak, Szymon Rusinkiewicz. Atomic Volumes for Mesh Completion[C]//In Eurographics SGP,2005:33-41.
[117]Tao Ju. Robust repair of polygonal models[J]. ACM Trans. Graph., 2004,23(3):888-895.
[118]Peter Liepa. Filling holes in meshes[C]//In Eurographics SGP,2003:200-205.
[119]Stephan Bischoff, Darko Pavic, Leif Kobbelt. Automatic restoration of polygon models[J]. ACM Trans. Graph.,2005,24(4):1332-1352.
[120]李根,陈志杨,张三元,等.网格曲面中复杂孔洞的自动修补算法[J].浙江大学学报(工学版),2007,41(3)：407-411.
[121]Freek Stulp, Fabio Dell'Acqua, Robert Fisher. Reconstruction of surfaces behind occlusions in range images[C]//In 3D Digital Imaging and Modeling,2001:232-239.
[122]Umberto Castellani, Salvatore Livatino, Robert B. Fisher. Improving environment modelling by edge occlusion surface completion[C]//3DPVT,2002:672-675.
[123]Jiaya Jia, Chi-Keung Tang. Inference of segmented color and texture description by tensor voting[J]. IEEE Trans. Pattern Anal.Mach. Intell.,2004,26(6):771-786.
[124]史文中,田岩,黄应,等.基于张量投票的激光扫描数据修复方法[J].系统工程与电子技术,2009,31(11)：2723-2727.
[125]Helmut Pottmann, Stefan Leopoldseder, Michael Hofer, et al. Industrial geometry: recent advances and applications in CAD[J]. Computer-Aided Design,2005,37(7): 751-766.
[126]Gerhard Roth, Martin D. Levine. Extracting geometric primitives[J]. CVGIP:Image Underst.,1993,58(1):1-22.
[127]Mark Pauly, Markus Gross, Leif P. Kobbelt. Efficient simplification of point-sampled surfaces[C]//In Proceedings of IEEE Visualization 2002,2002,163-170.
[128]JainhuaWu, Leif Kobbelt. Optimized sub-sampling of point sets for surface splatting[J]. Computer Graphics Forum,2004,23(3):643-652.
[129]王仁芳,张三元,叶修梓.点模型的几何图像简化法[J].计算机辅助设计与图形学学报,2007,19(8)：1022-1027.
[130]Hugues Hoppe, Tony DeRose, Tom Duchamp, et al. Surface reconstruction from unorganized points[C]//In SIGGRAPH'92,1992:71-78.
[131]Mitra N J, Nguyen A, Guibas L. Estimating surface normals in noisy point cloud data[J]. In special issue of International Journal of Computational Geometry and Applications,2004,14(2):261-276.
[132]Mark Pauly, Niloy J. Mitra, Joachim Giesen, et al. Example-Based 3D Scan Completion[C]//In Eurographics SGP,2005:23-32.
[133]谭晓阳,孙正兴,张福炎.交互式图像检索中的相关反馈技术研究进展[J].南京大学学报(自然科学),2004,40(5)：639-648.
[134]Tamal K. Dey, Samrat Goswami. Provable surface reconstruction from noisy samples[C]//In Proceedings of the 20th ACM Symposium on Computational Geometry, 2004:330-339.
[135]Tamal K. Dey, Gang Li, Jian Sun. Normal estimation for point clouds:A comparison study for a voronoi based method[C]//Symposium on Point-Based Graphics,2005: 39-46.
[136]Shachar Fleishman, Daniel Cohen, Claudio T. Silva. Robust moving least squares fitting with sharp features[J]. ACM Transactions on Graphics,2005,24(3):544-552.
[137]Oztireli C, Guennebaud G, Gross M. Feature preserving point set surfaces based on non-linear kernel regression[J]. Computer Graphics Forum,2009,28(2):493-501.
[138]桑爱军,陈贺新.基于稳健统计的矢量量化器设计算法[J].中国图象图形学报,2003,8(A)(7)：829-833.
[139]徐全元,邵玉斌,鲁莹.基本矢量量化器的性能研究[J].昆明理工大学学报(理工版),2004,29(6)：75-78.
[140]Stewart C V. Bias in robust estimation caused by discontinuities and multiple structures[J]. IEEE Trans. Pattern Analysis and Machine Intelligence, 1997,19(8):818-833.
[141]Alexa M, Behr J, Cohen D, et al. Point set surfaces[C]//IEEE Visualization 2001,2001: 21-28.
[142]Marc Alexa, Johannes Behr, Daniel Cohen, et al. Computing and rendering point set surfaces[J]. IEEE Transactions on Visualization and Computer Graphics, 2003,9(1):3-15.
[143]David Levin. Mesh-independent surface interpolation[C]//Geometric Modeling for Scientific Visualization,2003:37-49.
[144]Nina Amenta, Yong Joo Kil. Defining point-set surfaces[J]. ACM Transactions on Graphics,2004,23(3):264-270.
[145]Gideon Guy, Gerard G. Medioni. Inference of surfaces,3D curves, and junctions from sparse, noisy,3D data[J]. IEEE Trans. Pattern Anal. Mach. Intell,1997,19(11): 1265-1277.
[146]Anders Adamson, Marc Alexa. Approximating and intersecting surfaces from points[C]//In Proceedings of the Eurographics/ACM SIGGRAPH symposium on Geometry processing,2003:230-239.
[147]Marc Alexa, Anders Adamson. On normals and projection operators for surfaces defined by point sets[C]//In Symposium on Point-Based Graphics,2004:149-155.
[148]赵爽,李学军.复杂场景的快速光线跟踪算法[J].计算机工程,2006,32(1)：224-225,272.
[149]Matthias Zwicker, Mark Pauly, Oliver Knoll, et al.Pointshop 3D:an interactive system for point-based surface editing[J]. ACM Transactions on Graphics,2002,21(3): 322-329.
[150]Mark Pauly. Point Primitives for Interactive Modeling and Processing of 3D Geometry[D]. Switzerland:ETH Zurich,2003.
[151]Nina Amenta, Yong J. Kil. The domain of a point set surface[C]//In Symposium on Point-Based Graphics,2004:139-147.
[152]Ravikrishna Kolluri. Provably good moving least squares[C]//In SIGGRAPH'05,2005: 213-312.
[153]Dey T K, Goswami S, Sun T. Extremal surface based projections converge and reconstruct with isotopy[R]. German:Springer,2005.
[154]Tamal K. Dey, Jian Sun. An adaptive MLS surface for reconstruction with guarantees[C]//In EG Symposium on Geometry Processing,2005:43-52.
[155]顾步云,周来水,刘胜兰,等.基于平面散乱点集的曲线重建算法[J].机械科学与技术,2007,26(4)：455-458.
[156]Gael Guennebaud, Markus Gross. Algebraic point set surfaces[J].ACM Transactions on Graphics,2007,26(3):231-239.
[157]Gael Guennebaud, Marcel Germann, Markus H. Gross. Dynamic sampling and rendering of algebraic point set surfaces[J]. Comput.Graph. Forum,2008,27(2): 653-662.
[158]Bolles R C, Fischler M A. A ransac-based approach to model fitting and its application to finding cylinders in range data[C]//In Proceedings of the 7th International Joint Conference on Artificial Intelligence,1981:637-643.
[159]Chaperon T, Goulette F. Extracting cylinders in full 3d data using a random sampling method and the gaussian image[C]//In VMV01,2001:35-42.
[160]Torr P, Zisserman A. MLESAC:A new robust estimator with application to estimating image geometry[J]. Computer Vision and Image Understanding,2000,78(10): 138-156.
[161]Phil Torr, Andrew Zisserman. Robust computation and parametrization of multiple view relations[C]//In ICCV'98,1998:727-735.
[162]Jiri Matas, Ondrej Chum. Randomized RANSAC with ttd test[C]//In Proceedings of the British Machine Vision Conference 2002(BMVC),2002:15-24.
[163]Capel D P. An effective bail-out test for RANSAC consensus scoring[C]//In Proc. British Machine Vision Conf.,2005:629-638.
[164]Jiri Matas, Ondrej Chum. Randomized RANSAC with sequential probability ratio test[C]//In ICCV,2005:1727-1732.
[165]Ondrej Chum, Jiri Matas. Optimal randomized RANSAC[J]. IEEE Trans. Pattern Anal. Mach. Intell,2008,30(8):1472-1482.
[166]Rahul Raguram, Jan-Michael Frahm, Marc Pollefeys. A comparative analysis of RANSAC techniques leading to adaptive realtime random sample consensus[C]//In Computer Vision-ECCV2008,2008:12-18.
[167]Ond n ej Chum, Jiri Matas. Matching with PROSAC-progressive sample consensus[C]//In Proc. of Conference on Computer Vision and Pattern Recognition (CVPR),2005,1:220-226.
[168]程志全.三维几何的流式传输[D].长沙：国防科技大学,2008.
[169]Ben Tordoff, David W. Murray. Guided sampling and consensus for motion estimation[C]//In Computer Vision-ECCV 2002,2002:28-31.
[170]Ondnej Chum, Jiri Matas, Josef Kittler. Locally optimized RANSAC[C]//In DAGM 2003,2003:236-243.
[171]David Nister. Preemptive RANSAC for live structure and motion estimation[J]. Mach. Vision Appl.,2005,16(5):321-329.
[172]Myatt D R, Torr P H S, Nasuto S J, et al. Napsac:High noise, high dimensional robust estimation-it's in the bag[C]//In BMVC,2002:876-885.
[173]Kenneth P. Burnham, David R. Anderson. Model Selection and Multi-Model Inference: A Practical Information-Theoretic Approach[M]. German:Springer,2002.
[174]李云仙,王学仁.带有有序变量的结构方程模型中的模型选择[J].统计与决策,2009,26(14)：15-18.
[175]Akaike H. Information theory and an extension of the maximum likelihood principle[C]//In Second International Symposium on Information Theory,1973: 267-281.
[176]Leontaritis I J, Billings S A. Model selection and validation methods for nonlinear systems[J]. Int. J. Control,1987,45(1):311-341.
[177]Wallace C S, Boulton D M. An information measure for classification[J]. The Computer Journal,1968,11(2):185-194.
[178]Rissanen J. Modeling by shortest data description[J]. Automatica,1978,14(2): 465-471.
[179]Schwarz G. Estimating the dimension of a model[J]. The Annals of Statistics, 1978,8(6):461-464.
[180]Alireza Bab-Hadiashar, Niloofar Gheissari. Range image segmentation using surface selection criterion[J]. IEEE Transactions on Image Processing,2006,15(7): 2006-2018.
[181]Hugues Hoppe, Tony DeRose, Tom Duchamp, et al. Mesh optimization[C]//In SIGGRAPH,1993,27:19-26.
[182]MarkW. Powell, KevinW. Bowyer, Xiaoyi Jiang, et al. Comparing curved-surface range image segmenters[C]//In ICCV'98,1998:286-299.
[183]Xiaoyi Jiang, Horst Bunke. Range image segmentation:Adaptive grouping of edges into regions[C]//In ACCV'98,1998,2:299-306.
[184]Besl P J, Jain R C. Segmentation through variable-order surface fitting[J]. IEEE Trans. Pattern Anal. Mach. Intell.,1998,10(2):167-192.
[185]Heiko Hirschmuller. Stereo processing by semiglobal matching and mutual information[J]. IEEE Trans. Pattern Anal. Mach. Intell.,2008,30(2):328-341.
[186]Anders Adamson, Marc Alexa. Ray tracing point set surfaces[C]//In SMI'03,2003: 272-279.
[187]曹巨明,吾守尔.斯拉木,梁晋,等.移动最小二乘增量式多视点云数据融合算法[J]. 西安交通大学学报,2009,43(9)：46-50.
[188]Adelson E H, Burt P J. Image data compression with the laplacian pyramid[C]//In Pattern Recognition and Image Processing,1981:218-223.
[189]Cohen A, Daubechies I, Feauveau J C. Biorthogonal bases for compactly supported wavelets[J]. Comm. Pure & Applied Math,1997,45(2):485-560.
[190]Gersho A, Gray R M. Vector Quantization and Signal Compression[M]. Boston: Kluwer Academic,1999.
[191]陈雨时,张晔,谷延锋.基于特征选择的高光谱图像快速矢量量化算法[J].哈尔滨工业大学学报,2007,39(11)：1748-1750.
[192]Andrew C. Beers, Maneesh Agrawala, Navin Chaddha. Rendering from compressed textures[C]//In SIGGRAPH'06,2006,373-378.
[193]Marc Levoy, Pat Hanrahan. Light field rendering[C]//In SIGGRAPH'96,1996:31-42.
[194]Jens Schneider, RudigerWestermann. Compression domain volume rendering[C]//In VIS'03,2003,39-52.
[195]Linde Y, Buzo A, Gray R M. An algorithm for vector quantizer design[J]. IEEE Trans, on Communications,1990,28(1):84-95.
[196]Kanungo T, Mount D, Netanyahu N, et al. An efficient k-means clustering algorithm: Analysis and implementation[J]. IEEE Transactions on Pattern Analysis and MachineIntelligence,2002,24(7):881-892.
[197]Alsabti K, Ranka S, Singh V. An efficient space-partitioning based algorithm for the k-means clustering[J]. Lecture Notes in Computer Science,1999,1574:355-359.
[198]Dan Pelleg, Andrew W. Moore. Accelerating exact k-means algorithms with geometric reasoning[C]//In KDD,1999,277-281.
[199]George Kollios, Dimitrios Gunopulos, Nick Koudas, et al. Efficient biased sampling for approximate clustering and outlier detection in large data sets[J]. IEEE Trans. Knowl. Data Eng.,2003,15(5):1170-1187.
[200]Gereon Frahling, Christian Sohler. A fast k-means implementation using corsets[C]//In SCG'06,2006:135-143.
[201]张玉伦,余宁梅,王冬芳.一种压缩比自适应的快速矢量量化算法[J].计算机工程与应用,2006,23(19)：44-46,118.
[202]Ratko Orlandic, Ying Lai, Wai Gen Yee. Clustering highdimensional data using an efficient and effective data space reduction[C]//In Proceedings of the 2005 ACM CIKM International Conference on Information and Knowledge Management,2005,201-208.
[203]李晔,崔慧娟,唐昆.加权平方误差测度下的快速矢量量化算法[J].清华大学学报 (自然科学版),2007,47(7)：1130-1132.
[204]Kevin Beyer, Jonathan Goldstein, Raghu Ramakrishnan, et al. When is "nearest neighbor" meaningful?[J]. Lecture Notes in Computer Science,1999,1540:217-235.
[205]Charu C. Aggarwal, Alexander Hinneburg, Daniel A. Keim. On the surprising behavior of distance metrics in high dimensional space[J]. Lecture Notes in Computer Science,2006,1973:420-436.
[206]Timothy Mattson, Beverly Sanders, Berna Massingill. Patterns for Parallel Programming[M]. Amsterdam:Addison-Wesley Longman,2004.
[207]Witten I, Neal R, Cleary J. Arithmetic coding for data compression[J]. Communications of the ACM,1997,30:520-541.
[208]Mario Botsch, Leif Kobbelt. High-quality point-based rendering on modern gpus[C]//In PG'03,2003:335-346.
[209]Grossman J P, William J. Dally. Point sample rendering[M]. German:Springer,1998.
[210]Stephen A. Cook. The complexity of theorem-proving procedures[C]//In STOC'71, 1971:151-158.
[211]Vladimir Kolmogorov, Yuri Boykov. What metrics can be approximated by geo-cuts, or global optimization of length/area and flux[C]//In ICCV,2005:564-571.
[212]孙晓鹏,李华.三维网格模型的分割及应用技术综述[J].计算机辅助设计与图形学学报,2005,17(8)：1647-1655.
[213]Yuri Boykov, Vladimir Kolmogorov. Computing geodesics and minimal surfaces via graph cuts[C]//In ICCV,2003:26-33.
[214]Kolmogorov V, Zabin R. What energy functions can be minimized via graph cuts?[J]. IEEE Trans. on Pattern Anal. and Mach.Intell.,2004,26(2):147-159.
[215]William E. Lorensen, Harvey E. Cline. Marching cubes:A high resolution 3d surface construction algorithm[J]. SIGGRAPH,1997,21(4):163-169.
[216]Leif P. Kobbelt, Mario Botsch, Ulrich Schwanecke, et al. Feature sensitive surface extraction from volume data[C]//In SIGGRAPH,2004:57-66.
[217]Richard Szeliski, Ramin Zabih, Daniel Scharstein, et al. A comparative study of energy minimization methods for markov random fields with smoothness-based priors[J]. IEEE Trans. Pattern Anal. Mach. Intell.,2008,30(6):1068-1080.
[218]Yuri Boykov, Olga Veksler, Ramin Zabih. Fast approximate energy minimization via graph cuts[J]. IEEE Trans. Pattern Anal. Mach. Intell.,2001,23(11):1222-1239.
[219]张慧杰,孙吉贵,刘雪洁,等.大规模三维地形可视化算法研究进展[J].计算机科学,2007,34(3)：10-16.
[220]李宏华,程志全,李俊,等.一种基于深度域SIFT特征建立网格对应关系的算法[J].系统仿真学报,2009,21(1)：15-18.
[221]Toby P. Breckon, Robert B. Fisher. Plausible 3D colour surface completion using non-parametric techniques[J]. Lecture Notes in Computer Science,2007,3604: 102-120.
[222]李晋江,张彩明,范辉,等.基于分形的图像修复算法[J].电子学报,2010,38(10)：2430-2435.
[223]Kolev K, Klodt M, Brox T, et al. Continuous global optimization in multiview 3d reconstruction[J]. International Journal of Computer Vision,2010,84(1):80-96.
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |