mirror of https://github.com/mosra/magnum.git
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
83 lines
2.5 KiB
83 lines
2.5 KiB
15 years ago
|
#ifndef Magnum_MeshTools_Tipsify_h
|
||
|
|
#define Magnum_MeshTools_Tipsify_h
|
||
|
|
/*
|
||
|
|
Copyright © 2010, 2011, 2012 Vladimír Vondruš <mosra@centrum.cz>
|
||
|
|
|
||
|
|
This file is part of Magnum.
|
||
|
|
|
||
|
|
Magnum is free software: you can redistribute it and/or modify
|
||
|
|
it under the terms of the GNU Lesser General Public License version 3
|
||
|
|
only, as published by the Free Software Foundation.
|
||
|
|
|
||
|
|
Magnum 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 Lesser General Public License version 3 for more details.
|
||
|
|
*/
|
||
|
|
|
||
|
|
/** @file
|
||
|
|
* @brief Class Magnum::MeshTools::Tipsify
|
||
|
|
*/
|
||
|
|
|
||
|
|
#include "AbstractTool.h"
|
||
|
|
|
||
|
|
namespace Magnum { namespace MeshTools {
|
||
|
|
|
||
|
|
/**
|
||
|
|
@brief %Mesh tipsifier implementation
|
||
|
|
|
||
|
|
See tipsify() for full documentation.
|
||
|
|
*/
|
||
|
|
class Tipsify: public AbstractIndexTool {
|
||
|
|
public:
|
||
|
|
/** @copydoc AbstractIndexTool::AbstractIndexTool() */
|
||
|
|
template<class Vertex> inline Tipsify(MeshBuilder<Vertex>& builder): AbstractIndexTool(builder) {}
|
||
|
|
|
||
|
|
/**
|
||
|
|
* @brief Functor
|
||
|
|
*
|
||
|
|
* See tipsify() for full documentation.
|
||
|
|
*/
|
||
|
|
void run(size_t cacheSize);
|
||
|
|
|
||
|
|
/**
|
||
|
|
* @brief Build vertex-triangle adjacency
|
||
|
|
*
|
||
|
|
* Computes count and indices of adjacent triangles for each vertex
|
||
|
|
* (used internally).
|
||
|
|
*/
|
||
|
|
void buildAdjacency(std::vector<unsigned int>& liveTriangleCount, std::vector<unsigned int>& neighborOffset, std::vector<unsigned int>& neighbors) const;
|
||
|
|
};
|
||
|
|
|
||
|
|
/**
|
||
|
|
@brief %Tipsify the mesh
|
||
|
|
@tparam Vertex Vertex data type (the same as in MeshBuilder)
|
||
|
|
@param builder %Mesh builder to operate on
|
||
|
|
@param cacheSize Post-transform vertex cache size
|
||
|
|
|
||
|
|
Optimizes the mesh for vertex-bound applications by rearranging its index
|
||
|
|
array for beter usage of post-transform vertex cache. Algorithm used:
|
||
|
|
<em>Pedro V. Sander, Diego Nehab, and Joshua Barczak,
|
||
|
|
<a href="http://gfx.cs.princeton.edu/pubs/Sander_2007_%3ETR/index.php">Fast
|
||
|
|
Triangle Reordering for Vertex Locality and Reduced Overdraw</a>, SIGGRAPH
|
||
|
|
2007</em>.
|
||
|
|
|
||
|
|
This is convenience function supplementing direct usage of Tipsify class,
|
||
|
|
instead of
|
||
|
|
@code
|
||
|
|
MeshBuilder<T> builder;
|
||
|
|
MeshTools::Tipsify(builder).run(cacheSize);
|
||
|
|
@endcode
|
||
|
|
you can just write
|
||
|
|
@code
|
||
|
|
MeshTools::tipsify(builder, cacheSize);
|
||
|
|
@endcode
|
||
|
|
*/
|
||
|
|
template<class Vertex> inline void tipsify(MeshBuilder<Vertex>& builder, size_t cacheSize) {
|
||
|
|
Tipsify(builder).run(cacheSize);
|
||
|
|
}
|
||
|
|
|
||
|
|
}}
|
||
|
|
|
||
|
|
#endif
|