2 Copyright (C) 2001-2006, William Joseph.
5 This file is part of GtkRadiant.
7 GtkRadiant is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2 of the License, or
10 (at your option) any later version.
12 GtkRadiant is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GtkRadiant; if not, write to the Free Software
19 Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
24 #include <glib/gslist.h>
25 #include "preferences.h"
26 #include "brush_primit.h"
27 #include "signal/signal.h"
30 Signal0 g_patchTextureChangedCallbacks;
32 void Patch_addTextureChangedCallback(const SignalHandler& handler)
34 g_patchTextureChangedCallbacks.connectLast(handler);
37 void Patch_textureChanged()
39 g_patchTextureChangedCallbacks();
43 Shader* PatchInstance::m_state_selpoint;
44 Shader* Patch::m_state_ctrl;
45 Shader* Patch::m_state_lattice;
46 EPatchType Patch::m_type;
49 std::size_t MAX_PATCH_WIDTH = 0;
50 std::size_t MAX_PATCH_HEIGHT = 0;
52 int g_PatchSubdivideThreshold = 4;
54 void BezierCurveTree_Delete(BezierCurveTree *pCurve)
58 BezierCurveTree_Delete(pCurve->left);
59 BezierCurveTree_Delete(pCurve->right);
64 std::size_t BezierCurveTree_Setup(BezierCurveTree *pCurve, std::size_t index, std::size_t stride)
68 if(pCurve->left && pCurve->right)
70 index = BezierCurveTree_Setup(pCurve->left, index, stride);
71 pCurve->index = index*stride;
73 index = BezierCurveTree_Setup(pCurve->right, index, stride);
77 pCurve->index = BEZIERCURVETREE_MAX_INDEX;
84 bool BezierCurve_IsCurved(BezierCurve *pCurve)
86 Vector3 vTemp(vector3_subtracted(pCurve->right, pCurve->left));
87 Vector3 v1(vector3_subtracted(pCurve->crd, pCurve->left));
88 Vector3 v2(vector3_subtracted(pCurve->right, pCurve->crd));
90 if(vector3_equal(v1, g_vector3_identity) || vector3_equal(vTemp, v1)) // return 0 if 1->2 == 0 or 1->2 == 1->3
93 vector3_normalise(v1);
94 vector3_normalise(v2);
95 if(vector3_equal(v1, v2))
99 const double width = vector3_length(v3);
100 vector3_scale(v3, 1.0 / width);
102 if(vector3_equal(v1, v3) && vector3_equal(v2, v3))
105 const double angle = acos(vector3_dot(v1, v2)) / c_pi;
107 const double index = width * angle;
109 if(index > static_cast<double>(g_PatchSubdivideThreshold))
114 void BezierInterpolate(BezierCurve *pCurve)
116 pCurve->left = vector3_mid(pCurve->left, pCurve->crd);
117 pCurve->right = vector3_mid(pCurve->crd, pCurve->right);
118 pCurve->crd = vector3_mid(pCurve->left, pCurve->right);
121 const std::size_t PATCH_MAX_SUBDIVISION_DEPTH = 16;
123 void BezierCurveTree_FromCurveList(BezierCurveTree *pTree, GSList *pCurveList, std::size_t depth = 0)
125 GSList *pLeftList = 0;
126 GSList *pRightList = 0;
127 BezierCurve *pCurve, *pLeftCurve, *pRightCurve;
130 for (GSList *l = pCurveList; l; l = l->next)
132 pCurve = (BezierCurve *)(l->data);
133 if(bSplit || BezierCurve_IsCurved(pCurve))
136 pLeftCurve = new BezierCurve;
137 pRightCurve = new BezierCurve;
138 pLeftCurve->left = pCurve->left;
139 pRightCurve->right = pCurve->right;
140 BezierInterpolate(pCurve);
141 pLeftCurve->crd = pCurve->left;
142 pRightCurve->crd = pCurve->right;
143 pLeftCurve->right = pCurve->crd;
144 pRightCurve->left = pCurve->crd;
146 pLeftList = g_slist_prepend(pLeftList, pLeftCurve);
147 pRightList = g_slist_prepend(pRightList, pRightCurve);
151 if(pLeftList != 0 && pRightList != 0 && depth != PATCH_MAX_SUBDIVISION_DEPTH)
153 pTree->left = new BezierCurveTree;
154 pTree->right = new BezierCurveTree;
155 BezierCurveTree_FromCurveList(pTree->left, pLeftList, depth + 1);
156 BezierCurveTree_FromCurveList(pTree->right, pRightList, depth + 1);
158 for(GSList* l = pLeftList; l != 0; l = g_slist_next(l))
160 delete (BezierCurve*)l->data;
163 for(GSList* l = pRightList; l != 0; l = g_slist_next(l))
165 delete (BezierCurve*)l->data;
168 g_slist_free(pLeftList);
169 g_slist_free(pRightList);
179 int Patch::m_CycleCapIndex = 0;
182 void Patch::setDims (std::size_t w, std::size_t h)
186 ASSERT_MESSAGE(w <= MAX_PATCH_WIDTH, "patch too wide");
187 if(w > MAX_PATCH_WIDTH)
189 else if(w < MIN_PATCH_WIDTH)
194 ASSERT_MESSAGE(h <= MAX_PATCH_HEIGHT, "patch too tall");
195 if(h > MAX_PATCH_HEIGHT)
196 h = MAX_PATCH_HEIGHT;
197 else if(h < MIN_PATCH_HEIGHT)
198 h = MIN_PATCH_HEIGHT;
200 m_width = w; m_height = h;
202 if(m_width * m_height != m_ctrl.size())
204 m_ctrl.resize(m_width * m_height);
205 onAllocate(m_ctrl.size());
209 inline const Colour4b& colour_for_index(std::size_t i, std::size_t width)
211 return (i%2 || (i/width)%2) ? colour_inside : colour_corner;
214 inline bool float_valid(float f)
219 bool Patch::isValid() const
221 if(!m_width || !m_height)
226 for(const_iterator i = m_ctrl.begin(); i != m_ctrl.end(); ++i)
228 if(!float_valid((*i).m_vertex.x())
229 || !float_valid((*i).m_vertex.y())
230 || !float_valid((*i).m_vertex.z())
231 || !float_valid((*i).m_texcoord.x())
232 || !float_valid((*i).m_texcoord.y()))
234 globalErrorStream() << "patch has invalid control points\n";
241 void Patch::UpdateCachedData()
243 m_ctrl_vertices.clear();
244 m_lattice_indices.clear();
248 m_tess.m_numStrips = 0;
249 m_tess.m_lenStrips = 0;
250 m_tess.m_nArrayHeight = 0;
251 m_tess.m_nArrayWidth = 0;
252 m_tess.m_curveTreeU.resize(0);
253 m_tess.m_curveTreeV.resize(0);
254 m_tess.m_indices.resize(0);
255 m_tess.m_vertices.resize(0);
256 m_tess.m_arrayHeight.resize(0);
257 m_tess.m_arrayWidth.resize(0);
258 m_aabb_local = AABB();
262 BuildTesselationCurves(ROW);
263 BuildTesselationCurves(COL);
267 IndexBuffer ctrl_indices;
269 m_lattice_indices.reserve(((m_width * (m_height - 1)) + (m_height * (m_width - 1))) << 1);
270 ctrl_indices.reserve(m_ctrlTransformed.size());
272 UniqueVertexBuffer<PointVertex> inserter(m_ctrl_vertices);
273 for(iterator i = m_ctrlTransformed.begin(); i != m_ctrlTransformed.end(); ++i)
275 ctrl_indices.insert(inserter.insert(pointvertex_quantised(PointVertex(reinterpret_cast<const Vertex3f&>((*i).m_vertex), colour_for_index(i - m_ctrlTransformed.begin(), m_width)))));
279 for(IndexBuffer::iterator i = ctrl_indices.begin(); i != ctrl_indices.end(); ++i)
281 if(std::size_t(i - ctrl_indices.begin()) % m_width)
283 m_lattice_indices.insert(*(i - 1));
284 m_lattice_indices.insert(*i);
286 if(std::size_t(i - ctrl_indices.begin()) >= m_width)
288 m_lattice_indices.insert(*(i - m_width));
289 m_lattice_indices.insert(*i);
296 Array<RenderIndex>::iterator first = m_tess.m_indices.begin();
297 for(std::size_t s=0; s<m_tess.m_numStrips; s++)
299 Array<RenderIndex>::iterator last = first + m_tess.m_lenStrips;
301 for(Array<RenderIndex>::iterator i(first); i+2 != last; i += 2)
303 ArbitraryMeshTriangle_sumTangents(m_tess.m_vertices[*(i+0)], m_tess.m_vertices[*(i+1)], m_tess.m_vertices[*(i+2)]);
304 ArbitraryMeshTriangle_sumTangents(m_tess.m_vertices[*(i+2)], m_tess.m_vertices[*(i+1)], m_tess.m_vertices[*(i+3)]);
310 for(Array<ArbitraryMeshVertex>::iterator i = m_tess.m_vertices.begin(); i != m_tess.m_vertices.end(); ++i)
312 vector3_normalise(reinterpret_cast<Vector3&>((*i).tangent));
313 vector3_normalise(reinterpret_cast<Vector3&>((*i).bitangent));
321 void Patch::InvertMatrix()
325 PatchControlArray_invert(m_ctrl, m_width, m_height);
327 controlPointsChanged();
330 void Patch::TransposeMatrix()
335 Array<PatchControl> tmp(m_width * m_height);
336 copy_ctrl(tmp.data(), m_ctrl.data(), m_ctrl.data() + m_width * m_height);
338 PatchControlIter from = tmp.data();
339 for(std::size_t h = 0; h != m_height; ++h)
341 PatchControlIter to = m_ctrl.data() + h;
342 for(std::size_t w = 0; w != m_width; ++w, ++from, to += m_height)
350 std::size_t tmp = m_width;
355 controlPointsChanged();
358 void Patch::Redisperse(EMatrixMajor mt)
360 std::size_t w, h, width, height, row_stride, col_stride;
361 PatchControl* p1, * p2, * p3;
368 width = (m_width-1)>>1;
371 row_stride = m_width;
374 width = (m_height-1)>>1;
376 col_stride = m_width;
380 ERROR_MESSAGE("neither row-major nor column-major");
384 for(h=0;h<height;h++)
386 p1 = m_ctrl.data()+(h*row_stride);
391 p2->m_vertex = vector3_mid(p1->m_vertex, p3->m_vertex);
396 controlPointsChanged();
399 void Patch::Smooth(EMatrixMajor mt)
401 std::size_t w, h, width, height, row_stride, col_stride;
402 PatchControl* p1, * p2, * p3;
409 width = (m_width-1)>>1;
412 row_stride = m_width;
415 width = (m_height-1)>>1;
417 col_stride = m_width;
421 ERROR_MESSAGE("neither row-major nor column-major");
425 for(h=0;h<height;h++)
427 p1 = m_ctrl.data()+(h*row_stride)+col_stride;
428 for(w=0;w<width-1;w++)
432 p2->m_vertex = vector3_mid(p1->m_vertex, p3->m_vertex);
437 controlPointsChanged();
440 void Patch::InsertRemove(bool bInsert, bool bColumn, bool bFirst)
446 if(bColumn && (m_width + 2 <= MAX_PATCH_WIDTH))
447 InsertPoints(COL, bFirst);
448 else if(m_height + 2 <= MAX_PATCH_HEIGHT)
449 InsertPoints(ROW, bFirst);
453 if(bColumn && (m_width - 2 >= MIN_PATCH_WIDTH))
454 RemovePoints(COL, bFirst);
455 else if(m_height - 2 >= MIN_PATCH_HEIGHT)
456 RemovePoints(ROW, bFirst);
459 controlPointsChanged();
462 Patch* Patch::MakeCap(Patch* patch, EPatchCap eType, EMatrixMajor mt, bool bFirst)
464 std::size_t i, width, height;
477 ERROR_MESSAGE("neither row-major nor column-major");
481 Array<Vector3> p(width);
483 std::size_t nIndex = (bFirst) ? 0 : height-1;
486 for (i=0; i<width; i++)
488 p[(bFirst)?i:(width-1)-i] = ctrlAt(nIndex, i).m_vertex;
493 for (i=0; i<width; i++)
495 p[(bFirst)?i:(width-1)-i] = ctrlAt(i, nIndex).m_vertex;
499 patch->ConstructSeam(eType, p.data(), width);
503 void Patch::FlipTexture(int nAxis)
507 for(PatchControlIter i = m_ctrl.data(); i != m_ctrl.data() + m_ctrl.size(); ++i)
509 (*i).m_texcoord[nAxis] = -(*i).m_texcoord[nAxis];
512 controlPointsChanged();
515 void Patch::TranslateTexture(float s, float t)
519 s = -1 * s / m_state->getTexture().width;
520 t = t / m_state->getTexture().height;
522 for(PatchControlIter i = m_ctrl.data(); i != m_ctrl.data() + m_ctrl.size(); ++i)
524 (*i).m_texcoord[0] += s;
525 (*i).m_texcoord[1] += t;
528 controlPointsChanged();
531 void Patch::ScaleTexture(float s, float t)
535 for(PatchControlIter i = m_ctrl.data(); i != m_ctrl.data() + m_ctrl.size(); ++i)
537 (*i).m_texcoord[0] *= s;
538 (*i).m_texcoord[1] *= t;
541 controlPointsChanged();
544 void Patch::RotateTexture(float angle)
548 const float s = static_cast<float>(sin(degrees_to_radians(angle)));
549 const float c = static_cast<float>(cos(degrees_to_radians(angle)));
551 for(PatchControlIter i = m_ctrl.data(); i != m_ctrl.data() + m_ctrl.size(); ++i)
553 const float x = (*i).m_texcoord[0];
554 const float y = (*i).m_texcoord[1];
555 (*i).m_texcoord[0] = (x * c) - (y * s);
556 (*i).m_texcoord[1] = (y * c) + (x * s);
559 controlPointsChanged();
563 void Patch::SetTextureRepeat(float s, float t)
566 float si, ti, sc, tc;
571 si = s / (float)(m_width - 1);
572 ti = t / (float)(m_height - 1);
574 pDest = m_ctrl.data();
575 for (h=0, tc = 0.0f; h<m_height; h++, tc+=ti)
577 for (w=0, sc = 0.0f; w<m_width; w++, sc+=si)
579 pDest->m_texcoord[0] = sc;
580 pDest->m_texcoord[1] = tc;
585 controlPointsChanged();
589 void Patch::SetTextureInfo(texdef_t *pt)
591 if(pt->getShift()[0] || pt->getShift()[1])
592 TranslateTexture (pt->getShift()[0], pt->getShift()[1]);
593 else if(pt->getScale()[0] || pt->getScale()[1])
595 if(pt->getScale()[0] == 0.0f) pt->setScale(0, 1.0f);
596 if(pt->getScale()[1] == 0.0f) pt->setScale(1, 1.0f);
597 ScaleTexture (pt->getScale()[0], pt->getScale()[1]);
600 RotateTexture (pt->rotate);
604 inline int texture_axis(const Vector3& normal)
606 // axis dominance order: Z, X, Y
607 return (normal.x() >= normal.y()) ? (normal.x() > normal.z()) ? 0 : 2 : (normal.y() > normal.z()) ? 1 : 2;
610 void Patch::CapTexture()
612 const PatchControl& p1 = m_ctrl[m_width];
613 const PatchControl& p2 = m_ctrl[m_width*(m_height-1)];
614 const PatchControl& p3 = m_ctrl[(m_width*m_height)-1];
617 Vector3 normal(g_vector3_identity);
620 Vector3 tmp(vector3_cross(
621 vector3_subtracted(p2.m_vertex, m_ctrl[0].m_vertex),
622 vector3_subtracted(p3.m_vertex, m_ctrl[0].m_vertex)
624 if(!vector3_equal(tmp, g_vector3_identity))
626 vector3_add(normal, tmp);
630 Vector3 tmp(vector3_cross(
631 vector3_subtracted(p1.m_vertex, p3.m_vertex),
632 vector3_subtracted(m_ctrl[0].m_vertex, p3.m_vertex)
634 if(!vector3_equal(tmp, g_vector3_identity))
636 vector3_add(normal, tmp);
640 ProjectTexture(texture_axis(normal));
643 // uses longest parallel chord to calculate texture coords for each row/col
644 void Patch::NaturalTexture()
649 float fSize = (float)m_state->getTexture().width * Texdef_getDefaultTextureScale();
653 PatchControl* pWidth = m_ctrl.data();
654 for (std::size_t w=0; w<m_width; w++, pWidth++)
657 PatchControl* pHeight = pWidth;
658 for (std::size_t h=0; h<m_height; h++, pHeight+=m_width)
659 pHeight->m_texcoord[0] = static_cast<float>(tex);
666 PatchControl* pHeight = pWidth;
667 for (std::size_t h=0; h<m_height; h++, pHeight+=m_width)
669 Vector3 v(vector3_subtracted(pHeight->m_vertex, (pHeight+1)->m_vertex));
670 double length = tex + (vector3_length(v) / fSize);
671 if(fabs(length) > texBest) texBest = length;
680 float fSize = -(float)m_state->getTexture().height * Texdef_getDefaultTextureScale();
684 PatchControl* pHeight = m_ctrl.data();
685 for (std::size_t h=0; h<m_height; h++, pHeight+=m_width)
688 PatchControl* pWidth = pHeight;
689 for (std::size_t w=0; w<m_width; w++, pWidth++)
690 pWidth->m_texcoord[1] = static_cast<float>(tex);
697 PatchControl* pWidth = pHeight;
698 for (std::size_t w=0; w<m_width; w++, pWidth++)
700 Vector3 v(vector3_subtracted(pWidth->m_vertex, (pWidth+m_width)->m_vertex));
701 double length = tex + (vector3_length(v) / fSize);
702 if(fabs(length) > texBest) texBest = length;
710 controlPointsChanged();
717 void Patch::AccumulateBBox()
719 m_aabb_local = AABB();
721 for(PatchControlArray::iterator i = m_ctrlTransformed.begin(); i != m_ctrlTransformed.end(); ++i)
723 aabb_extend_by_point_safe(m_aabb_local, (*i).m_vertex);
730 void Patch::InsertPoints(EMatrixMajor mt, bool bFirst)
732 std::size_t width, height, row_stride, col_stride;
738 row_stride = m_width;
743 col_stride = m_width;
749 ERROR_MESSAGE("neither row-major nor column-major");
755 PatchControl* p1 = m_ctrl.data();
756 for(std::size_t w = 0; w != width; ++w, p1 += col_stride)
759 PatchControl* p2 = p1;
760 for(std::size_t h = 1; h < height; h += 2, p2 += 2 * row_stride)
762 if(0)//p2->m_selectable.isSelected())
775 PatchControl* p2 = p1;
776 for(std::size_t h = 0; h < height; h += 2, p2 += 2 * row_stride)
778 if(0)//p2->m_selectable.isSelected())
792 Array<PatchControl> tmp(m_ctrl);
794 std::size_t row_stride2, col_stride2;
798 setDims(m_width, m_height+2);
800 row_stride2 = m_width;
803 setDims(m_width+2, m_height);
804 col_stride2 = m_width;
808 ERROR_MESSAGE("neither row-major nor column-major");
833 for(std::size_t w = 0; w != width; ++w)
835 PatchControl* p1 = tmp.data() + (w*col_stride);
836 PatchControl* p2 = m_ctrl.data() + (w*col_stride2);
837 for(std::size_t h = 0; h != height; ++h, p2 += row_stride2, p1 += row_stride)
841 p2 += 2 * row_stride2;
846 p1 = tmp.data() + (w*col_stride+pos*row_stride);
847 p2 = m_ctrl.data() + (w*col_stride2+pos*row_stride2);
849 PatchControl* r2a = (p2+row_stride2);
850 PatchControl* r2b = (p2-row_stride2);
851 PatchControl* c2a = (p1-2*row_stride);
852 PatchControl* c2b = (p1-row_stride);
854 // set two new row points
855 *(p2+2*row_stride2) = *p1;
858 for(std::size_t i = 0; i != 3; ++i)
860 r2a->m_vertex[i] = float_mid(c2b->m_vertex[i], p1->m_vertex[i]);
862 r2b->m_vertex[i] = float_mid(c2a->m_vertex[i], c2b->m_vertex[i]);
864 p2->m_vertex[i] = float_mid(r2a->m_vertex[i], r2b->m_vertex[i]);
866 for(std::size_t i = 0; i != 2; ++i)
868 r2a->m_texcoord[i] = float_mid(c2b->m_texcoord[i], p1->m_texcoord[i]);
870 r2b->m_texcoord[i] = float_mid(c2a->m_texcoord[i], c2b->m_texcoord[i]);
872 p2->m_texcoord[i] = float_mid(r2a->m_texcoord[i], r2b->m_texcoord[i]);
877 void Patch::RemovePoints(EMatrixMajor mt, bool bFirst)
879 std::size_t width, height, row_stride, col_stride;
885 row_stride = m_width;
890 col_stride = m_width;
896 ERROR_MESSAGE("neither row-major nor column-major");
902 PatchControl* p1 = m_ctrl.data();
903 for(std::size_t w = 0; w != width; ++w, p1 += col_stride)
906 PatchControl* p2 = p1;
907 for(std::size_t h=1; h < height; h += 2, p2 += 2 * row_stride)
909 if(0)//p2->m_selectable.isSelected())
922 PatchControl* p2 = p1;
923 for(std::size_t h=0; h < height; h += 2, p2 += 2 * row_stride)
925 if(0)//p2->m_selectable.isSelected())
939 Array<PatchControl> tmp(m_ctrl);
941 std::size_t row_stride2, col_stride2;
945 setDims(m_width, m_height-2);
947 row_stride2 = m_width;
950 setDims(m_width-2, m_height);
951 col_stride2 = m_width;
955 ERROR_MESSAGE("neither row-major nor column-major");
974 else if(pos > height - 3)
983 for(std::size_t w = 0; w != width; w++)
985 PatchControl* p1 = tmp.data() + (w*col_stride);
986 PatchControl* p2 = m_ctrl.data() + (w*col_stride2);
987 for(std::size_t h = 0; h != height; ++h, p2 += row_stride2, p1 += row_stride)
991 p1 += 2 * row_stride2; h += 2;
996 p1 = tmp.data() + (w*col_stride+pos*row_stride);
997 p2 = m_ctrl.data() + (w*col_stride2+pos*row_stride2);
999 for(std::size_t i=0; i<3; i++)
1001 (p2-row_stride2)->m_vertex[i] = ((p1+2*row_stride)->m_vertex[i]+(p1-2*row_stride)->m_vertex[i]) * 0.5f;
1003 (p2-row_stride2)->m_vertex[i] = (p2-row_stride2)->m_vertex[i]+(2.0f * ((p1)->m_vertex[i]-(p2-row_stride2)->m_vertex[i]));
1005 for(std::size_t i=0; i<2; i++)
1007 (p2-row_stride2)->m_texcoord[i] = ((p1+2*row_stride)->m_texcoord[i]+(p1-2*row_stride)->m_texcoord[i]) * 0.5f;
1009 (p2-row_stride2)->m_texcoord[i] = (p2-row_stride2)->m_texcoord[i]+(2.0f * ((p1)->m_texcoord[i]-(p2-row_stride2)->m_texcoord[i]));
1014 void Patch::ConstructSeam(EPatchCap eType, Vector3* p, std::size_t width)
1021 m_ctrl[0].m_vertex = p[0];
1022 m_ctrl[1].m_vertex = p[1];
1023 m_ctrl[2].m_vertex = p[1];
1024 m_ctrl[3].m_vertex = p[1];
1025 m_ctrl[4].m_vertex = p[1];
1026 m_ctrl[5].m_vertex = p[1];
1027 m_ctrl[6].m_vertex = p[2];
1028 m_ctrl[7].m_vertex = p[1];
1029 m_ctrl[8].m_vertex = p[1];
1035 Vector3 p3(vector3_added(p[2], vector3_subtracted(p[0], p[1])));
1036 m_ctrl[0].m_vertex = p3;
1037 m_ctrl[1].m_vertex = p3;
1038 m_ctrl[2].m_vertex = p[2];
1039 m_ctrl[3].m_vertex = p3;
1040 m_ctrl[4].m_vertex = p3;
1041 m_ctrl[5].m_vertex = p[1];
1042 m_ctrl[6].m_vertex = p3;
1043 m_ctrl[7].m_vertex = p3;
1044 m_ctrl[8].m_vertex = p[0];
1049 Vector3 p5(vector3_mid(p[0], p[4]));
1052 m_ctrl[0].m_vertex = p[0];
1053 m_ctrl[1].m_vertex = p5;
1054 m_ctrl[2].m_vertex = p[4];
1055 m_ctrl[3].m_vertex = p[1];
1056 m_ctrl[4].m_vertex = p[2];
1057 m_ctrl[5].m_vertex = p[3];
1058 m_ctrl[6].m_vertex = p[2];
1059 m_ctrl[7].m_vertex = p[2];
1060 m_ctrl[8].m_vertex = p[2];
1066 m_ctrl[0].m_vertex = p[4];
1067 m_ctrl[1].m_vertex = p[3];
1068 m_ctrl[2].m_vertex = p[2];
1069 m_ctrl[3].m_vertex = p[1];
1070 m_ctrl[4].m_vertex = p[0];
1071 m_ctrl[5].m_vertex = p[3];
1072 m_ctrl[6].m_vertex = p[3];
1073 m_ctrl[7].m_vertex = p[2];
1074 m_ctrl[8].m_vertex = p[1];
1075 m_ctrl[9].m_vertex = p[1];
1076 m_ctrl[10].m_vertex = p[3];
1077 m_ctrl[11].m_vertex = p[3];
1078 m_ctrl[12].m_vertex = p[2];
1079 m_ctrl[13].m_vertex = p[1];
1080 m_ctrl[14].m_vertex = p[1];
1085 std::size_t mid = (width - 1) >> 1;
1087 bool degenerate = (mid % 2) != 0;
1089 std::size_t newHeight = mid + (degenerate ? 2 : 1);
1091 setDims(3, newHeight);
1096 for(std::size_t i = width; i != width + 2; ++i)
1098 p[i] = p[width - 1];
1103 PatchControl* pCtrl = m_ctrl.data();
1104 for(std::size_t i = 0; i != m_height; ++i, pCtrl += m_width)
1106 pCtrl->m_vertex = p[i];
1110 PatchControl* pCtrl = m_ctrl.data() + 2;
1111 std::size_t h = m_height - 1;
1112 for(std::size_t i = 0; i != m_height; ++i, pCtrl += m_width)
1114 pCtrl->m_vertex = p[h + (h - i)];
1122 ERROR_MESSAGE("invalid patch-cap type");
1126 controlPointsChanged();
1129 void Patch::ProjectTexture(int nAxis)
1150 ERROR_MESSAGE("invalid axis");
1154 float fWidth = 1 / (m_state->getTexture().width * Texdef_getDefaultTextureScale());
1155 float fHeight = 1 / (m_state->getTexture().height * -Texdef_getDefaultTextureScale());
1157 for(PatchControlIter i = m_ctrl.data(); i != m_ctrl.data() + m_ctrl.size(); ++i)
1159 (*i).m_texcoord[0] = (*i).m_vertex[s] * fWidth;
1160 (*i).m_texcoord[1] = (*i).m_vertex[t] * fHeight;
1163 controlPointsChanged();
1166 void Patch::constructPlane(const AABB& aabb, int axis, std::size_t width, std::size_t height)
1168 setDims(width, height);
1173 case 2: x=0; y=1; z=2; break;
1174 case 1: x=0; y=2; z=1; break;
1175 case 0: x=1; y=2; z=0; break;
1177 ERROR_MESSAGE("invalid view-type");
1181 if(m_width < MIN_PATCH_WIDTH || m_width > MAX_PATCH_WIDTH) m_width = 3;
1182 if(m_height < MIN_PATCH_HEIGHT || m_height > MAX_PATCH_HEIGHT) m_height = 3;
1185 vStart[x] = aabb.origin[x] - aabb.extents[x];
1186 vStart[y] = aabb.origin[y] - aabb.extents[y];
1187 vStart[z] = aabb.origin[z];
1189 float xAdj = fabsf((vStart[x] - (aabb.origin[x] + aabb.extents[x])) / (float)(m_width - 1));
1190 float yAdj = fabsf((vStart[y] - (aabb.origin[y] + aabb.extents[y])) / (float)(m_height - 1));
1193 vTmp[z] = vStart[z];
1194 PatchControl* pCtrl = m_ctrl.data();
1197 for (std::size_t h=0; h<m_height; h++)
1200 for (std::size_t w=0; w<m_width; w++, ++pCtrl)
1202 pCtrl->m_vertex = vTmp;
1211 void Patch::ConstructPrefab(const AABB& aabb, EPatchPrefab eType, int axis, std::size_t width, std::size_t height)
1217 vPos[0] = vector3_subtracted(aabb.origin, aabb.extents);
1218 vPos[1] = aabb.origin;
1219 vPos[2] = vector3_added(aabb.origin, aabb.extents);
1224 constructPlane(aabb, axis, width, height);
1226 else if(eType == eSqCylinder
1227 || eType == eCylinder
1228 || eType == eDenseCylinder
1229 || eType == eVeryDenseCylinder
1231 || eType == eSphere)
1233 unsigned char *pIndex;
1234 unsigned char pCylIndex[] =
1248 PatchControl *pStart;
1251 case eSqCylinder: setDims(9, 3);
1252 pStart = m_ctrl.data();
1254 case eDenseCylinder:
1255 case eVeryDenseCylinder:
1258 pStart = m_ctrl.data() + 1;
1260 case eCone: setDims(9, 3);
1261 pStart = m_ctrl.data() + 1;
1265 pStart = m_ctrl.data() + (9+1);
1268 ERROR_MESSAGE("this should be unreachable");
1272 for(std::size_t h=0; h<3; h++, pStart+=9)
1275 PatchControl* pCtrl = pStart;
1276 for(std::size_t w=0; w<8; w++, pCtrl++)
1278 pCtrl->m_vertex[0] = vPos[pIndex[0]][0];
1279 pCtrl->m_vertex[1] = vPos[pIndex[1]][1];
1280 pCtrl->m_vertex[2] = vPos[h][2];
1289 PatchControl* pCtrl=m_ctrl.data();
1290 for(std::size_t h=0; h<3; h++, pCtrl+=9)
1292 pCtrl[8].m_vertex = pCtrl[0].m_vertex;
1296 case eDenseCylinder:
1297 case eVeryDenseCylinder:
1300 PatchControl* pCtrl=m_ctrl.data();
1301 for (std::size_t h=0; h<3; h++, pCtrl+=9)
1303 pCtrl[0].m_vertex = pCtrl[8].m_vertex;
1309 PatchControl* pCtrl=m_ctrl.data();
1310 for (std::size_t h=0; h<2; h++, pCtrl+=9)
1312 pCtrl[0].m_vertex = pCtrl[8].m_vertex;
1316 PatchControl* pCtrl=m_ctrl.data()+9*2;
1317 for (std::size_t w=0; w<9; w++, pCtrl++)
1319 pCtrl->m_vertex[0] = vPos[1][0];
1320 pCtrl->m_vertex[1] = vPos[1][1];
1321 pCtrl->m_vertex[2] = vPos[2][2];
1327 PatchControl* pCtrl=m_ctrl.data()+9;
1328 for (std::size_t h=0; h<3; h++, pCtrl+=9)
1330 pCtrl[0].m_vertex = pCtrl[8].m_vertex;
1334 PatchControl* pCtrl = m_ctrl.data();
1335 for (std::size_t w=0; w<9; w++, pCtrl++)
1337 pCtrl->m_vertex[0] = vPos[1][0];
1338 pCtrl->m_vertex[1] = vPos[1][1];
1339 pCtrl->m_vertex[2] = vPos[2][2];
1343 PatchControl* pCtrl = m_ctrl.data()+(9*4);
1344 for (std::size_t w=0; w<9; w++, pCtrl++)
1346 pCtrl->m_vertex[0] = vPos[1][0];
1347 pCtrl->m_vertex[1] = vPos[1][1];
1348 pCtrl->m_vertex[2] = vPos[2][2];
1352 ERROR_MESSAGE("this should be unreachable");
1356 else if (eType == eBevel)
1358 unsigned char *pIndex;
1359 unsigned char pBevIndex[] =
1368 PatchControl* pCtrl = m_ctrl.data();
1369 for(std::size_t h=0; h<3; h++)
1372 for(std::size_t w=0; w<3; w++, pIndex+=2, pCtrl++)
1374 pCtrl->m_vertex[0] = vPos[pIndex[0]][0];
1375 pCtrl->m_vertex[1] = vPos[pIndex[1]][1];
1376 pCtrl->m_vertex[2] = vPos[h][2];
1380 else if(eType == eEndCap)
1382 unsigned char *pIndex;
1383 unsigned char pEndIndex[] =
1394 PatchControl* pCtrl = m_ctrl.data();
1395 for(std::size_t h=0; h<3; h++)
1398 for(std::size_t w=0; w<5; w++, pIndex+=2, pCtrl++)
1400 pCtrl->m_vertex[0] = vPos[pIndex[0]][0];
1401 pCtrl->m_vertex[1] = vPos[pIndex[1]][1];
1402 pCtrl->m_vertex[2] = vPos[h][2];
1407 if(eType == eDenseCylinder)
1409 InsertRemove(true, false, true);
1412 if(eType == eVeryDenseCylinder)
1414 InsertRemove(true, false, false);
1415 InsertRemove(true, false, true);
1421 void Patch::RenderDebug(RenderStateFlags state) const
1423 for (std::size_t i = 0; i<m_tess.m_numStrips; i++)
1425 glBegin(GL_QUAD_STRIP);
1426 for (std::size_t j = 0; j<m_tess.m_lenStrips; j++)
1428 glNormal3fv(normal3f_to_array((m_tess.m_vertices.data() + m_tess.m_indices[i*m_tess.m_lenStrips+j])->normal));
1429 glTexCoord2fv(texcoord2f_to_array((m_tess.m_vertices.data() + m_tess.m_indices[i*m_tess.m_lenStrips+j])->texcoord));
1430 glVertex3fv(vertex3f_to_array((m_tess.m_vertices.data() + m_tess.m_indices[i*m_tess.m_lenStrips+j])->vertex));
1436 void RenderablePatchSolid::RenderNormals() const
1438 const std::size_t width = m_tess.m_numStrips+1;
1439 const std::size_t height = m_tess.m_lenStrips>>1;
1441 for(std::size_t i=0;i<width;i++)
1443 for(std::size_t j=0;j<height;j++)
1448 vertex3f_to_vector3((m_tess.m_vertices.data() + (j*width+i))->vertex),
1449 vector3_scaled(normal3f_to_vector3((m_tess.m_vertices.data() + (j*width+i))->normal), 8)
1452 glVertex3fv(vertex3f_to_array((m_tess.m_vertices.data() + (j*width+i))->vertex));
1453 glVertex3fv(&vNormal[0]);
1458 vertex3f_to_vector3((m_tess.m_vertices.data() + (j*width+i))->vertex),
1459 vector3_scaled(normal3f_to_vector3((m_tess.m_vertices.data() + (j*width+i))->tangent), 8)
1462 glVertex3fv(vertex3f_to_array((m_tess.m_vertices.data() + (j*width+i))->vertex));
1463 glVertex3fv(&vNormal[0]);
1468 vertex3f_to_vector3((m_tess.m_vertices.data() + (j*width+i))->vertex),
1469 vector3_scaled(normal3f_to_vector3((m_tess.m_vertices.data() + (j*width+i))->bitangent), 8)
1472 glVertex3fv(vertex3f_to_array((m_tess.m_vertices.data() + (j*width+i))->vertex));
1473 glVertex3fv(&vNormal[0]);
1480 #define DEGEN_0a 0x01
1481 #define DEGEN_1a 0x02
1482 #define DEGEN_2a 0x04
1483 #define DEGEN_0b 0x08
1484 #define DEGEN_1b 0x10
1485 #define DEGEN_2b 0x20
1487 #define AVERAGE 0x80
1490 unsigned int subarray_get_degen(PatchControlIter subarray, std::size_t strideU, std::size_t strideV)
1492 unsigned int nDegen = 0;
1493 const PatchControl* p1;
1494 const PatchControl* p2;
1498 if(vector3_equal(p1->m_vertex, p2->m_vertex))
1502 if(vector3_equal(p1->m_vertex, p2->m_vertex))
1505 p1 = subarray + strideV;
1507 if(vector3_equal(p1->m_vertex, p2->m_vertex))
1511 if(vector3_equal(p1->m_vertex, p2->m_vertex))
1514 p1 = subarray + (strideV << 1);
1516 if(vector3_equal(p1->m_vertex, p2->m_vertex))
1520 if(vector3_equal(p1->m_vertex, p2->m_vertex))
1527 inline void deCasteljau3(const Vector3& P0, const Vector3& P1, const Vector3& P2, Vector3& P01, Vector3& P12, Vector3& P012)
1529 P01 = vector3_mid(P0, P1);
1530 P12 = vector3_mid(P1, P2);
1531 P012 = vector3_mid(P01, P12);
1534 inline void BezierInterpolate3( const Vector3& start, Vector3& left, Vector3& mid, Vector3& right, const Vector3& end )
1536 left = vector3_mid(start, mid);
1537 right = vector3_mid(mid, end);
1538 mid = vector3_mid(left, right);
1541 inline void BezierInterpolate2( const Vector2& start, Vector2& left, Vector2& mid, Vector2& right, const Vector2& end )
1543 left[0]= float_mid(start[0], mid[0]);
1544 left[1] = float_mid(start[1], mid[1]);
1545 right[0] = float_mid(mid[0], end[0]);
1546 right[1] = float_mid(mid[1], end[1]);
1547 mid[0] = float_mid(left[0], right[0]);
1548 mid[1] = float_mid(left[1], right[1]);
1552 inline Vector2& texcoord_for_index(Array<ArbitraryMeshVertex>& vertices, std::size_t index)
1554 return reinterpret_cast<Vector2&>(vertices[index].texcoord);
1557 inline Vector3& vertex_for_index(Array<ArbitraryMeshVertex>& vertices, std::size_t index)
1559 return reinterpret_cast<Vector3&>(vertices[index].vertex);
1562 inline Vector3& normal_for_index(Array<ArbitraryMeshVertex>& vertices, std::size_t index)
1564 return reinterpret_cast<Vector3&>(vertices[index].normal);
1567 inline Vector3& tangent_for_index(Array<ArbitraryMeshVertex>& vertices, std::size_t index)
1569 return reinterpret_cast<Vector3&>(vertices[index].tangent);
1572 inline Vector3& bitangent_for_index(Array<ArbitraryMeshVertex>& vertices, std::size_t index)
1574 return reinterpret_cast<Vector3&>(vertices[index].bitangent);
1577 inline const Vector2& texcoord_for_index(const Array<ArbitraryMeshVertex>& vertices, std::size_t index)
1579 return reinterpret_cast<const Vector2&>(vertices[index].texcoord);
1582 inline const Vector3& vertex_for_index(const Array<ArbitraryMeshVertex>& vertices, std::size_t index)
1584 return reinterpret_cast<const Vector3&>(vertices[index].vertex);
1587 inline const Vector3& normal_for_index(const Array<ArbitraryMeshVertex>& vertices, std::size_t index)
1589 return reinterpret_cast<const Vector3&>(vertices[index].normal);
1592 inline const Vector3& tangent_for_index(const Array<ArbitraryMeshVertex>& vertices, std::size_t index)
1594 return reinterpret_cast<const Vector3&>(vertices[index].tangent);
1597 inline const Vector3& bitangent_for_index(const Array<ArbitraryMeshVertex>& vertices, std::size_t index)
1599 return reinterpret_cast<const Vector3&>(vertices[index].bitangent);
1602 #include "math/curve.h"
1604 inline PatchControl QuadraticBezier_evaluate(const PatchControl* firstPoint, double t)
1606 PatchControl result = { Vector3(0, 0, 0), Vector2(0, 0) };
1607 double denominator = 0;
1610 double weight = BernsteinPolynomial<Zero, Two>::apply(t);
1611 vector3_add(result.m_vertex, vector3_scaled(firstPoint[0].m_vertex, weight));
1612 vector2_add(result.m_texcoord, vector2_scaled(firstPoint[0].m_texcoord, weight));
1613 denominator += weight;
1616 double weight = BernsteinPolynomial<One, Two>::apply(t);
1617 vector3_add(result.m_vertex, vector3_scaled(firstPoint[1].m_vertex, weight));
1618 vector2_add(result.m_texcoord, vector2_scaled(firstPoint[1].m_texcoord, weight));
1619 denominator += weight;
1622 double weight = BernsteinPolynomial<Two, Two>::apply(t);
1623 vector3_add(result.m_vertex, vector3_scaled(firstPoint[2].m_vertex, weight));
1624 vector2_add(result.m_texcoord, vector2_scaled(firstPoint[2].m_texcoord, weight));
1625 denominator += weight;
1628 vector3_divide(result.m_vertex, denominator);
1629 vector2_divide(result.m_texcoord, denominator);
1633 inline Vector3 vector3_linear_interpolated(const Vector3& a, const Vector3& b, double t)
1635 return vector3_added(vector3_scaled(a, 1.0 - t), vector3_scaled(b, t));
1638 inline Vector2 vector2_linear_interpolated(const Vector2& a, const Vector2& b, double t)
1640 return vector2_added(vector2_scaled(a, 1.0 - t), vector2_scaled(b, t));
1643 void normalise_safe(Vector3& normal)
1645 if(!vector3_equal(normal, g_vector3_identity))
1647 vector3_normalise(normal);
1651 inline void QuadraticBezier_evaluate(const PatchControl& a, const PatchControl& b, const PatchControl& c, double t, PatchControl& point, PatchControl& left, PatchControl& right)
1653 left.m_vertex = vector3_linear_interpolated(a.m_vertex, b.m_vertex, t);
1654 left.m_texcoord = vector2_linear_interpolated(a.m_texcoord, b.m_texcoord, t);
1655 right.m_vertex = vector3_linear_interpolated(b.m_vertex, c.m_vertex, t);
1656 right.m_texcoord = vector2_linear_interpolated(b.m_texcoord, c.m_texcoord, t);
1657 point.m_vertex = vector3_linear_interpolated(left.m_vertex, right.m_vertex, t);
1658 point.m_texcoord = vector2_linear_interpolated(left.m_texcoord, right.m_texcoord, t);
1661 void Patch::TesselateSubMatrixFixed(ArbitraryMeshVertex* vertices, std::size_t strideX, std::size_t strideY, unsigned int nFlagsX, unsigned int nFlagsY, PatchControl* subMatrix[3][3])
1663 double incrementU = 1.0 / m_subdivisions_x;
1664 double incrementV = 1.0 / m_subdivisions_y;
1665 const std::size_t width = m_subdivisions_x + 1;
1666 const std::size_t height = m_subdivisions_y + 1;
1668 for(std::size_t i = 0; i != width; ++i)
1670 double tU = (i + 1 == width) ? 1 : i * incrementU;
1671 PatchControl pointX[3];
1672 PatchControl leftX[3];
1673 PatchControl rightX[3];
1674 QuadraticBezier_evaluate(*subMatrix[0][0], *subMatrix[0][1], *subMatrix[0][2], tU, pointX[0], leftX[0], rightX[0]);
1675 QuadraticBezier_evaluate(*subMatrix[1][0], *subMatrix[1][1], *subMatrix[1][2], tU, pointX[1], leftX[1], rightX[1]);
1676 QuadraticBezier_evaluate(*subMatrix[2][0], *subMatrix[2][1], *subMatrix[2][2], tU, pointX[2], leftX[2], rightX[2]);
1678 ArbitraryMeshVertex* p = vertices + i * strideX;
1679 for(std::size_t j = 0; j != height; ++j)
1681 if((j == 0 || j + 1 == height) && (i == 0 || i + 1 == width))
1686 double tV = (j + 1 == height) ? 1 : j * incrementV;
1688 PatchControl pointY[3];
1689 PatchControl leftY[3];
1690 PatchControl rightY[3];
1691 QuadraticBezier_evaluate(*subMatrix[0][0], *subMatrix[1][0], *subMatrix[2][0], tV, pointY[0], leftY[0], rightY[0]);
1692 QuadraticBezier_evaluate(*subMatrix[0][1], *subMatrix[1][1], *subMatrix[2][1], tV, pointY[1], leftY[1], rightY[1]);
1693 QuadraticBezier_evaluate(*subMatrix[0][2], *subMatrix[1][2], *subMatrix[2][2], tV, pointY[2], leftY[2], rightY[2]);
1698 QuadraticBezier_evaluate(pointX[0], pointX[1], pointX[2], tV, point, left, right);
1701 QuadraticBezier_evaluate(pointY[0], pointY[1], pointY[2], tU, point, up, down);
1703 vertex3f_to_vector3(p->vertex) = point.m_vertex;
1704 texcoord2f_to_vector2(p->texcoord) = point.m_texcoord;
1706 ArbitraryMeshVertex a, b, c;
1708 a.vertex = vertex3f_for_vector3(left.m_vertex);
1709 a.texcoord = texcoord2f_for_vector2(left.m_texcoord);
1710 b.vertex = vertex3f_for_vector3(right.m_vertex);
1711 b.texcoord = texcoord2f_for_vector2(right.m_texcoord);
1715 c.vertex = vertex3f_for_vector3(up.m_vertex);
1716 c.texcoord = texcoord2f_for_vector2(up.m_texcoord);
1720 c.vertex = vertex3f_for_vector3(down.m_vertex);
1721 c.texcoord = texcoord2f_for_vector2(down.m_texcoord);
1724 Vector3 normal = vector3_normalised(vector3_cross(right.m_vertex - left.m_vertex, up.m_vertex - down.m_vertex));
1726 Vector3 tangent, bitangent;
1727 ArbitraryMeshTriangle_calcTangents(a, b, c, tangent, bitangent);
1728 vector3_normalise(tangent);
1729 vector3_normalise(bitangent);
1731 if(((nFlagsX & AVERAGE) != 0 && i == 0) || ((nFlagsY & AVERAGE) != 0 && j == 0))
1733 normal3f_to_vector3(p->normal) = vector3_normalised(vector3_added(normal3f_to_vector3(p->normal), normal));
1734 normal3f_to_vector3(p->tangent) = vector3_normalised(vector3_added(normal3f_to_vector3(p->tangent), tangent));
1735 normal3f_to_vector3(p->bitangent) = vector3_normalised(vector3_added(normal3f_to_vector3(p->bitangent), bitangent));
1739 normal3f_to_vector3(p->normal) = normal;
1740 normal3f_to_vector3(p->tangent) = tangent;
1741 normal3f_to_vector3(p->bitangent) = bitangent;
1750 void Patch::TesselateSubMatrix( const BezierCurveTree *BX, const BezierCurveTree *BY,
1751 std::size_t offStartX, std::size_t offStartY,
1752 std::size_t offEndX, std::size_t offEndY,
1753 std::size_t nFlagsX, std::size_t nFlagsY,
1754 Vector3& left, Vector3& mid, Vector3& right,
1755 Vector2& texLeft, Vector2& texMid, Vector2& texRight,
1758 int newFlagsX, newFlagsY;
1761 Vector3 vertex_0_0, vertex_0_1, vertex_1_0, vertex_1_1, vertex_2_0, vertex_2_1;
1763 Vector2 texcoord_0_0, texcoord_0_1, texcoord_1_0, texcoord_1_1, texcoord_2_0, texcoord_2_1;
1768 BezierInterpolate2( texcoord_for_index(m_tess.m_vertices, offStartX + offStartY),
1770 texcoord_for_index(m_tess.m_vertices, BX->index + offStartY),
1772 texcoord_for_index(m_tess.m_vertices, offEndX + offStartY) );
1775 BezierInterpolate2( texcoord_for_index(m_tess.m_vertices, offStartX + offEndY),
1777 texcoord_for_index(m_tess.m_vertices, BX->index + offEndY),
1779 texcoord_for_index(m_tess.m_vertices, offEndX + offEndY) );
1783 BezierInterpolate2(texLeft,
1789 if(!BezierCurveTree_isLeaf(BY))
1791 texcoord_for_index(m_tess.m_vertices, BX->index + BY->index) = texTmp;
1795 if(!BezierCurveTree_isLeaf(BX->left))
1797 texcoord_for_index(m_tess.m_vertices, BX->left->index + offStartY) = texcoord_0_0;
1798 texcoord_for_index(m_tess.m_vertices, BX->left->index + offEndY) = texcoord_2_0;
1800 if(!BezierCurveTree_isLeaf(BY))
1802 texcoord_for_index(m_tess.m_vertices, BX->left->index + BY->index) = texcoord_1_0;
1805 if(!BezierCurveTree_isLeaf(BX->right))
1807 texcoord_for_index(m_tess.m_vertices, BX->right->index + offStartY) = texcoord_0_1;
1808 texcoord_for_index(m_tess.m_vertices, BX->right->index + offEndY) = texcoord_2_1;
1810 if(!BezierCurveTree_isLeaf(BY))
1812 texcoord_for_index(m_tess.m_vertices, BX->right->index + BY->index) = texcoord_1_1;
1819 BezierInterpolate3( vertex_for_index(m_tess.m_vertices, offStartX + offStartY),
1821 vertex_for_index(m_tess.m_vertices, BX->index + offStartY),
1823 vertex_for_index(m_tess.m_vertices, offEndX + offStartY) );
1826 BezierInterpolate3( vertex_for_index(m_tess.m_vertices, offStartX + offEndY),
1828 vertex_for_index(m_tess.m_vertices, BX->index + offEndY),
1830 vertex_for_index(m_tess.m_vertices, offEndX + offEndY) );
1835 BezierInterpolate3( left,
1841 if(!BezierCurveTree_isLeaf(BY))
1843 vertex_for_index(m_tess.m_vertices, BX->index + BY->index) = tmp;
1847 if(!BezierCurveTree_isLeaf(BX->left))
1849 vertex_for_index(m_tess.m_vertices, BX->left->index + offStartY) = vertex_0_0;
1850 vertex_for_index(m_tess.m_vertices, BX->left->index + offEndY) = vertex_2_0;
1852 if(!BezierCurveTree_isLeaf(BY))
1854 vertex_for_index(m_tess.m_vertices, BX->left->index + BY->index) = vertex_1_0;
1857 if(!BezierCurveTree_isLeaf(BX->right))
1859 vertex_for_index(m_tess.m_vertices, BX->right->index + offStartY) = vertex_0_1;
1860 vertex_for_index(m_tess.m_vertices, BX->right->index + offEndY) = vertex_2_1;
1862 if(!BezierCurveTree_isLeaf(BY))
1864 vertex_for_index(m_tess.m_vertices, BX->right->index + BY->index) = vertex_1_1;
1872 ArbitraryMeshVertex a, b, c;
1875 if(!(nFlagsX & DEGEN_0a) || !(nFlagsX & DEGEN_0b))
1877 tangentU = vector3_subtracted(vertex_0_1, vertex_0_0);
1878 a.vertex = vertex3f_for_vector3(vertex_0_0);
1879 a.texcoord = texcoord2f_for_vector2(texcoord_0_0);
1880 c.vertex = vertex3f_for_vector3(vertex_0_1);
1881 c.texcoord = texcoord2f_for_vector2(texcoord_0_1);
1883 else if(!(nFlagsX & DEGEN_1a) || !(nFlagsX & DEGEN_1b))
1885 tangentU = vector3_subtracted(vertex_1_1, vertex_1_0);
1886 a.vertex = vertex3f_for_vector3(vertex_1_0);
1887 a.texcoord = texcoord2f_for_vector2(texcoord_1_0);
1888 c.vertex = vertex3f_for_vector3(vertex_1_1);
1889 c.texcoord = texcoord2f_for_vector2(texcoord_1_1);
1893 tangentU = vector3_subtracted(vertex_2_1, vertex_2_0);
1894 a.vertex = vertex3f_for_vector3(vertex_2_0);
1895 a.texcoord = texcoord2f_for_vector2(texcoord_2_0);
1896 c.vertex = vertex3f_for_vector3(vertex_2_1);
1897 c.texcoord = texcoord2f_for_vector2(texcoord_2_1);
1902 if((nFlagsY & DEGEN_0a) && (nFlagsY & DEGEN_1a) && (nFlagsY & DEGEN_2a))
1904 tangentV = vector3_subtracted(vertex_for_index(m_tess.m_vertices, BX->index + offEndY), tmp);
1905 b.vertex = vertex3f_for_vector3(tmp);//m_tess.m_vertices[BX->index + offEndY].vertex;
1906 b.texcoord = texcoord2f_for_vector2(texTmp);//m_tess.m_vertices[BX->index + offEndY].texcoord;
1910 tangentV = vector3_subtracted(tmp, vertex_for_index(m_tess.m_vertices, BX->index + offStartY));
1911 b.vertex = vertex3f_for_vector3(tmp);//m_tess.m_vertices[BX->index + offStartY].vertex;
1912 b.texcoord = texcoord2f_for_vector2(texTmp); //m_tess.m_vertices[BX->index + offStartY].texcoord;
1916 Vector3 normal, s, t;
1917 ArbitraryMeshVertex& v = m_tess.m_vertices[offStartY + BX->index];
1918 Vector3& p = normal3f_to_vector3(v.normal);
1919 Vector3& ps = normal3f_to_vector3(v.tangent);
1920 Vector3& pt = normal3f_to_vector3(v.bitangent);
1924 normal = vector3_cross(tangentV, tangentU);
1928 normal = vector3_cross(tangentU, tangentV);
1930 normalise_safe(normal);
1932 ArbitraryMeshTriangle_calcTangents(a, b, c, s, t);
1936 if(nFlagsX & AVERAGE)
1938 p = vector3_normalised(vector3_added(p, normal));
1939 ps = vector3_normalised(vector3_added(ps, s));
1940 pt = vector3_normalised(vector3_added(pt, t));
1951 ArbitraryMeshVertex a, b, c;
1954 if(!(nFlagsX & DEGEN_2a) || !(nFlagsX & DEGEN_2b))
1956 tangentU = vector3_subtracted(vertex_2_1, vertex_2_0);
1957 a.vertex = vertex3f_for_vector3(vertex_2_0);
1958 a.texcoord = texcoord2f_for_vector2(texcoord_2_0);
1959 c.vertex = vertex3f_for_vector3(vertex_2_1);
1960 c.texcoord = texcoord2f_for_vector2(texcoord_2_1);
1962 else if(!(nFlagsX & DEGEN_1a) || !(nFlagsX & DEGEN_1b))
1964 tangentU = vector3_subtracted(vertex_1_1, vertex_1_0);
1965 a.vertex = vertex3f_for_vector3(vertex_1_0);
1966 a.texcoord = texcoord2f_for_vector2(texcoord_1_0);
1967 c.vertex = vertex3f_for_vector3(vertex_1_1);
1968 c.texcoord = texcoord2f_for_vector2(texcoord_1_1);
1972 tangentU = vector3_subtracted(vertex_0_1, vertex_0_0);
1973 a.vertex = vertex3f_for_vector3(vertex_0_0);
1974 a.texcoord = texcoord2f_for_vector2(texcoord_0_0);
1975 c.vertex = vertex3f_for_vector3(vertex_0_1);
1976 c.texcoord = texcoord2f_for_vector2(texcoord_0_1);
1981 if((nFlagsY & DEGEN_0b) && (nFlagsY & DEGEN_1b) && (nFlagsY & DEGEN_2b))
1983 tangentV = vector3_subtracted(tmp, vertex_for_index(m_tess.m_vertices, BX->index + offStartY));
1984 b.vertex = vertex3f_for_vector3(tmp);//m_tess.m_vertices[BX->index + offStartY].vertex;
1985 b.texcoord = texcoord2f_for_vector2(texTmp);//m_tess.m_vertices[BX->index + offStartY].texcoord;
1989 tangentV = vector3_subtracted(vertex_for_index(m_tess.m_vertices, BX->index + offEndY), tmp);
1990 b.vertex = vertex3f_for_vector3(tmp);//m_tess.m_vertices[BX->index + offEndY].vertex;
1991 b.texcoord = texcoord2f_for_vector2(texTmp);//m_tess.m_vertices[BX->index + offEndY].texcoord;
1994 ArbitraryMeshVertex& v = m_tess.m_vertices[offEndY+BX->index];
1995 Vector3& p = normal3f_to_vector3(v.normal);
1996 Vector3& ps = normal3f_to_vector3(v.tangent);
1997 Vector3& pt = normal3f_to_vector3(v.bitangent);
2001 p = vector3_cross(tangentV, tangentU);
2005 p = vector3_cross(tangentU, tangentV);
2009 ArbitraryMeshTriangle_calcTangents(a, b, c, ps, pt);
2016 newFlagsX = newFlagsY = 0;
2018 if((nFlagsX & DEGEN_0a) && (nFlagsX & DEGEN_0b))
2020 newFlagsX |= DEGEN_0a;
2021 newFlagsX |= DEGEN_0b;
2023 if((nFlagsX & DEGEN_1a) && (nFlagsX & DEGEN_1b))
2025 newFlagsX |= DEGEN_1a;
2026 newFlagsX |= DEGEN_1b;
2028 if((nFlagsX & DEGEN_2a) && (nFlagsX & DEGEN_2b))
2030 newFlagsX |= DEGEN_2a;
2031 newFlagsX |= DEGEN_2b;
2033 if((nFlagsY & DEGEN_0a) && (nFlagsY & DEGEN_1a) && (nFlagsY & DEGEN_2a))
2035 newFlagsY |= DEGEN_0a;
2036 newFlagsY |= DEGEN_1a;
2037 newFlagsY |= DEGEN_2a;
2039 if((nFlagsY & DEGEN_0b) && (nFlagsY & DEGEN_1b) && (nFlagsY & DEGEN_2b))
2041 newFlagsY |= DEGEN_0b;
2042 newFlagsY |= DEGEN_1b;
2043 newFlagsY |= DEGEN_2b;
2047 //if((nFlagsX & DEGEN_0a) && (nFlagsX & DEGEN_1a) && (nFlagsX & DEGEN_2a)) { newFlagsX |= DEGEN_0a; newFlagsX |= DEGEN_1a; newFlagsX |= DEGEN_2a; }
2048 //if((nFlagsX & DEGEN_0b) && (nFlagsX & DEGEN_1b) && (nFlagsX & DEGEN_2b)) { newFlagsX |= DEGEN_0b; newFlagsX |= DEGEN_1b; newFlagsX |= DEGEN_2b; }
2050 newFlagsX |= (nFlagsX & SPLIT);
2051 newFlagsX |= (nFlagsX & AVERAGE);
2053 if(!BezierCurveTree_isLeaf(BY))
2056 int nTemp = newFlagsY;
2058 if((nFlagsY & DEGEN_0a) && (nFlagsY & DEGEN_0b))
2060 newFlagsY |= DEGEN_0a;
2061 newFlagsY |= DEGEN_0b;
2063 newFlagsY |= (nFlagsY & SPLIT);
2064 newFlagsY |= (nFlagsY & AVERAGE);
2066 Vector3& p = vertex_for_index(m_tess.m_vertices, BX->index+BY->index);
2069 Vector2& p2 = texcoord_for_index(m_tess.m_vertices, BX->index+BY->index);
2072 TesselateSubMatrix( BY, BX->left,
2073 offStartY, offStartX,
2075 newFlagsY, newFlagsX,
2076 vertex_0_0, vertex_1_0, vertex_2_0,
2077 texcoord_0_0, texcoord_1_0, texcoord_2_0,
2085 if((nFlagsY & DEGEN_2a) && (nFlagsY & DEGEN_2b)) { newFlagsY |= DEGEN_2a; newFlagsY |= DEGEN_2b; }
2087 TesselateSubMatrix( BY, BX->right,
2088 offStartY, BX->index,
2090 newFlagsY, newFlagsX,
2091 vertex_0_1, vertex_1_1, vertex_2_1,
2092 texcoord_0_1, texcoord_1_1, texcoord_2_1,
2097 if(!BezierCurveTree_isLeaf(BX->left))
2099 TesselateSubMatrix( BX->left, BY,
2100 offStartX, offStartY,
2102 newFlagsX, newFlagsY,
2103 left, vertex_1_0, tmp,
2104 texLeft, texcoord_1_0, texTmp,
2108 if(!BezierCurveTree_isLeaf(BX->right))
2110 TesselateSubMatrix( BX->right, BY,
2111 BX->index, offStartY,
2113 newFlagsX, newFlagsY,
2114 tmp, vertex_1_1, right,
2115 texTmp, texcoord_1_1, texRight,
2122 void Patch::BuildTesselationCurves(EMatrixMajor major)
2124 std::size_t nArrayStride, length, cross, strideU, strideV;
2129 length = (m_width - 1) >> 1;
2136 BezierCurveTreeArray_deleteAll(m_tess.m_curveTreeU);
2141 nArrayStride = m_tess.m_nArrayWidth;
2142 length = (m_height - 1) >> 1;
2149 BezierCurveTreeArray_deleteAll(m_tess.m_curveTreeV);
2154 ERROR_MESSAGE("neither row-major nor column-major");
2158 Array<std::size_t> arrayLength(length);
2159 Array<BezierCurveTree*> pCurveTree(length);
2161 std::size_t nArrayLength = 1;
2165 for(Array<std::size_t>::iterator i = arrayLength.begin(); i != arrayLength.end(); ++i)
2167 *i = Array<std::size_t>::value_type((major == ROW) ? m_subdivisions_x : m_subdivisions_y);
2173 // create a list of the horizontal control curves in each column of sub-patches
2174 // adaptively tesselate each horizontal control curve in the list
2175 // create a binary tree representing the combined tesselation of the list
2176 for(std::size_t i = 0; i != length; ++i)
2178 PatchControl* p1 = m_ctrlTransformed.data() + (i * 2 * strideU);
2179 GSList* pCurveList = 0;
2180 for(std::size_t j = 0; j < cross; j += 2)
2182 PatchControl* p2 = p1+strideV;
2183 PatchControl* p3 = p2+strideV;
2185 // directly taken from one row of control points
2187 BezierCurve* pCurve = new BezierCurve;
2188 pCurve->crd = (p1+strideU)->m_vertex;
2189 pCurve->left = p1->m_vertex;
2190 pCurve->right = (p1+(strideU<<1))->m_vertex;
2191 pCurveList = g_slist_prepend(pCurveList, pCurve);
2199 // interpolated from three columns of control points
2201 BezierCurve* pCurve = new BezierCurve;
2202 pCurve->crd = vector3_mid((p1+strideU)->m_vertex, (p3+strideU)->m_vertex);
2203 pCurve->left = vector3_mid(p1->m_vertex, p3->m_vertex);
2204 pCurve->right = vector3_mid((p1+(strideU<<1))->m_vertex, (p3+(strideU<<1))->m_vertex);
2206 pCurve->crd = vector3_mid(pCurve->crd, (p2+strideU)->m_vertex);
2207 pCurve->left = vector3_mid(pCurve->left, p2->m_vertex);
2208 pCurve->right = vector3_mid(pCurve->right, (p2+(strideU<<1))->m_vertex);
2209 pCurveList = g_slist_prepend(pCurveList, pCurve);
2215 pCurveTree[i] = new BezierCurveTree;
2216 BezierCurveTree_FromCurveList(pCurveTree[i], pCurveList);
2217 for(GSList* l = pCurveList; l != 0; l = g_slist_next(l))
2219 delete static_cast<BezierCurve*>((*l).data);
2221 g_slist_free(pCurveList);
2223 // set up array indices for binary tree
2224 // accumulate subarray width
2225 arrayLength[i] = Array<std::size_t>::value_type(BezierCurveTree_Setup(pCurveTree[i], nArrayLength, nArrayStride) - (nArrayLength - 1));
2226 // accumulate total array width
2227 nArrayLength += arrayLength[i];
2234 m_tess.m_nArrayWidth = nArrayLength;
2235 std::swap(m_tess.m_arrayWidth, arrayLength);
2239 std::swap(m_tess.m_curveTreeU, pCurveTree);
2243 m_tess.m_nArrayHeight = nArrayLength;
2244 std::swap(m_tess.m_arrayHeight, arrayLength);
2248 std::swap(m_tess.m_curveTreeV, pCurveTree);
2254 inline void vertex_assign_ctrl(ArbitraryMeshVertex& vertex, const PatchControl& ctrl)
2256 vertex.vertex = vertex3f_for_vector3(ctrl.m_vertex);
2257 vertex.texcoord = texcoord2f_for_vector2(ctrl.m_texcoord);
2260 inline void vertex_clear_normal(ArbitraryMeshVertex& vertex)
2262 vertex.normal = Normal3f(0, 0, 0);
2263 vertex.tangent = Normal3f(0, 0, 0);
2264 vertex.bitangent = Normal3f(0, 0, 0);
2267 inline void tangents_remove_degenerate(Vector3 tangents[6], Vector2 textureTangents[6], unsigned int flags)
2269 if(flags & DEGEN_0a)
2271 const std::size_t i =
2273 ? (flags & DEGEN_1a)
2274 ? (flags & DEGEN_1b)
2275 ? (flags & DEGEN_2a)
2281 tangents[0] = tangents[i];
2282 textureTangents[0] = textureTangents[i];
2284 if(flags & DEGEN_0b)
2286 const std::size_t i =
2288 ? (flags & DEGEN_1b)
2289 ? (flags & DEGEN_1a)
2290 ? (flags & DEGEN_2b)
2296 tangents[1] = tangents[i];
2297 textureTangents[1] = textureTangents[i];
2299 if(flags & DEGEN_2a)
2301 const std::size_t i =
2303 ? (flags & DEGEN_1a)
2304 ? (flags & DEGEN_1b)
2305 ? (flags & DEGEN_0a)
2311 tangents[4] = tangents[i];
2312 textureTangents[4] = textureTangents[i];
2314 if(flags & DEGEN_2b)
2316 const std::size_t i =
2318 ? (flags & DEGEN_1b)
2319 ? (flags & DEGEN_1a)
2320 ? (flags & DEGEN_0b)
2326 tangents[5] = tangents[i];
2327 textureTangents[5] = textureTangents[i];
2331 void bestTangents00(unsigned int degenerateFlags, double dot, double length, std::size_t& index0, std::size_t& index1)
2333 if(fabs(dot + length) < 0.001) // opposing direction = degenerate
2335 if(!(degenerateFlags & DEGEN_1a)) // if this tangent is degenerate we cannot use it
2340 else if(!(degenerateFlags & DEGEN_0b))
2351 else if(fabs(dot - length) < 0.001) // same direction = degenerate
2353 if(degenerateFlags & DEGEN_0b)
2366 void bestTangents01(unsigned int degenerateFlags, double dot, double length, std::size_t& index0, std::size_t& index1)
2368 if(fabs(dot - length) < 0.001) // same direction = degenerate
2370 if(!(degenerateFlags & DEGEN_1a)) // if this tangent is degenerate we cannot use it
2375 else if(!(degenerateFlags & DEGEN_2b))
2386 else if(fabs(dot + length) < 0.001) // opposing direction = degenerate
2388 if(degenerateFlags & DEGEN_2b)
2401 void bestTangents10(unsigned int degenerateFlags, double dot, double length, std::size_t& index0, std::size_t& index1)
2403 if(fabs(dot - length) < 0.001) // same direction = degenerate
2405 if(!(degenerateFlags & DEGEN_1b)) // if this tangent is degenerate we cannot use it
2410 else if(!(degenerateFlags & DEGEN_0a))
2421 else if(fabs(dot + length) < 0.001) // opposing direction = degenerate
2423 if(degenerateFlags & DEGEN_0a)
2436 void bestTangents11(unsigned int degenerateFlags, double dot, double length, std::size_t& index0, std::size_t& index1)
2438 if(fabs(dot + length) < 0.001) // opposing direction = degenerate
2440 if(!(degenerateFlags & DEGEN_1b)) // if this tangent is degenerate we cannot use it
2445 else if(!(degenerateFlags & DEGEN_2a))
2456 else if(fabs(dot - length) < 0.001) // same direction = degenerate
2458 if(degenerateFlags & DEGEN_2a)
2471 void Patch::accumulateVertexTangentSpace(std::size_t index, Vector3 tangentX[6], Vector3 tangentY[6], Vector2 tangentS[6], Vector2 tangentT[6], std::size_t index0, std::size_t index1)
2474 Vector3 normal(vector3_cross(tangentX[index0], tangentY[index1]));
2475 if(!vector3_equal(normal, g_vector3_identity))
2477 vector3_add(normal_for_index(m_tess.m_vertices, index), vector3_normalised(normal));
2482 ArbitraryMeshVertex a, b, c;
2483 a.vertex = Vertex3f(0, 0, 0);
2484 a.texcoord = TexCoord2f(0, 0);
2485 b.vertex = vertex3f_for_vector3(tangentX[index0]);
2486 b.texcoord = texcoord2f_for_vector2(tangentS[index0]);
2487 c.vertex = vertex3f_for_vector3(tangentY[index1]);
2488 c.texcoord = texcoord2f_for_vector2(tangentT[index1]);
2491 ArbitraryMeshTriangle_calcTangents(a, b, c, s, t);
2492 if(!vector3_equal(s, g_vector3_identity))
2494 vector3_add(tangent_for_index(m_tess.m_vertices, index), vector3_normalised(s));
2496 if(!vector3_equal(t, g_vector3_identity))
2498 vector3_add(bitangent_for_index(m_tess.m_vertices, index), vector3_normalised(t));
2503 const std::size_t PATCH_MAX_VERTEX_ARRAY = 1048576;
2505 void Patch::BuildVertexArray()
2507 const std::size_t strideU = 1;
2508 const std::size_t strideV = m_width;
2510 const std::size_t numElems = m_tess.m_nArrayWidth*m_tess.m_nArrayHeight; // total number of elements in vertex array
2512 const bool bWidthStrips = (m_tess.m_nArrayWidth >= m_tess.m_nArrayHeight); // decide if horizontal strips are longer than vertical
2515 // allocate vertex, normal, texcoord and primitive-index arrays
2516 m_tess.m_vertices.resize(numElems);
2517 m_tess.m_indices.resize(m_tess.m_nArrayWidth *2 * (m_tess.m_nArrayHeight - 1));
2519 // set up strip indices
2522 m_tess.m_numStrips = m_tess.m_nArrayHeight-1;
2523 m_tess.m_lenStrips = m_tess.m_nArrayWidth*2;
2525 for(std::size_t i=0; i<m_tess.m_nArrayWidth; i++)
2527 for(std::size_t j=0; j<m_tess.m_numStrips; j++)
2529 m_tess.m_indices[(j*m_tess.m_lenStrips)+i*2] = RenderIndex(j*m_tess.m_nArrayWidth+i);
2530 m_tess.m_indices[(j*m_tess.m_lenStrips)+i*2+1] = RenderIndex((j+1)*m_tess.m_nArrayWidth+i);
2531 // reverse because radiant uses CULL_FRONT
2532 //m_tess.m_indices[(j*m_tess.m_lenStrips)+i*2+1] = RenderIndex(j*m_tess.m_nArrayWidth+i);
2533 //m_tess.m_indices[(j*m_tess.m_lenStrips)+i*2] = RenderIndex((j+1)*m_tess.m_nArrayWidth+i);
2539 m_tess.m_numStrips = m_tess.m_nArrayWidth-1;
2540 m_tess.m_lenStrips = m_tess.m_nArrayHeight*2;
2542 for(std::size_t i=0; i<m_tess.m_nArrayHeight; i++)
2544 for(std::size_t j=0; j<m_tess.m_numStrips; j++)
2546 m_tess.m_indices[(j*m_tess.m_lenStrips)+i*2] = RenderIndex(((m_tess.m_nArrayHeight-1)-i)*m_tess.m_nArrayWidth+j);
2547 m_tess.m_indices[(j*m_tess.m_lenStrips)+i*2+1] = RenderIndex(((m_tess.m_nArrayHeight-1)-i)*m_tess.m_nArrayWidth+j+1);
2548 // reverse because radiant uses CULL_FRONT
2549 //m_tess.m_indices[(j*m_tess.m_lenStrips)+i*2+1] = RenderIndex(((m_tess.m_nArrayHeight-1)-i)*m_tess.m_nArrayWidth+j);
2550 //m_tess.m_indices[(j*m_tess.m_lenStrips)+i*2] = RenderIndex(((m_tess.m_nArrayHeight-1)-i)*m_tess.m_nArrayWidth+j+1);
2557 PatchControlIter pCtrl = m_ctrlTransformed.data();
2558 for(std::size_t j = 0, offStartY = 0; j+1 < m_height; j += 2, pCtrl += (strideU + strideV))
2560 // set up array offsets for this sub-patch
2561 const bool leafY = (m_patchDef3) ? false : BezierCurveTree_isLeaf(m_tess.m_curveTreeV[j>>1]);
2562 const std::size_t offMidY = (m_patchDef3) ? 0 : m_tess.m_curveTreeV[j>>1]->index;
2563 const std::size_t widthY = m_tess.m_arrayHeight[j>>1] * m_tess.m_nArrayWidth;
2564 const std::size_t offEndY = offStartY + widthY;
2566 for(std::size_t i = 0, offStartX = 0; i+1 < m_width; i += 2, pCtrl += (strideU << 1))
2568 const bool leafX = (m_patchDef3) ? false : BezierCurveTree_isLeaf(m_tess.m_curveTreeU[i>>1]);
2569 const std::size_t offMidX = (m_patchDef3) ? 0 : m_tess.m_curveTreeU[i>>1]->index;
2570 const std::size_t widthX = m_tess.m_arrayWidth[i>>1];
2571 const std::size_t offEndX = offStartX + widthX;
2573 PatchControl *subMatrix[3][3];
2574 subMatrix[0][0] = pCtrl;
2575 subMatrix[0][1] = subMatrix[0][0]+strideU;
2576 subMatrix[0][2] = subMatrix[0][1]+strideU;
2577 subMatrix[1][0] = subMatrix[0][0]+strideV;
2578 subMatrix[1][1] = subMatrix[1][0]+strideU;
2579 subMatrix[1][2] = subMatrix[1][1]+strideU;
2580 subMatrix[2][0] = subMatrix[1][0]+strideV;
2581 subMatrix[2][1] = subMatrix[2][0]+strideU;
2582 subMatrix[2][2] = subMatrix[2][1]+strideU;
2584 // assign on-patch control points to vertex array
2585 if(i == 0 && j == 0)
2587 vertex_clear_normal(m_tess.m_vertices[offStartX + offStartY]);
2589 vertex_assign_ctrl(m_tess.m_vertices[offStartX + offStartY], *subMatrix[0][0]);
2592 vertex_clear_normal(m_tess.m_vertices[offEndX + offStartY]);
2594 vertex_assign_ctrl(m_tess.m_vertices[offEndX + offStartY], *subMatrix[0][2]);
2597 vertex_clear_normal(m_tess.m_vertices[offStartX + offEndY]);
2599 vertex_assign_ctrl(m_tess.m_vertices[offStartX + offEndY], *subMatrix[2][0]);
2601 vertex_clear_normal(m_tess.m_vertices[offEndX + offEndY]);
2602 vertex_assign_ctrl(m_tess.m_vertices[offEndX + offEndY], *subMatrix[2][2]);
2606 // assign remaining control points to vertex array
2609 vertex_assign_ctrl(m_tess.m_vertices[offMidX + offStartY], *subMatrix[0][1]);
2610 vertex_assign_ctrl(m_tess.m_vertices[offMidX + offEndY], *subMatrix[2][1]);
2614 vertex_assign_ctrl(m_tess.m_vertices[offStartX + offMidY], *subMatrix[1][0]);
2615 vertex_assign_ctrl(m_tess.m_vertices[offEndX + offMidY], *subMatrix[1][2]);
2619 vertex_assign_ctrl(m_tess.m_vertices[offMidX + offMidY], *subMatrix[1][1]);
2624 // test all 12 edges for degeneracy
2625 unsigned int nFlagsX = subarray_get_degen(pCtrl, strideU, strideV);
2626 unsigned int nFlagsY = subarray_get_degen(pCtrl, strideV, strideU);
2627 Vector3 tangentX[6], tangentY[6];
2628 Vector2 tangentS[6], tangentT[6];
2630 // set up tangents for each of the 12 edges if they were not degenerate
2631 if(!(nFlagsX & DEGEN_0a))
2633 tangentX[0] = vector3_subtracted(subMatrix[0][1]->m_vertex, subMatrix[0][0]->m_vertex);
2634 tangentS[0] = vector2_subtracted(subMatrix[0][1]->m_texcoord, subMatrix[0][0]->m_texcoord);
2636 if(!(nFlagsX & DEGEN_0b))
2638 tangentX[1] = vector3_subtracted(subMatrix[0][2]->m_vertex, subMatrix[0][1]->m_vertex);
2639 tangentS[1] = vector2_subtracted(subMatrix[0][2]->m_texcoord, subMatrix[0][1]->m_texcoord);
2641 if(!(nFlagsX & DEGEN_1a))
2643 tangentX[2] = vector3_subtracted(subMatrix[1][1]->m_vertex, subMatrix[1][0]->m_vertex);
2644 tangentS[2] = vector2_subtracted(subMatrix[1][1]->m_texcoord, subMatrix[1][0]->m_texcoord);
2646 if(!(nFlagsX & DEGEN_1b))
2648 tangentX[3] = vector3_subtracted(subMatrix[1][2]->m_vertex, subMatrix[1][1]->m_vertex);
2649 tangentS[3] = vector2_subtracted(subMatrix[1][2]->m_texcoord, subMatrix[1][1]->m_texcoord);
2651 if(!(nFlagsX & DEGEN_2a))
2653 tangentX[4] = vector3_subtracted(subMatrix[2][1]->m_vertex, subMatrix[2][0]->m_vertex);
2654 tangentS[4] = vector2_subtracted(subMatrix[2][1]->m_texcoord, subMatrix[2][0]->m_texcoord);
2656 if(!(nFlagsX & DEGEN_2b))
2658 tangentX[5] = vector3_subtracted(subMatrix[2][2]->m_vertex, subMatrix[2][1]->m_vertex);
2659 tangentS[5] = vector2_subtracted(subMatrix[2][2]->m_texcoord, subMatrix[2][1]->m_texcoord);
2662 if(!(nFlagsY & DEGEN_0a))
2664 tangentY[0] = vector3_subtracted(subMatrix[1][0]->m_vertex, subMatrix[0][0]->m_vertex);
2665 tangentT[0] = vector2_subtracted(subMatrix[1][0]->m_texcoord, subMatrix[0][0]->m_texcoord);
2667 if(!(nFlagsY & DEGEN_0b))
2669 tangentY[1] = vector3_subtracted(subMatrix[2][0]->m_vertex, subMatrix[1][0]->m_vertex);
2670 tangentT[1] = vector2_subtracted(subMatrix[2][0]->m_texcoord, subMatrix[1][0]->m_texcoord);
2672 if(!(nFlagsY & DEGEN_1a))
2674 tangentY[2] = vector3_subtracted(subMatrix[1][1]->m_vertex, subMatrix[0][1]->m_vertex);
2675 tangentT[2] = vector2_subtracted(subMatrix[1][1]->m_texcoord, subMatrix[0][1]->m_texcoord);
2677 if(!(nFlagsY & DEGEN_1b))
2679 tangentY[3] = vector3_subtracted(subMatrix[2][1]->m_vertex, subMatrix[1][1]->m_vertex);
2680 tangentT[3] = vector2_subtracted(subMatrix[2][1]->m_texcoord, subMatrix[1][1]->m_texcoord);
2682 if(!(nFlagsY & DEGEN_2a))
2684 tangentY[4] = vector3_subtracted(subMatrix[1][2]->m_vertex, subMatrix[0][2]->m_vertex);
2685 tangentT[4] = vector2_subtracted(subMatrix[1][2]->m_texcoord, subMatrix[0][2]->m_texcoord);
2687 if(!(nFlagsY & DEGEN_2b))
2689 tangentY[5] = vector3_subtracted(subMatrix[2][2]->m_vertex, subMatrix[1][2]->m_vertex);
2690 tangentT[5] = vector2_subtracted(subMatrix[2][2]->m_texcoord, subMatrix[1][2]->m_texcoord);
2693 // set up remaining edge tangents by borrowing the tangent from the closest parallel non-degenerate edge
2694 tangents_remove_degenerate(tangentX, tangentS, nFlagsX);
2695 tangents_remove_degenerate(tangentY, tangentT, nFlagsY);
2699 std::size_t index = offStartX + offStartY;
2700 std::size_t index0 = 0;
2701 std::size_t index1 = 0;
2703 double dot = vector3_dot(tangentX[index0], tangentY[index1]);
2704 double length = vector3_length(tangentX[index0]) * vector3_length(tangentY[index1]);
2706 bestTangents00(nFlagsX, dot, length, index0, index1);
2708 accumulateVertexTangentSpace(index, tangentX, tangentY, tangentS, tangentT, index0, index1);
2713 std::size_t index = offEndX + offStartY;
2714 std::size_t index0 = 1;
2715 std::size_t index1 = 4;
2717 double dot = vector3_dot(tangentX[index0],tangentY[index1]);
2718 double length = vector3_length(tangentX[index0]) * vector3_length(tangentY[index1]);
2720 bestTangents10(nFlagsX, dot, length, index0, index1);
2722 accumulateVertexTangentSpace(index, tangentX, tangentY, tangentS, tangentT, index0, index1);
2727 std::size_t index = offStartX + offEndY;
2728 std::size_t index0 = 4;
2729 std::size_t index1 = 1;
2731 double dot = vector3_dot(tangentX[index0], tangentY[index1]);
2732 double length = vector3_length(tangentX[index1]) * vector3_length(tangentY[index1]);
2734 bestTangents01(nFlagsX, dot, length, index0, index1);
2736 accumulateVertexTangentSpace(index, tangentX, tangentY, tangentS, tangentT, index0, index1);
2741 std::size_t index = offEndX + offEndY;
2742 std::size_t index0 = 5;
2743 std::size_t index1 = 5;
2745 double dot = vector3_dot(tangentX[index0],tangentY[index1]);
2746 double length = vector3_length(tangentX[index0]) * vector3_length(tangentY[index1]);
2748 bestTangents11(nFlagsX, dot, length, index0, index1);
2750 accumulateVertexTangentSpace(index, tangentX, tangentY, tangentS, tangentT, index0, index1);
2753 //normalise normals that won't be accumulated again
2756 normalise_safe(normal_for_index(m_tess.m_vertices, offStartX + offStartY));
2757 normalise_safe(tangent_for_index(m_tess.m_vertices, offStartX + offStartY));
2758 normalise_safe(bitangent_for_index(m_tess.m_vertices, offStartX + offStartY));
2762 normalise_safe(normal_for_index(m_tess.m_vertices, offEndX + offStartY));
2763 normalise_safe(tangent_for_index(m_tess.m_vertices, offEndX + offStartY));
2764 normalise_safe(bitangent_for_index(m_tess.m_vertices, offEndX + offStartY));
2768 normalise_safe(normal_for_index(m_tess.m_vertices, offStartX + offEndY));
2769 normalise_safe(tangent_for_index(m_tess.m_vertices, offStartX + offEndY));
2770 normalise_safe(bitangent_for_index(m_tess.m_vertices, offStartX + offEndY));
2772 if(i+3 == m_width && j+3 == m_height)
2774 normalise_safe(normal_for_index(m_tess.m_vertices, offEndX + offEndY));
2775 normalise_safe(tangent_for_index(m_tess.m_vertices, offEndX + offEndY));
2776 normalise_safe(bitangent_for_index(m_tess.m_vertices, offEndX + offEndY));
2779 // set flags to average normals between shared edges
2788 // set flags to save evaluating shared edges twice
2792 // if the patch is curved.. tesselate recursively
2793 // use the relevant control curves for this sub-patch
2796 TesselateSubMatrixFixed(m_tess.m_vertices.data() + offStartX + offStartY, 1, m_tess.m_nArrayWidth, nFlagsX, nFlagsY, subMatrix);
2802 TesselateSubMatrix( m_tess.m_curveTreeU[i>>1], m_tess.m_curveTreeV[j>>1],
2803 offStartX, offStartY, offEndX, offEndY, // array offsets
2805 subMatrix[1][0]->m_vertex, subMatrix[1][1]->m_vertex, subMatrix[1][2]->m_vertex,
2806 subMatrix[1][0]->m_texcoord, subMatrix[1][1]->m_texcoord, subMatrix[1][2]->m_texcoord,
2811 TesselateSubMatrix( m_tess.m_curveTreeV[j>>1], m_tess.m_curveTreeU[i>>1],
2812 offStartY, offStartX, offEndY, offEndX, // array offsets
2814 subMatrix[0][1]->m_vertex, subMatrix[1][1]->m_vertex, subMatrix[2][1]->m_vertex,
2815 subMatrix[0][1]->m_texcoord, subMatrix[1][1]->m_texcoord, subMatrix[2][1]->m_texcoord,
2820 offStartX = offEndX;
2822 offStartY = offEndY;
2829 class PatchFilterWrapper : public Filter
2833 PatchFilter& m_filter;
2835 PatchFilterWrapper(PatchFilter& filter, bool invert) : m_invert(invert), m_filter(filter)
2838 void setActive(bool active)
2846 bool filter(const Patch& patch)
2848 return m_invert ^ m_filter.filter(patch);
2853 typedef std::list<PatchFilterWrapper> PatchFilters;
2854 PatchFilters g_patchFilters;
2856 void add_patch_filter(PatchFilter& filter, int mask, bool invert)
2858 g_patchFilters.push_back(PatchFilterWrapper(filter, invert));
2859 GlobalFilterSystem().addFilter(g_patchFilters.back(), mask);
2862 bool patch_filtered(Patch& patch)
2864 for(PatchFilters::iterator i = g_patchFilters.begin(); i != g_patchFilters.end(); ++i)
2866 if((*i).active() && (*i).filter(patch))