Method bisect

src/LNLib/Algorithm/Voronoi.cpp:379–412

}

struct LNLib::Edge* LNLib::VoronoiDiagramGenerator::bisect(struct Site* s1, struct Site* s2)
{
	float dx, dy, adx, ady;
	struct Edge* newedge;

	newedge = (struct Edge*)getfree(&efl);

	newedge->reg[0] = s1; //store the sites that this edge is bisecting
	newedge->reg[1] = s2;
	ref(s1);
	ref(s2);
	newedge->ep[0] = (struct Site*)NULL; //to begin with, there are no endpoints on the bisector - it goes to infinity
	newedge->ep[1] = (struct Site*)NULL;

	dx = s2->coord.x - s1->coord.x;			//get the difference in x dist between the sites
	dy = s2->coord.y - s1->coord.y;
	adx = dx > 0 ? dx : -dx;					//make sure that the difference in positive
	ady = dy > 0 ? dy : -dy;
	newedge->c = (float)(s1->coord.x * dx + s1->coord.y * dy + (dx * dx + dy * dy) * 0.5);//get the slope of the line

	if (adx > ady)
	{
		newedge->a = 1.0; newedge->b = dy / dx; newedge->c /= dx;//set formula of line, with x fixed to 1
	}
	else
	{
		newedge->b = 1.0; newedge->a = dx / dy; newedge->c /= dy;//set formula of line, with y fixed to 1
	};

	newedge->edgenbr = nedges;
	out_bisector(newedge);
	nedges += 1;
	return(newedge);
}

//create a new site where the HalfEdges el1 and el2 intersect - note that the PointVDG in the argument list is not used, don't know why it's there
struct LNLib::Site* LNLib::VoronoiDiagramGenerator::intersect(struct Halfedge* el1, struct Halfedge* el2, struct PointVDG* p)