Class CDTDecomposer

Namespace: Alis.Core.Physic.Common.Decomposition

Assembly: Alis.dll

2D constrained Delaunay triangulation algorithm. Based on the paper "Sweep-line algorithm for constrained Delaunay triangulation" by V. Domiter and and B. Zalik Properties:

Creates triangles with a large interior angle.
Supports holes
Generate a lot of garbage due to incapsulation of the Poly2Tri library.
Running time is O(n^2), n = number of vertices.
Does not care about winding order. Source: http://code.google.com/p/poly2tri/

internal static class CDTDecomposer

Inheritance

object

CDTDecomposer

Inherited Members

object.Equals(object?)

object.Equals(object?, object?)

object.GetHashCode()

object.GetType()

object.MemberwiseClone()

object.ReferenceEquals(object?, object?)

object.ToString()

Methods

ConvexPartition(Vertices)

Decompose the polygon into several smaller non-concave polygon.

public static List<Vertices> ConvexPartition(Vertices vertices)

Parameters

vertices Vertices

Returns

List<Vertices>