/**************************************************************************** ** ** Copyright (C) 2014 Digia Plc ** All rights reserved. ** For any questions to Digia, please use contact form at http://qt.io ** ** This file is part of the Qt Data Visualization module. ** ** Licensees holding valid commercial license for Qt may use this file in ** accordance with the Qt License Agreement provided with the Software ** or, alternatively, in accordance with the terms contained in a written ** agreement between you and Digia. ** ** If you have questions regarding the use of this file, please use ** contact form at http://qt.io ** ****************************************************************************/ #include "vertexindexer_p.h" #include QT_BEGIN_NAMESPACE_DATAVISUALIZATION int unique_vertices = 0; bool VertexIndexer::getSimilarVertexIndex_fast(const PackedVertex &packed, QMap &VertexToOutIndex, GLuint &result) { QMap::iterator it = VertexToOutIndex.find(packed); if (it == VertexToOutIndex.end()) { return false; } else { result = it.value(); return true; } } void VertexIndexer::indexVBO(const QVector &in_vertices, const QVector &in_uvs, const QVector &in_normals, QVector &out_indices, QVector &out_vertices, QVector &out_uvs, QVector &out_normals) { unique_vertices = 0; QMap VertexToOutIndex; // For each input vertex for (int i = 0; i < in_vertices.size(); i++) { PackedVertex packed = {in_vertices[i], in_uvs[i], in_normals[i]}; // Try to find a similar vertex in out_XXXX GLuint index; bool found = getSimilarVertexIndex_fast(packed, VertexToOutIndex, index); if (found) { out_indices.append(index); } else { unique_vertices++; out_vertices.append(in_vertices[i]); out_uvs.append(in_uvs[i]); out_normals.append(in_normals[i]); GLuint newindex = (GLuint)out_vertices.size() - 1; out_indices.append(newindex); VertexToOutIndex[packed] = newindex; } } } QT_END_NAMESPACE_DATAVISUALIZATION