DGtal::RegularDomainSplitter< Domain > Struct Template Reference

Splits a domain evenly along all dimensions. More...

#include <DGtal/kernel/domains/DomainSplitter.h>

Public Types
typedef std::vector< SplitInfo< Domain > >	SplitDomainsInfo

Public Member Functions
	BOOST_CONCEPT_ASSERT ((concepts::CDomain< Domain >))
SplitDomainsInfo	operator() (const Domain &d, uint32_t splitHint) const
	Splits a domain.

Detailed Description

template<typename Domain>
struct DGtal::RegularDomainSplitter< Domain >

Splits a domain evenly along all dimensions.

Template Parameters

The	model of domain to split

Definition at line 56 of file DomainSplitter.h.

Member Typedef Documentation

SplitDomainsInfo

template<typename Domain >

typedef std::vector<SplitInfo<Domain> > DGtal::RegularDomainSplitter< Domain >::SplitDomainsInfo

Definition at line 61 of file DomainSplitter.h.

Member Function Documentation

BOOST_CONCEPT_ASSERT()

template<typename Domain >

DGtal::RegularDomainSplitter< Domain >::BOOST_CONCEPT_ASSERT

(

(concepts::CDomain< Domain >)

)

operator()()

template<typename Domain >

SplitDomainsInfo DGtal::RegularDomainSplitter< Domain >::operator() ( const Domain &  d, uint32_t  splitHint  ) const

inline

Splits a domain.

This functions may split the domain in fewer part than wanted to ensure even subdomains.

Parameters

d	The domain to split
splitHint	The targeted number of splits

Definition at line 72 of file DomainSplitter.h.

    {
      // Find best match possible for even splitting
      const uint32_t splitCount = std::floor(std::log(splitHint) / std::log(Domain::dimension));
      const uint32_t totalSplits = std::pow(splitCount, Domain::dimension);
 
      if (splitCount == 0)
        return { SplitInfo{d, 0} };
 
      auto splitSize = (d.upperBound() - d.lowerBound()) / (int32_t)splitCount;
      SplitDomainsInfo result;
      result.reserve(totalSplits);
 
      for (uint32_t i = 0; i < totalSplits; ++i)
      {
        auto start = d.lowerBound();
        auto idx = i;
        for (uint32_t j = 0; j < Domain::dimension; ++j)
        {
          auto k = idx % splitCount;
          start[j] += k * splitSize[j] + k; // +k ensure no overlap between domains
          idx /= splitCount;
        }
 
        // Make correction to ensure it remains within the domain
        auto end = start + splitSize;
        for (uint32_t j = 0; j < Domain::dimension; ++j)
          end[j] = std::clamp(end[j], d.lowerBound()[j], d.upperBound()[j]);
 
        result.emplace_back(Domain(start, end), 0);
      }
 
      return result;
    };

References DGtal::HyperRectDomain< TSpace >::lowerBound(), and DGtal::HyperRectDomain< TSpace >::upperBound().

---

The documentation for this struct was generated from the following file:

• DomainSplitter.h