Updating the changelog in the VERSION file, and version_sync.

[shapes.git] / source / zbuftriangle.cc

/* This file is part of Shapes.
 *
 * Shapes is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * any later version.
 *
 * Shapes is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with Shapes.  If not, see <http://www.gnu.org/licenses/>.
 *
 * Copyright 2008 Henrik Tidefelt
 */

#include <cmath>

#include "shapestypes.h"
#include "shapesexceptions.h"
#include "astexpr.h"
#include "consts.h"
#include "angleselect.h"
#include "astvar.h"
#include "astclass.h"
#include "statetypes.h"
#include "lighttypes.h"
#include "shadingtypes.h"
#include "globals.h"
#include "trianglefunctions.h"
#include "basicsimplex.h"
#include "zbufinternals.h"
#include "constructorrepresentation.h"

#include <ctype.h>
#include <list>
#include <algorithm>
#include <limits>

using namespace Shapes;


#define SPLICEDEBUG( code ) // code

void
assertNotOverlapping( const std::list< Computation::ZBufTriangle > & disjointTriangles )
{

        typedef typeof disjointTriangles ListType;
        ListType::const_iterator last = disjointTriangles.end( );
        --last;
        for( ListType::const_iterator i = disjointTriangles.begin( ); i != last; ++i )
                {
                        if( last->overlaps( *i ) )
                                {
                                        throw Exceptions::InternalError( "assertNotOverlapping triggered" );
                                }
                }
}

void
assertCounterClockwiseConvex( const Lang::ZBuf::PolyIndices & poly, const std::vector< Concrete::Coords2D > & cornerMem )
{
        for( Lang::ZBuf::PolyIndices::const_iterator i0 = poly.begin( ); i0 != poly.end( ); ++i0 )
                {
                        Lang::ZBuf::PolyIndices::const_iterator i1 = i0;
                        ++i1;
                        if( i1 == poly.end( ) )
                                {
                                        i1 = poly.begin( );
                                }
                        Lang::ZBuf::PolyIndices::const_iterator i2 = i1;
                        ++i2;
                        if( i2 == poly.end( ) )
                                {
                                        i2 = poly.begin( );
                                }
                        Concrete::UnitFloatPair inHat = cornerMem[ *i0 ].normalizedOrthogonal( cornerMem[ *i1 ] );
                        if( Concrete::inner( inHat, cornerMem[ *i2 ] - cornerMem[ *i1 ] ) < - Computation::theTrixelizeSplicingTol )
                                {
                                        throw Exceptions::InternalError( "assertCounterClockwiseConvex triggered" );
                                }
                }
}


Computation::ZBufTriangle::ZMap::ZMap( const Concrete::UnitFloatTriple & normal,
                                                                                                                                                         Concrete::Length m,
                                                                                                                                                         Concrete::Length tiebreaker,
                                                                                                                                                         Concrete::Length eyez )
        : normal_( normal ), k_x_( normal_.x_ ), k_y_( normal_.y_ ), k_z_( normal_.z_ ), m_( m ),
                eyezInv_( 1. / eyez ), tiebreaker_( tiebreaker ), eyez_( eyez )
{ }

Concrete::Length
Computation::ZBufTriangle::ZMap::operator () ( const Concrete::Coords2D & p ) const
{
        Concrete::Length tmp = k_x_ * p.x_ + k_y_ * p.y_;
        return ( m_ - tmp ) / ( k_z_ - eyezInv_ * tmp );
}

void
Computation::ZBufTriangle::ZMap::writeToMatrices( double a[3], Concrete::Length * b ) const
{
        a[0] = normal_.x_;
        a[1] = normal_.y_;
        a[2] = normal_.z_;
        *b = m_;
}

Computation::SplicingLine::SplicingLine( const Concrete::Coords2D & p0, const Concrete::Coords2D & p1_sub_p0, bool isTriangleSide )
        : isTriangleSide_( isTriangleSide ),
                p0_( p0 ),
                d_( p1_sub_p0.direction( ) ),
                length_( p1_sub_p0.norm( ) ),
                n_( Concrete::UnitFloatPair( -p1_sub_p0.y_.offtype< 1, 0 >( ), p1_sub_p0.x_.offtype< 1, 0 >( ) ) ),     // Note that this will normalize n_.    What if this fails?
                r_( Concrete::inner( n_, p0 ) )
{ }

Computation::SplicingLine::SplicingLine( const Computation::SplicingLine & orig )
        : isTriangleSide_( orig.isTriangleSide_ ),
                p0_( orig.p0_ ),
                d_( orig.d_ ),
                length_( orig.length_ ),
                n_( orig.n_ ),
                r_( orig.r_ )
{ }

Computation::SplicingLine::SplicingLine( )
        : isTriangleSide_( false ),
                p0_( 0, 0 ),
                d_( 1., 0., bool( ) ),
                length_( 1 ),
                n_( 0., -1., bool( ) ),
                r_( 0 )
{ }

Concrete::Coords2D
Computation::SplicingLine::intersection( const Computation::SplicingLine & other ) const
{
        Concrete::Length x;
        Concrete::Length y;

        const Concrete::UnitFloatPair & n2 = other.n_;
        const Concrete::Length & r2 = other.r_;

        {
                double n_n1 = Concrete::inner( n_, n2 );
                double n_n_ = Concrete::inner( n_, n_ );
                double n2n2 = Concrete::inner( n2, n2 );

                if( n_n1 * n_n1 > ( 1 - 1e-8 ) * ( n_n_ * n2n2 ) ) // This corresponds to an angle of approximately 0.01 degree.
                        {
                                throw "no intersection";
                        }
        }

        double invDet = static_cast< double >( 1 ) / ( n_.x_ * n2.y_ - n_.y_ * n2.x_ );
        x = invDet * (   n2.y_ * r_ - n_.y_ * r2 );
        y = invDet * ( - n2.x_ * r_ + n_.x_ * r2 );

        Concrete::Coords2D res( x, y );
        {
                Concrete::Length c1 = Concrete::inner( d_, res - p0_ );
                Concrete::Length c2 = Concrete::inner( other.d_, res - other.p0_ );
                if( ( isTriangleSide_ && ( c1 < -Computation::theTrixelizeSplicingTol || c1 > length_ + Computation::theTrixelizeSplicingTol ) ) &&
                                ( other.isTriangleSide_ && ( c2 < -Computation::theTrixelizeSplicingTol || c2 > other.length_ + Computation::theTrixelizeSplicingTol ) ) )
                        {
                                throw "no intersection";
                        }
        }

        return res;
}

