intersect.cc File Reference

#include "subdivider.h"
#include "backend.h"

Include dependency graph for intersect.cc:

Go to the source code of this file.

Enumerations
enum	i_result { INTERSECT_VERTEX , INTERSECT_EDGE }

Functions
static int	arc_classify (Arc_ptr, int, REAL)
static enum i_result	pwlarc_intersect (PwlArc *, int, REAL, int, int[3])
static void	vert_interp (TrimVertex *n, TrimVertex *l, TrimVertex *r, int p, REAL val)

Enumeration Type Documentation

i_result

enum i_result

Enumerator
INTERSECT_VERTEX
INTERSECT_EDGE

Definition at line 51 of file intersect.cc.

{ INTERSECT_VERTEX, INTERSECT_EDGE };

Function Documentation

arc_classify()

static int arc_classify ( Arc_ptr  jarc, int  param, REAL  value  )

static

Definition at line 405 of file intersect.cc.

{
    REAL tdiff, hdiff;
    if( param == 0 ) {
    tdiff = jarc->tail()[0] - value;
    hdiff = jarc->head()[0] - value;
    } else {
    tdiff = jarc->tail()[1] - value;
    hdiff = jarc->head()[1] - value;
    }
 
    if( tdiff > 0.0 ) {
    if( hdiff > 0.0 ) {
        return 0x11;
    } else if( hdiff == 0.0 ) {
        return 0x12;
    } else {
        return 0x10;
    }
    } else if( tdiff == 0.0 ) {
    if( hdiff > 0.0 ) {
        return 0x21;
    } else if( hdiff == 0.0 ) {
        return 0x22;
    } else {
        return 0x20;
    }
    } else {
    if( hdiff > 0.0 ) {
        return 0x01;
    } else if( hdiff == 0.0 ) {
        return 0x02;
    } else {
        return 0;
    }
    }
}

Referenced by Subdivider::classify_headonleft_s(), Subdivider::classify_headonleft_t(), Subdivider::classify_headonright_s(), Subdivider::classify_headonright_t(), Subdivider::classify_tailonleft_s(), Subdivider::classify_tailonleft_t(), Subdivider::classify_tailonright_s(), and Subdivider::classify_tailonright_t().

pwlarc_intersect()

static enum i_result pwlarc_intersect ( PwlArc *  pwlArc, int  param, REAL  value, int  dir, int  loc[3]  )

static

Definition at line 346 of file intersect.cc.

{
    assert( pwlArc->npts > 0 );
 
    if( dir ) {
    TrimVertex *v = pwlArc->pts;
    int imin = 0; 
    int imax = pwlArc->npts - 1;
    assert( value > v[imin].param[param] );
    assert( value < v[imax].param[param] ); 
    while( (imax - imin) > 1 ) {
        int imid = (imax + imin)/2;
        if( v[imid].param[param] > value )
        imax = imid;
        else if( v[imid].param[param] < value )
        imin = imid;
        else {
        loc[1] = imid;
        return INTERSECT_VERTEX;
        }
    }
    loc[0] = imin;
    loc[2] = imax;
    return INTERSECT_EDGE;
    } else {
    TrimVertex *v = pwlArc->pts;
    int imax = 0; 
    int imin = pwlArc->npts - 1;
    assert( value > v[imin].param[param] );
    assert( value < v[imax].param[param] ); 
    while( (imin - imax) > 1 ) {
        int imid = (imax + imin)/2;
        if( v[imid].param[param] > value )
        imax = imid;
        else if( v[imid].param[param] < value )
        imin = imid;
        else {
        loc[1] = imid;
        return INTERSECT_VERTEX;
        }
    }
    loc[0] = imin;
    loc[2] = imax;
    return INTERSECT_EDGE;
    }
}

Referenced by Subdivider::arc_split().

vert_interp()

static void vert_interp ( TrimVertex *  n, TrimVertex *  l, TrimVertex *  r, int  p, REAL  val  )

inlinestatic

Definition at line 157 of file intersect.cc.

{
    assert( val > l->param[p]);
    assert( val < r->param[p]);
 
    n->nuid = l->nuid;
 
    n->param[p] = val;
    if( l->param[1-p] != r->param[1-p]  ) {
    REAL ratio = (val - l->param[p]) / (r->param[p] - l->param[p]);
    n->param[1-p] = l->param[1-p] + 
                ratio * (r->param[1-p] - l->param[1-p]);
    } else {
    n->param[1-p] = l->param[1-p];
    }
}

Referenced by Subdivider::arc_split().