C++ HalfEdge::getPoint方法代码示例

T DDT2D::globalCostFunction ( Container <HalfEdge <T> *> &half_edges )
{
        // Compute cost of the triangulation using selected criterion
        const unsigned int n = half_edges.size();
        T cost = 0;

        //Loop all edges
        for ( unsigned int i = 0; i < n; i++ )
        {

                //Take half edge
                HalfEdge <T> *e = half_edges [i];

                //Use simplex indentificator to eliminate T processing of the edge
                if ( !e->isSimplexEdge() )
                {
                        //Get the first triangle
                        const HalfEdge <T> *e12 = e->getNextEdge();
                        const HalfEdge <T> *e13 = e12->getNextEdge();

                        //Does a twin edge exist?
                        if ( e->getTwinEdge() )
                        {
                                //Get coordinates of the first triangle
                                const Point3DCartesian <T> *p11 = e->getPoint();
                                const Point3DCartesian <T> *p12 = e12->getPoint() ;
                                const Point3DCartesian <T> *p13 =  e13->getPoint() ;

                                //Get second triangle
                                HalfEdge <T> *e21 = e->getTwinEdge();
                                const HalfEdge <T> *e22 = e21->getNextEdge();
                                const HalfEdge <T> *e23 = e22->getNextEdge();

                                //Get coordinates
                                const Point3DCartesian <T> *p21 = p12;
                                const Point3DCartesian <T> *p22 = p11;
                                const Point3DCartesian <T> *p23 = e23->getPoint();

                                //Compute local criterion
                                T fi = ( *pcriterion ) ( p11, p12, p13, p21, p22, p23 );

                                //Global cost
                                cost += fi;

                                //Set both edges to be processed
                                e->setEdgeAsSimplex ( true );
                                e21->setEdgeAsSimplex ( true );
                        }
                }
        }

        //Reset attribute
        for ( unsigned int i = 0; i < n; i++ )
        {
                ( *half_edges ) [i]->setEdgeAsSimplex ( false );
        }

        //Return global cost of the triangulation
        return cost;
}

T FacePerimeter:: getFacePerimeter ( const HalfEdge <T> *e_start )
{
        //Get perimeter of the Face given by start half edge
        T perimeter = 0;
        HalfEdge <T> *e = const_cast <HalfEdge <T> *> ( e_start );

        //There is a valid edge
        if ( e_start != NULL )
        {
                //Get point
                Node3DCartesian <T> *pi = e->getPoint();

                //Proces all edges of the Face
                do
                {
                        //Get point
                        Node3DCartesian <T> *pii = e->getNextEdge()->getPoint();

                        //Compute area
                        perimeter += EuclDistance::getEuclDistance2D ( pi->getX(), pi->getY(), pii->getX(), pii->getY() );

                        //Assign point
                        pi = pii;

                        //Assign edge
                        e = e->getNextEdge();

                }
                while ( e != e_start );
        }

        //Get area
        return perimeter;
}

void Face <T> ::toNodesList ( Container <Node3DCartesian <T> *, NonDestructable > &nl ) const
{
        //Convert Face to nodes list
        if ( edge != NULL )
        {
                //Get next edge in cell
                HalfEdge <T> *e = edge;

                do
                {
                        //Add point to the list
                        nl.push_back ( e->getPoint() );

                        //Increment edge
                        e = e->getNextEdge();

                }
                while ( e != edge );
        }
}