size_t
Computation::SplicingLine::nextLine( const Concrete::Coords2D * p, const Concrete::UnitFloatPair & n, const std::vector< Computation::SplicingLine > & lines ) const
{
        // This algorithm is formulated without its own tolerances.     It relies on the pointers to the intersection points;
        // "nearby points" should be represented by the same pointer.   If two points are represented by different memory
        // locations, they are treated as positively separated in geometry as well.

        SPLICEDEBUG( std::cerr << "nextLine at " << Lang::Coords2D( *p ) << " -> " << "( " << n.x_ << ", " << n.y_ << " )" << " : " );
        // Note that n will be unit, so it can be used to compute lengths.
        const Concrete::Coords2D & my_p = *p;

        // back is parallel to this line, but not in the same halfspace as n.
        // nOut is parallel to n_ but is turned so that it points out from the enclosed area.
        // They will both be used to select among lines that intersect at the same point.
        Concrete::UnitFloatPair back = d_;
        if( Concrete::inner( back, n ) > 0 )
                {
                        back = back.reverse( );
                }
        Concrete::UnitFloatPair nIn( back.y_, -back.x_ );

        size_t res = 0;
        Concrete::Length bestRes( HUGE_VAL );
        const Concrete::Coords2D * bestPoint = 0;
        size_t idx = 0;
        typedef typeof intersections_ ListType;
        for( ListType::const_iterator i = intersections_.begin( ); i != intersections_.end( ); ++i, ++idx )
                {
                        if( *i == 0 || *i == p )
                                {
                                        continue;
                                }
                        Concrete::Length tmp = Concrete::inner( n, **i - my_p );
                        if( *i == bestPoint )
                                {
                                        // The lines are compared by direction.
                                        Concrete::UnitFloatPair dOld = lines[res].d_;
                                        if( Concrete::inner( nIn, dOld ) < 0 )
                                                {
                                                        dOld = dOld.reverse( );
                                                }
                                        Concrete::UnitFloatPair dNew = lines[idx].d_;
                                        if( Concrete::inner( nIn, dNew ) < 0 )
                                                {
                                                        dNew = dNew.reverse( );
                                                }
                                        if( Concrete::inner( back, dNew ) > Concrete::inner( back, dOld ) )
                                                {
                                                        bestRes = tmp;
                                                        // bestPoint is already equal to *i
                                                        SPLICEDEBUG( std::cerr << "{" << res << "->" << idx << "}" );
                                                        res = idx;
                                                }
                                }
                        else if( tmp > Concrete::ZERO_LENGTH && tmp < bestRes )
                                {
                                        bestRes = tmp;
                                        bestPoint = *i;
                                        SPLICEDEBUG( std::cerr << "{" << idx << "}" );
                                        res = idx;
                                }
                }
        if( bestRes == Concrete::HUGE_LENGTH )
                {
                        SPLICEDEBUG( std::cerr << "none" << std::endl );
                        throw "no intersection";
                }
        SPLICEDEBUG( std::cerr << *intersections_[res] << std::endl );
        return res;
}

Concrete::Length
Computation::SplicingLine::distanceTo( const Concrete::Coords2D p ) const
{
        return ( Concrete::inner( n_, p ) - r_ ).abs( );
}



Computation::ZBufTriangle::ZBufTriangle( const Computation::PaintedPolygon3D * painter, const RefCountPtr< const Computation::ZBufTriangle::ZMap > & zMap, const Concrete::Coords2D & p1, const Concrete::Coords2D & p2, const Concrete::Coords2D & p3 )
        : painter_( painter ), zMap_( zMap )
{
        points_.reserve( 3 );
        points_.push_back( p1 );
        points_.push_back( p2 );
        points_.push_back( p3 );
}

Concrete::Length
Computation::ZBufTriangle::zAt( const Concrete::Coords2D & p ) const
{
        return (*zMap_)( p );
}

bool
Computation::ZBufTriangle::isOnTopOfAt( const Computation::ZBufTriangle & other, const Concrete::Coords2D & p ) const
{
        Concrete::Length zThis = zAt( p );
        Concrete::Length zOther = other.zAt( p );

        Concrete::Length tThis = zMap_->getTiebreaker( );
        Concrete::Length tOther = other.zMap_->getTiebreaker( );
        if( ( zThis - zOther ).abs( ) < std::max( tThis, tOther ) )
                {
                        return zThis + tThis > zOther + tOther;
                }

        return zThis > zOther;
}


// This function does the test with the tolerance interpretation such that a true return value
// means that the triangles really overlaps by some positive amount.
bool
Computation::ZBufTriangle::overlaps( const Computation::ZBufTriangle & other ) const
{
        const std::vector< Concrete::Coords2D > & pointSet_a( points_ );
        const std::vector< Concrete::Coords2D > & pointSet_b( other.points_ ); 

        /* Do the circle-circle check
         */
        {
                Concrete::Coords2D ca( 0, 0 );
                for( std::vector< Concrete::Coords2D >::const_iterator i = pointSet_a.begin( );
                                 i != pointSet_a.end( );
                                 ++i )
                        {
                                ca = ca + *i;
                        }
                ca = ca * (1./3);

                Concrete::Coords2D cb( 0, 0 );
                for( std::vector< Concrete::Coords2D >::const_iterator i = pointSet_b.begin( );
                                 i != pointSet_b.end( );
                                 ++i )
                        {
                                cb = cb + *i;
                        }
                cb = cb * (1./3);

                Concrete::Length ra( 0 );
                for( std::vector< Concrete::Coords2D >::const_iterator i = pointSet_a.begin( );
                                 i != pointSet_a.end( );
                                 ++i )
                        {
                                ra = std::max( ra, hypotPhysical( ca.x_ - i->x_, ca.y_ - i->y_ ) );
                        }

                Concrete::Length rb( 0 );
                for( std::vector< Concrete::Coords2D >::const_iterator i = pointSet_b.begin( );
                                 i != pointSet_b.end( );
                                 ++i )
                        {
                                rb = std::max( rb, hypotPhysical( cb.x_ - i->x_, cb.y_ - i->y_ ) );
                        }

                Concrete::Length rSum = ra + rb;
                if( rSum <= Computation::theTrixelizeOverlapTol )
                        {
                                return false;
                        }
                if( ( rSum - Computation::theTrixelizeOverlapTol ) * ( rSum - Computation::theTrixelizeOverlapTol ) < ( ca.x_ - cb.x_ ) * ( ca.x_ - cb.x_ ) + ( ca.y_ - cb.y_ ) * ( ca.y_ - cb.y_ ) )
                        {
                                return false;
                        }
        }

        /* Now to the search for a separating line.
         */
        if( ! oneWayOverlap( pointSet_a, pointSet_b ) )
                {
                        return false;
                }
        if( ! oneWayOverlap( pointSet_b, pointSet_a ) )
                {
                        return false;
                }
        return true;
}

// To be consistent with the tolerance interpretation in ZBufTriangle::overlaps, which returns true only if the triangles
// overlaps by some positive amount, this function shall rather return false than true.
// This means that we should prefer not to unflag allOutside.
bool
Computation::ZBufTriangle::oneWayOverlap( const std::vector< Concrete::Coords2D > & poly1, const std::vector< Concrete::Coords2D > & poly2 )
{
        // If a bug is fixed here, remember to fix ZBufLine::overlaps too!

        for( std::vector< Concrete::Coords2D >::const_iterator i0 = poly1.begin( ); i0 != poly1.end( ); ++i0 )
                {
                        std::vector< Concrete::Coords2D >::const_iterator i1 = i0;
                        ++i1;
                        if( i1 == poly1.end( ) )
                                {
                                        i1 = poly1.begin( );
                                }
                        std::vector< Concrete::Coords2D >::const_iterator i2 = i1;
                        ++i2;
                        if( i2 == poly1.end( ) )
                                {
                                        i2 = poly1.begin( );
                                }

                        const Concrete::Coords2D & p0( *i0 );
                        const Concrete::Coords2D & p1( *i1 );

                        const Concrete::Length txUnnormed = p1.x_ - p0.x_;
                        const Concrete::Length tyUnnormed = p1.y_ - p0.y_;
                        const Physical< -1, 0 > invNorm = 1. / hypotPhysical( txUnnormed, tyUnnormed );
                        // First we guess what's the inward direction
                        double inx( - invNorm * tyUnnormed );
                        double iny( invNorm * txUnnormed );
                        // Then we check if it needs to be reversed
                        {
                                const Concrete::Length dx = i2->x_ - p0.x_;
                                const Concrete::Length dy = i2->y_ - p0.y_;
                                if( dx * inx + dy * iny < Concrete::ZERO_LENGTH )
                                        {
                                                inx = -inx;
                                                iny = -iny;
                                        }
                        }

                        bool allOutside = true;
                        for( std::vector< Concrete::Coords2D >::const_iterator p = poly2.begin( ); p != poly2.end( ); ++p )
                                {
                                        const Concrete::Length dx = p->x_ - p0.x_;
                                        const Concrete::Length dy = p->y_ - p0.y_;
                                        if( inx * dx + iny * dy > Computation::theTrixelizeOverlapTol )
                                                {
                                                        allOutside = false;
                                                        break;
                                                }
                                }
                        if( allOutside )
                                {
                                        return false;
                                }
                }

        /* Note that this is only one part of the test, only if both symmetric tests return true do the
         * polygons overlap.
         */
        return true;
}

