Cloud data modelling employing a unified, non-redundant triangular mesh

被引:94
作者
Sun, W
Bradley, C [1 ]
Zhang, YF
Loh, HT
机构
[1] Univ Victoria, Dept Engn Mech, Victoria, BC V8W 3P6, Canada
[2] Natl Univ Singapore, Dept Mech & Prod Engn, Singapore 117548, Singapore
关键词
triangulation; polyhedral mesh; reverse engineering;
D O I
10.1016/S0010-4485(00)00088-9
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
This paper describes an application of error-based triangulation to very large sets of three-dimensional (3D) data. The algorithm is suitable for processing data collected by machine vision systems, co-ordinate measuring machines or laser-based range sensors. The algorithm models the large data sets, termed cloud data, using a unified, non-redundant triangular mesh. This is accomplished from the 3D data points in two steps. Firstly, an initial data thinning is performed, to reduce the copious data set sizer employing 3D spatial filtering. Secondly, the triangulation commences utilising a set of heuristic rules, from a user defined seed point. The triangulation algorithm interrogates the local geometric and topological information inherent in the cloud data points. The spatial filtering parameters are extracted from the cloud data set, by a series of local surface patches, and the required spatial error between the final triangulation and the cloud data. Two procedures are subsequently employed to enhance the mesh: (i) the edges of mesh triangles are adjusted to produce a mesh containing approximately equilateral triangles; and (ii) mesh edges are aligned with the boundaries present on the object to minimise smoothing of naturally occurring features. Case studies are presented that illustrate the efficacy of the technique for rapidly constructing a geometric model from 3D digitised data. (C) 2001 Published by Elsevier Science Ltd.
引用
收藏
页码:183 / 193
页数:11
相关论文
共 22 条
[1]  
Bradley C, 1999, PROC SPIE, V3832, P26
[2]   SOLID-MODEL GENERATION FROM MEASURED POINT DATA [J].
CHIVATE, PN ;
JABLOKOW, AG .
COMPUTER-AIDED DESIGN, 1993, 25 (09) :587-600
[3]   TRIANGULATION OF SCATTERED DATA IN 3D SPACE [J].
CHOI, BK ;
SHIN, HY ;
YOON, YI ;
LEE, JW .
COMPUTER-AIDED DESIGN, 1988, 20 (05) :239-248
[4]   DeWall:: A fast divide and conquer Delaunay triangulation algorithm in Ed [J].
Cignoni, P ;
Montani, C ;
Scopigno, R .
COMPUTER-AIDED DESIGN, 1998, 30 (05) :333-341
[5]  
Curless B., 1996, Computer Graphics Proceedings. SIGGRAPH '96, P303, DOI 10.1145/237170.237269
[6]  
Eck M., 1995, PROCEEDING SIGGRAPH, P82
[7]  
FANG TP, 1995, IEEE COMPUT GRAPH, V15, P62
[8]   DARBOUX FRAMES, SNAKES, AND SUPER-QUADRICS - GEOMETRY FROM THE BOTTOM UP [J].
FERRIE, FP ;
LAGARDE, J ;
WHAITE, P .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1993, 15 (08) :771-784
[9]  
FILIP D, 2000, COMPUT AIDED GEOM D, V3, P295
[10]   SEGMENTATION AND CLASSIFICATION OF RANGE IMAGES [J].
HOFFMAN, R ;
JAIN, AK .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1987, 9 (05) :608-620