79 lines
1.7 KiB
C++
79 lines
1.7 KiB
C++
|
#include "solvespace.h"
|
||
|
|
|
||
|
|
bool SEdgeList::AssemblePolygon(SPolygon *dest, SEdge *errorAt) {
|
||
|
|
dest->Clear();
|
||
|
|
l.ClearTags();
|
||
|
|
|
||
|
|
for(;;) {
|
||
|
|
Vector first, last;
|
||
|
|
int i;
|
||
|
|
for(i = 0; i < l.n; i++) {
|
||
|
|
if(!l.elem[i].tag) {
|
||
|
|
first = l.elem[i].a;
|
||
|
|
last = l.elem[i].b;
|
||
|
|
l.elem[i].tag = 1;
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
if(i >= l.n) {
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
|
||
|
|
dest->AddEmptyContour();
|
||
|
|
dest->AddPoint(first);
|
||
|
|
dest->AddPoint(last);
|
||
|
|
do {
|
||
|
|
for(i = 0; i < l.n; i++) {
|
||
|
|
SEdge *se = &(l.elem[i]);
|
||
|
|
if(se->tag) continue;
|
||
|
|
|
||
|
|
if(se->a.Equals(last)) {
|
||
|
|
dest->AddPoint(se->b);
|
||
|
|
last = se->b;
|
||
|
|
se->tag = 1;
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
if(se->b.Equals(last)) {
|
||
|
|
dest->AddPoint(se->a);
|
||
|
|
last = se->a;
|
||
|
|
se->tag = 1;
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
if(i >= l.n) {
|
||
|
|
// Couldn't assemble a closed contour; mark where.
|
||
|
|
errorAt->a = first;
|
||
|
|
errorAt->b = last;
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
|
||
|
|
} while(!last.Equals(first));
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
void SPolygon::Clear(void) {
|
||
|
|
int i;
|
||
|
|
for(i = 0; i < l.n; i++) {
|
||
|
|
(l.elem[i]).l.Clear();
|
||
|
|
}
|
||
|
|
l.Clear();
|
||
|
|
}
|
||
|
|
|
||
|
|
void SPolygon::AddEmptyContour(void) {
|
||
|
|
SContour c;
|
||
|
|
memset(&c, 0, sizeof(c));
|
||
|
|
l.Add(&c);
|
||
|
|
}
|
||
|
|
|
||
|
|
void SPolygon::AddPoint(Vector p) {
|
||
|
|
if(l.n < 1) oops();
|
||
|
|
|
||
|
|
SPoint sp;
|
||
|
|
sp.tag = 0;
|
||
|
|
sp.p = p;
|
||
|
|
|
||
|
|
// Add to the last contour in the list
|
||
|
|
(l.elem[l.n-1]).l.Add(&sp);
|
||
|
|
}
|
||
|
|
|