// tol shall be positive, and gives the smallest acceptable distance from commonPoint to the intersection boundary.
bool
Computation::ZBufTriangle::overlaps( const ZBufTriangle & other, Concrete::Coords2D * commonPoint, Concrete::Length tol ) const
{
        // We set up a linear program, and use simplex to solve it.

        // The linear program is to maximize the distance from the common point to the intersection boundary,
        // and if the distance becomes greater than tol during the search, we're happy without locating the optimum.

        const size_t N_CONSTRAINTS = 7;
        const size_t N_VARIABLES = 3;

        static double c[ N_VARIABLES ] = { 0, 0, 1 };
        static double a[ N_CONSTRAINTS * N_VARIABLES ] =
                { 0, 0, 1,
                        0, 0, 1,
                        0, 0, 1,
                        0, 0, 1,
                        0, 0, 1,
                        0, 0, 1 };
        static double b[ N_CONSTRAINTS ];
        static double x[ N_VARIABLES ];

        Concrete::Length xmin = HUGE_VAL;
        Concrete::Length ymin = HUGE_VAL;

        typedef typeof points_ ListType;
        for( ListType::const_iterator i = points_.begin( ); i != points_.end( ); ++i )
                {
                        xmin = std::min( xmin, i->x_ );
                        ymin = std::min( ymin, i->y_ );
                }
        for( ListType::const_iterator i = other.points_.begin( ); i != other.points_.end( ); ++i )
                {
                        xmin = std::min( xmin, i->x_ );
                        ymin = std::min( ymin, i->y_ );
                }
        Concrete::Coords2D llCorner( xmin, ymin );

        addTriangleConstraints( llCorner, & a[ 0 ], & b[ 0 ] );
        other.addTriangleConstraints( llCorner, & a[ 9 ], & b[ 3 ] );

        // bShift is the amount _added_ to the right hand side in order to make the initial point feasible.
        // It is computed via its additive inverse, and then the sign is changed.
        // (The initial point will be feasible if the right hand side has no negative elements.)
        double bShift = b[ 0 ];
        for( const double * src = & b[ 1 ]; src != b + N_CONSTRAINTS; ++src )
                {
                        bShift = std::min( bShift, *src );
                }
        bShift = - bShift;

        for( double * dst = & b[ 0 ]; dst != b + N_CONSTRAINTS; ++dst )
                {
                        *dst += bShift;
                }


        double optRes;
        bool res;
        try
                {
                        res = Computation::theTwoTriangleSimplex.maximize( & x[0],
                                                                                                                                                                                                                                 & optRes, static_cast< double >( Concrete::Length::offtype( tol ) ) + bShift,
                                                                                                                                                                                                                                 & c[0], & a[0], & b[0] );
                }
        catch( const char * ball )
                {
                        throw Exceptions::InternalError( ball );
                }

        if( optRes < bShift )
                {
                        std::cerr << "Simplex couldn't find a truly feasible point: " << optRes << " < " << bShift << std::endl ;
                }

        commonPoint->x_ = xmin + Concrete::Length( x[ 0 ] );
        commonPoint->y_ = ymin + Concrete::Length( x[ 1 ] );

        return res;
}

// tol shall be positive, and gives the smallest acceptable distance from a common point on line to the intersection boundary.
bool
Computation::ZBufTriangle::overlapsAlong( const ZBufTriangle & other, const Computation::SplicingLine & line, Concrete::Length tol ) const
{
        // This is much simpler than the simplex solution to the general overlap problem.       Unfortunately, it doesn't seem like
        // just keeping track of an upper and lower bound of the time along the line, since this will very often involve division
        // by tiny numbers when line is parallel to any of the triangle sides.
        //
        // Instead, I keep track of two points points on the line, initialized far away in both directions.     When comparing against
        // a triangle side, four situations can occur, given by which of the points that satisfy the constraint.        If none of the points
        // satisfy the constraint, there is no intersection along the line.     If both satisfy the constraint, the constraint does not
        // further restrict the points. In the remaining case, the point which does not satisfy the constraint is moved to the border.

        // The tolerance is implemented by changing all constraints by tol.

        Concrete::Coords2D upper = line.p0_ + ( 0.1 * std::numeric_limits< double >::max( ) ) * line.d_;
        Concrete::Coords2D lower = line.p0_ - ( 0.1 * std::numeric_limits< double >::max( ) ) * line.d_;

        // It is convenient to use the halfspace intersection representation of the triangles, so some
        // code is borrowed from ZBufTriangle::overlaps.
        // However, this time only two out of the three variables are used.
        const size_t N_CONSTRAINTS = 3;
        const size_t N_VARIABLES = 3;

        static double a[ N_CONSTRAINTS * N_VARIABLES ];
        static double b[ N_CONSTRAINTS ];
        double * bend = & b[ 0 ] + N_CONSTRAINTS;

        Concrete::Coords2D llCorner( 0, 0 );    // This does not matter, so we may take the origin for instance
        {
                addTriangleConstraints( llCorner, & a[ 0 ], & b[ 0 ] );
                // Here's how the tolerance is implemented.     Since the coefficients in are normalized outward normals,
                // The triangles are shrunk by tol in all directions by subtracting tol from b.
                const double * srca = & a[0];
                for( const double * srcb = & b[ 0 ]; srcb != bend; ++srcb, srca += N_VARIABLES )
                        {
                                Concrete::UnitFloatPair n( *( srca ), *( srca + 1 ), bool( ) );
                                Concrete::Length m = Concrete::Length( *srcb ) - tol;
                                bool upperInside = Concrete::inner( n, upper ) < m;
                                bool lowerInside = Concrete::inner( n, lower ) < m;

                                if( upperInside && lowerInside )
                                        {
                                                continue;
                                        }
                                if( upperInside )
                                        {
                                                // Move lower.
                                                // That is, with lower = line.p0_ + t * line.d_, for some t, it shall also satisfy
                                                //       Concrete::inner( n, lower ) == m
                                                lower = line.p0_ + ( ( m - Concrete::inner( n, line.p0_ ) ) / Concrete::inner( n, line.d_ ) ) * line.d_;
                                                continue;
                                        }
                                if( lowerInside )
                                        {
                                                // Move upper, see above.
                                                upper = line.p0_ + ( ( m - Concrete::inner( n, line.p0_ ) ) / Concrete::inner( n, line.d_ ) ) * line.d_;
                                                continue;
                                        }
                                // None of the points did satisfy the constraint.       Infeasible.     No overlap.
                                return false;
                        }
        }
        {
                other.addTriangleConstraints( llCorner, & a[ 0 ], & b[ 0 ] );
                const double * srca = & a[0];
                for( const double * srcb = & b[ 0 ]; srcb != bend; ++srcb, srca += N_VARIABLES )
                        {
                                Concrete::UnitFloatPair n( *( srca ), *( srca + 1 ), bool( ) );
                                Concrete::Length m = Concrete::Length( *srcb ) - tol;
                                bool upperInside = Concrete::inner( n, upper ) < m;
                                bool lowerInside = Concrete::inner( n, lower ) < m;

                                if( upperInside && lowerInside )
                                        {
                                                continue;
                                        }
                                if( upperInside )
                                        {
                                                // Move lower.
                                                // That is, with lower = line.p0_ + t * line.d_, for some t, it shall also satisfy
                                                //       Concrete::inner( n, lower ) == m
                                                lower = line.p0_ + ( ( m - Concrete::inner( n, line.p0_ ) ) / Concrete::inner( n, line.d_ ) ) * line.d_;
                                                continue;
                                        }
                                if( lowerInside )
                                        {
                                                // Move upper, see above.
                                                upper = line.p0_ + ( ( m - Concrete::inner( n, line.p0_ ) ) / Concrete::inner( n, line.d_ ) ) * line.d_;
                                                continue;
                                        }
                                // None of the points did satisfy the constraint.       Infeasible.     No overlap.
                                return false;
                        }
        }

        return true;
}

