// -----------------------------------------------------------------------
//
// Original Triangle code by Jonathan Richard Shewchuk, http://www.cs.cmu.edu/~quake/triangle.html
// Triangle.NET code by Christian Woltering, http://triangle.codeplex.com/
//
// -----------------------------------------------------------------------
namespace TriangleNet
{
///
/// The type of the mesh vertex.
///
public enum VertexType { InputVertex, SegmentVertex, FreeVertex, DeadVertex, UndeadVertex };
///
/// Node renumbering algorithms.
///
public enum NodeNumbering { None, Linear, CuthillMcKee };
///
/// Labels that signify the result of point location.
///
/// The result of a search indicates that the point falls in the
/// interior of a triangle, on an edge, on a vertex, or outside the mesh.
///
public enum LocateResult { InTriangle, OnEdge, OnVertex, Outside };
///
/// Labels that signify the result of vertex insertion.
///
/// The result indicates that the vertex was inserted with complete
/// success, was inserted but encroaches upon a subsegment, was not inserted
/// because it lies on a segment, or was not inserted because another vertex
/// occupies the same location.
///
enum InsertVertexResult { Successful, Encroaching, Violating, Duplicate };
///
/// Labels that signify the result of direction finding.
///
/// The result indicates that a segment connecting the two query
/// points falls within the direction triangle, along the left edge of the
/// direction triangle, or along the right edge of the direction triangle.
///
enum FindDirectionResult { Within, Leftcollinear, Rightcollinear };
}