128 lines
3.3 KiB
C++
128 lines
3.3 KiB
C++
/**
|
|
* $Id:
|
|
*
|
|
* ***** BEGIN GPL LICENSE BLOCK *****
|
|
*
|
|
* 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. The Blender
|
|
* Foundation also sells licenses for use in proprietary software under
|
|
* the Blender License. See http://www.blender.org/BL/ for information
|
|
* about this.
|
|
*
|
|
* 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., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
|
|
*
|
|
* Contributor(s): Martin Poirier
|
|
*
|
|
* ***** END GPL LICENSE BLOCK *****
|
|
*/
|
|
|
|
#ifndef REEB_H_
|
|
#define REEB_H_
|
|
|
|
#include "DNA_listBase.h"
|
|
|
|
struct EdgeHash;
|
|
struct ReebArc;
|
|
struct ReebEdge;
|
|
struct ReebNode;
|
|
|
|
typedef struct ReebGraph {
|
|
ListBase arcs;
|
|
ListBase nodes;
|
|
int totnodes;
|
|
struct EdgeHash *emap;
|
|
} ReebGraph;
|
|
|
|
typedef struct EmbedBucket {
|
|
float val;
|
|
int nv;
|
|
float p[3];
|
|
} EmbedBucket;
|
|
|
|
typedef struct ReebNode {
|
|
struct ReebNode *next, *prev;
|
|
struct ReebArc **arcs;
|
|
int index;
|
|
int degree;
|
|
float weight;
|
|
float p[3];
|
|
int flags;
|
|
} ReebNode;
|
|
|
|
typedef struct ReebEdge {
|
|
struct ReebEdge *next, *prev;
|
|
struct ReebArc *arc;
|
|
struct ReebNode *v1, *v2;
|
|
struct ReebEdge *nextEdge;
|
|
} ReebEdge;
|
|
|
|
typedef struct ReebArc {
|
|
struct ReebArc *next, *prev;
|
|
ListBase edges;
|
|
struct ReebNode *v1, *v2;
|
|
struct EmbedBucket *buckets;
|
|
int bcount;
|
|
int flags;
|
|
} ReebArc;
|
|
|
|
typedef struct ReebArcIterator {
|
|
struct ReebArc *arc;
|
|
int index;
|
|
int start;
|
|
int end;
|
|
int stride;
|
|
} ReebArcIterator;
|
|
|
|
struct EditMesh;
|
|
|
|
int weightToHarmonic(struct EditMesh *em);
|
|
int weightFromDistance(struct EditMesh *em);
|
|
int weightFromLoc(struct EditMesh *me, int axis);
|
|
void weightToVCol(struct EditMesh *em);
|
|
void renormalizeWeight(struct EditMesh *em, float newmax);
|
|
|
|
ReebGraph * generateReebGraph(struct EditMesh *me, int subdivisions);
|
|
void freeGraph(ReebGraph *rg);
|
|
void exportGraph(ReebGraph *rg, int count);
|
|
|
|
#define OTHER_NODE(arc, node) ((arc->v1 == node) ? arc->v2 : arc->v1)
|
|
|
|
void initArcIterator(struct ReebArcIterator *iter, struct ReebArc *arc, struct ReebNode *head);
|
|
void initArcIterator2(struct ReebArcIterator *iter, struct ReebArc *arc, int start, int end);
|
|
struct EmbedBucket * nextBucket(struct ReebArcIterator *iter);
|
|
|
|
/* Filtering */
|
|
void filterNullReebGraph(ReebGraph *rg);
|
|
int filterExternalReebGraph(ReebGraph *rg, float threshold);
|
|
int filterInternalReebGraph(ReebGraph *rg, float threshold);
|
|
|
|
/* Post-Build processing */
|
|
void repositionNodes(ReebGraph *rg);
|
|
void postprocessGraph(ReebGraph *rg, char mode);
|
|
void removeNormalNodes(ReebGraph *rg);
|
|
|
|
/* Graph processing */
|
|
void buildAdjacencyList(ReebGraph *rg);
|
|
|
|
void sortNodes(ReebGraph *rg);
|
|
void sortArcs(ReebGraph *rg);
|
|
|
|
int subtreeDepth(ReebNode *node, ReebArc *rootArc);
|
|
int countConnectedArcs(ReebGraph *rg, ReebNode *node);
|
|
int hasAdjacencyList(ReebGraph *rg);
|
|
int isGraphCyclic(ReebGraph *rg);
|
|
|
|
/* Sanity check */
|
|
void verifyBuckets(ReebGraph *rg);
|
|
|
|
#endif /*REEB_H_*/
|