void
Computation::ZBufTriangle::addTriangleConstraints( Concrete::Coords2D llCorner, double * a, double * b ) const
{
        typedef typeof points_ ListType;
        ListType::const_iterator i0 = points_.begin( );
        ListType::const_iterator i1 = i0;
        ++i1;
        ListType::const_iterator i2 = i1;
        ++i2;

        // Note that a is increased by 3 since one position holds a constant 1.
        for( ; i0 != points_.end( ); i1 = i2, i2 = i0, ++i0, a += 3, ++b )
                {
                        // It's important that the normal be normalized, for otherwise the interpretation of the common slack (the third variable) will be wrong.
                        Concrete::UnitFloatPair n = i0->normalizedOrthogonal( *i1 );

                        if( Concrete::inner( n, *i2 - *i0 ) < 0 )
                                {
                                        // The normal points out.
                                        *a = n.x_;
                                        *(a+1) = n.y_;
                                        *b = Concrete::Length::offtype( Concrete::inner( n, *i0 - llCorner ) );
                                }
                        else
                                {
                                        // The normal points in -- reverse everything.
                                        *a = - n.x_;
                                        *(a+1) = - n.y_;
                                        *b = - Concrete::Length::offtype( Concrete::inner( n, *i0 - llCorner ) );
                                }
                }
}


std::ostream &
Computation::operator << ( std::ostream & os, const Computation::ZBufTriangle & self )
{
        std::vector< Concrete::Coords2D >::const_iterator i = self.points_.begin( );
        os << *i << " -- " ;
        ++i;
        os << *i << " -- " ;
        ++i;
        os << *i ;
        return os;
}

Concrete::Area
Computation::ZBufTriangle::area( ) const
{
        return Computation::triangleArea( points_[ 0 ], points_[ 1 ], points_[ 2 ] );
}

bool
Computation::ZBufTriangle::contains( const Concrete::Coords2D & p ) const
{
        for( std::vector< Concrete::Coords2D >::const_iterator i0 = points_.begin( ); i0 != points_.end( ); ++i0 )
                {
                        std::vector< Concrete::Coords2D >::const_iterator i1 = i0;
                        ++i1;
                        if( i1 == points_.end( ) )
                                {
                                        i1 = points_.begin( );
                                }
                        std::vector< Concrete::Coords2D >::const_iterator i2 = i1;
                        ++i2;
                        if( i2 == points_.end( ) )
                                {
                                        i2 = points_.begin( );
                                }

                        const Concrete::Coords2D & p0( *i0 );
                        const Concrete::Coords2D & p1( *i1 );

                        const double tx = ( p1.x_ - p0.x_ ).offtype< 1, 0 >( );
                        const double ty = ( p1.y_ - p0.y_ ).offtype< 1, 0 >( );
                        bool counterClockwise; // true when ( p0, p1 ) are ordered counter-clockwise around the interior.
                        {
                                const Concrete::Length dx = i2->x_ - p0.x_;
                                const Concrete::Length dy = i2->y_ - p0.y_;
                                counterClockwise = ( ty * dx - tx * dy < Concrete::ZERO_LENGTH );
                        }

                        {
                                const Concrete::Length dx = p.x_ - p0.x_;
                                const Concrete::Length dy = p.y_ - p0.y_;
                                if( ( ty * dx - tx * dy > Concrete::ZERO_LENGTH ) == counterClockwise )
                                        {
                                                return false;
                                        }
                        }
                }

        return true;
}


// The larger <tol>, the more often will this function return true.
bool
Computation::ZBufTriangle::contains( const Concrete::Coords2D & p, Concrete::Length tol ) const
{
        for( std::vector< Concrete::Coords2D >::const_iterator i0 = points_.begin( ); i0 != points_.end( ); ++i0 )
                {
                        std::vector< Concrete::Coords2D >::const_iterator i1 = i0;
                        ++i1;
                        if( i1 == points_.end( ) )
                                {
                                        i1 = points_.begin( );
                                }
                        std::vector< Concrete::Coords2D >::const_iterator i2 = i1;
                        ++i2;
                        if( i2 == points_.end( ) )
                                {
                                        i2 = points_.begin( );
                                }

                        const Concrete::Coords2D & p0( *i0 );
                        const Concrete::Coords2D & p1( *i1 );

                        const Concrete::UnitFloatPair d = p0.normalizedOrthogonal( p1 );
                        if( Concrete::inner( d, *i2 - p0 ) < Concrete::ZERO_LENGTH )
                                {
                                        // d points out
                                        if( Concrete::inner( d, p - p0 ) > tol )
                                                {
                                                        return false;
                                                }
                                }
                        else
                                {
                                        // d points in
                                        if( Concrete::inner( d, p - p0 ) < - tol )
                                                {
                                                        return false;
                                                }
                                }
                }

        return true;
}

void
Computation::ZBufTriangle::pushLines( std::vector< Computation::SplicingLine > * dst ) const
{
        for( std::vector< Concrete::Coords2D >::const_iterator i0 = points_.begin( ); i0 != points_.end( ); ++i0 )
                {
                        std::vector< Concrete::Coords2D >::const_iterator i1 = i0;
                        ++i1;
                        if( i1 == points_.end( ) )
                                {
                                        i1 = points_.begin( );
                                }
                        pushIfUnique( dst, *i0, *i1 );
                }
}

void
Computation::ZBufTriangle::pushIntersection( std::vector< Computation::SplicingLine > * dst, const Computation::ZBufTriangle & other ) const
{
        Concrete::Coords3D p0( 0, 0, 0 );
        Concrete::Coords3D p1( 0, 0, 0 );
        if( intersectionLinePoints( other, & p0, & p1 ) )
                {
                 pushIfUnique( dst, p0, p1, false );
                }
}

bool
Computation::ZBufTriangle::intersection( const Computation::ZBufTriangle & other, Computation::SplicingLine * line ) const
{
        Concrete::Coords3D p03D( 0, 0, 0 );
        Concrete::Coords3D p13D( 0, 0, 0 );
        if( intersectionLinePoints( other, & p03D, & p13D ) )
                {
                        const Concrete::Coords2D p0 = p03D.make2DAutomatic( zMap_->eyez( ) );
                        const Concrete::Coords2D p1 = p13D.make2DAutomatic( zMap_->eyez( ) );
                        *line = Computation::SplicingLine( p0, p1 - p0, false );
                        return true;
                }
        return false;
}


