forked from BilalY/Rasagar
58 lines
2.3 KiB
C#
58 lines
2.3 KiB
C#
|
/* Poly2Tri
|
|||
|
|
* Copyright (c) 2009-2010, Poly2Tri Contributors
|
|||
|
|
* http://code.google.com/p/poly2tri/
|
|||
|
|
*
|
|||
|
|
* All rights reserved.
|
|||
|
|
*
|
|||
|
|
* Redistribution and use in source and binary forms, with or without modification,
|
|||
|
|
* are permitted provided that the following conditions are met:
|
|||
|
|
*
|
|||
|
|
* * Redistributions of source code must retain the above copyright notice,
|
|||
|
|
* this list of conditions and the following disclaimer.
|
|||
|
|
* * Redistributions in binary form must reproduce the above copyright notice,
|
|||
|
|
* this list of conditions and the following disclaimer in the documentation
|
|||
|
|
* and/or other materials provided with the distribution.
|
|||
|
|
* * Neither the name of Poly2Tri nor the names of its contributors may be
|
|||
|
|
* used to endorse or promote products derived from this software without specific
|
|||
|
|
* prior written permission.
|
|||
|
|
*
|
|||
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|||
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|||
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|||
|
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
|
|||
|
|
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
|
|||
|
|
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
|||
|
|
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
|
|||
|
|
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
|||
|
|
* LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
|||
|
|
* NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
|||
|
|
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|||
|
|
*/
|
|||
|
|
|
|||
|
|
namespace UnityEngine.ProBuilder.Poly2Tri {
|
|||
|
|
class DTSweepConstraint : TriangulationConstraint {
|
|||
|
|
/// <summary>
|
|||
|
|
/// Give two points in any order. Will always be ordered so
|
|||
|
|
/// that q.y > p.y and q.x > p.x if same y value
|
|||
|
|
/// </summary>
|
|||
|
|
public DTSweepConstraint( TriangulationPoint p1, TriangulationPoint p2 ) {
|
|||
|
|
P = p1;
|
|||
|
|
Q = p2;
|
|||
|
|
if (p1.Y > p2.Y) {
|
|||
|
|
Q = p1;
|
|||
|
|
P = p2;
|
|||
|
|
} else if (p1.Y == p2.Y) {
|
|||
|
|
if (p1.X > p2.X) {
|
|||
|
|
Q = p1;
|
|||
|
|
P = p2;
|
|||
|
|
} else if (p1.X == p2.X) {
|
|||
|
|
// logger.info( "Failed to create constraint {}={}", p1, p2 );
|
|||
|
|
// throw new DuplicatePointException( p1 + "=" + p2 );
|
|||
|
|
// return;
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
Q.AddEdge(this);
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
}
|