DGtal
1.2.0
|
#include <iostream>
#include <vector>
#include <algorithm>
#include "DGtal/base/Common.h"
#include "DGtal/kernel/SpaceND.h"
#include "DGtal/topology/KhalimskySpaceND.h"
#include "DGtal/geometry/volumes/CellGeometry.h"
#include "DGtal/geometry/volumes/DigitalConvexity.h"
#include "DGtalCatch.h"
Go to the source code of this file.
Functions | |
SCENARIO ("DigitalConvexity< Z2 > unit tests", "[digital_convexity][2d]") | |
SCENARIO ("DigitalConvexity< Z2 > fully convex triangles", "[convex_simplices][2d]") | |
SCENARIO ("DigitalConvexity< Z3 > fully convex tetrahedra", "[convex_simplices][3d]") | |
SCENARIO ("DigitalConvexity< Z3 > rational fully convex tetrahedra", "[convex_simplices][3d][rational]") | |
SCENARIO ("DigitalConvexity< Z2 > rational fully convex tetrahedra", "[convex_simplices][2d][rational]") | |
SCENARIO ("DigitalConvexity< Z3 > full subconvexity of segments and triangles", "[subconvexity][3d]") | |
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/.
Functions for testing class CellGeometry.
This file is part of the DGtal library.
Definition in file testDigitalConvexity.cpp.
SCENARIO | ( | "DigitalConvexity< Z2 > fully convex triangles" | , |
"" | [convex_simplices][2d] | ||
) |
Definition at line 113 of file testDigitalConvexity.cpp.
SCENARIO | ( | "DigitalConvexity< Z2 > rational fully convex tetrahedra" | , |
"" | [convex_simplices][2d][rational] | ||
) |
Definition at line 352 of file testDigitalConvexity.cpp.
SCENARIO | ( | "DigitalConvexity< Z2 > unit tests" | , |
"" | [digital_convexity][2d] | ||
) |
Definition at line 50 of file testDigitalConvexity.cpp.
SCENARIO | ( | "DigitalConvexity< Z3 > full subconvexity of segments and triangles" | , |
"" | [subconvexity][3d] | ||
) |
Definition at line 408 of file testDigitalConvexity.cpp.
References domain, DGtal::Trace::info(), REQUIRE(), and DGtal::trace.
SCENARIO | ( | "DigitalConvexity< Z3 > fully convex tetrahedra" | , |
"" | [convex_simplices][3d] | ||
) |
Definition at line 193 of file testDigitalConvexity.cpp.
SCENARIO | ( | "DigitalConvexity< Z3 > rational fully convex tetrahedra" | , |
"" | [convex_simplices][3d][rational] | ||
) |
Definition at line 289 of file testDigitalConvexity.cpp.