PointKdTreeSearcher.hpp

Go to the documentation of this file.

// This code is based on Jet framework.
// Copyright (c) 2018 Doyub Kim
// CubbyFlow is voxel-based fluid simulation engine for computer games.
// Copyright (c) 2020 CubbyFlow Team
// Core Part: Chris Ohk, Junwoo Hwang, Jihong Sin, Seungwoo Yoo
// AI Part: Dongheon Cho, Minseo Kim
// We are making my contributions/submissions to this project solely in our
// personal capacity and are not conveying any rights to any intellectual
// property of any third parties.
 
#ifndef CUBBYFLOW_POINT_KDTREE_SEARCHER_HPP
#define CUBBYFLOW_POINT_KDTREE_SEARCHER_HPP
 
#include <Core/Geometry/KdTree.hpp>
#include <Core/Searcher/PointNeighborSearcher.hpp>
#include <Core/Utils/Macros.hpp>
 
namespace CubbyFlow
{
template <size_t N>
class PointKdTreeSearcher final : public PointNeighborSearcher<N>
{
 public:
    CUBBYFLOW_NEIGHBOR_SEARCHER_TYPE_NAME(PointKdTreeSearcher, N)
 
    class Builder;
 
    using typename PointNeighborSearcher<N>::ForEachNearbyPointFunc;
    using PointNeighborSearcher<N>::Build;
 
    PointKdTreeSearcher() = default;
 
    ~PointKdTreeSearcher() override = default;
 
    PointKdTreeSearcher(const PointKdTreeSearcher& other);
 
    PointKdTreeSearcher(PointKdTreeSearcher&& other) noexcept;
 
    PointKdTreeSearcher& operator=(const PointKdTreeSearcher& other);
 
    PointKdTreeSearcher& operator=(PointKdTreeSearcher&& other) noexcept;
 
    void Build(const ConstArrayView1<Vector<double, N>>& points,
               double maxSearchRadius) override;
 
    void ForEachNearbyPoint(
        const Vector<double, N>& origin, double radius,
        const ForEachNearbyPointFunc& callback) const override;
 
    [[nodiscard]] bool HasNearbyPoint(const Vector<double, N>& origin,
                                      double radius) const override;
 
    [[nodiscard]] std::shared_ptr<PointNeighborSearcher<N>> Clone()
        const override;
 
    void Set(const PointKdTreeSearcher& other);
 
    void Serialize(std::vector<uint8_t>* buffer) const override;
 
    void Deserialize(const std::vector<uint8_t>& buffer) override;
 
    static Builder GetBuilder();
 
 private:
    template <size_t M = N>
    CUBBYFLOW_REQUIRES(M == 2)
    static void Serialize(const PointKdTreeSearcher<2>& searcher,
                          std::vector<uint8_t>* buffer);
 
    template <size_t M = N>
    CUBBYFLOW_REQUIRES(M == 3)
    static void Serialize(const PointKdTreeSearcher<3>& searcher,
                          std::vector<uint8_t>* buffer);
 
    template <size_t M = N>
    CUBBYFLOW_REQUIRES(M == 2)
    static void Deserialize(const std::vector<uint8_t>& buffer,
                            PointKdTreeSearcher<2>& searcher);
 
    template <size_t M = N>
    CUBBYFLOW_REQUIRES(M == 3)
    static void Deserialize(const std::vector<uint8_t>& buffer,
                            PointKdTreeSearcher<3>& searcher);
 
    KdTree<double, N> m_tree;
};
 
using PointKdTreeSearcher2 = PointKdTreeSearcher<2>;
 
using PointKdTreeSearcher3 = PointKdTreeSearcher<3>;
 
using PointKdTreeSearcher2Ptr = std::shared_ptr<PointKdTreeSearcher2>;
 
using PointKdTreeSearcher3Ptr = std::shared_ptr<PointKdTreeSearcher3>;
 
template <size_t N>
class PointKdTreeSearcher<N>::Builder final
    : public PointNeighborSearcherBuilder<N>
{
 public:
    Builder() = default;
 
    ~Builder() override = default;
 
    Builder(const Builder& other) = delete;
 
    Builder(Builder&& other) noexcept = delete;
 
    Builder& operator=(const Builder& other) = delete;
 
    Builder& operator=(Builder&& other) noexcept = delete;
 
    PointKdTreeSearcher Build() const;
 
    std::shared_ptr<PointKdTreeSearcher<N>> MakeShared() const;
 
    std::shared_ptr<PointNeighborSearcher<N>> BuildPointNeighborSearcher()
        const override;
};
}  // namespace CubbyFlow
 
#endif