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;
403 PatchControl* p1, * p2, * p3, * p2b;
410 width = (m_width-1)>>1;
413 row_stride = m_width;
416 width = (m_height-1)>>1;
418 col_stride = m_width;
422 ERROR_MESSAGE("neither row-major nor column-major");
427 for(h=0;h<height;h++)
429 p1 = m_ctrl.data()+(h*row_stride);
430 p2 = p1+(2*width)*col_stride;
431 //globalErrorStream() << "compare " << p1->m_vertex << " and " << p2->m_vertex << "\n";
432 if(vector3_length_squared(vector3_subtracted(p1->m_vertex, p2->m_vertex)) > 1.0)
434 //globalErrorStream() << "too far\n";
440 for(h=0;h<height;h++)
442 p1 = m_ctrl.data()+(h*row_stride)+col_stride;
443 for(w=0;w<width-1;w++)
447 p2->m_vertex = vector3_mid(p1->m_vertex, p3->m_vertex);
452 p1 = m_ctrl.data()+(h*row_stride)+(2*width-1)*col_stride;
453 p2 = m_ctrl.data()+(h*row_stride);
454 p2b = m_ctrl.data()+(h*row_stride)+(2*width)*col_stride;
455 p3 = m_ctrl.data()+(h*row_stride)+col_stride;
456 p2->m_vertex = p2b->m_vertex = vector3_mid(p1->m_vertex, p3->m_vertex);
460 controlPointsChanged();
463 void Patch::InsertRemove(bool bInsert, bool bColumn, bool bFirst)
469 if(bColumn && (m_width + 2 <= MAX_PATCH_WIDTH))
470 InsertPoints(COL, bFirst);
471 else if(m_height + 2 <= MAX_PATCH_HEIGHT)
472 InsertPoints(ROW, bFirst);
476 if(bColumn && (m_width - 2 >= MIN_PATCH_WIDTH))
477 RemovePoints(COL, bFirst);
478 else if(m_height - 2 >= MIN_PATCH_HEIGHT)
479 RemovePoints(ROW, bFirst);
482 controlPointsChanged();
485 Patch* Patch::MakeCap(Patch* patch, EPatchCap eType, EMatrixMajor mt, bool bFirst)
487 std::size_t i, width, height;
500 ERROR_MESSAGE("neither row-major nor column-major");
504 Array<Vector3> p(width);
506 std::size_t nIndex = (bFirst) ? 0 : height-1;
509 for (i=0; i<width; i++)
511 p[(bFirst)?i:(width-1)-i] = ctrlAt(nIndex, i).m_vertex;
516 for (i=0; i<width; i++)
518 p[(bFirst)?i:(width-1)-i] = ctrlAt(i, nIndex).m_vertex;
522 patch->ConstructSeam(eType, p.data(), width);
526 void Patch::FlipTexture(int nAxis)
530 for(PatchControlIter i = m_ctrl.data(); i != m_ctrl.data() + m_ctrl.size(); ++i)
532 (*i).m_texcoord[nAxis] = -(*i).m_texcoord[nAxis];
535 controlPointsChanged();
538 void Patch::TranslateTexture(float s, float t)
542 s = -1 * s / m_state->getTexture().width;
543 t = t / m_state->getTexture().height;
545 for(PatchControlIter i = m_ctrl.data(); i != m_ctrl.data() + m_ctrl.size(); ++i)
547 (*i).m_texcoord[0] += s;
548 (*i).m_texcoord[1] += t;
551 controlPointsChanged();
554 void Patch::ScaleTexture(float s, float t)
558 for(PatchControlIter i = m_ctrl.data(); i != m_ctrl.data() + m_ctrl.size(); ++i)
560 (*i).m_texcoord[0] *= s;
561 (*i).m_texcoord[1] *= t;
564 controlPointsChanged();
567 void Patch::RotateTexture(float angle)
571 const float s = static_cast<float>(sin(degrees_to_radians(angle)));
572 const float c = static_cast<float>(cos(degrees_to_radians(angle)));
574 for(PatchControlIter i = m_ctrl.data(); i != m_ctrl.data() + m_ctrl.size(); ++i)
576 const float x = (*i).m_texcoord[0];
577 const float y = (*i).m_texcoord[1];
578 (*i).m_texcoord[0] = (x * c) - (y * s);
579 (*i).m_texcoord[1] = (y * c) + (x * s);
582 controlPointsChanged();
586 void Patch::SetTextureRepeat(float s, float t)
589 float si, ti, sc, tc;
594 si = s / (float)(m_width - 1);
595 ti = t / (float)(m_height - 1);
597 pDest = m_ctrl.data();
598 for (h=0, tc = 0.0f; h<m_height; h++, tc+=ti)
600 for (w=0, sc = 0.0f; w<m_width; w++, sc+=si)
602 pDest->m_texcoord[0] = sc;
603 pDest->m_texcoord[1] = tc;
608 controlPointsChanged();
612 void Patch::SetTextureInfo(texdef_t *pt)
614 if(pt->getShift()[0] || pt->getShift()[1])
615 TranslateTexture (pt->getShift()[0], pt->getShift()[1]);
616 else if(pt->getScale()[0] || pt->getScale()[1])
618 if(pt->getScale()[0] == 0.0f) pt->setScale(0, 1.0f);
619 if(pt->getScale()[1] == 0.0f) pt->setScale(1, 1.0f);
620 ScaleTexture (pt->getScale()[0], pt->getScale()[1]);
623 RotateTexture (pt->rotate);
627 inline int texture_axis(const Vector3& normal)
629 // axis dominance order: Z, X, Y
630 return (normal.x() >= normal.y()) ? (normal.x() > normal.z()) ? 0 : 2 : (normal.y() > normal.z()) ? 1 : 2;
633 void Patch::CapTexture()
635 const PatchControl& p1 = m_ctrl[m_width];
636 const PatchControl& p2 = m_ctrl[m_width*(m_height-1)];
637 const PatchControl& p3 = m_ctrl[(m_width*m_height)-1];
640 Vector3 normal(g_vector3_identity);
643 Vector3 tmp(vector3_cross(
644 vector3_subtracted(p2.m_vertex, m_ctrl[0].m_vertex),
645 vector3_subtracted(p3.m_vertex, m_ctrl[0].m_vertex)
647 if(!vector3_equal(tmp, g_vector3_identity))
649 vector3_add(normal, tmp);
653 Vector3 tmp(vector3_cross(
654 vector3_subtracted(p1.m_vertex, p3.m_vertex),
655 vector3_subtracted(m_ctrl[0].m_vertex, p3.m_vertex)
657 if(!vector3_equal(tmp, g_vector3_identity))
659 vector3_add(normal, tmp);
663 ProjectTexture(texture_axis(normal));
666 // uses longest parallel chord to calculate texture coords for each row/col
667 void Patch::NaturalTexture()
672 float fSize = (float)m_state->getTexture().width * Texdef_getDefaultTextureScale();
676 PatchControl* pWidth = m_ctrl.data();
677 for (std::size_t w=0; w<m_width; w++, pWidth++)
680 PatchControl* pHeight = pWidth;
681 for (std::size_t h=0; h<m_height; h++, pHeight+=m_width)
682 pHeight->m_texcoord[0] = static_cast<float>(tex);
689 PatchControl* pHeight = pWidth;
690 for (std::size_t h=0; h<m_height; h++, pHeight+=m_width)
692 Vector3 v(vector3_subtracted(pHeight->m_vertex, (pHeight+1)->m_vertex));
693 double length = tex + (vector3_length(v) / fSize);
694 if(fabs(length) > texBest) texBest = length;
703 float fSize = -(float)m_state->getTexture().height * Texdef_getDefaultTextureScale();
707 PatchControl* pHeight = m_ctrl.data();
708 for (std::size_t h=0; h<m_height; h++, pHeight+=m_width)
711 PatchControl* pWidth = pHeight;
712 for (std::size_t w=0; w<m_width; w++, pWidth++)
713 pWidth->m_texcoord[1] = static_cast<float>(tex);
720 PatchControl* pWidth = pHeight;
721 for (std::size_t w=0; w<m_width; w++, pWidth++)
723 Vector3 v(vector3_subtracted(pWidth->m_vertex, (pWidth+m_width)->m_vertex));
724 double length = tex + (vector3_length(v) / fSize);
725 if(fabs(length) > texBest) texBest = length;
733 controlPointsChanged();
740 void Patch::AccumulateBBox()
742 m_aabb_local = AABB();
744 for(PatchControlArray::iterator i = m_ctrlTransformed.begin(); i != m_ctrlTransformed.end(); ++i)
746 aabb_extend_by_point_safe(m_aabb_local, (*i).m_vertex);
753 void Patch::InsertPoints(EMatrixMajor mt, bool bFirst)
755 std::size_t width, height, row_stride, col_stride;
761 row_stride = m_width;
766 col_stride = m_width;
772 ERROR_MESSAGE("neither row-major nor column-major");
778 PatchControl* p1 = m_ctrl.data();
779 for(std::size_t w = 0; w != width; ++w, p1 += col_stride)
782 PatchControl* p2 = p1;
783 for(std::size_t h = 1; h < height; h += 2, p2 += 2 * row_stride)
785 if(0)//p2->m_selectable.isSelected())
798 PatchControl* p2 = p1;
799 for(std::size_t h = 0; h < height; h += 2, p2 += 2 * row_stride)
801 if(0)//p2->m_selectable.isSelected())
815 Array<PatchControl> tmp(m_ctrl);
817 std::size_t row_stride2, col_stride2;
821 setDims(m_width, m_height+2);
823 row_stride2 = m_width;
826 setDims(m_width+2, m_height);
827 col_stride2 = m_width;
831 ERROR_MESSAGE("neither row-major nor column-major");
856 for(std::size_t w = 0; w != width; ++w)
858 PatchControl* p1 = tmp.data() + (w*col_stride);
859 PatchControl* p2 = m_ctrl.data() + (w*col_stride2);
860 for(std::size_t h = 0; h != height; ++h, p2 += row_stride2, p1 += row_stride)
864 p2 += 2 * row_stride2;
869 p1 = tmp.data() + (w*col_stride+pos*row_stride);
870 p2 = m_ctrl.data() + (w*col_stride2+pos*row_stride2);
872 PatchControl* r2a = (p2+row_stride2);
873 PatchControl* r2b = (p2-row_stride2);
874 PatchControl* c2a = (p1-2*row_stride);
875 PatchControl* c2b = (p1-row_stride);
877 // set two new row points
878 *(p2+2*row_stride2) = *p1;
881 for(std::size_t i = 0; i != 3; ++i)
883 r2a->m_vertex[i] = float_mid(c2b->m_vertex[i], p1->m_vertex[i]);
885 r2b->m_vertex[i] = float_mid(c2a->m_vertex[i], c2b->m_vertex[i]);
887 p2->m_vertex[i] = float_mid(r2a->m_vertex[i], r2b->m_vertex[i]);
889 for(std::size_t i = 0; i != 2; ++i)
891 r2a->m_texcoord[i] = float_mid(c2b->m_texcoord[i], p1->m_texcoord[i]);
893 r2b->m_texcoord[i] = float_mid(c2a->m_texcoord[i], c2b->m_texcoord[i]);
895 p2->m_texcoord[i] = float_mid(r2a->m_texcoord[i], r2b->m_texcoord[i]);
900 void Patch::RemovePoints(EMatrixMajor mt, bool bFirst)
902 std::size_t width, height, row_stride, col_stride;
908 row_stride = m_width;
913 col_stride = m_width;
919 ERROR_MESSAGE("neither row-major nor column-major");
925 PatchControl* p1 = m_ctrl.data();
926 for(std::size_t w = 0; w != width; ++w, p1 += col_stride)
929 PatchControl* p2 = p1;
930 for(std::size_t h=1; h < height; h += 2, p2 += 2 * row_stride)
932 if(0)//p2->m_selectable.isSelected())
945 PatchControl* p2 = p1;
946 for(std::size_t h=0; h < height; h += 2, p2 += 2 * row_stride)
948 if(0)//p2->m_selectable.isSelected())
962 Array<PatchControl> tmp(m_ctrl);
964 std::size_t row_stride2, col_stride2;
968 setDims(m_width, m_height-2);
970 row_stride2 = m_width;
973 setDims(m_width-2, m_height);
974 col_stride2 = m_width;
978 ERROR_MESSAGE("neither row-major nor column-major");
997 else if(pos > height - 3)
1006 for(std::size_t w = 0; w != width; w++)
1008 PatchControl* p1 = tmp.data() + (w*col_stride);
1009 PatchControl* p2 = m_ctrl.data() + (w*col_stride2);
1010 for(std::size_t h = 0; h != height; ++h, p2 += row_stride2, p1 += row_stride)
1014 p1 += 2 * row_stride2; h += 2;
1019 p1 = tmp.data() + (w*col_stride+pos*row_stride);
1020 p2 = m_ctrl.data() + (w*col_stride2+pos*row_stride2);
1022 for(std::size_t i=0; i<3; i++)
1024 (p2-row_stride2)->m_vertex[i] = ((p1+2*row_stride)->m_vertex[i]+(p1-2*row_stride)->m_vertex[i]) * 0.5f;
1026 (p2-row_stride2)->m_vertex[i] = (p2-row_stride2)->m_vertex[i]+(2.0f * ((p1)->m_vertex[i]-(p2-row_stride2)->m_vertex[i]));
1028 for(std::size_t i=0; i<2; i++)
1030 (p2-row_stride2)->m_texcoord[i] = ((p1+2*row_stride)->m_texcoord[i]+(p1-2*row_stride)->m_texcoord[i]) * 0.5f;
1032 (p2-row_stride2)->m_texcoord[i] = (p2-row_stride2)->m_texcoord[i]+(2.0f * ((p1)->m_texcoord[i]-(p2-row_stride2)->m_texcoord[i]));
1037 void Patch::ConstructSeam(EPatchCap eType, Vector3* p, std::size_t width)
1044 m_ctrl[0].m_vertex = p[0];
1045 m_ctrl[1].m_vertex = p[1];
1046 m_ctrl[2].m_vertex = p[1];
1047 m_ctrl[3].m_vertex = p[1];
1048 m_ctrl[4].m_vertex = p[1];
1049 m_ctrl[5].m_vertex = p[1];
1050 m_ctrl[6].m_vertex = p[2];
1051 m_ctrl[7].m_vertex = p[1];
1052 m_ctrl[8].m_vertex = p[1];
1058 Vector3 p3(vector3_added(p[2], vector3_subtracted(p[0], p[1])));
1059 m_ctrl[0].m_vertex = p3;
1060 m_ctrl[1].m_vertex = p3;
1061 m_ctrl[2].m_vertex = p[2];
1062 m_ctrl[3].m_vertex = p3;
1063 m_ctrl[4].m_vertex = p3;
1064 m_ctrl[5].m_vertex = p[1];
1065 m_ctrl[6].m_vertex = p3;
1066 m_ctrl[7].m_vertex = p3;
1067 m_ctrl[8].m_vertex = p[0];
1072 Vector3 p5(vector3_mid(p[0], p[4]));
1075 m_ctrl[0].m_vertex = p[0];
1076 m_ctrl[1].m_vertex = p5;
1077 m_ctrl[2].m_vertex = p[4];
1078 m_ctrl[3].m_vertex = p[1];
1079 m_ctrl[4].m_vertex = p[2];
1080 m_ctrl[5].m_vertex = p[3];
1081 m_ctrl[6].m_vertex = p[2];
1082 m_ctrl[7].m_vertex = p[2];
1083 m_ctrl[8].m_vertex = p[2];
1089 m_ctrl[0].m_vertex = p[4];
1090 m_ctrl[1].m_vertex = p[3];
1091 m_ctrl[2].m_vertex = p[2];
1092 m_ctrl[3].m_vertex = p[1];
1093 m_ctrl[4].m_vertex = p[0];
1094 m_ctrl[5].m_vertex = p[3];
1095 m_ctrl[6].m_vertex = p[3];
1096 m_ctrl[7].m_vertex = p[2];
1097 m_ctrl[8].m_vertex = p[1];
1098 m_ctrl[9].m_vertex = p[1];
1099 m_ctrl[10].m_vertex = p[3];
1100 m_ctrl[11].m_vertex = p[3];
1101 m_ctrl[12].m_vertex = p[2];
1102 m_ctrl[13].m_vertex = p[1];
1103 m_ctrl[14].m_vertex = p[1];
1108 std::size_t mid = (width - 1) >> 1;
1110 bool degenerate = (mid % 2) != 0;
1112 std::size_t newHeight = mid + (degenerate ? 2 : 1);
1114 setDims(3, newHeight);
1119 for(std::size_t i = width; i != width + 2; ++i)
1121 p[i] = p[width - 1];
1126 PatchControl* pCtrl = m_ctrl.data();
1127 for(std::size_t i = 0; i != m_height; ++i, pCtrl += m_width)
1129 pCtrl->m_vertex = p[i];
1133 PatchControl* pCtrl = m_ctrl.data() + 2;
1134 std::size_t h = m_height - 1;
1135 for(std::size_t i = 0; i != m_height; ++i, pCtrl += m_width)
1137 pCtrl->m_vertex = p[h + (h - i)];
1145 ERROR_MESSAGE("invalid patch-cap type");
1149 controlPointsChanged();
1152 void Patch::ProjectTexture(int nAxis)
1173 ERROR_MESSAGE("invalid axis");
1177 float fWidth = 1 / (m_state->getTexture().width * Texdef_getDefaultTextureScale());
1178 float fHeight = 1 / (m_state->getTexture().height * -Texdef_getDefaultTextureScale());
1180 for(PatchControlIter i = m_ctrl.data(); i != m_ctrl.data() + m_ctrl.size(); ++i)
1182 (*i).m_texcoord[0] = (*i).m_vertex[s] * fWidth;
1183 (*i).m_texcoord[1] = (*i).m_vertex[t] * fHeight;
1186 controlPointsChanged();
1189 void Patch::constructPlane(const AABB& aabb, int axis, std::size_t width, std::size_t height)
1191 setDims(width, height);
1196 case 2: x=0; y=1; z=2; break;
1197 case 1: x=0; y=2; z=1; break;
1198 case 0: x=1; y=2; z=0; break;
1200 ERROR_MESSAGE("invalid view-type");
1204 if(m_width < MIN_PATCH_WIDTH || m_width > MAX_PATCH_WIDTH) m_width = 3;
1205 if(m_height < MIN_PATCH_HEIGHT || m_height > MAX_PATCH_HEIGHT) m_height = 3;
1208 vStart[x] = aabb.origin[x] - aabb.extents[x];
1209 vStart[y] = aabb.origin[y] - aabb.extents[y];
1210 vStart[z] = aabb.origin[z];
1212 float xAdj = fabsf((vStart[x] - (aabb.origin[x] + aabb.extents[x])) / (float)(m_width - 1));
1213 float yAdj = fabsf((vStart[y] - (aabb.origin[y] + aabb.extents[y])) / (float)(m_height - 1));
1216 vTmp[z] = vStart[z];
1217 PatchControl* pCtrl = m_ctrl.data();
1220 for (std::size_t h=0; h<m_height; h++)
1223 for (std::size_t w=0; w<m_width; w++, ++pCtrl)
1225 pCtrl->m_vertex = vTmp;
1234 void Patch::ConstructPrefab(const AABB& aabb, EPatchPrefab eType, int axis, std::size_t width, std::size_t height)
1240 vPos[0] = vector3_subtracted(aabb.origin, aabb.extents);
1241 vPos[1] = aabb.origin;
1242 vPos[2] = vector3_added(aabb.origin, aabb.extents);
1247 constructPlane(aabb, axis, width, height);
1249 else if(eType == eSqCylinder
1250 || eType == eCylinder
1251 || eType == eDenseCylinder
1252 || eType == eVeryDenseCylinder
1254 || eType == eSphere)
1256 unsigned char *pIndex;
1257 unsigned char pCylIndex[] =
1271 PatchControl *pStart;
1274 case eSqCylinder: setDims(9, 3);
1275 pStart = m_ctrl.data();
1277 case eDenseCylinder:
1278 case eVeryDenseCylinder:
1281 pStart = m_ctrl.data() + 1;
1283 case eCone: setDims(9, 3);
1284 pStart = m_ctrl.data() + 1;
1288 pStart = m_ctrl.data() + (9+1);
1291 ERROR_MESSAGE("this should be unreachable");
1295 for(std::size_t h=0; h<3; h++, pStart+=9)
1298 PatchControl* pCtrl = pStart;
1299 for(std::size_t w=0; w<8; w++, pCtrl++)
1301 pCtrl->m_vertex[0] = vPos[pIndex[0]][0];
1302 pCtrl->m_vertex[1] = vPos[pIndex[1]][1];
1303 pCtrl->m_vertex[2] = vPos[h][2];
1312 PatchControl* pCtrl=m_ctrl.data();
1313 for(std::size_t h=0; h<3; h++, pCtrl+=9)
1315 pCtrl[8].m_vertex = pCtrl[0].m_vertex;
1319 case eDenseCylinder:
1320 case eVeryDenseCylinder:
1323 PatchControl* pCtrl=m_ctrl.data();
1324 for (std::size_t h=0; h<3; h++, pCtrl+=9)
1326 pCtrl[0].m_vertex = pCtrl[8].m_vertex;
1332 PatchControl* pCtrl=m_ctrl.data();
1333 for (std::size_t h=0; h<2; h++, pCtrl+=9)
1335 pCtrl[0].m_vertex = pCtrl[8].m_vertex;
1339 PatchControl* pCtrl=m_ctrl.data()+9*2;
1340 for (std::size_t w=0; w<9; w++, pCtrl++)
1342 pCtrl->m_vertex[0] = vPos[1][0];
1343 pCtrl->m_vertex[1] = vPos[1][1];
1344 pCtrl->m_vertex[2] = vPos[2][2];
1350 PatchControl* pCtrl=m_ctrl.data()+9;
1351 for (std::size_t h=0; h<3; h++, pCtrl+=9)
1353 pCtrl[0].m_vertex = pCtrl[8].m_vertex;
1357 PatchControl* pCtrl = m_ctrl.data();
1358 for (std::size_t w=0; w<9; w++, pCtrl++)
1360 pCtrl->m_vertex[0] = vPos[1][0];
1361 pCtrl->m_vertex[1] = vPos[1][1];
1362 pCtrl->m_vertex[2] = vPos[0][2];
1366 PatchControl* pCtrl = m_ctrl.data()+(9*4);
1367 for (std::size_t w=0; w<9; w++, pCtrl++)
1369 pCtrl->m_vertex[0] = vPos[1][0];
1370 pCtrl->m_vertex[1] = vPos[1][1];
1371 pCtrl->m_vertex[2] = vPos[2][2];
1376 ERROR_MESSAGE("this should be unreachable");
1380 else if (eType == eBevel)
1382 unsigned char *pIndex;
1383 unsigned char pBevIndex[] =
1392 PatchControl* pCtrl = m_ctrl.data();
1393 for(std::size_t h=0; h<3; h++)
1396 for(std::size_t w=0; w<3; w++, pIndex+=2, pCtrl++)
1398 pCtrl->m_vertex[0] = vPos[pIndex[0]][0];
1399 pCtrl->m_vertex[1] = vPos[pIndex[1]][1];
1400 pCtrl->m_vertex[2] = vPos[h][2];
1404 else if(eType == eEndCap)
1406 unsigned char *pIndex;
1407 unsigned char pEndIndex[] =
1418 PatchControl* pCtrl = m_ctrl.data();
1419 for(std::size_t h=0; h<3; h++)
1422 for(std::size_t w=0; w<5; w++, pIndex+=2, pCtrl++)
1424 pCtrl->m_vertex[0] = vPos[pIndex[0]][0];
1425 pCtrl->m_vertex[1] = vPos[pIndex[1]][1];
1426 pCtrl->m_vertex[2] = vPos[h][2];
1431 if(eType == eDenseCylinder)
1433 InsertRemove(true, false, true);
1436 if(eType == eVeryDenseCylinder)
1438 InsertRemove(true, false, false);
1439 InsertRemove(true, false, true);
1445 void Patch::RenderDebug(RenderStateFlags state) const
1447 for (std::size_t i = 0; i<m_tess.m_numStrips; i++)
1449 glBegin(GL_QUAD_STRIP);
1450 for (std::size_t j = 0; j<m_tess.m_lenStrips; j++)
1452 glNormal3fv(normal3f_to_array((m_tess.m_vertices.data() + m_tess.m_indices[i*m_tess.m_lenStrips+j])->normal));
1453 glTexCoord2fv(texcoord2f_to_array((m_tess.m_vertices.data() + m_tess.m_indices[i*m_tess.m_lenStrips+j])->texcoord));
1454 glVertex3fv(vertex3f_to_array((m_tess.m_vertices.data() + m_tess.m_indices[i*m_tess.m_lenStrips+j])->vertex));
1460 void RenderablePatchSolid::RenderNormals() const
1462 const std::size_t width = m_tess.m_numStrips+1;
1463 const std::size_t height = m_tess.m_lenStrips>>1;
1465 for(std::size_t i=0;i<width;i++)
1467 for(std::size_t j=0;j<height;j++)
1472 vertex3f_to_vector3((m_tess.m_vertices.data() + (j*width+i))->vertex),
1473 vector3_scaled(normal3f_to_vector3((m_tess.m_vertices.data() + (j*width+i))->normal), 8)
1476 glVertex3fv(vertex3f_to_array((m_tess.m_vertices.data() + (j*width+i))->vertex));
1477 glVertex3fv(&vNormal[0]);
1482 vertex3f_to_vector3((m_tess.m_vertices.data() + (j*width+i))->vertex),
1483 vector3_scaled(normal3f_to_vector3((m_tess.m_vertices.data() + (j*width+i))->tangent), 8)
1486 glVertex3fv(vertex3f_to_array((m_tess.m_vertices.data() + (j*width+i))->vertex));
1487 glVertex3fv(&vNormal[0]);
1492 vertex3f_to_vector3((m_tess.m_vertices.data() + (j*width+i))->vertex),
1493 vector3_scaled(normal3f_to_vector3((m_tess.m_vertices.data() + (j*width+i))->bitangent), 8)
1496 glVertex3fv(vertex3f_to_array((m_tess.m_vertices.data() + (j*width+i))->vertex));
1497 glVertex3fv(&vNormal[0]);
1504 #define DEGEN_0a 0x01
1505 #define DEGEN_1a 0x02
1506 #define DEGEN_2a 0x04
1507 #define DEGEN_0b 0x08
1508 #define DEGEN_1b 0x10
1509 #define DEGEN_2b 0x20
1511 #define AVERAGE 0x80
1514 unsigned int subarray_get_degen(PatchControlIter subarray, std::size_t strideU, std::size_t strideV)
1516 unsigned int nDegen = 0;
1517 const PatchControl* p1;
1518 const PatchControl* p2;
1522 if(vector3_equal(p1->m_vertex, p2->m_vertex))
1526 if(vector3_equal(p1->m_vertex, p2->m_vertex))
1529 p1 = subarray + strideV;
1531 if(vector3_equal(p1->m_vertex, p2->m_vertex))
1535 if(vector3_equal(p1->m_vertex, p2->m_vertex))
1538 p1 = subarray + (strideV << 1);
1540 if(vector3_equal(p1->m_vertex, p2->m_vertex))
1544 if(vector3_equal(p1->m_vertex, p2->m_vertex))
1551 inline void deCasteljau3(const Vector3& P0, const Vector3& P1, const Vector3& P2, Vector3& P01, Vector3& P12, Vector3& P012)
1553 P01 = vector3_mid(P0, P1);
1554 P12 = vector3_mid(P1, P2);
1555 P012 = vector3_mid(P01, P12);
1558 inline void BezierInterpolate3( const Vector3& start, Vector3& left, Vector3& mid, Vector3& right, const Vector3& end )
1560 left = vector3_mid(start, mid);
1561 right = vector3_mid(mid, end);
1562 mid = vector3_mid(left, right);
1565 inline void BezierInterpolate2( const Vector2& start, Vector2& left, Vector2& mid, Vector2& right, const Vector2& end )
1567 left[0]= float_mid(start[0], mid[0]);
1568 left[1] = float_mid(start[1], mid[1]);
1569 right[0] = float_mid(mid[0], end[0]);
1570 right[1] = float_mid(mid[1], end[1]);
1571 mid[0] = float_mid(left[0], right[0]);
1572 mid[1] = float_mid(left[1], right[1]);
1576 inline Vector2& texcoord_for_index(Array<ArbitraryMeshVertex>& vertices, std::size_t index)
1578 return reinterpret_cast<Vector2&>(vertices[index].texcoord);
1581 inline Vector3& vertex_for_index(Array<ArbitraryMeshVertex>& vertices, std::size_t index)
1583 return reinterpret_cast<Vector3&>(vertices[index].vertex);
1586 inline Vector3& normal_for_index(Array<ArbitraryMeshVertex>& vertices, std::size_t index)
1588 return reinterpret_cast<Vector3&>(vertices[index].normal);
1591 inline Vector3& tangent_for_index(Array<ArbitraryMeshVertex>& vertices, std::size_t index)
1593 return reinterpret_cast<Vector3&>(vertices[index].tangent);
1596 inline Vector3& bitangent_for_index(Array<ArbitraryMeshVertex>& vertices, std::size_t index)
1598 return reinterpret_cast<Vector3&>(vertices[index].bitangent);
1601 inline const Vector2& texcoord_for_index(const Array<ArbitraryMeshVertex>& vertices, std::size_t index)
1603 return reinterpret_cast<const Vector2&>(vertices[index].texcoord);
1606 inline const Vector3& vertex_for_index(const Array<ArbitraryMeshVertex>& vertices, std::size_t index)
1608 return reinterpret_cast<const Vector3&>(vertices[index].vertex);
1611 inline const Vector3& normal_for_index(const Array<ArbitraryMeshVertex>& vertices, std::size_t index)
1613 return reinterpret_cast<const Vector3&>(vertices[index].normal);
1616 inline const Vector3& tangent_for_index(const Array<ArbitraryMeshVertex>& vertices, std::size_t index)
1618 return reinterpret_cast<const Vector3&>(vertices[index].tangent);
1621 inline const Vector3& bitangent_for_index(const Array<ArbitraryMeshVertex>& vertices, std::size_t index)
1623 return reinterpret_cast<const Vector3&>(vertices[index].bitangent);
1626 #include "math/curve.h"
1628 inline PatchControl QuadraticBezier_evaluate(const PatchControl* firstPoint, double t)
1630 PatchControl result = { Vector3(0, 0, 0), Vector2(0, 0) };
1631 double denominator = 0;
1634 double weight = BernsteinPolynomial<Zero, Two>::apply(t);
1635 vector3_add(result.m_vertex, vector3_scaled(firstPoint[0].m_vertex, weight));
1636 vector2_add(result.m_texcoord, vector2_scaled(firstPoint[0].m_texcoord, weight));
1637 denominator += weight;
1640 double weight = BernsteinPolynomial<One, Two>::apply(t);
1641 vector3_add(result.m_vertex, vector3_scaled(firstPoint[1].m_vertex, weight));
1642 vector2_add(result.m_texcoord, vector2_scaled(firstPoint[1].m_texcoord, weight));
1643 denominator += weight;
1646 double weight = BernsteinPolynomial<Two, Two>::apply(t);
1647 vector3_add(result.m_vertex, vector3_scaled(firstPoint[2].m_vertex, weight));
1648 vector2_add(result.m_texcoord, vector2_scaled(firstPoint[2].m_texcoord, weight));
1649 denominator += weight;
1652 vector3_divide(result.m_vertex, denominator);
1653 vector2_divide(result.m_texcoord, denominator);
1657 inline Vector3 vector3_linear_interpolated(const Vector3& a, const Vector3& b, double t)
1659 return vector3_added(vector3_scaled(a, 1.0 - t), vector3_scaled(b, t));
1662 inline Vector2 vector2_linear_interpolated(const Vector2& a, const Vector2& b, double t)
1664 return vector2_added(vector2_scaled(a, 1.0 - t), vector2_scaled(b, t));
1667 void normalise_safe(Vector3& normal)
1669 if(!vector3_equal(normal, g_vector3_identity))
1671 vector3_normalise(normal);
1675 inline void QuadraticBezier_evaluate(const PatchControl& a, const PatchControl& b, const PatchControl& c, double t, PatchControl& point, PatchControl& left, PatchControl& right)
1677 left.m_vertex = vector3_linear_interpolated(a.m_vertex, b.m_vertex, t);
1678 left.m_texcoord = vector2_linear_interpolated(a.m_texcoord, b.m_texcoord, t);
1679 right.m_vertex = vector3_linear_interpolated(b.m_vertex, c.m_vertex, t);
1680 right.m_texcoord = vector2_linear_interpolated(b.m_texcoord, c.m_texcoord, t);
1681 point.m_vertex = vector3_linear_interpolated(left.m_vertex, right.m_vertex, t);
1682 point.m_texcoord = vector2_linear_interpolated(left.m_texcoord, right.m_texcoord, t);
1685 void Patch::TesselateSubMatrixFixed(ArbitraryMeshVertex* vertices, std::size_t strideX, std::size_t strideY, unsigned int nFlagsX, unsigned int nFlagsY, PatchControl* subMatrix[3][3])
1687 double incrementU = 1.0 / m_subdivisions_x;
1688 double incrementV = 1.0 / m_subdivisions_y;
1689 const std::size_t width = m_subdivisions_x + 1;
1690 const std::size_t height = m_subdivisions_y + 1;
1692 for(std::size_t i = 0; i != width; ++i)
1694 double tU = (i + 1 == width) ? 1 : i * incrementU;
1695 PatchControl pointX[3];
1696 PatchControl leftX[3];
1697 PatchControl rightX[3];
1698 QuadraticBezier_evaluate(*subMatrix[0][0], *subMatrix[0][1], *subMatrix[0][2], tU, pointX[0], leftX[0], rightX[0]);
1699 QuadraticBezier_evaluate(*subMatrix[1][0], *subMatrix[1][1], *subMatrix[1][2], tU, pointX[1], leftX[1], rightX[1]);
1700 QuadraticBezier_evaluate(*subMatrix[2][0], *subMatrix[2][1], *subMatrix[2][2], tU, pointX[2], leftX[2], rightX[2]);
1702 ArbitraryMeshVertex* p = vertices + i * strideX;
1703 for(std::size_t j = 0; j != height; ++j)
1705 if((j == 0 || j + 1 == height) && (i == 0 || i + 1 == width))
1710 double tV = (j + 1 == height) ? 1 : j * incrementV;
1712 PatchControl pointY[3];
1713 PatchControl leftY[3];
1714 PatchControl rightY[3];
1715 QuadraticBezier_evaluate(*subMatrix[0][0], *subMatrix[1][0], *subMatrix[2][0], tV, pointY[0], leftY[0], rightY[0]);
1716 QuadraticBezier_evaluate(*subMatrix[0][1], *subMatrix[1][1], *subMatrix[2][1], tV, pointY[1], leftY[1], rightY[1]);
1717 QuadraticBezier_evaluate(*subMatrix[0][2], *subMatrix[1][2], *subMatrix[2][2], tV, pointY[2], leftY[2], rightY[2]);
1722 QuadraticBezier_evaluate(pointX[0], pointX[1], pointX[2], tV, point, left, right);
1725 QuadraticBezier_evaluate(pointY[0], pointY[1], pointY[2], tU, point, up, down);
1727 vertex3f_to_vector3(p->vertex) = point.m_vertex;
1728 texcoord2f_to_vector2(p->texcoord) = point.m_texcoord;
1730 ArbitraryMeshVertex a, b, c;
1732 a.vertex = vertex3f_for_vector3(left.m_vertex);
1733 a.texcoord = texcoord2f_for_vector2(left.m_texcoord);
1734 b.vertex = vertex3f_for_vector3(right.m_vertex);
1735 b.texcoord = texcoord2f_for_vector2(right.m_texcoord);
1739 c.vertex = vertex3f_for_vector3(up.m_vertex);
1740 c.texcoord = texcoord2f_for_vector2(up.m_texcoord);
1744 c.vertex = vertex3f_for_vector3(down.m_vertex);
1745 c.texcoord = texcoord2f_for_vector2(down.m_texcoord);
1748 Vector3 normal = vector3_normalised(vector3_cross(right.m_vertex - left.m_vertex, up.m_vertex - down.m_vertex));
1750 Vector3 tangent, bitangent;
1751 ArbitraryMeshTriangle_calcTangents(a, b, c, tangent, bitangent);
1752 vector3_normalise(tangent);
1753 vector3_normalise(bitangent);
1755 if(((nFlagsX & AVERAGE) != 0 && i == 0) || ((nFlagsY & AVERAGE) != 0 && j == 0))
1757 normal3f_to_vector3(p->normal) = vector3_normalised(vector3_added(normal3f_to_vector3(p->normal), normal));
1758 normal3f_to_vector3(p->tangent) = vector3_normalised(vector3_added(normal3f_to_vector3(p->tangent), tangent));
1759 normal3f_to_vector3(p->bitangent) = vector3_normalised(vector3_added(normal3f_to_vector3(p->bitangent), bitangent));
1763 normal3f_to_vector3(p->normal) = normal;
1764 normal3f_to_vector3(p->tangent) = tangent;
1765 normal3f_to_vector3(p->bitangent) = bitangent;
1774 void Patch::TesselateSubMatrix( const BezierCurveTree *BX, const BezierCurveTree *BY,
1775 std::size_t offStartX, std::size_t offStartY,
1776 std::size_t offEndX, std::size_t offEndY,
1777 std::size_t nFlagsX, std::size_t nFlagsY,
1778 Vector3& left, Vector3& mid, Vector3& right,
1779 Vector2& texLeft, Vector2& texMid, Vector2& texRight,
1782 int newFlagsX, newFlagsY;
1785 Vector3 vertex_0_0, vertex_0_1, vertex_1_0, vertex_1_1, vertex_2_0, vertex_2_1;
1787 Vector2 texcoord_0_0, texcoord_0_1, texcoord_1_0, texcoord_1_1, texcoord_2_0, texcoord_2_1;
1792 BezierInterpolate2( texcoord_for_index(m_tess.m_vertices, offStartX + offStartY),
1794 texcoord_for_index(m_tess.m_vertices, BX->index + offStartY),
1796 texcoord_for_index(m_tess.m_vertices, offEndX + offStartY) );
1799 BezierInterpolate2( texcoord_for_index(m_tess.m_vertices, offStartX + offEndY),
1801 texcoord_for_index(m_tess.m_vertices, BX->index + offEndY),
1803 texcoord_for_index(m_tess.m_vertices, offEndX + offEndY) );
1807 BezierInterpolate2(texLeft,
1813 if(!BezierCurveTree_isLeaf(BY))
1815 texcoord_for_index(m_tess.m_vertices, BX->index + BY->index) = texTmp;
1819 if(!BezierCurveTree_isLeaf(BX->left))
1821 texcoord_for_index(m_tess.m_vertices, BX->left->index + offStartY) = texcoord_0_0;
1822 texcoord_for_index(m_tess.m_vertices, BX->left->index + offEndY) = texcoord_2_0;
1824 if(!BezierCurveTree_isLeaf(BY))
1826 texcoord_for_index(m_tess.m_vertices, BX->left->index + BY->index) = texcoord_1_0;
1829 if(!BezierCurveTree_isLeaf(BX->right))
1831 texcoord_for_index(m_tess.m_vertices, BX->right->index + offStartY) = texcoord_0_1;
1832 texcoord_for_index(m_tess.m_vertices, BX->right->index + offEndY) = texcoord_2_1;
1834 if(!BezierCurveTree_isLeaf(BY))
1836 texcoord_for_index(m_tess.m_vertices, BX->right->index + BY->index) = texcoord_1_1;
1843 BezierInterpolate3( vertex_for_index(m_tess.m_vertices, offStartX + offStartY),
1845 vertex_for_index(m_tess.m_vertices, BX->index + offStartY),
1847 vertex_for_index(m_tess.m_vertices, offEndX + offStartY) );
1850 BezierInterpolate3( vertex_for_index(m_tess.m_vertices, offStartX + offEndY),
1852 vertex_for_index(m_tess.m_vertices, BX->index + offEndY),
1854 vertex_for_index(m_tess.m_vertices, offEndX + offEndY) );
1859 BezierInterpolate3( left,
1865 if(!BezierCurveTree_isLeaf(BY))
1867 vertex_for_index(m_tess.m_vertices, BX->index + BY->index) = tmp;
1871 if(!BezierCurveTree_isLeaf(BX->left))
1873 vertex_for_index(m_tess.m_vertices, BX->left->index + offStartY) = vertex_0_0;
1874 vertex_for_index(m_tess.m_vertices, BX->left->index + offEndY) = vertex_2_0;
1876 if(!BezierCurveTree_isLeaf(BY))
1878 vertex_for_index(m_tess.m_vertices, BX->left->index + BY->index) = vertex_1_0;
1881 if(!BezierCurveTree_isLeaf(BX->right))
1883 vertex_for_index(m_tess.m_vertices, BX->right->index + offStartY) = vertex_0_1;
1884 vertex_for_index(m_tess.m_vertices, BX->right->index + offEndY) = vertex_2_1;
1886 if(!BezierCurveTree_isLeaf(BY))
1888 vertex_for_index(m_tess.m_vertices, BX->right->index + BY->index) = vertex_1_1;
1896 ArbitraryMeshVertex a, b, c;
1899 if(!(nFlagsX & DEGEN_0a) || !(nFlagsX & DEGEN_0b))
1901 tangentU = vector3_subtracted(vertex_0_1, vertex_0_0);
1902 a.vertex = vertex3f_for_vector3(vertex_0_0);
1903 a.texcoord = texcoord2f_for_vector2(texcoord_0_0);
1904 c.vertex = vertex3f_for_vector3(vertex_0_1);
1905 c.texcoord = texcoord2f_for_vector2(texcoord_0_1);
1907 else if(!(nFlagsX & DEGEN_1a) || !(nFlagsX & DEGEN_1b))
1909 tangentU = vector3_subtracted(vertex_1_1, vertex_1_0);
1910 a.vertex = vertex3f_for_vector3(vertex_1_0);
1911 a.texcoord = texcoord2f_for_vector2(texcoord_1_0);
1912 c.vertex = vertex3f_for_vector3(vertex_1_1);
1913 c.texcoord = texcoord2f_for_vector2(texcoord_1_1);
1917 tangentU = vector3_subtracted(vertex_2_1, vertex_2_0);
1918 a.vertex = vertex3f_for_vector3(vertex_2_0);
1919 a.texcoord = texcoord2f_for_vector2(texcoord_2_0);
1920 c.vertex = vertex3f_for_vector3(vertex_2_1);
1921 c.texcoord = texcoord2f_for_vector2(texcoord_2_1);
1926 if((nFlagsY & DEGEN_0a) && (nFlagsY & DEGEN_1a) && (nFlagsY & DEGEN_2a))
1928 tangentV = vector3_subtracted(vertex_for_index(m_tess.m_vertices, BX->index + offEndY), tmp);
1929 b.vertex = vertex3f_for_vector3(tmp);//m_tess.m_vertices[BX->index + offEndY].vertex;
1930 b.texcoord = texcoord2f_for_vector2(texTmp);//m_tess.m_vertices[BX->index + offEndY].texcoord;
1934 tangentV = vector3_subtracted(tmp, vertex_for_index(m_tess.m_vertices, BX->index + offStartY));
1935 b.vertex = vertex3f_for_vector3(tmp);//m_tess.m_vertices[BX->index + offStartY].vertex;
1936 b.texcoord = texcoord2f_for_vector2(texTmp); //m_tess.m_vertices[BX->index + offStartY].texcoord;
1940 Vector3 normal, s, t;
1941 ArbitraryMeshVertex& v = m_tess.m_vertices[offStartY + BX->index];
1942 Vector3& p = normal3f_to_vector3(v.normal);
1943 Vector3& ps = normal3f_to_vector3(v.tangent);
1944 Vector3& pt = normal3f_to_vector3(v.bitangent);
1948 normal = vector3_cross(tangentV, tangentU);
1952 normal = vector3_cross(tangentU, tangentV);
1954 normalise_safe(normal);
1956 ArbitraryMeshTriangle_calcTangents(a, b, c, s, t);
1960 if(nFlagsX & AVERAGE)
1962 p = vector3_normalised(vector3_added(p, normal));
1963 ps = vector3_normalised(vector3_added(ps, s));
1964 pt = vector3_normalised(vector3_added(pt, t));
1975 ArbitraryMeshVertex a, b, c;
1978 if(!(nFlagsX & DEGEN_2a) || !(nFlagsX & DEGEN_2b))
1980 tangentU = vector3_subtracted(vertex_2_1, vertex_2_0);
1981 a.vertex = vertex3f_for_vector3(vertex_2_0);
1982 a.texcoord = texcoord2f_for_vector2(texcoord_2_0);
1983 c.vertex = vertex3f_for_vector3(vertex_2_1);
1984 c.texcoord = texcoord2f_for_vector2(texcoord_2_1);
1986 else if(!(nFlagsX & DEGEN_1a) || !(nFlagsX & DEGEN_1b))
1988 tangentU = vector3_subtracted(vertex_1_1, vertex_1_0);
1989 a.vertex = vertex3f_for_vector3(vertex_1_0);
1990 a.texcoord = texcoord2f_for_vector2(texcoord_1_0);
1991 c.vertex = vertex3f_for_vector3(vertex_1_1);
1992 c.texcoord = texcoord2f_for_vector2(texcoord_1_1);
1996 tangentU = vector3_subtracted(vertex_0_1, vertex_0_0);
1997 a.vertex = vertex3f_for_vector3(vertex_0_0);
1998 a.texcoord = texcoord2f_for_vector2(texcoord_0_0);
1999 c.vertex = vertex3f_for_vector3(vertex_0_1);
2000 c.texcoord = texcoord2f_for_vector2(texcoord_0_1);
2005 if((nFlagsY & DEGEN_0b) && (nFlagsY & DEGEN_1b) && (nFlagsY & DEGEN_2b))
2007 tangentV = vector3_subtracted(tmp, vertex_for_index(m_tess.m_vertices, BX->index + offStartY));
2008 b.vertex = vertex3f_for_vector3(tmp);//m_tess.m_vertices[BX->index + offStartY].vertex;
2009 b.texcoord = texcoord2f_for_vector2(texTmp);//m_tess.m_vertices[BX->index + offStartY].texcoord;
2013 tangentV = vector3_subtracted(vertex_for_index(m_tess.m_vertices, BX->index + offEndY), tmp);
2014 b.vertex = vertex3f_for_vector3(tmp);//m_tess.m_vertices[BX->index + offEndY].vertex;
2015 b.texcoord = texcoord2f_for_vector2(texTmp);//m_tess.m_vertices[BX->index + offEndY].texcoord;
2018 ArbitraryMeshVertex& v = m_tess.m_vertices[offEndY+BX->index];
2019 Vector3& p = normal3f_to_vector3(v.normal);
2020 Vector3& ps = normal3f_to_vector3(v.tangent);
2021 Vector3& pt = normal3f_to_vector3(v.bitangent);
2025 p = vector3_cross(tangentV, tangentU);
2029 p = vector3_cross(tangentU, tangentV);
2033 ArbitraryMeshTriangle_calcTangents(a, b, c, ps, pt);
2040 newFlagsX = newFlagsY = 0;
2042 if((nFlagsX & DEGEN_0a) && (nFlagsX & DEGEN_0b))
2044 newFlagsX |= DEGEN_0a;
2045 newFlagsX |= DEGEN_0b;
2047 if((nFlagsX & DEGEN_1a) && (nFlagsX & DEGEN_1b))
2049 newFlagsX |= DEGEN_1a;
2050 newFlagsX |= DEGEN_1b;
2052 if((nFlagsX & DEGEN_2a) && (nFlagsX & DEGEN_2b))
2054 newFlagsX |= DEGEN_2a;
2055 newFlagsX |= DEGEN_2b;
2057 if((nFlagsY & DEGEN_0a) && (nFlagsY & DEGEN_1a) && (nFlagsY & DEGEN_2a))
2059 newFlagsY |= DEGEN_0a;
2060 newFlagsY |= DEGEN_1a;
2061 newFlagsY |= DEGEN_2a;
2063 if((nFlagsY & DEGEN_0b) && (nFlagsY & DEGEN_1b) && (nFlagsY & DEGEN_2b))
2065 newFlagsY |= DEGEN_0b;
2066 newFlagsY |= DEGEN_1b;
2067 newFlagsY |= DEGEN_2b;
2071 //if((nFlagsX & DEGEN_0a) && (nFlagsX & DEGEN_1a) && (nFlagsX & DEGEN_2a)) { newFlagsX |= DEGEN_0a; newFlagsX |= DEGEN_1a; newFlagsX |= DEGEN_2a; }
2072 //if((nFlagsX & DEGEN_0b) && (nFlagsX & DEGEN_1b) && (nFlagsX & DEGEN_2b)) { newFlagsX |= DEGEN_0b; newFlagsX |= DEGEN_1b; newFlagsX |= DEGEN_2b; }
2074 newFlagsX |= (nFlagsX & SPLIT);
2075 newFlagsX |= (nFlagsX & AVERAGE);
2077 if(!BezierCurveTree_isLeaf(BY))
2080 int nTemp = newFlagsY;
2082 if((nFlagsY & DEGEN_0a) && (nFlagsY & DEGEN_0b))
2084 newFlagsY |= DEGEN_0a;
2085 newFlagsY |= DEGEN_0b;
2087 newFlagsY |= (nFlagsY & SPLIT);
2088 newFlagsY |= (nFlagsY & AVERAGE);
2090 Vector3& p = vertex_for_index(m_tess.m_vertices, BX->index+BY->index);
2093 Vector2& p2 = texcoord_for_index(m_tess.m_vertices, BX->index+BY->index);
2096 TesselateSubMatrix( BY, BX->left,
2097 offStartY, offStartX,
2099 newFlagsY, newFlagsX,
2100 vertex_0_0, vertex_1_0, vertex_2_0,
2101 texcoord_0_0, texcoord_1_0, texcoord_2_0,
2109 if((nFlagsY & DEGEN_2a) && (nFlagsY & DEGEN_2b)) { newFlagsY |= DEGEN_2a; newFlagsY |= DEGEN_2b; }
2111 TesselateSubMatrix( BY, BX->right,
2112 offStartY, BX->index,
2114 newFlagsY, newFlagsX,
2115 vertex_0_1, vertex_1_1, vertex_2_1,
2116 texcoord_0_1, texcoord_1_1, texcoord_2_1,
2121 if(!BezierCurveTree_isLeaf(BX->left))
2123 TesselateSubMatrix( BX->left, BY,
2124 offStartX, offStartY,
2126 newFlagsX, newFlagsY,
2127 left, vertex_1_0, tmp,
2128 texLeft, texcoord_1_0, texTmp,
2132 if(!BezierCurveTree_isLeaf(BX->right))
2134 TesselateSubMatrix( BX->right, BY,
2135 BX->index, offStartY,
2137 newFlagsX, newFlagsY,
2138 tmp, vertex_1_1, right,
2139 texTmp, texcoord_1_1, texRight,
2146 void Patch::BuildTesselationCurves(EMatrixMajor major)
2148 std::size_t nArrayStride, length, cross, strideU, strideV;
2153 length = (m_width - 1) >> 1;
2160 BezierCurveTreeArray_deleteAll(m_tess.m_curveTreeU);
2165 nArrayStride = m_tess.m_nArrayWidth;
2166 length = (m_height - 1) >> 1;
2173 BezierCurveTreeArray_deleteAll(m_tess.m_curveTreeV);
2178 ERROR_MESSAGE("neither row-major nor column-major");
2182 Array<std::size_t> arrayLength(length);
2183 Array<BezierCurveTree*> pCurveTree(length);
2185 std::size_t nArrayLength = 1;
2189 for(Array<std::size_t>::iterator i = arrayLength.begin(); i != arrayLength.end(); ++i)
2191 *i = Array<std::size_t>::value_type((major == ROW) ? m_subdivisions_x : m_subdivisions_y);
2197 // create a list of the horizontal control curves in each column of sub-patches
2198 // adaptively tesselate each horizontal control curve in the list
2199 // create a binary tree representing the combined tesselation of the list
2200 for(std::size_t i = 0; i != length; ++i)
2202 PatchControl* p1 = m_ctrlTransformed.data() + (i * 2 * strideU);
2203 GSList* pCurveList = 0;
2204 for(std::size_t j = 0; j < cross; j += 2)
2206 PatchControl* p2 = p1+strideV;
2207 PatchControl* p3 = p2+strideV;
2209 // directly taken from one row of control points
2211 BezierCurve* pCurve = new BezierCurve;
2212 pCurve->crd = (p1+strideU)->m_vertex;
2213 pCurve->left = p1->m_vertex;
2214 pCurve->right = (p1+(strideU<<1))->m_vertex;
2215 pCurveList = g_slist_prepend(pCurveList, pCurve);
2223 // interpolated from three columns of control points
2225 BezierCurve* pCurve = new BezierCurve;
2226 pCurve->crd = vector3_mid((p1+strideU)->m_vertex, (p3+strideU)->m_vertex);
2227 pCurve->left = vector3_mid(p1->m_vertex, p3->m_vertex);
2228 pCurve->right = vector3_mid((p1+(strideU<<1))->m_vertex, (p3+(strideU<<1))->m_vertex);
2230 pCurve->crd = vector3_mid(pCurve->crd, (p2+strideU)->m_vertex);
2231 pCurve->left = vector3_mid(pCurve->left, p2->m_vertex);
2232 pCurve->right = vector3_mid(pCurve->right, (p2+(strideU<<1))->m_vertex);
2233 pCurveList = g_slist_prepend(pCurveList, pCurve);
2239 pCurveTree[i] = new BezierCurveTree;
2240 BezierCurveTree_FromCurveList(pCurveTree[i], pCurveList);
2241 for(GSList* l = pCurveList; l != 0; l = g_slist_next(l))
2243 delete static_cast<BezierCurve*>((*l).data);
2245 g_slist_free(pCurveList);
2247 // set up array indices for binary tree
2248 // accumulate subarray width
2249 arrayLength[i] = Array<std::size_t>::value_type(BezierCurveTree_Setup(pCurveTree[i], nArrayLength, nArrayStride) - (nArrayLength - 1));
2250 // accumulate total array width
2251 nArrayLength += arrayLength[i];
2258 m_tess.m_nArrayWidth = nArrayLength;
2259 std::swap(m_tess.m_arrayWidth, arrayLength);
2263 std::swap(m_tess.m_curveTreeU, pCurveTree);
2267 m_tess.m_nArrayHeight = nArrayLength;
2268 std::swap(m_tess.m_arrayHeight, arrayLength);
2272 std::swap(m_tess.m_curveTreeV, pCurveTree);
2278 inline void vertex_assign_ctrl(ArbitraryMeshVertex& vertex, const PatchControl& ctrl)
2280 vertex.vertex = vertex3f_for_vector3(ctrl.m_vertex);
2281 vertex.texcoord = texcoord2f_for_vector2(ctrl.m_texcoord);
2284 inline void vertex_clear_normal(ArbitraryMeshVertex& vertex)
2286 vertex.normal = Normal3f(0, 0, 0);
2287 vertex.tangent = Normal3f(0, 0, 0);
2288 vertex.bitangent = Normal3f(0, 0, 0);
2291 inline void tangents_remove_degenerate(Vector3 tangents[6], Vector2 textureTangents[6], unsigned int flags)
2293 if(flags & DEGEN_0a)
2295 const std::size_t i =
2297 ? (flags & DEGEN_1a)
2298 ? (flags & DEGEN_1b)
2299 ? (flags & DEGEN_2a)
2305 tangents[0] = tangents[i];
2306 textureTangents[0] = textureTangents[i];
2308 if(flags & DEGEN_0b)
2310 const std::size_t i =
2312 ? (flags & DEGEN_1b)
2313 ? (flags & DEGEN_1a)
2314 ? (flags & DEGEN_2b)
2320 tangents[1] = tangents[i];
2321 textureTangents[1] = textureTangents[i];
2323 if(flags & DEGEN_2a)
2325 const std::size_t i =
2327 ? (flags & DEGEN_1a)
2328 ? (flags & DEGEN_1b)
2329 ? (flags & DEGEN_0a)
2335 tangents[4] = tangents[i];
2336 textureTangents[4] = textureTangents[i];
2338 if(flags & DEGEN_2b)
2340 const std::size_t i =
2342 ? (flags & DEGEN_1b)
2343 ? (flags & DEGEN_1a)
2344 ? (flags & DEGEN_0b)
2350 tangents[5] = tangents[i];
2351 textureTangents[5] = textureTangents[i];
2355 void bestTangents00(unsigned int degenerateFlags, double dot, double length, std::size_t& index0, std::size_t& index1)
2357 if(fabs(dot + length) < 0.001) // opposing direction = degenerate
2359 if(!(degenerateFlags & DEGEN_1a)) // if this tangent is degenerate we cannot use it
2364 else if(!(degenerateFlags & DEGEN_0b))
2375 else if(fabs(dot - length) < 0.001) // same direction = degenerate
2377 if(degenerateFlags & DEGEN_0b)
2390 void bestTangents01(unsigned int degenerateFlags, double dot, double length, std::size_t& index0, std::size_t& index1)
2392 if(fabs(dot - length) < 0.001) // same direction = degenerate
2394 if(!(degenerateFlags & DEGEN_1a)) // if this tangent is degenerate we cannot use it
2399 else if(!(degenerateFlags & DEGEN_2b))
2410 else if(fabs(dot + length) < 0.001) // opposing direction = degenerate
2412 if(degenerateFlags & DEGEN_2b)
2425 void bestTangents10(unsigned int degenerateFlags, double dot, double length, std::size_t& index0, std::size_t& index1)
2427 if(fabs(dot - length) < 0.001) // same direction = degenerate
2429 if(!(degenerateFlags & DEGEN_1b)) // if this tangent is degenerate we cannot use it
2434 else if(!(degenerateFlags & DEGEN_0a))
2445 else if(fabs(dot + length) < 0.001) // opposing direction = degenerate
2447 if(degenerateFlags & DEGEN_0a)
2460 void bestTangents11(unsigned int degenerateFlags, double dot, double length, std::size_t& index0, std::size_t& index1)
2462 if(fabs(dot + length) < 0.001) // opposing direction = degenerate
2464 if(!(degenerateFlags & DEGEN_1b)) // if this tangent is degenerate we cannot use it
2469 else if(!(degenerateFlags & DEGEN_2a))
2480 else if(fabs(dot - length) < 0.001) // same direction = degenerate
2482 if(degenerateFlags & DEGEN_2a)
2495 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)
2498 Vector3 normal(vector3_cross(tangentX[index0], tangentY[index1]));
2499 if(!vector3_equal(normal, g_vector3_identity))
2501 vector3_add(normal_for_index(m_tess.m_vertices, index), vector3_normalised(normal));
2506 ArbitraryMeshVertex a, b, c;
2507 a.vertex = Vertex3f(0, 0, 0);
2508 a.texcoord = TexCoord2f(0, 0);
2509 b.vertex = vertex3f_for_vector3(tangentX[index0]);
2510 b.texcoord = texcoord2f_for_vector2(tangentS[index0]);
2511 c.vertex = vertex3f_for_vector3(tangentY[index1]);
2512 c.texcoord = texcoord2f_for_vector2(tangentT[index1]);
2515 ArbitraryMeshTriangle_calcTangents(a, b, c, s, t);
2516 if(!vector3_equal(s, g_vector3_identity))
2518 vector3_add(tangent_for_index(m_tess.m_vertices, index), vector3_normalised(s));
2520 if(!vector3_equal(t, g_vector3_identity))
2522 vector3_add(bitangent_for_index(m_tess.m_vertices, index), vector3_normalised(t));
2527 const std::size_t PATCH_MAX_VERTEX_ARRAY = 1048576;
2529 void Patch::BuildVertexArray()
2531 const std::size_t strideU = 1;
2532 const std::size_t strideV = m_width;
2534 const std::size_t numElems = m_tess.m_nArrayWidth*m_tess.m_nArrayHeight; // total number of elements in vertex array
2536 const bool bWidthStrips = (m_tess.m_nArrayWidth >= m_tess.m_nArrayHeight); // decide if horizontal strips are longer than vertical
2539 // allocate vertex, normal, texcoord and primitive-index arrays
2540 m_tess.m_vertices.resize(numElems);
2541 m_tess.m_indices.resize(m_tess.m_nArrayWidth *2 * (m_tess.m_nArrayHeight - 1));
2543 // set up strip indices
2546 m_tess.m_numStrips = m_tess.m_nArrayHeight-1;
2547 m_tess.m_lenStrips = m_tess.m_nArrayWidth*2;
2549 for(std::size_t i=0; i<m_tess.m_nArrayWidth; i++)
2551 for(std::size_t j=0; j<m_tess.m_numStrips; j++)
2553 m_tess.m_indices[(j*m_tess.m_lenStrips)+i*2] = RenderIndex(j*m_tess.m_nArrayWidth+i);
2554 m_tess.m_indices[(j*m_tess.m_lenStrips)+i*2+1] = RenderIndex((j+1)*m_tess.m_nArrayWidth+i);
2555 // reverse because radiant uses CULL_FRONT
2556 //m_tess.m_indices[(j*m_tess.m_lenStrips)+i*2+1] = RenderIndex(j*m_tess.m_nArrayWidth+i);
2557 //m_tess.m_indices[(j*m_tess.m_lenStrips)+i*2] = RenderIndex((j+1)*m_tess.m_nArrayWidth+i);
2563 m_tess.m_numStrips = m_tess.m_nArrayWidth-1;
2564 m_tess.m_lenStrips = m_tess.m_nArrayHeight*2;
2566 for(std::size_t i=0; i<m_tess.m_nArrayHeight; i++)
2568 for(std::size_t j=0; j<m_tess.m_numStrips; j++)
2570 m_tess.m_indices[(j*m_tess.m_lenStrips)+i*2] = RenderIndex(((m_tess.m_nArrayHeight-1)-i)*m_tess.m_nArrayWidth+j);
2571 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);
2572 // reverse because radiant uses CULL_FRONT
2573 //m_tess.m_indices[(j*m_tess.m_lenStrips)+i*2+1] = RenderIndex(((m_tess.m_nArrayHeight-1)-i)*m_tess.m_nArrayWidth+j);
2574 //m_tess.m_indices[(j*m_tess.m_lenStrips)+i*2] = RenderIndex(((m_tess.m_nArrayHeight-1)-i)*m_tess.m_nArrayWidth+j+1);
2581 PatchControlIter pCtrl = m_ctrlTransformed.data();
2582 for(std::size_t j = 0, offStartY = 0; j+1 < m_height; j += 2, pCtrl += (strideU + strideV))
2584 // set up array offsets for this sub-patch
2585 const bool leafY = (m_patchDef3) ? false : BezierCurveTree_isLeaf(m_tess.m_curveTreeV[j>>1]);
2586 const std::size_t offMidY = (m_patchDef3) ? 0 : m_tess.m_curveTreeV[j>>1]->index;
2587 const std::size_t widthY = m_tess.m_arrayHeight[j>>1] * m_tess.m_nArrayWidth;
2588 const std::size_t offEndY = offStartY + widthY;
2590 for(std::size_t i = 0, offStartX = 0; i+1 < m_width; i += 2, pCtrl += (strideU << 1))
2592 const bool leafX = (m_patchDef3) ? false : BezierCurveTree_isLeaf(m_tess.m_curveTreeU[i>>1]);
2593 const std::size_t offMidX = (m_patchDef3) ? 0 : m_tess.m_curveTreeU[i>>1]->index;
2594 const std::size_t widthX = m_tess.m_arrayWidth[i>>1];
2595 const std::size_t offEndX = offStartX + widthX;
2597 PatchControl *subMatrix[3][3];
2598 subMatrix[0][0] = pCtrl;
2599 subMatrix[0][1] = subMatrix[0][0]+strideU;
2600 subMatrix[0][2] = subMatrix[0][1]+strideU;
2601 subMatrix[1][0] = subMatrix[0][0]+strideV;
2602 subMatrix[1][1] = subMatrix[1][0]+strideU;
2603 subMatrix[1][2] = subMatrix[1][1]+strideU;
2604 subMatrix[2][0] = subMatrix[1][0]+strideV;
2605 subMatrix[2][1] = subMatrix[2][0]+strideU;
2606 subMatrix[2][2] = subMatrix[2][1]+strideU;
2608 // assign on-patch control points to vertex array
2609 if(i == 0 && j == 0)
2611 vertex_clear_normal(m_tess.m_vertices[offStartX + offStartY]);
2613 vertex_assign_ctrl(m_tess.m_vertices[offStartX + offStartY], *subMatrix[0][0]);
2616 vertex_clear_normal(m_tess.m_vertices[offEndX + offStartY]);
2618 vertex_assign_ctrl(m_tess.m_vertices[offEndX + offStartY], *subMatrix[0][2]);
2621 vertex_clear_normal(m_tess.m_vertices[offStartX + offEndY]);
2623 vertex_assign_ctrl(m_tess.m_vertices[offStartX + offEndY], *subMatrix[2][0]);
2625 vertex_clear_normal(m_tess.m_vertices[offEndX + offEndY]);
2626 vertex_assign_ctrl(m_tess.m_vertices[offEndX + offEndY], *subMatrix[2][2]);
2630 // assign remaining control points to vertex array
2633 vertex_assign_ctrl(m_tess.m_vertices[offMidX + offStartY], *subMatrix[0][1]);
2634 vertex_assign_ctrl(m_tess.m_vertices[offMidX + offEndY], *subMatrix[2][1]);
2638 vertex_assign_ctrl(m_tess.m_vertices[offStartX + offMidY], *subMatrix[1][0]);
2639 vertex_assign_ctrl(m_tess.m_vertices[offEndX + offMidY], *subMatrix[1][2]);
2643 vertex_assign_ctrl(m_tess.m_vertices[offMidX + offMidY], *subMatrix[1][1]);
2648 // test all 12 edges for degeneracy
2649 unsigned int nFlagsX = subarray_get_degen(pCtrl, strideU, strideV);
2650 unsigned int nFlagsY = subarray_get_degen(pCtrl, strideV, strideU);
2651 Vector3 tangentX[6], tangentY[6];
2652 Vector2 tangentS[6], tangentT[6];
2654 // set up tangents for each of the 12 edges if they were not degenerate
2655 if(!(nFlagsX & DEGEN_0a))
2657 tangentX[0] = vector3_subtracted(subMatrix[0][1]->m_vertex, subMatrix[0][0]->m_vertex);
2658 tangentS[0] = vector2_subtracted(subMatrix[0][1]->m_texcoord, subMatrix[0][0]->m_texcoord);
2660 if(!(nFlagsX & DEGEN_0b))
2662 tangentX[1] = vector3_subtracted(subMatrix[0][2]->m_vertex, subMatrix[0][1]->m_vertex);
2663 tangentS[1] = vector2_subtracted(subMatrix[0][2]->m_texcoord, subMatrix[0][1]->m_texcoord);
2665 if(!(nFlagsX & DEGEN_1a))
2667 tangentX[2] = vector3_subtracted(subMatrix[1][1]->m_vertex, subMatrix[1][0]->m_vertex);
2668 tangentS[2] = vector2_subtracted(subMatrix[1][1]->m_texcoord, subMatrix[1][0]->m_texcoord);
2670 if(!(nFlagsX & DEGEN_1b))
2672 tangentX[3] = vector3_subtracted(subMatrix[1][2]->m_vertex, subMatrix[1][1]->m_vertex);
2673 tangentS[3] = vector2_subtracted(subMatrix[1][2]->m_texcoord, subMatrix[1][1]->m_texcoord);
2675 if(!(nFlagsX & DEGEN_2a))
2677 tangentX[4] = vector3_subtracted(subMatrix[2][1]->m_vertex, subMatrix[2][0]->m_vertex);
2678 tangentS[4] = vector2_subtracted(subMatrix[2][1]->m_texcoord, subMatrix[2][0]->m_texcoord);
2680 if(!(nFlagsX & DEGEN_2b))
2682 tangentX[5] = vector3_subtracted(subMatrix[2][2]->m_vertex, subMatrix[2][1]->m_vertex);
2683 tangentS[5] = vector2_subtracted(subMatrix[2][2]->m_texcoord, subMatrix[2][1]->m_texcoord);
2686 if(!(nFlagsY & DEGEN_0a))
2688 tangentY[0] = vector3_subtracted(subMatrix[1][0]->m_vertex, subMatrix[0][0]->m_vertex);
2689 tangentT[0] = vector2_subtracted(subMatrix[1][0]->m_texcoord, subMatrix[0][0]->m_texcoord);
2691 if(!(nFlagsY & DEGEN_0b))
2693 tangentY[1] = vector3_subtracted(subMatrix[2][0]->m_vertex, subMatrix[1][0]->m_vertex);
2694 tangentT[1] = vector2_subtracted(subMatrix[2][0]->m_texcoord, subMatrix[1][0]->m_texcoord);
2696 if(!(nFlagsY & DEGEN_1a))
2698 tangentY[2] = vector3_subtracted(subMatrix[1][1]->m_vertex, subMatrix[0][1]->m_vertex);
2699 tangentT[2] = vector2_subtracted(subMatrix[1][1]->m_texcoord, subMatrix[0][1]->m_texcoord);
2701 if(!(nFlagsY & DEGEN_1b))
2703 tangentY[3] = vector3_subtracted(subMatrix[2][1]->m_vertex, subMatrix[1][1]->m_vertex);
2704 tangentT[3] = vector2_subtracted(subMatrix[2][1]->m_texcoord, subMatrix[1][1]->m_texcoord);
2706 if(!(nFlagsY & DEGEN_2a))
2708 tangentY[4] = vector3_subtracted(subMatrix[1][2]->m_vertex, subMatrix[0][2]->m_vertex);
2709 tangentT[4] = vector2_subtracted(subMatrix[1][2]->m_texcoord, subMatrix[0][2]->m_texcoord);
2711 if(!(nFlagsY & DEGEN_2b))
2713 tangentY[5] = vector3_subtracted(subMatrix[2][2]->m_vertex, subMatrix[1][2]->m_vertex);
2714 tangentT[5] = vector2_subtracted(subMatrix[2][2]->m_texcoord, subMatrix[1][2]->m_texcoord);
2717 // set up remaining edge tangents by borrowing the tangent from the closest parallel non-degenerate edge
2718 tangents_remove_degenerate(tangentX, tangentS, nFlagsX);
2719 tangents_remove_degenerate(tangentY, tangentT, nFlagsY);
2723 std::size_t index = offStartX + offStartY;
2724 std::size_t index0 = 0;
2725 std::size_t index1 = 0;
2727 double dot = vector3_dot(tangentX[index0], tangentY[index1]);
2728 double length = vector3_length(tangentX[index0]) * vector3_length(tangentY[index1]);
2730 bestTangents00(nFlagsX, dot, length, index0, index1);
2732 accumulateVertexTangentSpace(index, tangentX, tangentY, tangentS, tangentT, index0, index1);
2737 std::size_t index = offEndX + offStartY;
2738 std::size_t index0 = 1;
2739 std::size_t index1 = 4;
2741 double dot = vector3_dot(tangentX[index0],tangentY[index1]);
2742 double length = vector3_length(tangentX[index0]) * vector3_length(tangentY[index1]);
2744 bestTangents10(nFlagsX, dot, length, index0, index1);
2746 accumulateVertexTangentSpace(index, tangentX, tangentY, tangentS, tangentT, index0, index1);
2751 std::size_t index = offStartX + offEndY;
2752 std::size_t index0 = 4;
2753 std::size_t index1 = 1;
2755 double dot = vector3_dot(tangentX[index0], tangentY[index1]);
2756 double length = vector3_length(tangentX[index1]) * vector3_length(tangentY[index1]);
2758 bestTangents01(nFlagsX, dot, length, index0, index1);
2760 accumulateVertexTangentSpace(index, tangentX, tangentY, tangentS, tangentT, index0, index1);
2765 std::size_t index = offEndX + offEndY;
2766 std::size_t index0 = 5;
2767 std::size_t index1 = 5;
2769 double dot = vector3_dot(tangentX[index0],tangentY[index1]);
2770 double length = vector3_length(tangentX[index0]) * vector3_length(tangentY[index1]);
2772 bestTangents11(nFlagsX, dot, length, index0, index1);
2774 accumulateVertexTangentSpace(index, tangentX, tangentY, tangentS, tangentT, index0, index1);
2777 //normalise normals that won't be accumulated again
2780 normalise_safe(normal_for_index(m_tess.m_vertices, offStartX + offStartY));
2781 normalise_safe(tangent_for_index(m_tess.m_vertices, offStartX + offStartY));
2782 normalise_safe(bitangent_for_index(m_tess.m_vertices, offStartX + offStartY));
2786 normalise_safe(normal_for_index(m_tess.m_vertices, offEndX + offStartY));
2787 normalise_safe(tangent_for_index(m_tess.m_vertices, offEndX + offStartY));
2788 normalise_safe(bitangent_for_index(m_tess.m_vertices, offEndX + offStartY));
2792 normalise_safe(normal_for_index(m_tess.m_vertices, offStartX + offEndY));
2793 normalise_safe(tangent_for_index(m_tess.m_vertices, offStartX + offEndY));
2794 normalise_safe(bitangent_for_index(m_tess.m_vertices, offStartX + offEndY));
2796 if(i+3 == m_width && j+3 == m_height)
2798 normalise_safe(normal_for_index(m_tess.m_vertices, offEndX + offEndY));
2799 normalise_safe(tangent_for_index(m_tess.m_vertices, offEndX + offEndY));
2800 normalise_safe(bitangent_for_index(m_tess.m_vertices, offEndX + offEndY));
2803 // set flags to average normals between shared edges
2812 // set flags to save evaluating shared edges twice
2816 // if the patch is curved.. tesselate recursively
2817 // use the relevant control curves for this sub-patch
2820 TesselateSubMatrixFixed(m_tess.m_vertices.data() + offStartX + offStartY, 1, m_tess.m_nArrayWidth, nFlagsX, nFlagsY, subMatrix);
2826 TesselateSubMatrix( m_tess.m_curveTreeU[i>>1], m_tess.m_curveTreeV[j>>1],
2827 offStartX, offStartY, offEndX, offEndY, // array offsets
2829 subMatrix[1][0]->m_vertex, subMatrix[1][1]->m_vertex, subMatrix[1][2]->m_vertex,
2830 subMatrix[1][0]->m_texcoord, subMatrix[1][1]->m_texcoord, subMatrix[1][2]->m_texcoord,
2835 TesselateSubMatrix( m_tess.m_curveTreeV[j>>1], m_tess.m_curveTreeU[i>>1],
2836 offStartY, offStartX, offEndY, offEndX, // array offsets
2838 subMatrix[0][1]->m_vertex, subMatrix[1][1]->m_vertex, subMatrix[2][1]->m_vertex,
2839 subMatrix[0][1]->m_texcoord, subMatrix[1][1]->m_texcoord, subMatrix[2][1]->m_texcoord,
2844 offStartX = offEndX;
2846 offStartY = offEndY;
2853 class PatchFilterWrapper : public Filter
2857 PatchFilter& m_filter;
2859 PatchFilterWrapper(PatchFilter& filter, bool invert) : m_invert(invert), m_filter(filter)
2862 void setActive(bool active)
2870 bool filter(const Patch& patch)
2872 return m_invert ^ m_filter.filter(patch);
2877 typedef std::list<PatchFilterWrapper> PatchFilters;
2878 PatchFilters g_patchFilters;
2880 void add_patch_filter(PatchFilter& filter, int mask, bool invert)
2882 g_patchFilters.push_back(PatchFilterWrapper(filter, invert));
2883 GlobalFilterSystem().addFilter(g_patchFilters.back(), mask);
2886 bool patch_filtered(Patch& patch)
2888 for(PatchFilters::iterator i = g_patchFilters.begin(); i != g_patchFilters.end(); ++i)
2890 if((*i).active() && (*i).filter(patch))