Try combining (partially overlapping) meshes.
This function effectively works on the vertex graph and will not produce meaningful faces.
Source code in navis/meshes/operations.py
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215 | def combine_meshes(meshes, max_dist='auto'):
"""Try combining (partially overlapping) meshes.
This function effectively works on the vertex graph and will not produce
meaningful faces.
"""
# Sort meshes by size
meshes = sorted(meshes, key=lambda x: len(x.vertices), reverse=True)
comb = tm.Trimesh(meshes[0].vertices.copy(), meshes[0].faces.copy())
comb.remove_unreferenced_vertices()
if max_dist == 'auto':
max_dist = comb.edges_unique_length.mean()
for m in config.tqdm(meshes[1:], desc='Combining',
disable=config.pbar_hide,
leave=config.pbar_leave):
# Generate a new up-to-date tree
tree = KDTree(comb.vertices)
# Offset faces
vertex_offset = comb.vertices.shape[0]
new_faces = m.faces + vertex_offset
# Find vertices that can be merged - note that we are effectively
# zippig the two meshes by making sure that each vertex can only be
# merged once
dist, ix = tree.query(m.vertices, distance_upper_bound=max_dist)
merged = set()
# Merge closest vertices first
for i in np.argsort(dist):
# Skip if no more within-distance
if dist[i] >= np.inf:
break
# Skip if target vertex has already been merged
if ix[i] in merged:
continue
# Remap this vertex
new_faces[new_faces == (i + vertex_offset)] = ix[i]
# Track that target vertex has already been seen
merged.add(ix[i])
# Merge vertices and faces
comb.vertices = np.append(comb.vertices, m.vertices, axis=0)
comb.faces = np.append(comb.faces, new_faces, axis=0)
# Drop unreferenced vertices (i.e. those that were remapped)
comb.remove_unreferenced_vertices()
return comb
|