bool
Computation::ZBufTriangle::intersectionLinePoints( const Computation::ZBufTriangle & other, Concrete::Coords3D * p0, Concrete::Coords3D * p1 ) const
{
        double a0[3];
        Concrete::Length b0;
        zMap_->writeToMatrices( a0, & b0 );

        double a1[3];
        Concrete::Length b1;
        other.zMap_->writeToMatrices( a1, & b1 );

        Concrete::Coords3D ray( a0[1]*a1[2] - a0[2]*a1[1],
                                                                                                        a0[2]*a1[0] - a0[0]*a1[2],
                                                                                                        a0[0]*a1[1] - a0[1]*a1[0] );

        // If the ray is zero, the planes are paralell, so there's no splicing line to add.
        if( ray.normScalar( ) < 1e-5 )
                {
                        return false;
                }

        size_t bestCol = 4;
        {
                double * src = a0;
                double bestAbs = 0;
                for( size_t col_i = 0; col_i < 3; ++col_i, ++src )
                        {
                                double tmp = fabs( *src );
                                if( tmp > bestAbs )
                                        {
                                                bestAbs = tmp;
                                                bestCol = col_i;
                                        }
                        }
        }
        // Here, one could check that bestCol has really been assigned.
        // To test if it is unassigned, test for bestCol == 4.

        {
                const double f = a1[bestCol] / a0[bestCol];
                double * src = a0;
                double * dst = a1;
                for( ; src != a0 + 3; ++src, ++dst )
                        {
                                *dst -= f * *src;
                        }
                b1 -= f * b0;
        }

        // The remaining two columns of the second row can now be used to determine the other two components.
        // Let secondCol point out the biggest remaining element in a1, and zeroCol point out the column containing the smallest
        // (non-zero) element.
        // First, we guess...
        size_t secondCol;
        size_t zeroCol;
        switch( bestCol )
                {
                case 0:
                        secondCol = 1;
                        zeroCol = 2;
                        break;
                case 1:
                        secondCol = 0;
                        zeroCol = 2;
                        break;
                case 2:
                        secondCol = 0;
                        zeroCol = 1;
                        break;
                default:
                        throw Exceptions::InternalError( "pushIntersection: Column switch out of range." );
                }
        // ... then correct the guess if it's wrong
        if( fabs( a1[secondCol] ) < fabs( a1[zeroCol] ) )
                {
                        size_t tmp = zeroCol;
                        zeroCol = secondCol;
                        secondCol = tmp;
                }

        Concrete::Length res[3];
        // Now it's time to determine the first two components of the solution.
        res[zeroCol] = Concrete::ZERO_LENGTH;
        res[secondCol] = b1 / a1[secondCol];

        // and then the final component follows by back-substitution:
        b0 -= a0[secondCol] * res[secondCol];
        res[bestCol] = b0 / a0[bestCol];

        *p0 = Concrete::Coords3D( res[0], res[1], res[2] );
        *p1 = *p0 + Concrete::SOME_LENGTH * ray.direction( );

        return true;
}

void
Computation::ZBufTriangle::pushIfUnique( std::vector< Computation::SplicingLine > * dst, const Concrete::Coords3D p03D, const Concrete::Coords3D p13D, bool isTriangleSide ) const
{
        const Concrete::Coords2D p0 = p03D.make2DAutomatic( zMap_->eyez( ) );
        const Concrete::Coords2D p1 = p13D.make2DAutomatic( zMap_->eyez( ) );
        typedef typeof *dst ListType;
        for( ListType::const_iterator i = dst->begin( ); i != dst->end( ); ++i )
                {
                        if( i->distanceTo( p0 ) < Computation::theTrixelizeSplicingTol && i->distanceTo( p1 ) < Computation::theTrixelizeSplicingTol )
                                {
                                        return;
                                }
         }
        dst->push_back( Computation::SplicingLine( p0, p1 - p0, isTriangleSide ) );
}

namespace Shapes
{
        typedef std::pair< const Concrete::Coords2D *, const Concrete::Coords2D * > VisitType;
}
namespace std
{
        template< >
        class less< Shapes::VisitType >
        {
        public:
                bool operator () ( const Shapes::VisitType & p1,
                                                                                         const Shapes::VisitType & p2 )
                {
                        if( p1.first < p2.first )
                                {
                                        return true;
                                }
                        if( p2.first < p1.first )
                                {
                                        return false;
                                }
                        return p1.second < p2.second;
                }
        };
}

