testFullConvexity.cpp File Reference

#include <iostream>
#include <vector>
#include <algorithm>
#include "DGtal/base/Common.h"
#include "DGtal/kernel/SpaceND.h"
#include "DGtal/kernel/domains/HyperRectDomain.h"
#include "DGtal/kernel/sets/DigitalSetBySTLSet.h"
#include "DGtal/topology/KhalimskySpaceND.h"
#include "DGtal/geometry/volumes/CellGeometry.h"
#include "DGtal/geometry/volumes/DigitalConvexity.h"
#include "DGtal/shapes/Shapes.h"
#include "DGtalCatch.h"

Include dependency graph for testFullConvexity.cpp:

Go to the source code of this file.

Functions
	SCENARIO ("DigitalConvexity< Z2 > full convexity tests", "[digital_convexity][2d][full_convexity]")
	SCENARIO ("FullConvexity< Z3 > full convexity tests", "[full_convexity][3d]")
	SCENARIO ("DigitalConvexity< Z2 > ball tests", "[digital_convexity][2d]")
	SCENARIO ("DigitalConvexity< Z3 > ball tests", "[digital_convexity][3d]")
	SCENARIO ("DigitalConvexity< Z4 > ball tests", "[digital_convexity][4d]")

Detailed Description

This program is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.

This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.

You should have received a copy of the GNU General Public License along with this program. If not, see http://www.gnu.org/licenses/.

Author

Jacques-Olivier Lachaud (jacqu.nosp@m.es-o.nosp@m.livie.nosp@m.r.la.nosp@m.chaud.nosp@m.@uni.nosp@m.v-sav.nosp@m.oie..nosp@m.fr ) Laboratory of Mathematics (CNRS, UMR 5127), University of Savoie, France

Date

2020/02/01

Functions for testing full convexity.

This file is part of the DGtal library.

Definition in file testFullConvexity.cpp.

Function Documentation

SCENARIO() [1/5]

SCENARIO	(	"DigitalConvexity< Z2 > ball tests"	,
		""	[digital_convexity][2d] )

Definition at line 99 of file testFullConvexity.cpp.

{
  GIVEN( "Given a 2D digital ball of radius 5 " ) {
    typedef KhalimskySpaceND<2,int>          KSpace;
    typedef KSpace::Point                    Point;
    typedef KSpace::Space                    Space;
    typedef DigitalConvexity< KSpace >       DConvexity;
    typedef HyperRectDomain< Space >         Domain;
    typedef DigitalSetBySTLSet< Domain >     DigitalSet;
    
    Point      lo = Point::diagonal( -7 );
    Point      hi = Point::diagonal(  7 );
    Point      c  = Point::zero;
    Domain     domain( lo, hi );
    DConvexity dconv ( lo, hi );
    DigitalSet ball  ( domain );
    Shapes< Domain >::addNorm2Ball( ball, c, 5 );
    std::vector<Point> V( ball.begin(), ball.end() );
    bool cvx0 = dconv.is0Convex( V );
    bool fcvx = dconv.isFullyConvex( V );
    THEN( "It is a 0-convex and fully convex set by morphological characterization" ) {
      REQUIRE( cvx0 );
      REQUIRE( fcvx );
    }
  }
}

References DGtal::Shapes< TDomain >::addNorm2Ball(), DGtal::DigitalSetByAssociativeContainer< TDomain, TContainer >::begin(), domain, DGtal::DigitalSetByAssociativeContainer< TDomain, TContainer >::end(), GIVEN(), DGtal::DigitalConvexity< TKSpace >::is0Convex(), DGtal::DigitalConvexity< TKSpace >::isFullyConvex(), and REQUIRE().

SCENARIO() [2/5]

SCENARIO	(	"DigitalConvexity< Z2 > full convexity tests"	,
		""	[digital_convexity][2d][full_convexity] )

Definition at line 53 of file testFullConvexity.cpp.

{
  typedef KhalimskySpaceND<2,int>          KSpace;
  typedef KSpace::Point                    Point;
  typedef DigitalConvexity< KSpace >       DConvexity;
 
  DConvexity dconv( Point( -5, -5 ), Point( 10, 10 ) );
 
  std::vector<Point> V1 = { Point(0,0), Point(-1,0), Point(1,0), Point(0,1) };
  REQUIRE( dconv.isFullyConvex( V1 ) );
  std::vector<Point> V2 = { Point(-1,0), Point(1,0), Point(0,1) };
  REQUIRE( ! dconv.isFullyConvex( V2 ) );
  std::vector<Point> V3 = { Point(0,0), Point(-1,0), Point(1,0) };
  REQUIRE( dconv.isFullyConvex( V3 ) );
  std::vector<Point> V4 = { Point(0,0), Point(-1,0), Point(1,0), Point(0,1),
    Point(0,-1) };
  REQUIRE( dconv.isFullyConvex( V4 ) );
  std::vector<Point> V5 = { Point(-1,0), Point(1,0), Point(0,1), Point(0,-1) };
  REQUIRE( ! dconv.isFullyConvex( V5 ) );
}

References DGtal::DigitalConvexity< TKSpace >::isFullyConvex(), and REQUIRE().

SCENARIO() [3/5]

SCENARIO	(	"DigitalConvexity< Z3 > ball tests"	,
		""	[digital_convexity][3d] )

