QGIS » QGIS Application

        {

          toswap = index;

          index = mHalfEdge[mHalfEdge[mHalfEdge[index]->getNext()]->getDual()]->getNext();

          if ( toswap == cwedge )

          {

            break;

        mHalfEdge.at( nextnextnumber )->setNext(( int )edge6 );

        //check, if there are swaps necessary

      }

      //the point is exactly on an existing edge (the number of the edge is stored in the variable 'mEdgeWithPoint'---------------

        mHalfEdge[edgef]->setNext( nedge2 );

        //swap edges if necessary

      }

      else if ( number == -100 || number == -5 )//this means unknown problems or a numerical error occured in 'baseEdgeOfTriangle'

  }

}

{

  if ( swapPossible( edge ) )

  {

    Point3D* ptb = mPointVector[mHalfEdge[mHalfEdge[edge]->getNext()]->getPoint()];

    Point3D* ptc = mPointVector[mHalfEdge[mHalfEdge[mHalfEdge[edge]->getNext()]->getNext()]->getPoint()];

    Point3D* ptd = mPointVector[mHalfEdge[mHalfEdge[mHalfEdge[edge]->getDual()]->getNext()]->getPoint()];

    {

      return true;

    }

  }

  mHalfEdge[edge2]->setPoint( mHalfEdge[edge5]->getPoint() );

}

{

  unsigned int edge1 = edge;

  unsigned int edge2 = mHalfEdge[edge]->getDual();

  mHalfEdge[edge6]->setNext( edge3 );

  mHalfEdge[edge1]->setPoint( mHalfEdge[edge3]->getPoint() );//change the points to which edge1 and edge2 point

  mHalfEdge[edge2]->setPoint( mHalfEdge[edge5]->getPoint() );

}

#if 0

  //optimisation of the new edges

  for ( iter = crossedEdges.begin(); iter != crossedEdges.end(); ++iter )

  {

  }

  return leftPolygon.first();

  mHalfEdge[mHalfEdge[edge3]->getNext()]->setNext( edge6 );

  //test four times recursively for swaping

  mDecorator->addPoint( new Point3D( p->getX(), p->getY(), 0 ) );//dirty hack to enforce update of decorators

    /**returns the number of a HalfEdge from a triangle in which 'point' is in. If the number -10 is returned, this means, that 'point' is outside the convex hull. If -5 is returned, then numerical problems with the leftOfTest occured (and the value of the possible edge is stored in the variable 'mUnstableEdge'. -20 means, that the inserted point is exactly on an edge (the number is stored in the variable 'mEdgeWithPoint'). -25 means, that the point is already in the triangulation (the number of the point is stored in the member 'mTwiceInsPoint'. If -100 is returned, this means that something else went wrong*/

    int baseEdgeOfTriangle( Point3D* point );

    /**Checks, if 'edge' has to be swapped because of the empty circle criterion. If so, doSwap(...) is called.*/

    /**Swaps 'edge' and test recursively for other swaps (delaunay criterion)*/

    /**Swaps 'edge' and does no recursiv testing*/

    void doOnlySwap( unsigned int edge );

    /**Number of an edge which does not point to the virtual point. It continuously updated for a fast search*/