PointCloudHierarchy.h

Go to the documentation of this file.

#ifndef POINT_CLOUD_HIERARCHY_H
#define POINT_CLOUD_HIERARCHY_H
 
#include <deal.II/base/point.h>
#include <vector>
#include <array>
#include <string>
#include <memory>
#include <unordered_map>
#include "SemiDiscreteOT/utils/dkm/dkm.hpp"
#include "SemiDiscreteOT/utils/dkm/dkm_parallel.hpp"
#include "SemiDiscreteOT/utils/dkm/dkm_utils.hpp"
 
using namespace dealii;
 
namespace PointCloudHierarchy {
 
class PointCloudHierarchyManager {
public:
    PointCloudHierarchyManager(int min_points = 100, int max_points = 1000);
 
    template <int spacedim>
    int generateHierarchy(
        const std::vector<Point<spacedim>>& input_points,
        const std::vector<double>& input_density,
        const std::string& output_dir);
 
    void setMaxPoints(int max_points);
 
    void setMinPoints(int min_points);
 
    int getNumLevels() const;
 
    int getPointCount(int level) const;
 
    int getPointsForLevel(int base_points, int level) const;
 
    const std::vector<std::vector<size_t>>& getParentIndices(int level) const;
 
    const std::vector<std::vector<size_t>>& getChildIndices(int level) const;
 
private:
    int min_points_;
    int max_points_;
    int num_levels_;
    std::vector<int> level_point_counts_;
 
    // parent_indices_[L] stores the relationships between level L and level L+1
    // For each point at level L, parent_indices_[L][point_idx] contains indices of its parents at level L+1
    std::vector<std::vector<std::vector<size_t>>> parent_indices_;
 
    // child_indices_[L] stores the relationships between level L+1 and level L
    // For each point at level L+1, child_indices_[L][point_idx] contains indices of its children at level L
    std::vector<std::vector<std::vector<size_t>>> child_indices_;
 
    void ensureDirectoryExists(const std::string& path) const;
 
    template <int spacedim>
    std::tuple<std::vector<std::array<double, spacedim>>, std::vector<double>, std::vector<int>>
    kmeansClustering(
        const std::vector<std::array<double, spacedim>>& points,
        const std::vector<double>& densities,
        size_t k);
};
 
} // namespace PointCloudHierarchy
 
#endif // POINT_CLOUD_HIERARCHY_H