RStarTree.h

/*
 * Gamedev Framework (gf)
 * Copyright (C) 2016-2019 Julien Bernard
 *
 * This software is provided 'as-is', without any express or implied
 * warranty.  In no event will the authors be held liable for any damages
 * arising from the use of this software.
 *
 * Permission is granted to anyone to use this software for any purpose,
 * including commercial applications, and to alter it and redistribute it
 * freely, subject to the following restrictions:
 *
 * 1. The origin of this software must not be misrepresented; you must not
 *    claim that you wrote the original software. If you use this software
 *    in a product, an acknowledgment in the product documentation would be
 *    appreciated but is not required.
 * 2. Altered source versions must be plainly marked as such, and must not be
 *    misrepresented as being the original software.
 * 3. This notice may not be removed or altered from any source distribution.
 */
#ifndef GF_SPATIAL_R_STAR_TREE_H
#define GF_SPATIAL_R_STAR_TREE_H

#include <cassert>
#include <vector>

#include <boost/container/static_vector.hpp>

#include <gf/Handle.h>
#include <gf/Portability.h>
#include <gf/Rect.h>

#include "BlockAllocator.h"
#include "Types.h"

namespace gf {
#ifndef DOXYGEN_SHOULD_SKIP_THIS
inline namespace v1 {
#endif

  class GF_API RStarTree {
  public:
    static constexpr std::size_t MaxSize = 16;
    static constexpr std::size_t MinSize = 4;

    RStarTree();

    SpatialId insert(Handle handle, const RectF& bounds);

    void modify(SpatialId id, RectF bounds);

    std::size_t query(const RectF& bounds, SpatialQueryCallback callback, SpatialQuery kind = SpatialQuery::Intersect);

    void remove(SpatialId id);

    void clear();

    Handle operator[](SpatialId id);

  private:
    std::size_t allocateEntry();
    void disposeEntry(std::size_t index);

    std::size_t allocateNode();
    void disposeNode(std::size_t index);

    RectF computeBounds(std::size_t nodeIndex);
    void updateBoundsForChild(std::size_t parentIndex, const RectF& bounds, std::size_t childIndex);

    void doInsert(std::size_t entryIndex, const RectF& bounds);

    std::size_t chooseSubtree(std::size_t nodeIndex, const RectF& bounds);
    std::size_t chooseNode(std::size_t nodeIndex, const RectF& bounds);
    std::size_t searchForCoveringNode(std::size_t nodeIndex, const RectF& bounds);
    bool existsEmptyVolumeExtension(std::size_t nodeIndex, const RectF& bounds);

    struct Candidate {
      std::size_t index;
      float overlap;
      bool isCandidate;
    };

    template<typename OverlapEnlargement>
    std::size_t findCandidates(std::size_t nodeIndex, std::size_t t, std::size_t p, const RectF& bounds, std::vector<Candidate>& candidates);

    std::size_t doInsertInLeaf(std::size_t nodeIndex, std::size_t entryIndex, const RectF& entryBounds);
    std::size_t doInsertInBranch(std::size_t nodeIndex, std::size_t childIndex, const RectF& childBounds);

    std::size_t doQuery(std::size_t nodeIndex, const RectF& bounds, SpatialQueryCallback callback, SpatialQuery kind);

    void getEntriesAndDispose(std::size_t nodeIndex, std::vector<std::size_t>& eliminated);
    void doRemove(std::size_t entryIndex);

    void validate() const;
    std::size_t validateNode(std::size_t nodeIndex) const;

  private:
    static constexpr std::size_t Size = MaxSize + 1;

    struct Entry {
      Handle handle;
      RectF bounds;
      std::size_t node;
    };

    BlockAllocator<Entry> m_entries;

    struct Node {
      enum NodeType {
        Branch,
        Leaf,
      };

      struct Member {
        RectF bounds;
        std::size_t index;
      };

      RectF bounds;
      std::size_t parent;
      NodeType type;
      boost::container::static_vector<Member, Size> members;
    };

    BlockAllocator<Node> m_nodes;
    std::size_t m_root;
  };

#ifndef DOXYGEN_SHOULD_SKIP_THIS
}
#endif
}

#endif // GF_SPATIAL_R_STAR_TREE_H