Utility.GetEdgesWithoutDuplicates (IList<IndexTriangle>, Int32, out LinkedList<SharedEdge>()) Method
Public Shared Function GetEdgesWithoutDuplicates( _
ByVal polygons As IList(Of IndexTriangle), _
ByVal numVerts As Integer, _
ByRef edgesPerVertex As LinkedList(Of SharedEdge)() _
) As Integer
This language is not supported or no code example is available.
public static int GetEdgesWithoutDuplicates(
IList<IndexTriangle> polygons,
int numVerts,
out LinkedList<SharedEdge>[] edgesPerVertex
)
This language is not supported or no code example is available.
Parameters
- polygons
- IList<IndexTriangle>
Polygon list definition, each row can have independently 3 or 4 indices.
- numVerts
- int
Number of vertices in the mesh
- edgesPerVertex
- LinkedList<SharedEdge>[]
The edges per each vertex
Return Value
intThe number of edges.
The entry 'i' of the edgesPerVertex array is a LinkedList<T> of SharedEdge for all vertices connected to 'i'
whose index is greater than 'i'.
The SharedEdge.Dad is -1 if the edge has only one adjacent triangle (that is stored in SharedEdge.Mum).