Libs/Optimize/Neighborhood/PowerOfTwoPointTree.h

Namespaces

Name
shapeworks User usage reporting (telemetry)

Classes

	Name
struct	shapeworks::powstruct
struct	shapeworks::powstruct< a, 0 >
class	shapeworks::PowerOfTwoPointTreeNode
class	shapeworks::PowerOfTwoPointTree

Source code

#pragma once

#include <list>

#include "ParticlePointIndexPair.h"
#include "itkDataObject.h"
#include "itkLightObject.h"
#include "itkPoint.h"
#include "itkTreeContainer.h"
#include "itkWeakPointer.h"

namespace shapeworks {

template <int a, int b>
struct powstruct {
  static const int c = a * powstruct<a, b - 1>::c;
};
template <int a>
struct powstruct<a, 0> {
  static const int c = 1;
};

class PowerOfTwoPointTreeNode : public itk::LightObject {
 public:
  constexpr static unsigned int VDimension = 3;
  typedef PowerOfTwoPointTreeNode Self;
  typedef itk::SmartPointer<Self> Pointer;
  typedef itk::SmartPointer<const Self> ConstPointer;
  typedef itk::LightObject Superclass;
  itkTypeMacro(PowerOfTwoPointTreeNode, LightObject);

  itkNewMacro(Self);

  itkStaticConstMacro(BranchesPerNode, int, (powstruct<2, VDimension>::c));

  typedef itk::Point<double, VDimension> PointType;

  typedef std::list<ParticlePointIndexPair> PointListType;

  bool operator==(const PowerOfTwoPointTreeNode& o) const {
    if ((m_LowerBound == o.m_LowerBound) && (m_UpperBound == o.m_UpperBound))
      return true;
    else
      return false;
  }

  bool IsLeaf() const {
    if (m_Branches[0].GetPointer() != 0)
      return false;
    else
      return true;
  }

  typename PointListType::iterator InsertElement(const ParticlePointIndexPair& elem) {
    return m_List.insert(m_List.end(), elem);
  }

  bool Contains(const PointType& p) const {
    for (unsigned int i = 0; i < VDimension; i++) {
      if (p[i] < m_LowerBound[i] || p[i] > m_UpperBound[i]) {
        return false;
      }
    }
    return true;
  }

  void SetLowerBound(const PointType& p) { m_LowerBound = p; }
  const PointType& GetLowerBound() const { return m_LowerBound; }
  void SetUpperBound(const PointType& p) { m_UpperBound = p; }
  const PointType& GetUpperBound() const { return m_UpperBound; }

  typename Self::Pointer* GetBranches() { return m_Branches; }
  const typename Self::Pointer* GetBranches() const { return m_Branches; }

  typename Self::Pointer& GetBranch(unsigned int i) { return m_Branches[i]; }
  const typename Self::Pointer& GetBranch(unsigned int i) const { return m_Branches[i]; }

  void SetBranch(unsigned int b, typename Self::Pointer n) { this->GetBranch(b) = n; }

  void PrintSelf(std::ostream& os, itk::Indent indent) const;

  const PointListType& GetList() const { return m_List; }
  PointListType& GetList() { return m_List; }

 protected:
  PowerOfTwoPointTreeNode() {}
  ~PowerOfTwoPointTreeNode() {}

  PowerOfTwoPointTreeNode(const PowerOfTwoPointTreeNode& o);  // purposely not implemented
  const PowerOfTwoPointTreeNode& operator=(const PowerOfTwoPointTreeNode& o);

 private:
  PointType m_LowerBound;
  PointType m_UpperBound;
  PointListType m_List;

  typename Self::Pointer m_Branches[powstruct<2, VDimension>::c];
};

class PowerOfTwoPointTree : public itk::DataObject {
 public:
  constexpr static unsigned int VDimension = 3;

  typedef PowerOfTwoPointTree Self;
  typedef DataObject Superclass;
  typedef itk::SmartPointer<Self> Pointer;
  typedef itk::SmartPointer<const Self> ConstPointer;
  typedef itk::WeakPointer<const Self> ConstWeakPointer;

  typedef PowerOfTwoPointTreeNode NodeType;

  typedef typename NodeType::Pointer NodePointerType;

  typedef typename PowerOfTwoPointTreeNode::PointType PointType;

  typedef typename NodeType::PointListType PointListType;
  typedef std::vector<typename PointListType::const_iterator> PointIteratorListType;

  itkNewMacro(Self);

  itkTypeMacro(PowerOfTwoPointTree, DataObject);

  itkStaticConstMacro(Dimension, unsigned int, VDimension);

  itkStaticConstMacro(BranchesPerNode, int, (powstruct<2, VDimension>::c));

  itkGetMacro(Depth, unsigned int);

  void ConstructTree(const PointType&, const PointType&, unsigned int);

  PointIteratorListType FindPointsInRegion(const PointType&, const PointType&) const;
  unsigned int FindPointsInRegion(const PointType&, const PointType&, PointIteratorListType&) const;

  NodePointerType GetNode(const PointType&);
  const NodePointerType GetNode(const PointType&) const;

  itkGetObjectMacro(Root, NodeType);
  itkSetObjectMacro(Root, NodeType);

  typename PointListType::iterator AddPoint(const PointType&, unsigned int, NodePointerType&);
  typename PointListType::iterator AddPoint(const PointType& p, unsigned int i) {
    NodePointerType node = NodeType::New();
    return this->AddPoint(p, i, node);
  }

  bool Overlap(const NodePointerType&, const PointType&, const PointType&) const;

  inline bool RegionContains(const PointType& p, const PointType& lowerbound, const PointType& upperbound) const {
    for (unsigned int i = 0; i < VDimension; i++) {
      if (p[i] < lowerbound[i] || p[i] >= upperbound[i]) return false;
    }
    return true;
  }

  void PrintSelf(std::ostream& os, itk::Indent indent) const;

 protected:
  PowerOfTwoPointTree() { m_Depth = 0; }
  virtual ~PowerOfTwoPointTree() {}

  void BranchNode(NodePointerType&, unsigned int);

  void FindOneNodeInRegion(const NodePointerType&, const PointType&, const PointType&, PointIteratorListType&) const;

 private:
  PowerOfTwoPointTree(const Self&);  // purposely not implemented
  void operator=(const Self&);       // purposely not implemented

  NodePointerType m_Root;

  unsigned int m_Depth;
};

}  // end namespace shapeworks

---

Updated on 2024-03-17 at 12:58:44 -0600