Definition at line 126 of file testFullConvexity.cpp.

{
  GIVEN( "Given a 3D digital ball of radius 5 " ) {
    typedef KhalimskySpaceND<3,int>          KSpace;
    typedef KSpace::Point                    Point;
    typedef KSpace::Space                    Space;
    typedef DigitalConvexity< KSpace >       DConvexity;
    typedef HyperRectDomain< Space >         Domain;
    typedef DigitalSetBySTLSet< Domain >     DigitalSet;
    
    Point      lo = Point::diagonal( -7 );
    Point      hi = Point::diagonal(  7 );
    Point      c  = Point::zero;
    Domain     domain( lo, hi );
    DConvexity dconv ( lo, hi );
    DigitalSet ball  ( domain );
    Shapes< Domain >::addNorm2Ball( ball, c, 5 );
    std::vector<Point> V( ball.begin(), ball.end() );
    bool cvx0 = dconv.is0Convex( V );
    bool fcvx = dconv.isFullyConvex( V );
    THEN( "It is a 0-convex and fully convex set by morphological characterization" ) {
      REQUIRE( cvx0 );
      REQUIRE( fcvx );
    }
  }
}

References DGtal::Shapes< TDomain >::addNorm2Ball(), DGtal::DigitalSetByAssociativeContainer< TDomain, TContainer >::begin(), domain, DGtal::DigitalSetByAssociativeContainer< TDomain, TContainer >::end(), GIVEN(), DGtal::DigitalConvexity< TKSpace >::is0Convex(), DGtal::DigitalConvexity< TKSpace >::isFullyConvex(), and REQUIRE().

SCENARIO() [4/5]

SCENARIO	(	"DigitalConvexity< Z4 > ball tests"	,
		""	[digital_convexity][4d] )

[nD-full-convexity]

[nD-full-convexity]

Definition at line 153 of file testFullConvexity.cpp.

{
  GIVEN( "Given a 4D digital ball of radius 5 " ) {
    typedef KhalimskySpaceND<4,int>          KSpace;
    typedef KSpace::Point                    Point;
    typedef KSpace::Space                    Space;
    typedef DigitalConvexity< KSpace >       DConvexity;
    typedef HyperRectDomain< Space >         Domain;
    typedef DigitalSetBySTLSet< Domain >     DigitalSet;
    
    Point      lo = Point::diagonal( -7 );
    Point      hi = Point::diagonal(  7 );
    Point      c  = Point::zero;
    Domain     domain( lo, hi );
    DConvexity dconv ( lo, hi );
    DigitalSet ball  ( domain );
    Shapes< Domain >::addNorm2Ball( ball, c, 5 );
    std::vector<Point> V( ball.begin(), ball.end() );
    bool cvx0 = dconv.is0Convex( V );     // checks digital 0-convexity
    bool fcvx = dconv.isFullyConvex( V ); // checks full convexity
    THEN( "It is a 0-convex and fully convex set by morphological characterization" ) {
      REQUIRE( cvx0 );
      REQUIRE( fcvx );
    }
  }
}

References DGtal::Shapes< TDomain >::addNorm2Ball(), DGtal::DigitalSetByAssociativeContainer< TDomain, TContainer >::begin(), domain, DGtal::DigitalSetByAssociativeContainer< TDomain, TContainer >::end(), GIVEN(), DGtal::DigitalConvexity< TKSpace >::is0Convex(), DGtal::DigitalConvexity< TKSpace >::isFullyConvex(), and REQUIRE().

SCENARIO() [5/5]

SCENARIO	(	"FullConvexity< Z3 > full convexity tests"	,
		""	[full_convexity][3d] )

Definition at line 74 of file testFullConvexity.cpp.

{
  typedef KhalimskySpaceND<3,int>          KSpace;
  typedef KSpace::Point                    Point;
  typedef DigitalConvexity< KSpace >       DConvexity;
 
  DConvexity dconv( Point( -5, -5, -5 ), Point( 10, 10, 10 ) );
  Point a( 0, 2, 3 );
  Point b( 3, 1, 0 );
  Point c( 2, 0, 1 );
  Point d( 2, 1, 2 );
  std::vector< Point > X;
  REQUIRE( dconv.isSimplexFullDimensional( { a, b, c, d } ) );
  auto tetra= dconv.makeSimplex( { a, b, c, d } );
  tetra.getPoints( X );
  bool cvx0 = dconv.isKConvex( tetra, 0 );
  bool cvx1 = dconv.isKConvex( tetra, 1 );
  bool cvx2 = dconv.isKConvex( tetra, 2 );
  bool cvx3 = dconv.isKConvex( tetra, 3 );
  bool cvxf = dconv.isFullyConvex( tetra );
  bool cvxg = dconv.isFullyConvex( X, false );
  REQUIRE( cvxf == cvxg );
  REQUIRE( ( cvx0 && cvx1 && cvx2 && cvx3 ) == cvxf );
}

References DGtal::BoundedLatticePolytope< TSpace >::getPoints(), DGtal::DigitalConvexity< TKSpace >::isFullyConvex(), DGtal::DigitalConvexity< TKSpace >::isKConvex(), DGtal::DigitalConvexity< TKSpace >::isSimplexFullDimensional(), DGtal::DigitalConvexity< TKSpace >::makeSimplex(), and REQUIRE().