eFace Class Reference

#include <eTess2.h>

Inheritance diagram for eFace:

[legend]

Collaboration diagram for eFace:

[legend]

List of all members.

Public Member Functions
	eFace (eHalfEdge *a, eHalfEdge *b, eHalfEdge *c)
	eFace (eHalfEdge *a, eHalfEdge *b, eHalfEdge *c, tControlledPTR< eFace > &old)
	eFace (eHalfEdge *a, eHalfEdge *b, eHalfEdge *c, tControlledPTR< eFace > &old1, tControlledPTR< eFace > &old2)
void	Create (eHalfEdge *a, eHalfEdge *b, eHalfEdge *c)
bool	Check ()
void	Print (std::ostream &s) const
void	Unlink ()
bool	IsInside (const eCoord &coord) const
REAL	Insideness (const eCoord &coord, const eCoord &direction, const eCoord &lastDirection) const
REAL	Insideness (const eCoord &coord, const eCoord &direction) const
REAL	Insideness (const eCoord &coord) const
eFace *	FindReplacement (const eCoord &coord, const eCoord &direction, const eCoord &lastDirection) const
eFace *	FindReplacement (const eCoord &coord, const eCoord &direction) const
eFace *	FindReplacement (const eCoord &coord) const
bool	CorrectArea ()
eReplacementStorage &	GetReplacementStorage () const
Public Attributes
eFace *	nextProcessed
Private Member Functions
	~eFace ()
Private Attributes
eReplacementStorage *	replacementStorage
Friends
class	tReferencable< eFace >

---

Detailed Description

Definition at line 284 of file eTess2.h.

---

Constructor & Destructor Documentation

eFace::~eFace

(

)

[private]

Definition at line 457 of file eGrid.cpp.

References replacementStorage, and Unlink().

{
    Unlink();
    //  se_EraseFace( this );

    delete replacementStorage;
}

Here is the call graph for this function:

eFace::eFace	(	eHalfEdge *	a,
		eHalfEdge *	b,
		eHalfEdge *	c
	)

Definition at line 465 of file eGrid.cpp.

References Create().

        :replacementStorage( 0 )
{
    Create( e1, e2, e3 );
}

Here is the call graph for this function:

eFace::eFace	(	eHalfEdge *	a,
		eHalfEdge *	b,
		eHalfEdge *	c,
		tControlledPTR< eFace > &	old
	)

Definition at line 471 of file eGrid.cpp.

References Create(), and se_LinkFaces().

        :replacementStorage( 0 )
{
    Create( e1, e2, e3 );
    se_LinkFaces( old, this );
}

Here is the call graph for this function:

eFace::eFace	(	eHalfEdge *	a,
		eHalfEdge *	b,
		eHalfEdge *	c,
		tControlledPTR< eFace > &	old1,
		tControlledPTR< eFace > &	old2
	)

Definition at line 478 of file eGrid.cpp.

References Create(), and se_LinkFaces().

        :replacementStorage( 0 )
{
    Create( e1, e2, e3 );
    se_LinkFaces( old1, this );
    se_LinkFaces( old2, this );
}

Here is the call graph for this function:

---

Member Function Documentation

void eFace::Create	(	eHalfEdge *	a,
		eHalfEdge *	b,
		eHalfEdge *	c
	)

Definition at line 486 of file eGrid.cpp.

References con, eDual::edge, EPS, eHalfEdge::next, nextProcessed, NULL, eHalfEdge::other, eHalfEdge::Point(), eHalfEdge::prev, REAL, se_maxGridSize, eHalfEdge::SetFace(), and tASSERT.

Referenced by eFace().

{
#ifdef DEBUG 
    tASSERT( edge == 0 );

    tASSERT(e1->other);
    tASSERT(e2->other);
    tASSERT(e3->other);

    tASSERT(e1->Point() == e3->other->Point());
    tASSERT(e2->Point() == e1->other->Point());
    tASSERT(e3->Point() == e2->other->Point());

    //  tASSERT(*e1->Point() != *e2->Point());
    //  tASSERT(*e3->Point() != *e2->Point());
    //  tASSERT(*e1->Point() != *e3->Point());

    tASSERT((*e1->Point() - *e2->Point()).NormSquared() < se_maxGridSize*100);
    tASSERT((*e3->Point() - *e2->Point()).NormSquared() < se_maxGridSize*100);
    tASSERT((*e1->Point() - *e3->Point()).NormSquared() < se_maxGridSize*100);
#endif

    nextProcessed = NULL;

    e1->SetFace(this);
    e2->SetFace(this);
    e3->SetFace(this);

    e1->next = e2;
    e2->next = e3;
    e3->next = e1;
    e1->prev = e3;
    e2->prev = e1;
    e3->prev = e2;

    e1->Point()->edge = e1;
    e2->Point()->edge = e2;
    e3->Point()->edge = e3;

    edge = e1;

#ifdef DEBUG
    REAL area = -(*e1->Point() - *e2->Point()) * (*e1->Point() - *e3->Point());
    if( area <= -EPS )
    {
        con << "Face " << *this << " has wrong orientation (area: " << area << ").\n";
    }
#endif
}

