BrepEdgeList

References
Provides access to all the Edges in a Brep object.

Properties

Count

#Since v5.0
Gets the number of brep edges.
public int Count { get; }

Indexers

this[]

#
Gets the BrepEdge at the given index. The index must be valid or an IndexOutOfRangeException will be thrown.
public BrepEdge this[
index
Index of BrepEdge to access.
] { get; }
The BrepEdge at [index].
IndexOutOfRangeExceptionThrown when the index is invalid.

Methods

Add

#Since v5.4
Create and add a new edge to this list
public BrepEdge Add(
startVertex,
endVertex,
curve3dIndex,
edgeTolerance
)

Add

#Since v5.4
Create and add a new edge to this list
public BrepEdge Add(
startVertex,
endVertex,
curve3dIndex,
subDomain,
edgeTolerance
)

Add

#Since v5.4
Create and add a new edge to this list
public BrepEdge Add(
curve3dIndex
)

Add

#Since v5.6
Create and add a new edge to this list
public BrepEdge Add(
startVertexIndex,
endVertexIndex,
curve3dIndex,
edgeTolerance
)

Add

#Since v5.6
Create and add a new edge to this list
public BrepEdge Add(
startVertexIndex,
endVertexIndex,
curve3dIndex,
subDomain,
edgeTolerance
)

GetEnumerator

#Since v5.0
Gets an enumerator that visits all edges.
public IEnumerator<BrepEdge> GetEnumerator()
The enumerator.

MergeAllEdges

#Since v6.23
Merges all possible Brep edges. Edges across kinks cannot be merged. A pair of adjacent edges in a Brep are mergeable if the angle between them is less than tolerance and the valence of the shared vertex is 2.
public int MergeAllEdges(
angleTolerance
The maximum allowable difference of angle in radian between adjacent edges that can be merged.
)
The number of edges merged.

MergeEdge

#Since v6.23
Merge adjacent edges to a specified edge recursively. A pair of adjacent edges in a Brep are mergeable if the angle between them is less than tolerance and the valence of the shared vertex is 2.
public int MergeEdge(
edgeIndex,
>Index of edge to merge.
angleTolerance
The maximum allowable difference of angle in radian between adjacent edges that can be merged.
)
The number of edges merged.

RemoveNakedMicroEdges

#Since v7.0
Finds any naked edges with the same start and end vertex and an arc-length less than tolerance and attempts to remove them by removing trims and extending the adjacent to meet.
public int RemoveNakedMicroEdges(
tolerance,
The tolerance. When in doubt, use the document's model absolute tolerance.
cleanUp
If true, then the method cleans up the Brep by setting tolerances, boxes, flags, and then compacts. If false, then the caller should do this at some point.
)
The number of naked micro edges that were removed.

RemoveNakedMicroEdges

#Since v7.0
Finds any naked edges with the same start and end vertex and an arc-length less than tolerance and attempts to remove them by removing trims and extending the adjacent to meet.
public int RemoveNakedMicroEdges(
tolerance
The tolerance. When in doubt, use the document's model absolute tolerance.
)
The number of naked micro edges that were removed.

SplitEdgeAtParameters

#Since v5.0
Splits an edge at the specified parameters.
public int SplitEdgeAtParameters(
edgeIndex,
The index of the edge to be addressed.
edgeParameters
The parameter along that edge.
)
Remarks: This function leaves deleted stuff in the brep. Call Brep.Compact() to remove deleted stuff.
Number of splits applied to the edge.

SplitKinkyEdge

#Since v5.0
Splits the edge into G1 pieces.
public bool SplitKinkyEdge(
edgeIndex,
Index of edge to test and split.
kinkToleranceRadians
The split tolerance in radians.
)
Remarks: This function leaves deleted stuff in the brep. Call Brep.Compact() to remove deleted stuff.
true if successful.
Explicit

IEnumerable.GetEnumerator

#Since v5.0
Gets the same enumerator as GetEnumerator().
IEnumerator IEnumerable.GetEnumerator()
The enumerator.