Neighboring triangles of each vertex

  • Thread starter Thread starter ria91
  • Start date Start date
  • Tags Tags
    Triangles Vertex
AI Thread Summary
To find neighboring triangles of each vertex in an unstructured triangular grid, a common approach is to use a double loop method. This involves iterating through each triangle and checking for shared vertices with other triangles, resulting in a runtime complexity of O(n^2). If the data structure consists solely of a list of triangles, this method effectively identifies neighboring triangles by comparing vertices.
ria91
Messages
3
Reaction score
0
I have a mesh with unstructured triangular grid.
I need to find neighboring triangles of each vertex. How can I do it?
Thanks before :D
 
Physics news on Phys.org
Hey ria91.

What exactly is the data structure like? If its just a list of triangles then do a double loop (runtime O(n^2)) where you fix one triangle and get all the other triangles that have at least one similar vertex.
 

Similar threads

LaTeX Creating a right triangle in Cartesian plane in LaTeX
Replies
1
Views
2K
B A triangle problem: Prove that |AC|+|AB|=|PR|+|PQ| given some constraints
Replies
13
Views
2K
I Finding vertex of a 3D Triangle on a Plane
Replies
3
Views
2K
Feynman diagram with TikZ-Feynman
Replies
8
Views
6K
Four Dimensional Bowling Alley & Billiard Hall
Replies
3
Views
1K
Area of interior triangle of pyramid normal to a side length
Replies
3
Views
1K
Is the Charge Conservation Correct in This Meson Decay Feynman Diagram?
Replies
8
Views
945
I Electroweak Feynman Rules: Confusion about the photon-W boson interaction term
Replies
2
Views
2K
Prove the sums of the angles of any given triangle = 180°
Replies
12
Views
3K
A Pauli–Villars ghost fields?
Replies
8
Views
718

Hot Threads

Recent Insights

Back
Top