11 lines
326 B
C#
11 lines
326 B
C#
|
using Microsoft.Msagl.Core.DataStructures;
|
|||
|
|
|
|||
|
|
namespace Microsoft.Msagl.Routing.ConstrainedDelaunayTriangulation {
|
|||
|
|
internal class CdtFront {
|
|||
|
|
RbTree<CdtSite> front = new RbTree<CdtSite>((a, b) => a.Point.X.CompareTo(b.Point.X));
|
|||
|
|
|
|||
|
|
public CdtFront(CdtSite p_1, CdtSite p0, CdtSite p_2) {
|
|||
|
|
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
}
|