|
1 | 1 | { |
2 | | - "name": "RANSACGlobalRegistration", |
3 | | - "nickname": "RANSACGReg", |
| 2 | + "name": "CloudToCloudDistance", |
| 3 | + "nickname": "C2CDistance", |
4 | 4 | "category": "diffCheck", |
5 | | - "subcategory": "Registrations", |
6 | | - "description": "Register two point clouds together with a feature matching based on RANSAC.", |
| 5 | + "subcategory": "Analysis", |
| 6 | + "description": "Computes the distance between each point in the source point cloud and its nearest neighbour in thr target point cloud.", |
7 | 7 | "exposure": 4, |
8 | 8 | "instanceGuid": "805911b9-7ea9-4bbf-be34-00f9f225b9b3", |
9 | 9 | "ghpython": { |
|
13 | 13 | "marshalOutGuids": true, |
14 | 14 | "iconDisplay": 2, |
15 | 15 | "inputParameters": [ |
16 | | - { |
17 | | - "name": "i_recompute", |
18 | | - "nickname": "i_recompute", |
19 | | - "description": "Connect a button to recompute the registration.", |
20 | | - "optional": true, |
21 | | - "allowTreeAccess": true, |
22 | | - "showTypeHints": true, |
23 | | - "scriptParamAccess": "item", |
24 | | - "wireDisplay": "default", |
25 | | - "sourceCount": 0, |
26 | | - "typeHintID": "bool" |
27 | | - }, |
28 | 16 | { |
29 | 17 | "name": "i_cloud_source", |
30 | 18 | "nickname": "i_cloud_source", |
|
50 | 38 | "typeHintID": "pointcloud" |
51 | 39 | }, |
52 | 40 | { |
53 | | - "name": "i_radius_kd_search", |
54 | | - "nickname": "i_radius_kd_search", |
55 | | - "description": "The radius used to search for neighbors in the KDTree.it is expressed relative to the point cloud size (0.01 means radiusKDTreeSearch = 1% of maxSize(pointCloud). It is used for the calculation of FPFHFeatures.", |
56 | | - "optional": false, |
57 | | - "allowTreeAccess": true, |
58 | | - "showTypeHints": true, |
59 | | - "scriptParamAccess": "item", |
60 | | - "wireDisplay": "default", |
61 | | - "sourceCount": 0, |
62 | | - "typeHintID": "float" |
63 | | - }, |
64 | | - { |
65 | | - "name": "i_neighbours_kd_search", |
66 | | - "nickname": "i_neighbours_kd_search", |
67 | | - "description": "The maximum number of neighbors to search for in the KDTree. It is used for the calculation of FPFHFeatures. A higher value will result in heavier computation but potentially more precise.", |
68 | | - "optional": false, |
69 | | - "allowTreeAccess": true, |
70 | | - "showTypeHints": true, |
71 | | - "scriptParamAccess": "item", |
72 | | - "wireDisplay": "default", |
73 | | - "sourceCount": 0, |
74 | | - "typeHintID": "int" |
75 | | - }, |
76 | | - { |
77 | | - "name": "i_max_corrspondence_dist", |
78 | | - "nickname": "i_max_corrspondence_dist", |
79 | | - "description": "The maximum distance between correspondences. A higher value will result in more correspondences, but potentially include wrong ones.", |
| 41 | + "name": "i_signed_flag", |
| 42 | + "nickname": "i_signed_flag", |
| 43 | + "description": "whether to take normals into account", |
80 | 44 | "optional": false, |
81 | | - "allowTreeAccess": true, |
| 45 | + "allowTreeAccess": false, |
82 | 46 | "showTypeHints": true, |
83 | 47 | "scriptParamAccess": "item", |
84 | 48 | "wireDisplay": "default", |
85 | 49 | "sourceCount": 0, |
86 | 50 | "typeHintID": "float" |
87 | | - }, |
88 | | - { |
89 | | - "name": "is_t_estimate_pt2pt", |
90 | | - "nickname": "is_t_estimate_pt2pt", |
91 | | - "description": "If true it deforms the cloud to match. The transformation estimation method to use. By default, it uses a point to point transformation estimation. If true it will scale and deform the cloud.", |
92 | | - "optional": false, |
93 | | - "allowTreeAccess": true, |
94 | | - "showTypeHints": true, |
95 | | - "scriptParamAccess": "item", |
96 | | - "wireDisplay": "default", |
97 | | - "sourceCount": 0, |
98 | | - "typeHintID": "bool" |
99 | | - }, |
| 51 | + } |
| 52 | + ], |
| 53 | + "outputParameters": [ |
100 | 54 | { |
101 | | - "name": "i_ransac_n", |
102 | | - "nickname": "i_ransac_n", |
103 | | - "description": "The number of points to sample in the source point cloud. A higher value can result in a more precise transformation, but will take more time to compute.", |
| 55 | + "name": "o_distance", |
| 56 | + "nickname": "o_distance", |
| 57 | + "description": "list of calculated distances for each point of the source.", |
104 | 58 | "optional": false, |
105 | | - "allowTreeAccess": true, |
106 | | - "showTypeHints": true, |
107 | | - "scriptParamAccess": "item", |
108 | | - "wireDisplay": "default", |
109 | 59 | "sourceCount": 0, |
110 | | - "typeHintID": "int" |
| 60 | + "graft": false |
111 | 61 | }, |
112 | 62 | { |
113 | | - "name": "i_checker_dist", |
114 | | - "nickname": "i_checker_dist", |
115 | | - "description": "The maximum distance between correspondances in the FPFH space before testing a RanSaC model. It is exprimed in relative values (it is scaled by the size of the bounding box of the poinnt cloud).", |
| 63 | + "name": "o_mse", |
| 64 | + "nickname": "o_mse", |
| 65 | + "description": "average squared difference between source and target.", |
116 | 66 | "optional": false, |
117 | | - "allowTreeAccess": true, |
118 | | - "showTypeHints": true, |
119 | | - "scriptParamAccess": "item", |
120 | | - "wireDisplay": "default", |
121 | 67 | "sourceCount": 0, |
122 | | - "typeHintID": "float" |
| 68 | + "graft": false |
123 | 69 | }, |
124 | 70 | { |
125 | | - "name": "i_similarity_threshold", |
126 | | - "nickname": "i_similarity_threshold", |
127 | | - "description": "The threshold for the ransac check based on edge length to consider a model as inlier. A higher value will be stricter, discarding more ransac models.", |
| 71 | + "name": "o_max_deviation", |
| 72 | + "nickname": "o_max_deviation", |
| 73 | + "description": "max deviation between source and target", |
128 | 74 | "optional": false, |
129 | | - "allowTreeAccess": true, |
130 | | - "showTypeHints": true, |
131 | | - "scriptParamAccess": "item", |
132 | | - "wireDisplay": "default", |
133 | 75 | "sourceCount": 0, |
134 | | - "typeHintID": "float" |
| 76 | + "graft": false |
135 | 77 | }, |
136 | 78 | { |
137 | | - "name": "i_max_iterations", |
138 | | - "nickname": "i_max_iterations", |
139 | | - "description": "The maximum number of iterations to run the Ransac algorithm. A higher value will take more time to compute but increases the chances of finding a good transformation.", |
| 79 | + "name": "o_min_deviation", |
| 80 | + "nickname": "o_min_deviation", |
| 81 | + "description": "min deviation between source and target", |
140 | 82 | "optional": false, |
141 | | - "allowTreeAccess": true, |
142 | | - "showTypeHints": true, |
143 | | - "scriptParamAccess": "item", |
144 | | - "wireDisplay": "default", |
145 | 83 | "sourceCount": 0, |
146 | | - "typeHintID": "int" |
| 84 | + "graft": false |
147 | 85 | }, |
148 | 86 | { |
149 | | - "name": "i_confidence_threshold", |
150 | | - "nickname": "i_confidence_threshold", |
151 | | - "description": "The threshold for the convergence criteria of the ransac models. A higher value will be stricter, discarding more ransac models.", |
152 | | - "optional": false, |
153 | | - "allowTreeAccess": true, |
154 | | - "showTypeHints": true, |
155 | | - "scriptParamAccess": "item", |
156 | | - "wireDisplay": "default", |
157 | | - "sourceCount": 0, |
158 | | - "typeHintID": "float" |
159 | | - } |
160 | | - ], |
161 | | - "outputParameters": [ |
162 | | - { |
163 | | - "name": "o_x_form", |
164 | | - "nickname": "o_x_form", |
165 | | - "description": "The computed transformation.", |
| 87 | + "name": "o_std_deviation", |
| 88 | + "nickname": "o_std_deviation", |
| 89 | + "description": "standard deviation between source and target.", |
166 | 90 | "optional": false, |
167 | 91 | "sourceCount": 0, |
168 | 92 | "graft": false |
|
0 commit comments