Here is the call graph for this function:

Here is the caller graph for this function:

bool eFace::Check

(

)

[inline]

Definition at line 304 of file eTess2.h.

References eDual::Check().

{return eDual::Check(1);}

Here is the call graph for this function:

void eFace::Print

(

std::ostream &

s

)

const

Definition at line 653 of file eGrid.cpp.

References eDual::edge.

Referenced by operator<<().

{ s << "[" << *edge->Point() << "->" << *edge->next->Point() << "->" << *edge->next->next->Point() << "]"; }

Here is the caller graph for this function:

void eFace::Unlink

(

)

Definition at line 536 of file eGrid.cpp.

References eDual::edge, eHalfEdge::Face(), eHalfEdge::next, NULL, eHalfEdge::SetFace(), and tASSERT.

Referenced by eGrid::KillFace(), eGrid::ZombifyFace(), and ~eFace().

                  {
    if (edge)
    {
        eHalfEdge *run = edge;
        const eHalfEdge *stop = run;

        do
        {
            tASSERT(run->Face() == this);
            run->SetFace(NULL);

            run = run->next;
        }
        while (stop != run);

        edge = NULL;
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

bool eFace::IsInside

(

const eCoord &

coord

)

const

Definition at line 609 of file eGrid.cpp.

References eCoord, eDual::edge, EPS, eHalfEdge::Face(), eHalfEdge::next, eHalfEdge::Point(), and tASSERT.

Referenced by eGrid::FindSurroundingFace().

{
    // flags storing whether there is a point of the triangle with bigger/smaller coordinates
    // than the test coords
    bool xLower=false, xHigher=false, yLower=false, yHigher=false;

    eHalfEdge *run = edge;
    if (!run)
        return false;

    eCoord *last_p = run->Point();
    run = run->next;
    const eHalfEdge *stop = run;

    do
    {
        tASSERT(run && run->Face() == this);
        eCoord *p = run->Point();
        eCoord ed=*last_p - *p;
        eCoord cc= c - *p;

        if ( p->x <= c.x + EPS )
            xLower = true;
        if ( p->x >= c.x - EPS )
            xHigher = true;
        if ( p->y <= c.y + EPS )
            yLower = true;
        if ( p->y >= c.y - EPS )
            yHigher = true;

        if (ed*cc<-EPS)
            return false;

        last_p = p;
        run = run->next;
    }
    while (run && stop != run);

    // test if the point is in the bounding rectangle of the triangle
    return xLower && xHigher && yLower && yHigher;
}

Here is the call graph for this function:

Here is the caller graph for this function:

REAL eFace::Insideness	(	const eCoord &	coord,
		const eCoord &	direction,
		const eCoord &	lastDirection
	)			const

Definition at line 556 of file eGrid.cpp.

References eCoord, eDual::edge, EPS, eHalfEdge::Face(), max(), eHalfEdge::next, eHalfEdge::Point(), REAL, and tASSERT.

Referenced by Insideness(), and se_FindBestReplacement().

{
    // TODO: bounding box check

    eCoord min, max;

    eHalfEdge *run = edge;
    if (!run)
        return -1000000000;

    REAL ret = 1000000000;

    eCoord *last_p = run->Point();
    run = run->next;
    const eHalfEdge *stop = run;

    do
    {
        tASSERT(run && run->Face() == this);
        eCoord *p = run->Point();
        eCoord ed=*last_p - *p;
        eCoord cc= pos - *p;

        REAL val = ed*cc;
        // REAL tol = 10 * EPS/(ed.Norm() + EPS*1000);
        REAL tol = 10 * EPS;
        REAL retDir = direction*ed;
        REAL retLastDir = lastDirection*ed;
        val += tol*(retDir + tol*retLastDir);
        if ( val < ret )
        {
            ret = val;
        }

        last_p = p;
        run = run->next;
    }
    while (run && stop != run);

    return ret;
}

Here is the call graph for this function:

Here is the caller graph for this function:

REAL eFace::Insideness	(	const eCoord &	coord,
		const eCoord &	direction
	)			const

Definition at line 598 of file eGrid.cpp.

References eCoord, and Insideness().

{
    return Insideness( c, direction, eCoord() );
}

Here is the call graph for this function:

REAL eFace::Insideness

(

const eCoord &

coord

)

const

Definition at line 603 of file eGrid.cpp.

References eCoord, and Insideness().

{
    return Insideness( c, eCoord(), eCoord() );
}

Here is the call graph for this function:

eFace * eFace::FindReplacement	(	const eCoord &	coord,
		const eCoord &	direction,
		const eCoord &	lastDirection
	)			const

Definition at line 415 of file eGrid.cpp.

References arg(), se_FindBestReplacement(), and tASSERT.

{
    // check if we don't need an replacement
    tASSERT( !this->IsInGrid() );

    // set of already visited faces
    eFaceReplacementArgument arg;
    arg.coord = coord;
    arg.direction = direction;
    arg.lastDirection = lastDirection;

    // delegate search to recursive function
    return se_FindBestReplacement( this, arg ).first;
}

Here is the call graph for this function:

eFace * eFace::FindReplacement	(	const eCoord &	coord,
		const eCoord &	direction
	)			const

Definition at line 430 of file eGrid.cpp.

References arg(), se_FindBestReplacement(), and tASSERT.

{
    // check if we don't need an replacement
    tASSERT( !this->IsInGrid() );

    // set of already visited faces
    eFaceReplacementArgument arg;
    arg.coord = coord;
    arg.direction = direction;

    // delegate search to recursive function
    return se_FindBestReplacement( this, arg ).first;
}

Here is the call graph for this function:

eFace * eFace::FindReplacement

(

const eCoord &

coord

)

const

Definition at line 444 of file eGrid.cpp.

References arg(), se_FindBestReplacement(), and tASSERT.

{
    // check if we don't need an replacement
    tASSERT( !this->IsInGrid() );

    // set of already visited faces
    eFaceReplacementArgument arg;
    arg.coord = coord;

    // delegate search to recursive function
    return se_FindBestReplacement( this, arg ).first;
}

Here is the call graph for this function:

bool eFace::CorrectArea

(

)

Definition at line 1751 of file eGrid.cpp.

References ClampMovement(), eCoord, eDual::edge, eHalfEdge::Movable(), Movable(), eHalfEdge::next, NULL, eHalfEdge::Point(), REAL, st_Breakpoint(), tASSERT, and eHalfEdge::Vec().

Referenced by eGrid::AddFace(), and eGrid::DrawLine().

{
    REAL area = edge->next->Vec() * edge->Vec();
    if (area >= 0)
        return false;

    eHalfEdge *run = edge;

    // find the longest edge ( preferably with wall )
    eHalfEdge *longest = NULL;
    REAL       length  = -1;
    bool       wall    = false;

    for (int i=2; i>=0; i--)
    {
        REAL runLength   = run->Vec().NormSquared();

        // test if moving the point opposite to run would move walls
        if (!Movable( run->next->next->Point() ) )
            continue;

        bool runWall     = !run->Movable();
        if ( runLength > length || runWall )
        {
            // abort if the triangle has two walled sides
            if ( wall && runWall )
            {
                // however, this should never, ever happen.
                st_Breakpoint();
                return false;
            }

            wall    = runWall;
            length  = runLength;
            longest = run;
        }
        run = run->next;
    }

    // no luck?
    if ( !longest )
        return false;

    run = longest;
    eCoord &A = *run->Point();
    run       =  run->next;
    eCoord &B = *run->Point();
    run       =  run->next;
    eCoord &C = *run->Point();
    ePoint* pC = run->Point();

    // now, C is the point opposite to the longest edge.
    eCoord MoveDir = (B-A);
    MoveDir = MoveDir.Turn(0, -area * 1.01/MoveDir.NormSquared() );

    // move C as little as possible into the desired direction
    if ( MoveDir.NormSquared() > 0 )
    {
        eCoord Cnew = C + MoveDir;

        while ( Cnew.x == C.x && Cnew.y == C.y )
        {
            // try displacing by MoveDir and enlarge MoveDir
            Cnew = C + MoveDir;
            MoveDir = MoveDir * 2;
        }

        // clamp the movement so it does not make the situation worse
        // for other faces
        ClampMovement( pC, MoveDir );

        // store result
        C = C + MoveDir;
    }
    else // give up
        return false;

    REAL newarea = edge->next->Vec() * edge->Vec();
    tASSERT(newarea >= area);

    // check if treatment was successful
    return newarea > area;
}

Here is the call graph for this function:

Here is the caller graph for this function:

eReplacementStorage & eFace::GetReplacementStorage

(

)

const

Definition at line 407 of file eGrid.cpp.

References replacementStorage, and tNEW.

Referenced by se_FindBestReplacement().

{
    if ( !replacementStorage )
        replacementStorage = tNEW( eReplacementStorage );

    return *replacementStorage;
}

Here is the caller graph for this function:

---

Friends And Related Function Documentation

friend class tReferencable< eFace > [friend]

Definition at line 285 of file eTess2.h.

---

Member Data Documentation

eFace* eFace::nextProcessed

Definition at line 339 of file eTess2.h.

Referenced by Create(), eGrid::ProcessWallsInRange(), and ProcessWallsRecursive().

eReplacementStorage* eFace::replacementStorage [mutable, private]

Definition at line 352 of file eTess2.h.

Referenced by GetReplacementStorage(), and ~eFace().

---

The documentation for this class was generated from the following files:

• src/engine/eTess2.h
• src/engine/eGrid.cpp

---