35 lines
1.1 KiB
C
35 lines
1.1 KiB
C
|
#ifndef DUST3D_CYCLE_FINDER
|
||
|
|
#define DUST3D_CYCLE_FINDER
|
||
|
|
#include <vector>
|
||
|
|
#include <set>
|
||
|
|
#include <QVector3D>
|
||
|
|
|
||
|
|
class CycleFinder
|
||
|
|
{
|
||
|
|
public:
|
||
|
|
CycleFinder(const std::vector<QVector3D> &nodePositions,
|
||
|
|
const std::vector<std::pair<size_t, size_t>> &edges);
|
||
|
|
void find();
|
||
|
|
const std::vector<std::vector<size_t>> &getCycles();
|
||
|
|
private:
|
||
|
|
size_t m_nodeNum = 0;
|
||
|
|
std::vector<QVector3D> m_nodePositions;
|
||
|
|
std::vector<std::pair<size_t, size_t>> m_edges;
|
||
|
|
std::vector<int> m_edgeLengths;
|
||
|
|
std::map<std::pair<size_t, size_t>, int> m_edgeLengthMap;
|
||
|
|
std::vector<std::vector<size_t>> m_cycles;
|
||
|
|
std::vector<int> m_cycleLengths;
|
||
|
|
std::set<std::pair<size_t, size_t>> m_cycleEdges;
|
||
|
|
std::set<std::pair<size_t, size_t>> m_halfEdges;
|
||
|
|
float m_invalidFlatness = 1.0;
|
||
|
|
void removeEdgeFrom(const std::pair<size_t, size_t> &edge,
|
||
|
|
std::vector<std::pair<size_t, size_t>> *edges,
|
||
|
|
std::vector<int> *edgeLengths);
|
||
|
|
void prepareWeights();
|
||
|
|
bool validateCycleByFlatness(const std::vector<size_t> &cycle);
|
||
|
|
int calculateCycleLength(const std::vector<size_t> &cycle);
|
||
|
|
};
|
||
|
|
|
||
|
|
#endif
|
||
|
|
|