void LoopSubdiv::weightOneRing(SDVertex *destVert, SDVertex *vert,
float beta) const
{
// Put _vert_ one-ring in _Pring_
u_int valence = vert->valence();
SDVertex **Vring = (SDVertex **)alloca(valence * sizeof(SDVertex *));
SDVertex **VR = Vring;
// Get one ring vertices for interior vertex
SDFace *face = vert->startFace;
bool uvSplit = false;
do {
SDVertex *v = face->v[face->vnum(vert->P)];
if (v->u != vert->u || v->v != vert->v)
uvSplit = true;
SDVertex *v2 = face->nextVert(vert->P);
float vu = v2->u;
float vv = v2->v;
*VR++ = v2;
face = face->nextFace(vert->P);
v2 = face->prevVert(vert->P);
if (vu != v2->u || vv != v2->v)
uvSplit = true;
} while (face != vert->startFace);
Point P((1 - valence * beta) * vert->P);
float u = (1 - valence * beta) * vert->u;
float v = (1 - valence * beta) * vert->v;
Normal N((1 - valence * beta) * vert->n);
for (u_int i = 0; i < valence; ++i) {
P += beta * Vring[i]->P;
u += beta * Vring[i]->u;
v += beta * Vring[i]->v;
N += beta * Vring[i]->n;
}
destVert->P = P;
if (uvSplit) {
destVert->u = vert->u;
destVert->v = vert->v;
} else {
destVert->u = u;
destVert->v = v;
}
destVert->n = N;
}
void LoopSubdiv::weightBoundary(SDVertex *destVert, SDVertex *vert,
float beta) const
{
// Put _vert_ one-ring in _Pring_
u_int valence = vert->valence();
if (displacementMapSharpBoundary) {
destVert->P = vert->P;
destVert->u = vert->u;
destVert->v = vert->v;
destVert->n = vert->n;
return;
}
SDVertex **Vring = (SDVertex **)alloca(valence * sizeof(SDVertex *));
SDVertex **VR = Vring;
// Get one ring vertices for boundary vertex
SDFace *face = vert->startFace, *f2;
// Go to the last face in the list
while ((f2 = face->nextFace(vert->P)) != NULL)
face = f2;
// Add the last vertex (on the boundary)
*VR++ = face->nextVert(vert->P);
// Add all vertices up to the first one (on the boundary)
bool uvSplit = false;
do {
SDVertex *v = face->v[face->vnum(vert->P)];
if (v->u != vert->u || v->v != vert->v)
uvSplit = true;
SDVertex *v2 = face->prevVert(vert->P);
float vu = v2->u;
float vv = v2->v;
*VR++ = v2;
face = face->prevFace(vert->P);
if (face) {
v2 = face->nextVert(vert->P);
if (vu != v2->u || vv != v2->v)
uvSplit = true;
}
} while (face != NULL);
Point P((1 - 2 * beta) * vert->P);
P += beta * Vring[0]->P;
P += beta * Vring[valence - 1]->P;
destVert->P = P;
if (uvSplit) {
destVert->u = vert->u;
destVert->v = vert->v;
} else {
float u = (1.f - 2.f * beta) * vert->u;
float v = (1.f - 2.f * beta) * vert->v;
u += beta * (Vring[0]->u + Vring[valence - 1]->u);
v += beta * (Vring[0]->v + Vring[valence - 1]->v);
destVert->u = u;
destVert->v = v;
}
Normal N((1 - 2 * beta) * vert->n);
N += beta * Vring[0]->n;
N += beta * Vring[valence - 1]->n;
destVert->n = N;
}
void LoopSubdiv::ApplyDisplacementMap(const vector<SDVertex *> verts) const
{
// Dade - apply the displacement map
SHAPE_LOG(name, LUX_INFO,LUX_NOERROR) << "Applying displacement map to " << verts.size() << " vertices";
SpectrumWavelengths swl;
swl.Sample(.5f);
for (u_int i = 0; i < verts.size(); i++) {
SDVertex *v = verts[i];
// Special use of the child member to detect that
// the vertex has already been displaced
if (v->child == v)
continue;
Vector dpdu, dpdv;
CoordinateSystem(Vector(v->n), &dpdu, &dpdv);
Vector displacement(v->n);
SDFace *face = v->startFace;
u_int nf = 0;
float dl = 0.f;
vector<SDVertex *> vlist;
vlist.reserve(v->valence());
if (v->boundary) {
do {
SDVertex *vv = face->v[face->vnum(v->P)];
DifferentialGeometry dg(v->P, v->n, dpdu, dpdv,
Normal(0, 0, 0), Normal(0, 0, 0),
vv->u, vv->v, NULL);
dl += displacementMap->Evaluate(swl, dg);
++nf;
if (vv->child != vv) {
vlist.push_back(vv);
vv->child = vv;
}
face = face->nextFace(v->P);
} while (face);
face = v->startFace->prevFace(v->P);
while (face) {
SDVertex *vv = face->v[face->vnum(v->P)];
DifferentialGeometry dg(v->P, v->n, dpdu, dpdv,
Normal(0, 0, 0), Normal(0, 0, 0),
vv->u, vv->v, NULL);
dl += displacementMap->Evaluate(swl, dg);
++nf;
if (vv->child != vv) {
vlist.push_back(vv);
vv->child = vv;
}
face = face->prevFace(v->P);
}
} else {
do {
SDVertex *vv = face->v[face->vnum(v->P)];
DifferentialGeometry dg(v->P, v->n, dpdu, dpdv,
Normal(0, 0, 0), Normal(0, 0, 0),
vv->u, vv->v, NULL);
dl += displacementMap->Evaluate(swl, dg);
++nf;
if (vv->child != vv) {
vlist.push_back(vv);
vv->child = vv;
}
face = face->nextFace(v->P);
} while (face != v->startFace);
}
dl = (dl * displacementMapScale / nf + displacementMapOffset);
// Average the displacement
displacement *= dl;
// Apply displacement to all vertices in the list
for (u_int j = 0; j < vlist.size(); ++j)
vlist[j]->P += displacement;
}
}
