quickly optimize locality in triangle index list for vertex cache use More...
#include <cassert>#include <vector>#include <algorithm>
Include dependency graph for Tipsify.h:
Go to the source code of this file.
Classes | |
| struct | opencover::Tipsify::Neighbors< Index > |
Namespaces | |
| namespace | opencover |
| namespace | opencover::Tipsify |
Functions | |
| template<class Index > | |
| Neighbors< Index > | opencover::Tipsify::buildNeighbours (const Index *idx, size_t size, Index maxIndex) |
| template<class Index > | |
| void | opencover::tipsify (Index *idx, size_t num, int cachesize=20, int batchsize=-1) |
Detailed Description
quickly optimize locality in triangle index list for vertex cache use
as proposed in Sander, Nehab, Barczak: "Fast Triangle Reordering for Vertex Locality and Reduced Overdraw"
