C# (CSharp) FarseerPhysics.Common.Decomposition.CDT.Delaunay DelaunayTriangle.Containsの例

Contains() public method

public Contains ( DTSweepConstraint e ) : bool
e	FarseerPhysics.Common.Decomposition.CDT.Delaunay.Sweep.DTSweepConstraint
return	bool

コード例 #1

ファイル: DelaunayTriangle.cs プロジェクト: hannomalie/hdm-silhouette

        /// <summary>
        /// Exhaustive search to update neighbor pointers
        /// </summary>
        public void MarkNeighbor(DelaunayTriangle t)
        {
            // Points of this triangle also belonging to t
            bool a = t.Contains(Points[0]);
            bool b = t.Contains(Points[1]);
            bool c = t.Contains(Points[2]);

            if (b && c)
            {
                Neighbors[0] = t;
                t.MarkNeighbor(Points[1], Points[2], this);
            }
            else if (a && c)
            {
                Neighbors[1] = t;
                t.MarkNeighbor(Points[0], Points[2], this);
            }
            else if (a && b)
            {
                Neighbors[2] = t;
                t.MarkNeighbor(Points[0], Points[1], this);
            }
            else
            {
                throw new Exception("Failed to mark neighbor, doesn't share an edge!");
            }
        }

コード例 #2

ファイル: DelaunayTriangle.cs プロジェクト: Jypeli-JYU/Jypeli

 /// <summary>
 /// Exhaustive search to update neighbor pointers
 /// </summary>
 public void MarkNeighbor(DelaunayTriangle t)
 {
     if (t.Contains(Points[1], Points[2]))
     {
         Neighbors[0] = t;
         t.MarkNeighbor(Points[1], Points[2], this);
     }
     else if (t.Contains(Points[0], Points[2]))
     {
         Neighbors[1] = t;
         t.MarkNeighbor(Points[0], Points[2], this);
     }
     else if (t.Contains(Points[0], Points[1]))
     {
         Neighbors[2] = t;
         t.MarkNeighbor(Points[0], Points[1], this);
     }
     else
     {
         Debug.WriteLine("markNeighbor failed");
     }
 }

コード例 #3

ファイル: DelaunayTriangle.cs プロジェクト: prime31/Nez

		/// <summary>
		/// Exhaustive search to update neighbor pointers
		/// </summary>
		public void MarkNeighbor( DelaunayTriangle t )
		{
			if( t.Contains( points[1], points[2] ) )
			{
				neighbors[0] = t;
				t.MarkNeighbor( points[1], points[2], this );
			}
			else if( t.Contains( points[0], points[2] ) )
			{
				neighbors[1] = t;
				t.MarkNeighbor( points[0], points[2], this );
			}
			else if( t.Contains( points[0], points[1] ) )
			{
				neighbors[2] = t;
				t.MarkNeighbor( points[0], points[1], this );
			}
			else
			{
				Debug.WriteLine( "markNeighbor failed" );
			}
		}