AreaEdge.cpp

Go to the documentation of this file.

/*
SagaEngine library
Copyright (c) 2002-2006 Skalden Studio AS

This software is provided 'as-is', without any express or implied 
warranty. In no event will the authors be held liable for any 
damages arising from the use of this software.

Permission is granted to distribute the library under the terms of the 
Q Public License version 1.0. Be sure to read and understand the license
before using the library. It should be included here, or you may read it
at http://www.trolltech.com/products/qt/licenses/licensing/qpl

The original version of this library can be located at:
http://www.sagaengine.com/

Rune Myrland
rune@skalden.com
*/


#include "AreaEdge.hpp"
#include "CollisionComponent.hpp"
#include "../schema/SimSchema.hpp"
#include "../pos/Pos.hpp"


namespace se_core {

    AreaEdge
    ::AreaEdge() : controlPointCount_(0) {
    }


    void AreaEdge
    ::addLink(const Point2& p1, const Point2& p2) {
        int index1 = _getOrAddControlPoint(p1);
        int index2 = _getOrAddControlPoint(p2);
        AssertFatal(links_[ index1 ] == -1, "The point " << p1 << " already links to another point");

        links_[ index1 ] = index2;
    }


    void AreaEdge
    ::removeLink(const Point2& p1, const Point2& p2) {
        int index1 = _getOrAddControlPoint(p1);
        int index2 = _getOrAddControlPoint(p2);
        AssertFatal(links_[ index1 ] == index2, "The point " << p1 << " doesn't link to another point");

        links_[ index1 ] = -1;
    }

    int AreaEdge
    ::_getOrAddControlPoint(const Point2& p) {
        // Find control point and return the index if it already exists.
        for(int i = 0; i < controlPointCount_; ++i) {
            if(controlPoints_[ i ].equals(p))
                return i;
        }
        // Didn't exist, so add it and return the new index
        Assert(controlPointCount_ < MAX_CONTROL_POINTS);
        controlPoints_[ controlPointCount_ ] = p;
        links_[ controlPointCount_ ] = -1;
        return controlPointCount_++;
    }


    coor_t AreaEdge
    ::distance(const Point2& p, Point2& dest) const {
        Point2 tmp;
        coor_double_t nearest = 65536.0f * 65536.0f, d;
        for(int i = 0; i < controlPointCount_; ++i) {
            // Is there a link from this control point?
            if(links_[ i ] == -1) {
                // No? Try next then.
                continue;
            }

            // Calculate nearest point on this line
            tmp.nearestPoint(controlPoints_[i], controlPoints_[ links_[ i ] ], p);

            // Closer than nearest on other lines?
            if(nearest < 0 || (d = tmp.distanceSquared(p)) < nearest) {
                nearest = d;
                dest.set(tmp);
            }
        }
        return CoorT::sqrt(nearest);
    }


    bool AreaEdge
    ::isGuilty(const Point2& oldP, const Point2& nextP) const {
        Point2 tmp;
        int nearestIndex = -1;
        coor_double_t nearest = 65536.0f * 65536.0f, d;
        for(int i = 0; i < controlPointCount_; ++i) {
            // Is there a link from this control point?
            if(links_[ i ] == -1) {
                // No? Try next then.
                continue;
            }

            // Calculate nearest point on this line
            tmp.nearestPoint(controlPoints_[i], controlPoints_[ links_[ i ] ], nextP);

            // Closer than nearest on other lines?
            if(nearest < 0 || (d = tmp.distanceSquared(nextP)) < nearest) {
                nearest = d;
                nearestIndex = i;
            }
        }

        bool isOldLeft = oldP.isLeft(controlPoints_[nearestIndex], controlPoints_[ links_[ nearestIndex ] ]);
        bool isNextLeft = nextP.isLeft(controlPoints_[nearestIndex], controlPoints_[ links_[ nearestIndex ] ]);

        if(isOldLeft != isNextLeft) {
            return true;
        }

        // Calculate nearest point on this line
        tmp.nearestPoint(controlPoints_[nearestIndex], controlPoints_[ links_[ nearestIndex ] ], oldP);
        coor_double_t distSq = tmp.distanceSquared(oldP);

        return (nearest < distSq);
        //return CoorT::sqrt(nearest);
    }
}

---

Home Page | SagaEngine trunk (updated nightly) reference generated Sun Dec 2 20:06:11 2007 by Doxygen version 1.3.9.1.