void
Computation::ZBufTriangle::splice( const ZBufTriangle & tOld, const ZBufTriangle & tNew, std::list< Computation::ZBufTriangle > * oldDisjointTriangles, std::list< Computation::ZBufTriangle > * oldOccludedTriangles, std::list< Computation::ZBufTriangle > * newDisjointTriangles, std::list< Computation::ZBufTriangle > * newOccludedTriangles, std::list< Computation::ZBufTriangle > * triangleQueue )
{
        SPLICEDEBUG( std::cerr << "==== Overlapping triangles ====" << std::endl
                                                         << "   old: " << tOld << std::endl
                                                         << "   new: " << tNew << std::endl );

        // This function is only called if the triangles overlap

        std::vector< Computation::SplicingLine > lines;

        tOld.pushLines( & lines );
        tNew.pushLines( & lines );

        tOld.pushIntersection( & lines, tNew );

        const size_t numberOfLines = lines.size( );

        SPLICEDEBUG( std::cerr << "#needs circle" << std::endl
                                                         << "#needs centering" << std::endl
                                                         << std::endl
                                                         << "@width:0bp" << std::endl
                                                         << "|" << std::endl
                                                         << "{" << std::endl
                                                         << "res: Hot2D <<" << std::endl );

        {
                typedef typeof lines ListType;
                for( ListType::iterator i = lines.begin( ); i != lines.end( ); ++i )
                        {
                                SPLICEDEBUG( std::cerr << "|** Line " << ( i - lines.begin( ) ) << ": " );
                                //                              SPLICEDEBUG( std::cerr << i->p0_ << " -- " << i->p0_ + i->d_ * i->length_ << std::endl );
                                SPLICEDEBUG( std::cerr << std::endl
                                                                                 << "res << stroke [] "
                                                                                 << " (" << Helpers::shapesFormat( i->p0_.x_ ) << "," << Helpers::shapesFormat( i->p0_.y_ )
                                                                                 << ")--(" << Helpers::shapesFormat( (i->p0_ + i->d_ * i->length_).x_ ) << "," << Helpers::shapesFormat( (i->p0_ + i->d_ * i->length_).y_ ) << ")"
                                                                                 << std::endl );
                                i->intersections_.resize( numberOfLines, 0 );
                        }
        }


        std::vector< Concrete::Coords2D > intersectionsMem;
        intersectionsMem.reserve( numberOfLines * ( numberOfLines - 1 ) / 2 );

        {
                typedef typeof lines ListType;
                size_t idx_i = 0;
                for( ListType::iterator i = lines.begin( ); i != lines.end( ); ++i, ++idx_i )
                        {
                                SPLICEDEBUG( std::cerr << "|** Line " << idx_i << " intersections: " );
                                SPLICEDEBUG( std::cerr << std::endl );
                                ListType::const_iterator j = i;
                                size_t idx_j = idx_i;
                                ++j;
                                ++idx_j;
                                for( ; j != lines.end( ); ++j, ++idx_j )
                                        {
                                                try
                                                        {
                                                                Concrete::Coords2D tmp = i->intersection( *j );
                                                                typedef typeof intersectionsMem VectorType;
                                                                bool reuse = false;
                                                                // We try to reuse an old point.        Not to save space, but to make the algorithm more robust by
                                                                // perhaps avoiding some corner cases this way...
                                                                for( VectorType::const_iterator k = intersectionsMem.begin( ); k != intersectionsMem.end( ); ++k )
                                                                        {
                                                                                if( ( tmp - *k ).norm( ) < Computation::theTrixelizeSplicingTol )
                                                                                        {
                                                                                                //                                                                                              SPLICEDEBUG( std::cerr << "<" << tmp << ">      " );
                                                                                                SPLICEDEBUG( std::cerr << "|** reusing <" << tmp << ">  " << std::endl );
                                                                                                reuse = true;
                                                                                                lines[ idx_i ].intersections_[ idx_j ] = & *k;
                                                                                                lines[ idx_j ].intersections_[ idx_i ] = & *k;
                                                                                                break;
                                                                                        }
                                                                        }
                                                                if( ! reuse )
                                                                        {
                                                                                //                                                                              SPLICEDEBUG( std::cerr << tmp << "      " );
                                                                                SPLICEDEBUG( std::cerr << "res << [shift (" << Helpers::shapesFormat( tmp.x_ ) << "," << Helpers::shapesFormat( tmp.y_ ) << ")] [] stroke [] [circle 0.1mm]" << std::endl );
                                                                                intersectionsMem.push_back( tmp );
                                                                                lines[ idx_i ].intersections_[ idx_j ] = & intersectionsMem.back( );
                                                                                lines[ idx_j ].intersections_[ idx_i ] = & intersectionsMem.back( );
                                                                        }
                                                        }
                                                catch( const char * )
                                                        {
                                                                //                                                              SPLICEDEBUG( std::cerr << "(no-int)" << "       " );
                                                                SPLICEDEBUG( std::cerr << "|** (no-int)" << std::endl );
                                                        }
                                        }
                                SPLICEDEBUG( std::cerr << std::endl );
                        }
        }

        SPLICEDEBUG( std::cerr << "res;" << std::endl
                                                         << "bb: [bbox res]" << std::endl
                                                         << "@<< [scale 19cm/[max [xmax bb]-[xmin bb] [ymax bb]-[ymin bb]]] [] res" << std::endl
                                                         << "}" << std::endl );

        std::set< VisitType > visited;

        for( size_t start_a = 0; start_a < numberOfLines; ++start_a )
                {
                        if( ! lines[ start_a ].isTriangleSide_ )
                                {
                                        continue;
                                }
                        for( size_t start_b = 0; start_b < numberOfLines; ++start_b )
                                {
                                        if( start_b == start_a )
                                                {
                                                        continue;
                                                }
                                        SPLICEDEBUG( std::cerr << "From line " << start_a << " to line " << start_b << std::endl );
                                        const Concrete::Coords2D * p0 = lines[ start_a ].intersections_[ start_b ];
                                        if( p0 == 0 )
                                                {
                                                        SPLICEDEBUG( std::cerr << "     No intersection" << std::endl );
                                                        continue;
                                                }
                                        Concrete::UnitFloatPair start_n = lines[ start_a ].n_;
                                        for( char start_n_i = 0; start_n_i < 2; ++start_n_i, start_n = start_n.reverse( ) )
                                                {
                                                        SPLICEDEBUG( std::cerr << "     Starting direction " << static_cast< int >( start_n_i ) << std::endl );
                                                        Concrete::UnitFloatPair n = start_n;
                                                        size_t currentLine = start_b;
                                                        size_t nextLine;
                                                        try
                                                                {
                                                                        nextLine = lines[ currentLine ].nextLine( p0, n, lines );
                                                                        SPLICEDEBUG( std::cerr << "Line " << currentLine << " --> " << nextLine << std::endl );
                                                                }
                                                        catch( const char * ball )
                                                                {
                                                                        continue;
                                                                }
                                                        const Concrete::Coords2D * p1 = lines[ currentLine ].intersections_[ nextLine ];
                                                        if( visited.find( VisitType( p0, p1 ) ) != visited.end( ) )
                                                                {
                                                                        SPLICEDEBUG( std::cerr << *p0 << " --> " << *p1 << " already visited" << std::endl );
                                                                        continue;
                                                                }
                                                        visited.insert( VisitType( p0, p1 ) );

                                                        // visitedLines is used to tell when we have completed a polygon; when a line is visited a second time,
                                                        // the polygon is complete.     The first point is on start_b.  start_a is only used to give a direction along
                                                        // start_b.
                                                        std::vector< bool > visitedLines;
                                                        visitedLines.resize( numberOfLines, false );
                                                        visitedLines[ currentLine ] = true;

                                                        {
                                                                Concrete::UnitFloatPair oldn = n;
                                                                n = lines[ currentLine ].n_;
                                                                if(     - oldn.y_ * n.x_ + oldn.x_ * n.y_ < 0 )
                                                                        {
                                                                                n = n.reverse( );
                                                                        }
                                                        }

                                                        const Concrete::Coords2D * p2 = 0;

                                                        currentLine = nextLine;
                                                        try
                                                                {
                                                                        nextLine = lines[ currentLine ].nextLine( p1, n, lines );
                                                                        SPLICEDEBUG( std::cerr << "Line " << currentLine << " --> " << nextLine << std::endl );
                                                                }
                                                        catch( const char * ball )
                                                                {
                                                                        SPLICEDEBUG( std::cerr << "Line " << currentLine << " --> " << "infinity! (no enclosed region)" << std::endl );
                                                                        continue;
                                                                }
                                                        p2 = lines[ currentLine ].intersections_[ nextLine ];
                                                        visited.insert( VisitType( p1, p2 ) );
                                                        visitedLines[ currentLine ] = true;

                                                        // Here, we choose a way to compute a point well inside the *p0--*p1--*p2 triangle.
                                                        // Using the mean is quick, but the incenter should be more robust.
                                                        Concrete::Coords2D mean = (1./3) * ( *p0 + *p1 + *p2 );
                                                        //                                                      Concrete::Coords2D mean = Computation::triangleIncenter( *p0, *p1, *p2 );

                                                        // The following test never triggers, which is good.
//                                                       if( tOld.contains( mean ) &&
//                                                                       ( ( ! tOld.contains( *p0, Computation::theTrixelizeSplicingTol ) ) ||
//                                                                               ( ! tOld.contains( *p1, Computation::theTrixelizeSplicingTol ) ) ||
//                                                                               ( ! tOld.contains( *p2, Computation::theTrixelizeSplicingTol ) ) ) )
//                                                               {
//                                                                       std::cerr << "tOld contains mean but not all corners!" << std::endl ;
//                                                               }
//                                                       if( tNew.contains( mean ) &&
//                                                                       ( ( ! tNew.contains( *p0, Computation::theTrixelizeSplicingTol ) ) ||
//                                                                               ( ! tNew.contains( *p1, Computation::theTrixelizeSplicingTol ) ) ||
//                                                                               ( ! tNew.contains( *p2, Computation::theTrixelizeSplicingTol ) ) ) )
//                                                               {
//                                                                       std::cerr << "tNew contains mean but not all corners!" << std::endl ;
//                                                               }



                                                        const Computation::ZBufTriangle * topTriangle = 0;
                                                        bool reQueue = true;
                                                        std::list< Computation::ZBufTriangle > * disjointDestination = 0; // this must be assigned when ( ! reQueue )
                                                        if( tOld.contains( mean ) )
                                                                {
                                                                        reQueue = false;
                                                                        if( tNew.contains( mean ) )
                                                                                {
                                                                                        if( tOld.isOnTopOfAt( tNew, mean ) )
                                                                                                {
                                                                                                        topTriangle = & tOld;
                                                                                                        disjointDestination = oldDisjointTriangles;
                                                                                                        SPLICEDEBUG( std::cerr << "Part of tOld" << std::endl );
                                                                                                }
                                                                                        else
                                                                                                {
                                                                                                        topTriangle = & tNew;
                                                                                                        disjointDestination = newDisjointTriangles;
                                                                                                        SPLICEDEBUG( std::cerr << "Part of tNew" << std::endl );
                                                                                                }
                                                                                }
                                                                        else
                                                                                {
                                                                                        topTriangle = & tOld;
                                                                                        disjointDestination = oldDisjointTriangles;
                                                                                        SPLICEDEBUG( std::cerr << "Part of tOld" << std::endl );
                                                                                }
                                                                }
                                                        else
                                                                {
                                                                        if( tNew.contains( mean ) )
                                                                                {
                                                                                        topTriangle = & tNew;
                                                                                        SPLICEDEBUG( std::cerr << "Part of tNew" << std::endl );
                                                                                }
                                                                        else
                                                                                {
                                                                                        SPLICEDEBUG( std::cerr << "Outside painted area" << std::endl );
                                                                                        continue;
                                                                                }
                                                                }

                                                        size_t undoSize;
                                                        if( reQueue )
                                                                {
                                                                        undoSize = triangleQueue->size( );
                                                                }
                                                        else
                                                                {
                                                                        undoSize = disjointDestination->size( );
                                                                }

                                                        // This tolerance test assures that we don't produce tiny-tiny triangles.
                                                        if( Computation::triangleArea( *p0, *p1, *p2 ) > Computation::theTrixelizeOverlapTol * Computation::triangleSemiPerimeter( *p0, *p1, *p2 ) )
                                                                {
                                                                        if( reQueue )
                                                                                {
                                                                                        triangleQueue->push_back( Computation::ZBufTriangle( topTriangle->painter_,
                                                                                                                                                                                                                                                                                                         topTriangle->zMap_,
                                                                                                                                                                                                                                                                                                         *p0, *p1, *p2) );
                                                                                }
                                                                        else
                                                                                {
                                                                                        disjointDestination->push_back( Computation::ZBufTriangle( topTriangle->painter_,
                                                                                                                                                                                                                                                                                                                                 topTriangle->zMap_,
                                                                                                                                                                                                                                                                                                                                 *p0, *p1, *p2) );
                                                                                }
                                                                }
                                                        p1 = p2;

                                                        {
                                                                Concrete::UnitFloatPair oldn = n;
                                                                n = lines[ currentLine ].n_;
                                                                if(     - oldn.y_ * n.x_ + oldn.x_ * n.y_ < 0 )
                                                                        {
                                                                                n = n.reverse( );
                                                                        }
                                                        }

                                                        bool insertTriangles = true;

                                                        while( ! visitedLines[ nextLine ] )
                                                                {
                                                                        currentLine = nextLine;
                                                                        try
                                                                                {
                                                                                        nextLine = lines[ currentLine ].nextLine( p1, n, lines );
                                                                                        SPLICEDEBUG( std::cerr << "Line " << currentLine << " --> " << nextLine << std::endl );
                                                                                }
                                                                        catch( const char * ball )
                                                                                {
                                                                                        SPLICEDEBUG( std::cerr << "Line " << currentLine << " --> " << "infinity! (no enclosed region)" << std::endl );
                                                                                        insertTriangles = false;
                                                                                        break;
                                                                                }
                                                                        p2 = lines[ currentLine ].intersections_[ nextLine ];
                                                                        visited.insert( VisitType( p1, p2 ) );
                                                                        visitedLines[ currentLine ] = true;

                                                                        if( Computation::triangleArea( *p0, *p1, *p2 ) > Computation::theTrixelizeOverlapTol * Computation::triangleSemiPerimeter( *p0, *p1, *p2 ) )
                                                                                {
                                                                                        if( reQueue )
                                                                                                {
                                                                                                        triangleQueue->push_back( Computation::ZBufTriangle( topTriangle->painter_,
                                                                                                                                                                                                                                                                                                                         topTriangle->zMap_,
                                                                                                                                                                                                                                                                                                                         *p0, *p1, *p2) );
                                                                                                }
                                                                                        else
                                                                                                {
                                                                                                        disjointDestination->push_back( Computation::ZBufTriangle( topTriangle->painter_,
                                                                                                                                                                                                                                                                                                                                                 topTriangle->zMap_,
                                                                                                                                                                                                                                                                                                                                                 *p0, *p1, *p2) );
                                                                                                }
                                                                                }
                                                                        p1 = p2;

                                                                        {
                                                                                Concrete::UnitFloatPair oldn = n;
                                                                                n = lines[ currentLine ].n_;
                                                                                if(     - oldn.y_ * n.x_ + oldn.x_ * n.y_ < 0 )
                                                                                        {
                                                                                                n = n.reverse( );
                                                                                        }
                                                                        }
                                                                }
                                                        if( insertTriangles )
                                                                {
                                                                        visited.insert( VisitType( p2, p0 ) );
                                                                        SPLICEDEBUG( std::cerr << "Found new region." << std::endl );
                                                                }
                                                        else
                                                                {
                                                                        if( reQueue )
                                                                                {
                                                                                        while( triangleQueue->size( ) > undoSize )
                                                                                                {
                                                                                                        triangleQueue->pop_back( );
                                                                                                }
                                                                                }
                                                                        else
                                                                                {
                                                                                        while( disjointDestination->size( ) > undoSize )
                                                                                                {
                                                                                                        disjointDestination->pop_back( );
                                                                                                }
                                                                                }
                                                                }
                                                }
                                }
                }
}

