34 #include "DGtal/base/Common.h"
35 #include "DGtal/helpers/StdDefs.h"
36 #include "DGtal/geometry/volumes/distance/PowerMap.h"
37 #include "DGtal/geometry/volumes/distance/ReducedMedialAxis.h"
38 #include "DGtal/geometry/volumes/distance/ExactPredicateLpPowerSeparableMetric.h"
39 #include "DGtal/kernel/sets/DigitalSetDomain.h"
40 #include "DGtal/kernel/sets/DigitalSetBySTLSet.h"
44 using namespace DGtal;
55 unsigned int nbok = 0;
80 for(
unsigned int i=0; i<11; i++)
82 for(
unsigned int j=0; j<11; j++)
93 for(
unsigned int i=0; i<11; i++)
95 for(
unsigned int j=0; j<11; j++)
102 for(
unsigned int i=0; i<11; i++)
104 for(
unsigned int j=0; j<11; j++)
111 std::cerr<<std::endl;
119 for(
unsigned int i=0; i<11; i++)
121 for(
unsigned int j=0; j<11; j++)
124 if (rdma.domain().isInside(p) )
130 std::cerr<<std::endl;
137 trace.
info() <<
"(" << nbok <<
"/" << nb <<
") "
138 <<
"true == true" << std::endl;
142 for (
auto const & pt :
domain )
145 const Image::Value b = rdma.domain().isInside(pt) ? rdma(pt) : 0;
161 int main(
int argc,
char** argv )
165 for (
int i = 0; i < argc; ++i )
176 trace.
emphase() << ( res ?
"Passed." :
"Error." ) << endl;
Aim: A container class for storing sets of digital points within some given domain.
Aim: Constructs a domain limited to the given digital set.
Aim: implements weighted separable l_p metrics with exact predicates.
Aim: implements association bewteen points lying in a digital domain and values.
Aim: Implementation of the linear in time Power map construction.
void beginBlock(const std::string &keyword="")
T power(const T &aVal, const unsigned int exponent)
DGtal is the top-level namespace which contains all DGtal functions and types.
bool isEqual(Container1 &c1, Container2 &c2)