本文整理汇总了Java中org.poly2tri.triangulation.delaunay.DelaunayTriangle.isInterior方法的典型用法代码示例。如果您正苦于以下问题：Java DelaunayTriangle.isInterior方法的具体用法？Java DelaunayTriangle.isInterior怎么用？Java DelaunayTriangle.isInterior使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类org.poly2tri.triangulation.delaunay.DelaunayTriangle的用法示例。
在下文中一共展示了DelaunayTriangle.isInterior方法的4个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Java代码示例。
示例1: meshCleanReq
import org.poly2tri.triangulation.delaunay.DelaunayTriangle; //导入方法依赖的package包/类
private void meshCleanReq( DelaunayTriangle triangle )
{
if( triangle != null && !triangle.isInterior() )
{
triangle.isInterior( true );
_triUnit.addTriangle( triangle );
for( int i = 0; i < 3; i++ )
{
if( !triangle.cEdge[i] )
{
meshCleanReq( triangle.neighbors[i] );
}
}
}
}
示例2: meshClean
import org.poly2tri.triangulation.delaunay.DelaunayTriangle; //导入方法依赖的package包/类
protected void meshClean(DelaunayTriangle triangle)
{
DelaunayTriangle t1,t2;
if( triangle != null )
{
ArrayDeque<DelaunayTriangle> deque = new ArrayDeque<DelaunayTriangle>();
deque.addFirst(triangle);
triangle.isInterior(true);
while( !deque.isEmpty() )
{
t1 = deque.removeFirst();
_triUnit.addTriangle( t1 );
for( int i=0; i<3; ++i )
{
if( !t1.cEdge[i] )
{
t2 = t1.neighbors[i];
if( t2 != null && !t2.isInterior())
{
t2.isInterior(true);
deque.addLast(t2);
}
}
}
}
}
}
示例3: meshClean
import org.poly2tri.triangulation.delaunay.DelaunayTriangle; //导入方法依赖的package包/类
protected void meshClean(DelaunayTriangle triangle)
{
DelaunayTriangle t1,t2;
if( triangle != null )
{
ArrayDeque<DelaunayTriangle> deque = new ArrayDeque<DelaunayTriangle>();
deque.addFirst(triangle);
triangle.isInterior(true);
while( !deque.isEmpty() )
{
t1 = deque.removeFirst();
_triUnit.addTriangle( t1 );
for( int i=0; i<3; ++i )
{
if( !t1.cEdge[i] )
{
t2 = t1.neighbors[i];
if( t2 != null && !t2.isInterior() )
{
t2.isInterior(true);
deque.addLast(t2);
}
}
}
}
}
}
示例4: meshClean
import org.poly2tri.triangulation.delaunay.DelaunayTriangle; //导入方法依赖的package包/类
protected void meshClean(DelaunayTriangle triangle)
{
DelaunayTriangle t1,t2;
if( triangle != null )
{
ArrayDeque<DelaunayTriangle> deque = new ArrayDeque<DelaunayTriangle>();
deque.addFirst(triangle);
triangle.isInterior(true);
while( !deque.isEmpty() )
{
t1 = deque.removeFirst();
_triUnit.addTriangle( t1 );
for( int i=0; i<3; ++i )
{
if( !t1.cEdge[i] )
{
t2 = t1.neighbors[i];
if( t2 != null && !t2.isInterior() )
{
t2.isInterior(true);
deque.addLast(t2);
}
}
}
}
}
}