std::list< Computation::ZBufTriangle >::iterator
Computation::ZBufTriangle::spliceAlong( const Computation::SplicingLine & line, std::list< Computation::ZBufTriangle > * dst ) const
{

        // Two of the triangle sides will be intersected by the line.   A second line will have to be added to split the bottom
        // part of the splitted triangle in two triangles.
        // First two two intersections are identified along with the sides they belong to.      Then the triangle corners can be identified
        // and the three triangles be created.

        // Let p0 be the point on the intersection of the intereced triangle sides.
        // Let pa be the intersection on the line p0--p1,
        // and pb be the intersection on the line p0--p2.

        // This variable holds each corner points (signed) distance to the line.
        Concrete::Length lineDists[ 3 ];
        {
                Concrete::Length * distDst = & lineDists[ 0 ];
                for( std::vector< Concrete::Coords2D >::const_iterator i = points_.begin( ); i != points_.end( ); ++i, ++distDst )
                        {
                                *distDst = Concrete::inner( line.n_, *i ) - line.r_;
                        }
        }

        // However, the special case when the line intersects one of the corners will generate just two triangles.      This case is
        // considered first.
        {
                const Concrete::Length * distSrc = & lineDists[ 0 ];
                for( std::vector< Concrete::Coords2D >::const_iterator i = points_.begin( ); i != points_.end( ); ++i, ++distSrc )
                        {
                                if( distSrc->abs( ) < Computation::theTrixelizeSplicingTol )
                                        {
                                                // Here p0 coincides either of pa or pb, and here it is *i.
                                                // Let pa denote the intersection with the opposide triangle side.

                                                // Let p1 be *i1:
                                                std::vector< Concrete::Coords2D >::const_iterator i1 = i;
                                                ++i1;
                                                if( i1 == points_.end( ) )
                                                        {
                                                                i1 = points_.begin( );
                                                        }

                                                // Let p2 be *i2:
                                                std::vector< Concrete::Coords2D >::const_iterator i2 = i1;
                                                ++i2;
                                                if( i2 == points_.end( ) )
                                                        {
                                                                i2 = points_.begin( );
                                                        }

                                                // Parameterize the line segment from p1 to p2 as ( p1 + t * d )
                                                Concrete::Coords2D d = *i2 - *i1;
                                                // Then t can be computed easily using the equation of the line.
                                                Concrete::Coords2D pa = *i1 + ( ( line.r_ - Concrete::inner( line.n_, *i1 ) ) / Concrete::inner( line.n_, d ) ) * d;

                                                dst->push_back( Computation::ZBufTriangle( painter_,
                                                                                                                                                                                                                         zMap_,
                                                                                                                                                                                                                         *i1, *i, pa) );
                                                std::list< Computation::ZBufTriangle >::iterator res = dst->end( );
                                                --res;

                                                dst->push_back( Computation::ZBufTriangle( painter_,
                                                                                                                                                                                                                         zMap_,
                                                                                                                                                                                                                         *i2, *i, pa) );
                                                return res;
                                        }
                        }
        }

        // Turning the question of intersecting sides around, I search for the side which is not intersected by the line.
        // This side is identified by its both endpoints being on the same side of the line.
        // By now we assume that we don't run into corner cases when there's no clear cut.

        // Since only one line can avoid being intersected by the line, two distances will have the same sign, and the last
        // corner will have a distance to the line of the other sign.   Hence, the product of all signs will be the sign of the corner
        // not belonging to the avoiding line.
        bool p0sign = ( lineDists[ 0 ] > 0 ) ^ ( lineDists[ 1 ] > 0 ) ^ ( lineDists[ 2 ] > 0 );

        {
                const Concrete::Length * distSrc = & lineDists[ 0 ];
                for( std::vector< Concrete::Coords2D >::const_iterator i = points_.begin( ); i != points_.end( ); ++i, ++distSrc )
                        {
                                if( ( *distSrc > 0 ) == p0sign )
                                        {
                                                // We have p0 being *i

                                                // Let p1 be *i1:
                                                std::vector< Concrete::Coords2D >::const_iterator i1 = i;
                                                ++i1;
                                                if( i1 == points_.end( ) )
                                                        {
                                                                i1 = points_.begin( );
                                                        }

                                                // Let p2 be *i1:
                                                std::vector< Concrete::Coords2D >::const_iterator i2 = i1;
                                                ++i2;
                                                if( i2 == points_.end( ) )
                                                        {
                                                                i2 = points_.begin( );
                                                        }

                                                // Parameterize the line segment from p0 to p1 as ( p0 + ta * da )
                                                Concrete::Coords2D da = *i1 - *i;
                                                // Then ta can be computed easily using the equation of the line, and then inserted to obtain pa.
                                                Concrete::Coords2D pa = *i + ( ( line.r_ - Concrete::inner( line.n_, *i ) ) / Concrete::inner( line.n_, da ) ) * da;

                                                // Parameterize the line segment from p0 to p2 as ( p0 + tb * db )
                                                Concrete::Coords2D db = *i2 - *i;
                                                // Then tb can be computed easily using the equation of the line, and then inserted to obtain pb.
                                                Concrete::Coords2D pb = *i + ( ( line.r_ - Concrete::inner( line.n_, *i ) ) / Concrete::inner( line.n_, db ) ) * db;

                                                dst->push_back( Computation::ZBufTriangle( painter_,
                                                                                                                                                                                                                         zMap_,
                                                                                                                                                                                                                         *i, pa, pb) );
                                                std::list< Computation::ZBufTriangle >::iterator res = dst->end( );
                                                --res;

                                                dst->push_back( Computation::ZBufTriangle( painter_,
                                                                                                                                                                                                                         zMap_,
                                                                                                                                                                                                                         *i1, pa, pb) );
                                                dst->push_back( Computation::ZBufTriangle( painter_,
                                                                                                                                                                                                                         zMap_,
                                                                                                                                                                                                                         *i1, *i2, pb) );

                                                return res;
                                        }
                        }
        }

        throw Exceptions::InternalError( "Failed to identify p0 when splicing triangle along a line." );
}