void DDT2D::DDTLOP ( Container <Node3DCartesian <T> *> &nl, Container <HalfEdge <T> *> &half_edges, unsigned short swap_criterion_selected, const bool print_message, const bool print_exception, std::ostream * output )
{
        // Data Depending triangulation using selected local criterion
        bool swap_exist = true;

        //Set iterations
        unsigned iterations = 0;

        //Create Delaunay triangulation
        DT2D::DT ( nl, half_edges, print_message );

        //Get number of HalfEdges
        const unsigned int n = half_edges->size();

        //Set local swap criterion
        setSwapCriterion ( swap_criterion_selected );

        //Global cost before swapping
        const T global_cost_old = globalCostFunction ( half_edges );
        T global_cost = global_cost_old;

        //Print info
        if ( print_message )
        {
                *output << "> Starting DDTLOP... " ;
        }

        //Initialize counters
        unsigned int counter = MAX_INT, counter_old = MAX_INT;

        try
        {
                //Run until swap exists or decrease number of swaps between two loops
                do
                {
                        //We suppose ordered set of triangles, no swap will be required
                        swap_exist = false;

                        //Remember old counter
                        counter_old = counter;

                        //Assign new counter value
                        counter = 0;

                        //Loop all edges
                        for ( unsigned int i = 0; i < n; i++ )
                        {

                                //Take half edge
                                HalfEdge <T> *e = ( *half_edges ) [i];

                                //Use simplex flag to eliminate T processing of the edge
                                if ( !e->isSimplexEdge() )
                                {
                                        //Does twin edge exist?
                                        if ( e->getTwinEdge() )
                                        {
                                                // Test of convexity for quadrilateral
                                                HalfEdge <T> *e12 = e->getNextEdge();
                                                HalfEdge <T> *e13 = e12->getNextEdge();
                                                HalfEdge <T> *e21 = e->getTwinEdge();
                                                HalfEdge <T> *e22 = e21->getNextEdge();
                                                HalfEdge <T> *e23 = e22->getNextEdge();

                                                // Get nodes, counterclockwise set of nodes
                                                const Node3DCartesian <T> *p1 = e->getPoint();
                                                const Node3DCartesian <T> *p2 = e23->getPoint();
                                                const Node3DCartesian <T> *p3 = e12->getPoint();
                                                const Node3DCartesian <T> *p4 = e13->getPoint();

                                                //Is convex (non convex can not be swapped)
                                                if ( ConvexQuadrilateral::isStrictlyConvex ( p1, p2, p3, p4 ) == 1 )
                                                {

                                                        //Set twin edge to be processed
                                                        e->getTwinEdge()->setEdgeAsSimplex ( true );

                                                        //Get first triangle
                                                        e12 = e->getNextEdge();
                                                        e13 = e12->getNextEdge();

                                                        //Get coordinates (cast to parent using static_cast)
                                                        const Point3DCartesian <T> *p11 = e->getPoint();
                                                        const Point3DCartesian <T> *p12 = e12->getPoint();
                                                        const Point3DCartesian <T> *p13 = e13->getPoint();

                                                        //Get second triangle
                                                        e21 = e->getTwinEdge();
                                                        e22 = e21->getNextEdge();
                                                        e23 = e22->getNextEdge();

                                                        //Get coordinates
                                                        const Point3DCartesian <T> *p21 = p12;
                                                        const Point3DCartesian <T> *p22 = p11;
                                                        const Point3DCartesian <T> *p23 = e23->getPoint();

                                                        //Compute local criterion
                                                        const T c1 = ( *pcriterion ) ( p11, p12, p13, p21, p22, p23 );

                                                        //Calculation local criterion from swapped diagonal
//.........这里部分代码省略.........

float DDT2D::getInitialTemperature ( Container <HalfEdge <T> *> &half_edges )
{
        // Compute cost of the triangulation using selected criterion
        const unsigned int n = half_edges.size();
        T max_difference = 0; ;

        //Loop all edges
        for ( unsigned int i = 0; i < n; i++ )
        {

                //Take half edge
                HalfEdge <T> *e = half_edges [i];

                if ( !e->isSimplexEdge() )
                {
                        //Get next edges
                        const HalfEdge <T> *e12 = e->getNextEdge();
                        const HalfEdge <T> *e13 = e12->getNextEdge();

                        //Does a twin edge exist?
                        if ( e->getTwinEdge() )
                        {
                                //Get coordinates of the first triangle (cast to parent using static_cast)
                                const Point3DCartesian <T> *p11 = e->getPoint();
                                const Point3DCartesian <T> *p12 = e12->getPoint();
                                const Point3DCartesian <T> *p13 = e13->getPoint();

                                //Get second triangle
                                HalfEdge <T> *e21 = e->getTwinEdge();
                                HalfEdge <T> *e22 = e21->getNextEdge();
                                HalfEdge <T> *e23 = e22->getNextEdge();

                                //Get coordinates
                                const Point3DCartesian <T> *p21 = p12;
                                const Point3DCartesian <T> *p22 = p11;
                                const Point3DCartesian <T> *p23 = e23->getPoint();

                                //Only strictly convex quadrilaterals
                                if ( ConvexQuadrilateral::isStrictlyConvex ( p11,  p23, p12,  p13 ) == 1 )
                                {
                                        //Compute local criterion  for adjacent triangles
                                        const T fi1 = ( *pcriterion ) ( p11, p12, p13, p21, p22, p23 );

                                        //Compute local criterion  for swapped triangles
                                        const T fi2 = ( *pcriterion ) ( p13, p23, p12, p23, p13, p11 );

                                        //Find max difference
                                        if ( fabs ( fi2 - fi1 ) > max_difference )
                                        {
                                                max_difference = fabs ( fi2 - fi1 );
                                        }
                                }

                                //Set both edges to be processed
                                e->setEdgeAsSimplex ( true );
                                e21->setEdgeAsSimplex ( true );
                        }
                }
        }

        //Reset attribute
        for ( unsigned int i = 0; i < n; i++ )
        {
                ( *half_edges ) [i]->setEdgeAsSimplex ( false );
        }

        //Return result
        return ( float ) ( 2 * max_difference );
}

unsigned short PointFacePosition:: getPointFacePosition ( const Point3DCartesian <T> * q, const Face <T> *face )
{
        /*Returns position of the point to the Face
        0: q is strictly interior
        1: q is strictly exterior
        2: q is on the edge but not an endpoint
        3: q is a vertex
        */

        //There is a valid Face
        if ( face != NULL )
        {
                unsigned short l_inters = 0, r_inters = 0;

                HalfEdge <T> *e = face->getHalfEdge();
                const HalfEdge <T> *e_start = e;

                //Get point P[i-1]
                const Node3DCartesian <T> *pi1 = e->getPreviousEdge()->getPoint();

                //Process all edges
                do
                {
                        //Get point P[i]
                        const Node3DCartesian <T> *pi = e->getPoint();

                        //Test point is identical with end points: d(q, pi) < POSITION_ROUND_ERROR
                        if ( ( q->getX() - pi->getX() ) * ( q->getX() - pi->getX() ) + ( q->getY() - pi->getY() ) * ( q->getY() - pi->getY() ) < POSITION_ROUND_ERROR * POSITION_ROUND_ERROR )
                        {
                                return 3;
                        }

                        //Perform  tests: different position of segment end points to ray
                        bool t1 = ( pi->getY() > q->getY() + POSITION_ROUND_ERROR ) != ( pi1->getY() > q->getY() + POSITION_ROUND_ERROR );
                        bool t2 = ( pi->getY() < q->getY() - POSITION_ROUND_ERROR ) != ( pi1->getY() < q->getY() - POSITION_ROUND_ERROR );

                        //Segment intersects left or ray
                        if ( t1 || t2 )
                        {
                                //Compute intersection
                                T x = ( ( pi->getX() - q->getX() ) * ( pi1->getY() - q->getY() ) - ( pi1->getX() - q->getX() ) * ( pi->getY() - q->getY() ) )
                                      / double ( ( pi1->getY() - pi->getY() ) );

                                //Aditional test to avoid roundness error: point too close to edge
                                if ( PointLineDistance::getPointLineSegmentDistance2D ( q, pi, pi1 ) < POSITION_ROUND_ERROR )
                                {
                                        return 2;
                                }

                                //Increment number of right intersections
                                if ( t1 && x > 0 )
                                {
                                        r_inters ++;
                                }

                                //Increment  number of left intersections
                                if ( t2 && x < 0 )
                                {
                                        l_inters ++;
                                }
                        }

                        //Assign point
                        pi1 = pi;

                        //Increment edge
                        e = e->getNextEdge();

                }
                while ( e != e_start );

                //Point lies on the edge, but not at endpoints
                if ( ( l_inters % 2 ) != ( r_inters % 2 ) )
                {
                        return 2;
                }

                //Points is strictly interior
                if ( l_inters % 2 == 1 )
                {
                        return 0;
                }

                //Point is strictly exterior
                return 1;
        }

        //Throw exception
        else
        {
                throw ErrorBadData ( "ErrorBadData: no face incident to edge, ", "can not test point vs. face position" );
        }
}