1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127
|
// OpenCSG - library for image-based CSG rendering for OpenGL
// Copyright (C) 2002-2016, Florian Kirsch
// Hasso-Plattner-Institute at the University of Potsdam, Germany
//
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License,
// Version 2, as published by the Free Software Foundation.
// As a special exception, you have permission to link this library
// with the CGAL library and distribute executables.
//
// This library 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
//
// batch.cpp
//
#include "opencsgConfig.h"
#include <opencsg.h>
#include "batch.h"
#include "primitiveHelper.h"
namespace OpenCSG {
class FullscreenPrimitive : public Primitive
{
public:
FullscreenPrimitive()
: Primitive(OpenCSG::Intersection, 1)
{
}
virtual void render()
{
}
};
Batcher::Batcher(const std::vector<Primitive*>& primitives) {
FullscreenPrimitive fullscreen;
const unsigned int numberOfPrimitives = primitives.size();
mBatches.reserve(numberOfPrimitives);
std::vector<Batch> batchCandidates;
batchCandidates.reserve(numberOfPrimitives);
for (std::vector<Primitive*>::const_iterator itr = primitives.begin(); itr != primitives.end(); ++itr) {
// primitive completely outside viewport, no need to process it any further
if (!Algo::intersectXY(*itr, &fullscreen))
continue;
// fullscreen is completely part of the primitive's bounding box,
// no other primitive can be part of the same batch
if (Algo::containsXY(&fullscreen, *itr)) {
mBatches.push_back(Batch());
Batch& batch = mBatches.back();
batch.push_back(*itr);
}
else
{
std::vector<Batch>::iterator batchItr = batchCandidates.begin();
std::vector<Batch>::iterator batchEnd = batchCandidates.end();
for ( ; batchItr != batchEnd; ++batchItr) {
Batch & batch = *batchItr;
Batch::const_iterator batchPrimitives = batch.begin();
Batch::const_iterator batchPrimitivesEnd = batch.end();
// if the primitive does not intersect any of the primitives in
// the current batch, we can add the primitive to that batch
for ( ; batchPrimitives != batchPrimitivesEnd; ++batchPrimitives) {
if (Algo::intersectXY(*itr, *batchPrimitives)) {
break;
}
}
if (batchPrimitives == batchPrimitivesEnd) {
batch.push_back(*itr);
break;
}
}
// primitive could not added to any batch -> create a new batch
if (batchItr == batchEnd) {
batchCandidates.push_back(Batch());
Batch& batch = batchCandidates.back();
batch.push_back(*itr);
}
}
}
// Could do here the following. But since since batchCandidates is not needed anymore,
// we can use the std::vector swap trick to avoid calling of the copy constructor.
// std::copy(batchCandidates.begin(), batchCandidates.end(), std::back_inserter(mBatches));
std::vector<Batch>::iterator batchItr = batchCandidates.begin();
std::vector<Batch>::iterator batchEnd = batchCandidates.end();
for ( ; batchItr != batchEnd; ++batchItr) {
mBatches.push_back(Batch());
Batch& batch = mBatches.back();
batch.swap(*batchItr);
}
}
std::vector<Batch>::const_iterator Batcher::begin() const {
return mBatches.begin();
}
std::vector<Batch>::const_iterator Batcher::end() const {
return mBatches.end();
}
unsigned int Batcher::size() const {
return mBatches.size();
}
} // namespace OpenCSG
|