Skip to content

vertex_edge_adjacency #172

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open

vertex_edge_adjacency #172

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
55df4b7
feat: add new function mesh/vertex_edge_adjacency.m
yDF8EPJN8 Jul 4, 2025
6b675e8
fix(vertex_triangle_adjacency): fix documentation inconsistency
yDF8EPJN8 Jul 4, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
16 changes: 16 additions & 0 deletions mesh/vertex_edge_adjacency.m
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,16 @@
function VE = vertex_edge_adjacency(E)
%VERTEX_EDGE_ADJACENCY Build a vertex-edge adjacency matrix for a triangle
% mesh.
%
% Input:
% E #E x 2 list of edge indices
% Output:
% VE #E x #V sparse matrix, VE(i,j) is 1 iff vertex j is in edge i
%
% Example:
% [EF,EI,uE,EMAP] = edge_flaps(F);
% VE = vertex_edge_adjacency(uE);
i = (1:size(E,1))';
j = E;
VE = sparse([i i],j,1);
end
2 changes: 1 addition & 1 deletion mesh/vertex_triangle_adjacency.m
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -7,7 +7,7 @@
% Input:
% F #F x 3 list of face indices
% Output:
% VT #F x #V sparse matrix, VT(i,j) is 1 iff vertex i is in face j
% VT #F x #V sparse matrix, VT(i,j) is 1 iff vertex j is in face i

i = (1:size(F,1))';
j = F;
Expand Down