RefCountPtr< const Lang::ElementaryPath2D >
Computation::ZBufTriangle::toPath( ) const
{
        Lang::ElementaryPath2D * res = new Lang::ElementaryPath2D;

        for( std::vector< Concrete::Coords2D >::const_iterator i = points_.begin( ); i != points_.end( ); ++i )
                {
                        res->push_back( new Concrete::PathPoint2D( i->x_, i->y_ ) );
                }
        res->close( );

        return RefCountPtr< const Lang::ElementaryPath2D >( res );
}

RefCountPtr< const Lang::Drawable2D >
Computation::ZBufTriangle::debugFrame( ) const
{
        const Concrete::Coords2D & p1( points_[ 0 ] );
        const Concrete::Coords2D & p2( points_[ 1 ] );
        const Concrete::Coords2D & p3( points_[ 2 ] );

        SPLICEDEBUG( std::cerr << "Debug frame: " << p1 << " -- " << p2 << " -- " << p3 << std::endl ; )

        Kernel::GraphicsState * discStatePtr = new Kernel::GraphicsState( true );
        discStatePtr->cap_ = Lang::CapStyle::CAP_ROUND;
        discStatePtr->width_ = 2 * Computation::triangleArea( p1, p2, p3 ) / Computation::triangleSemiPerimeter( p1, p2, p3 );
        discStatePtr->strokingColor_ = painter_->getColor( );
        RefCountPtr< const Kernel::GraphicsState > discState( discStatePtr );

        Kernel::GraphicsState * frameStatePtr = new Kernel::GraphicsState( true );
        frameStatePtr->width_ = Concrete::Length( 0.2 );
        RefCountPtr< const Kernel::GraphicsState > frameState( frameStatePtr );

        Lang::ElementaryPath2D * pointPath = new Lang::ElementaryPath2D;
        const Concrete::Coords2D incenter = Computation::triangleIncenter( p1, p2, p3 );
        pointPath->push_back( new Concrete::PathPoint2D( incenter.x_, incenter.y_ ) );
        pointPath->push_back( new Concrete::PathPoint2D( incenter.x_, incenter.y_ ) );

        SPLICEDEBUG( std::cerr << "     incenter: " << incenter << std::endl );
        SPLICEDEBUG( std::cerr << "     radius: " <<    Lang::Length( discState->width_ ) << std::endl );

        return Helpers::newSolidTransparencyGroup( RefCountPtr< const Lang::Drawable2D >
                                                                                                                                                                                 ( new Lang::PaintedPath2D( frameState, toPath( ), "S" ) ),
                                                                                                                                                                                 RefCountPtr< const Lang::Drawable2D >
                                                                                                                                                                                 ( new Lang::PaintedPath2D( discState, RefCountPtr< const Lang::ElementaryPath2D >( pointPath ), "S" ) ) );
}