PCfindNearestNeighbors
by Tim C. Lueth, SG-Lib Toolbox: SolidGeometry 5.6 - VL/Vertices/PC/Clouds
Introduced first in SolidGeometry 4.3, Creation date: 2018-10-08, Last change: 2025-09-14
returns for a pointcloud a list of direct neighbors, distances and areas
Description
Since the nearest neighbor search is time consuming, it makes sense to reduce the number of points to less than 10000.
uses findNearestNeighbors from class pointCLoud.
See Also:
Example Illustration
Syntax
[NIL,DIL,OA,AL,pc]=PCfindNearestNeighbors(pc,[ind,nr,al])
Input Parameter
pc: | | point cloud or vertex list |
ind: | | indices' default is all |
nr: | | number of neighbors; default is 3 |
al: | | minimal angle for triangles; default is zero |
Output Parameter
NIL: | | Neighbor index list [n x nr] = Facet list for nr==3 |
DIL: | | Neighbor distance list [n x nr] |
OA: | | point cloud |
AL: | | Area list |
pc: | | point cloud |
Examples
loadweb IntelRealsense.mat % loads vertex lists from RS300 and RS415
VLdownsample(VL_D415a,30); NVL=ans; whos('VL_D415a'), whos ('NVL')
PCfindNearestNeighbors(NVL);
Copyright 2018-2025 Tim C. Lueth. All rights reserved. The code is the property of Tim C. Lueth and may not be redistributed or modified without explicit written permission. This software may be used free of charge for academic research and teaching purposes only. Commercial use, redistribution, modification, or reverse engineering is strictly prohibited. Access to source code is restricted and granted only under specific agreements. For licensing inquiries or commercial use, please contact: Tim C. Lueth
Last html export of this page out of FM database by TL: 2025-09-21