Function splitByBorder

plugin/seq/plotPDF.cpp:2803–2910

	    if( (-EPS < t) && (t < 1+EPS) )
		return i;
	}
    }

    return -1;
}

void splitByBorder( std::vector< std::vector<double> > &partition_x, std::vector< std::vector<double> > &partition_y,
		    const std::vector< std::vector<double> > &cxs, const std::vector< std::vector<double> > &cys )
{
    assert( partition_x.size() == partition_y.size() );
    assert( cxs.size() == cys.size() );

    for(size_t i = 0; i < cxs.size(); i++){

	std::vector<double> cx = cxs[i];
	std::vector<double> cy = cys[i];

	assert( cx.size() == cy.size() );

	const double &beg_x = cx[0];
	const double &beg_y = cy[0];
    
	const double &end_x = cx.back(); // cx[ cx.size()-1 ]
	const double &end_y = cy.back(); // cy[ cy.size()-1 ]

	for(size_t j = 0; j < partition_x.size(); j++){

	    const std::vector<double> &px = partition_x[j];
	    const std::vector<double> &py = partition_y[j];

	    assert( px.size() == py.size() );

	    int beg_id = findSegment( beg_x, beg_y, px, py );

	    if( beg_id < 0 ) continue;

	    int end_id = findSegment( end_x, end_y, px, py );

	    if( end_id < 0 ) continue;

	    // findSegment returns 3n ( multiple of 3 )

	    if( end_id < beg_id ){
		int tmp_id = beg_id;
		beg_id = end_id;
		end_id = tmp_id;
		std::reverse(cx.begin(), cx.end());
		std::reverse(cy.begin(), cy.end());
	    }

	    if( beg_id == end_id ){

		if( (px[beg_id]-beg_x)*(px[beg_id]-beg_x) + (py[beg_id]-beg_y)*(py[beg_id]-beg_y)
		    > (px[beg_id]-end_x)*(px[beg_id]-end_x) + (py[beg_id]-end_y)*(py[beg_id]-end_y) ){

		    std::reverse(cx.begin(), cx.end());
		    std::reverse(cy.begin(), cy.end());
		}