BrepEdgeList

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

Properties

Count

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

Indexers

this[]

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

Methods

Add

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

Add

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

Add

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

Add

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

Add

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

GetEnumerator

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

MergeAllEdges

#Since v6.23
public int MergeAllEdges(double angleTolerance)
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.
angleTolerance (double)The maximum allowable difference of angle in radian between adjacent edges that can be merged.
The number of edges merged.

MergeEdge

#Since v6.23
public int MergeEdge(int edgeIndex, double angleTolerance)
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.
edgeIndex (int)>Index of edge to merge.
angleTolerance (double)The maximum allowable difference of angle in radian between adjacent edges that can be merged.
The number of edges merged.

RemoveNakedMicroEdges

#Since v7.0
public int RemoveNakedMicroEdges(double tolerance, bool cleanUp)
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.
tolerance (double)The tolerance. When in doubt, use the document's model absolute tolerance.
cleanUp (bool)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
public int RemoveNakedMicroEdges(double tolerance)
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.
tolerance (double)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
public int SplitEdgeAtParameters(int edgeIndex, IEnumerable<double> edgeParameters)
Splits an edge at the specified parameters.
Remarks: This function leaves deleted stuff in the brep. Call Brep.Compact() to remove deleted stuff.
edgeIndex (int)The index of the edge to be addressed.
edgeParameters (IEnumerable<double>)The parameter along that edge.
Number of splits applied to the edge.

SplitKinkyEdge

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

IEnumerable.GetEnumerator

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