How can I find the set of vertices of hexagons which are adjacent to a random point?
2 次查看(过去 30 天)
显示 更早的评论
I have a set of hexagons whose blue coordinates are known:
I have a random red point and I need to know the 4 (in some cases it would be 3) points which are immediately adjacent to it. These points are contained in the black box shown for illustration.
I tried to sort the blue points by measuring distances but I keep getting extra points (shown by black arrows) or missing the required points.
采纳的回答
Matt J
2024-8-13
编辑:Matt J
2024-8-13
hex=[ 0 -1.0000
-0.8660 -0.5000
-0.8660 0.5000
0 1.0000
0.8660 0.5000
0.8660 -0.5000
1.7321 -1.0000
0.8660 -0.5000
0.8660 0.5000
1.7321 1.0000
2.5981 0.5000
2.5981 -0.5000
3.4641 -1.0000
2.5981 -0.5000
2.5981 0.5000
3.4641 1.0000
4.3301 0.5000
4.3301 -0.5000] %hexagon points
hex=unique(hex,'rows');
given=[1.2,-1];
pts=[given;hex];
DT=delaunayTriangulation(pts);
CL=DT.ConnectivityList;
idx=any(CL==1,2);
idx=setdiff(CL(idx,:),1);
nearest=pts(idx,:)
plot(hex(:,1),hex(:,2),'x', nearest(:,1),nearest(:,2),'o',given(:,1),given(:,2),'s');
legend Vertices Nearest Given
axis equal padded
更多回答(1 个)
Mario Malic
2024-8-10
Hi,
here's some code to give you an idea
X = rand(3,3);
Y = rand(3,3);
pts = [X(:), Y(:)];
distance = squareform(pdist(pts)); % symmetric matrix that contains distances between points
% distance between pt3 and all other pts
[~, idx] = sort(distance(:, 3));
closestPts = idx(2:5) % first one is distance between pt3 and pt3 so we ignore that
2 个评论
另请参阅
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!