119 lines
3.3 KiB
C++
119 lines
3.3 KiB
C++
#pragma region License
|
|
/******************************************************************************
|
|
This file is part of the PolyVox library
|
|
Copyright (C) 2006 David Williams
|
|
|
|
This program is free software; you can redistribute it and/or
|
|
modify it under the terms of the GNU General Public License
|
|
as published by the Free Software Foundation; either version 2
|
|
of the License, or (at your option) any later version.
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with this program; if not, write to the Free Software
|
|
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
|
|
******************************************************************************/
|
|
#pragma endregion
|
|
|
|
#include "IndexedSurfacePatch.h"
|
|
|
|
using namespace std;
|
|
|
|
namespace PolyVox
|
|
{
|
|
IndexedSurfacePatch::IndexedSurfacePatch()
|
|
{
|
|
m_iTimeStamp = -1;
|
|
}
|
|
|
|
IndexedSurfacePatch::~IndexedSurfacePatch()
|
|
{
|
|
}
|
|
|
|
const std::vector<uint32_t>& IndexedSurfacePatch::getIndices(void) const
|
|
{
|
|
return m_vecTriangleIndices;
|
|
}
|
|
|
|
uint32_t IndexedSurfacePatch::getNoOfIndices(void) const
|
|
{
|
|
return m_vecTriangleIndices.size();
|
|
}
|
|
|
|
uint32_t IndexedSurfacePatch::getNoOfNonUniformTrianges(void) const
|
|
{
|
|
uint32_t result = 0;
|
|
for(uint32_t i = 0; i < m_vecTriangleIndices.size() - 2; i += 3)
|
|
{
|
|
if((m_vecVertices[m_vecTriangleIndices[i]].getMaterial() == m_vecVertices[m_vecTriangleIndices[i+1]].getMaterial())
|
|
&& (m_vecVertices[m_vecTriangleIndices[i]].getMaterial() == m_vecVertices[m_vecTriangleIndices[i+2]].getMaterial()))
|
|
{
|
|
}
|
|
else
|
|
{
|
|
result++;
|
|
}
|
|
}
|
|
return result;
|
|
}
|
|
|
|
uint32_t IndexedSurfacePatch::getNoOfUniformTrianges(void) const
|
|
{
|
|
uint32_t result = 0;
|
|
for(uint32_t i = 0; i < m_vecTriangleIndices.size() - 2; i += 3)
|
|
{
|
|
if((m_vecVertices[m_vecTriangleIndices[i]].getMaterial() == m_vecVertices[m_vecTriangleIndices[i+1]].getMaterial())
|
|
&& (m_vecVertices[m_vecTriangleIndices[i]].getMaterial() == m_vecVertices[m_vecTriangleIndices[i+2]].getMaterial()))
|
|
{
|
|
result++;
|
|
}
|
|
}
|
|
return result;
|
|
}
|
|
|
|
uint32_t IndexedSurfacePatch::getNoOfVertices(void) const
|
|
{
|
|
return m_vecVertices.size();
|
|
}
|
|
|
|
std::vector<SurfaceVertex>& IndexedSurfacePatch::getRawVertexData(void)
|
|
{
|
|
return m_vecVertices;
|
|
}
|
|
|
|
const std::vector<SurfaceVertex>& IndexedSurfacePatch::getVertices(void) const
|
|
{
|
|
return m_vecVertices;
|
|
}
|
|
|
|
void IndexedSurfacePatch::addTriangle(uint32_t index0, uint32_t index1, uint32_t index2)
|
|
{
|
|
m_vecTriangleIndices.push_back(index0);
|
|
m_vecTriangleIndices.push_back(index1);
|
|
m_vecTriangleIndices.push_back(index2);
|
|
}
|
|
|
|
uint32_t IndexedSurfacePatch::addVertex(const SurfaceVertex& vertex)
|
|
{
|
|
m_vecVertices.push_back(vertex);
|
|
return m_vecVertices.size() - 1;
|
|
}
|
|
|
|
void IndexedSurfacePatch::clear(void)
|
|
{
|
|
m_vecVertices.clear();
|
|
m_vecTriangleIndices.clear();
|
|
}
|
|
|
|
const bool IndexedSurfacePatch::isEmpty(void) const
|
|
{
|
|
return (getNoOfVertices() == 0) || (getNoOfIndices() == 0);
|
|
}
|
|
|
|
|
|
}
|