Problem 45259. Build edges list
Input T is a triangulation connectivity indices list (triplet list of indices -positive integers-, each index refering to a vertex number in a corresponding vertices list).
The purpose of this function is to query the list E of all the edges.
For instance if T = [1, 2, 3; 4, 5, 6; 7, 8, 9], then the output of the function must be E = [1, 2; 1, 3; 2, 3; 4, 5; 4, 6; 5, 6; 7, 8; 7, 9; 8, 9] (all the 3 possible combination of the 3 vertices of a triangle / row, for every triangle / row of the list).
Hypothesis on output E :
- size(E) = [N, 2], with N the number of edges
- E doesn't need to be ordered neither following dimension 1 (rows) nor dimension 2 (columns), but must not contain duplicated edges
- Edges are symmetric : [e1, e2] is the same edge as [e2, e1]
- Every indices are positive, distinct integers.
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers21
Suggested Problems
-
27609 Solvers
-
10266 Solvers
-
Back to basics 23 - Triangular matrix
1003 Solvers
-
925 Solvers
-
SatCom #1: Wavelength of an electomagnetic wave
212 Solvers
More from this Author9
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!