1 | /*
|
---|
2 | * Project: MoleCuilder
|
---|
3 | * Description: creates and alters molecular systems
|
---|
4 | * Copyright (C) 2010-2012 University of Bonn. All rights reserved.
|
---|
5 | * Please see the LICENSE file or "Copyright notice" in builder.cpp for details.
|
---|
6 | */
|
---|
7 |
|
---|
8 | /*
|
---|
9 | * Tesselation_InsideOutsideUnitTest.cpp
|
---|
10 | *
|
---|
11 | * Created on: Dec 28, 2009
|
---|
12 | * Author: heber
|
---|
13 | */
|
---|
14 |
|
---|
15 | // include config.h
|
---|
16 | #ifdef HAVE_CONFIG_H
|
---|
17 | #include <config.h>
|
---|
18 | #endif
|
---|
19 |
|
---|
20 | using namespace std;
|
---|
21 |
|
---|
22 | #include <cppunit/CompilerOutputter.h>
|
---|
23 | #include <cppunit/extensions/TestFactoryRegistry.h>
|
---|
24 | #include <cppunit/ui/text/TestRunner.h>
|
---|
25 |
|
---|
26 | #include <cstring>
|
---|
27 | #include <iostream>
|
---|
28 |
|
---|
29 | #include "Atom/TesselPoint.hpp"
|
---|
30 | #include "CodePatterns/Log.hpp"
|
---|
31 | #include "Helpers/defs.hpp"
|
---|
32 | #include "LinkedCell/PointCloudAdaptor.hpp"
|
---|
33 | #include "Tesselation/BoundaryLineSet.hpp"
|
---|
34 | #include "Tesselation/BoundaryTriangleSet.hpp"
|
---|
35 | #include "Tesselation/CandidateForTesselation.hpp"
|
---|
36 | #include "Tesselation/tesselation.hpp"
|
---|
37 |
|
---|
38 | #include "Tesselation_InsideOutsideUnitTest.hpp"
|
---|
39 |
|
---|
40 | #ifdef HAVE_TESTRUNNER
|
---|
41 | #include "UnitTestMain.hpp"
|
---|
42 | #endif /*HAVE_TESTRUNNER*/
|
---|
43 |
|
---|
44 | const double TesselationInOutsideTest::SPHERERADIUS=2.;
|
---|
45 |
|
---|
46 | /********************************************** Test classes **************************************/
|
---|
47 |
|
---|
48 | // Registers the fixture into the 'registry'
|
---|
49 | CPPUNIT_TEST_SUITE_REGISTRATION( TesselationInOutsideTest );
|
---|
50 |
|
---|
51 | void TesselationInOutsideTest::setUp()
|
---|
52 | {
|
---|
53 | setVerbosity(2);
|
---|
54 |
|
---|
55 | // create corners
|
---|
56 | class TesselPoint *Walker;
|
---|
57 | Walker = new TesselPoint;
|
---|
58 | Walker->setPosition(Vector(0., 0., 0.));
|
---|
59 | Walker->setName("1");
|
---|
60 | Walker->setNr(1);
|
---|
61 | Corners.push_back(Walker);
|
---|
62 | Walker = new TesselPoint;
|
---|
63 | Walker->setPosition(Vector(0., 1., 0.));
|
---|
64 | Walker->setName("2");
|
---|
65 | Walker->setNr(2);
|
---|
66 | Corners.push_back(Walker);
|
---|
67 | Walker = new TesselPoint;
|
---|
68 | Walker->setPosition(Vector(1., 0., 0.));
|
---|
69 | Walker->setName("3");
|
---|
70 | Walker->setNr(3);
|
---|
71 | Corners.push_back(Walker);
|
---|
72 | Walker = new TesselPoint;
|
---|
73 | Walker->setPosition(Vector(1., 1., 0.));
|
---|
74 | Walker->setName("4");
|
---|
75 | Walker->setNr(4);
|
---|
76 | Corners.push_back(Walker);
|
---|
77 | Walker = new TesselPoint;
|
---|
78 | Walker->setPosition(Vector(0., 0., 1.));
|
---|
79 | Walker->setName("5");
|
---|
80 | Walker->setNr(5);
|
---|
81 | Corners.push_back(Walker);
|
---|
82 | Walker = new TesselPoint;
|
---|
83 | Walker->setPosition(Vector(0., 1., 1.));
|
---|
84 | Walker->setName("6");
|
---|
85 | Walker->setNr(6);
|
---|
86 | Corners.push_back(Walker);
|
---|
87 | Walker = new TesselPoint;
|
---|
88 | Walker->setPosition(Vector(1., 0., 1.));
|
---|
89 | Walker->setName("7");
|
---|
90 | Walker->setNr(7);
|
---|
91 | Corners.push_back(Walker);
|
---|
92 | Walker = new TesselPoint;
|
---|
93 | Walker->setPosition(Vector(1., 1., 1.));
|
---|
94 | Walker->setName("8");
|
---|
95 | Walker->setNr(8);
|
---|
96 | Corners.push_back(Walker);
|
---|
97 |
|
---|
98 | // create LinkedCell
|
---|
99 | PointCloudAdaptor< TesselPointSTLList > cloud(&Corners, "TesselPointSTLList");
|
---|
100 | LinkedList = new LinkedCell_deprecated(cloud, 2.*SPHERERADIUS);
|
---|
101 |
|
---|
102 | // create tesselation
|
---|
103 | TesselStruct = new Tesselation;
|
---|
104 | (*TesselStruct)(cloud, SPHERERADIUS);
|
---|
105 | };
|
---|
106 |
|
---|
107 |
|
---|
108 | void TesselationInOutsideTest::tearDown()
|
---|
109 | {
|
---|
110 | delete LinkedList;
|
---|
111 | delete TesselStruct;
|
---|
112 | for (TesselPointSTLList::iterator Runner = Corners.begin(); Runner != Corners.end(); Runner++)
|
---|
113 | delete *Runner;
|
---|
114 | Corners.clear();
|
---|
115 | logger::purgeInstance();
|
---|
116 | errorLogger::purgeInstance();
|
---|
117 | };
|
---|
118 |
|
---|
119 | /** UnitTest for Tesselation::IsInnerPoint()
|
---|
120 | */
|
---|
121 | void TesselationInOutsideTest::IsInnerPointTest()
|
---|
122 | {
|
---|
123 | double n[3];
|
---|
124 | const double boundary = 2.;
|
---|
125 | const double step = 1.;
|
---|
126 |
|
---|
127 | // go through the mesh and check each point
|
---|
128 | for (n[0] = -boundary; n[0] <= boundary; n[0]+=step)
|
---|
129 | for (n[1] = -boundary; n[1] <= boundary; n[1]+=step)
|
---|
130 | for (n[2] = -boundary; n[2] <= boundary; n[2]+=step) {
|
---|
131 | if ( ((n[0] >= 0.) && (n[1] >= 0.) && (n[2] >= 0.)) && ((n[0] <= 1.) && (n[1] <= 1.) && (n[2] <= 1.)))
|
---|
132 | CPPUNIT_ASSERT_EQUAL( true , TesselStruct->IsInnerPoint(Vector(n[0], n[1], n[2]), LinkedList) );
|
---|
133 | else
|
---|
134 | CPPUNIT_ASSERT_EQUAL( false , TesselStruct->IsInnerPoint(Vector(n[0], n[1], n[2]), LinkedList) );
|
---|
135 | }
|
---|
136 | };
|
---|