source: src/LinearAlgebra/unittests/PlaneUnitTest.cpp@ 06aedc

Action_Thermostats Add_AtomRandomPerturbation Add_FitFragmentPartialChargesAction Add_RotateAroundBondAction Add_SelectAtomByNameAction Added_ParseSaveFragmentResults AddingActions_SaveParseParticleParameters Adding_Graph_to_ChangeBondActions Adding_MD_integration_tests Adding_ParticleName_to_Atom Adding_StructOpt_integration_tests AtomFragments Automaking_mpqc_open AutomationFragmentation_failures Candidate_v1.5.4 Candidate_v1.6.0 Candidate_v1.6.1 ChangeBugEmailaddress ChangingTestPorts ChemicalSpaceEvaluator CombiningParticlePotentialParsing Combining_Subpackages Debian_Package_split Debian_package_split_molecuildergui_only Disabling_MemDebug Docu_Python_wait EmpiricalPotential_contain_HomologyGraph EmpiricalPotential_contain_HomologyGraph_documentation Enable_parallel_make_install Enhance_userguide Enhanced_StructuralOptimization Enhanced_StructuralOptimization_continued Example_ManyWaysToTranslateAtom Exclude_Hydrogens_annealWithBondGraph FitPartialCharges_GlobalError Fix_BoundInBox_CenterInBox_MoleculeActions Fix_ChargeSampling_PBC Fix_ChronosMutex Fix_FitPartialCharges Fix_FitPotential_needs_atomicnumbers Fix_ForceAnnealing Fix_IndependentFragmentGrids Fix_ParseParticles Fix_ParseParticles_split_forward_backward_Actions Fix_PopActions Fix_QtFragmentList_sorted_selection Fix_Restrictedkeyset_FragmentMolecule Fix_StatusMsg Fix_StepWorldTime_single_argument Fix_Verbose_Codepatterns Fix_fitting_potentials Fixes ForceAnnealing_goodresults ForceAnnealing_oldresults ForceAnnealing_tocheck ForceAnnealing_with_BondGraph ForceAnnealing_with_BondGraph_continued ForceAnnealing_with_BondGraph_continued_betteresults ForceAnnealing_with_BondGraph_contraction-expansion FragmentAction_writes_AtomFragments FragmentMolecule_checks_bonddegrees GeometryObjects Gui_Fixes Gui_displays_atomic_force_velocity ImplicitCharges IndependentFragmentGrids IndependentFragmentGrids_IndividualZeroInstances IndependentFragmentGrids_IntegrationTest IndependentFragmentGrids_Sole_NN_Calculation JobMarket_RobustOnKillsSegFaults JobMarket_StableWorkerPool JobMarket_unresolvable_hostname_fix MoreRobust_FragmentAutomation ODR_violation_mpqc_open PartialCharges_OrthogonalSummation PdbParser_setsAtomName PythonUI_with_named_parameters QtGui_reactivate_TimeChanged_changes Recreated_GuiChecks Rewrite_FitPartialCharges RotateToPrincipalAxisSystem_UndoRedo SaturateAtoms_findBestMatching SaturateAtoms_singleDegree StoppableMakroAction Subpackage_CodePatterns Subpackage_JobMarket Subpackage_LinearAlgebra Subpackage_levmar Subpackage_mpqc_open Subpackage_vmg Switchable_LogView ThirdParty_MPQC_rebuilt_buildsystem TrajectoryDependenant_MaxOrder TremoloParser_IncreasedPrecision TremoloParser_MultipleTimesteps TremoloParser_setsAtomName Ubuntu_1604_changes stable
Last change on this file since 06aedc was 9b410d, checked in by Frederik Heber <heber@…>, 14 years ago

Replace MYEPSILON in LinearAlgebra/ by LINALG_MYEPSILON.

  • this is preparatory for external use lib libmolecuilderLinearAlgebra.
  • new file LinearAlgebra/defs.hpp.
  • Property mode set to 100644
File size: 7.7 KB
Line 
1/*
2 * Project: MoleCuilder
3 * Description: creates and alters molecular systems
4 * Copyright (C) 2010 University of Bonn. All rights reserved.
5 * Please see the LICENSE file or "Copyright notice" in builder.cpp for details.
6 */
7
8/*
9 * PlaneUnittest.cpp
10 *
11 * Created on: Apr 30, 2010
12 * Author: crueger
13 */
14
15// include config.h
16#ifdef HAVE_CONFIG_H
17#include <config.h>
18#endif
19
20#include <cppunit/CompilerOutputter.h>
21#include <cppunit/extensions/TestFactoryRegistry.h>
22#include <cppunit/ui/text/TestRunner.h>
23
24#include <cmath>
25#include <limits>
26
27#include "LinearAlgebra/defs.hpp"
28#include "LinearAlgebra/Line.hpp"
29#include "LinearAlgebra/Vector.hpp"
30
31#include "PlaneUnitTest.hpp"
32
33#ifdef HAVE_TESTRUNNER
34#include "UnitTestMain.hpp"
35#endif /*HAVE_TESTRUNNER*/
36
37CPPUNIT_TEST_SUITE_REGISTRATION( PlaneUnittest );
38
39void PlaneUnittest::setUp(){
40 p1 = new Plane(unitVec[0],unitVec[1],unitVec[2]);
41 p2 = new Plane(unitVec[0],unitVec[1],zeroVec);
42 p3 = new Plane(unitVec[0],zeroVec,unitVec[2]);
43 p4 = new Plane(zeroVec,unitVec[1],unitVec[2]);
44}
45
46void PlaneUnittest::tearDown(){
47 delete p1;
48 delete p2;
49 delete p3;
50 delete p4;
51}
52
53void PlaneUnittest::constructionErrorTest(){
54 // try several method of construction..
55 // see if error checking works
56
57 // three points
58 CPPUNIT_ASSERT_NO_THROW(Plane(unitVec[0],unitVec[1],unitVec[2]));
59 // when only two points are differnt this gives an error
60 CPPUNIT_ASSERT_THROW(Plane(unitVec[0],unitVec[1],unitVec[1]),LinearDependenceException);
61 // same with only one point
62 CPPUNIT_ASSERT_THROW(Plane(unitVec[0],unitVec[0],unitVec[0]),LinearDependenceException);
63
64 // use two vector giving two directions
65 CPPUNIT_ASSERT_NO_THROW(Plane(unitVec[0],unitVec[1],0));
66 // and again this is actually only one vector
67 CPPUNIT_ASSERT_THROW(Plane(unitVec[0],unitVec[0],0),LinearDependenceException);
68 // Zero vector does not give a good direction
69 CPPUNIT_ASSERT_THROW(Plane(unitVec[0],zeroVec,0),ZeroVectorException);
70
71 // use a normalvector and an scalar offset
72 CPPUNIT_ASSERT_NO_THROW(Plane(unitVec[0],0));
73 // The zero vector is no good as a normalvector
74 CPPUNIT_ASSERT_THROW(Plane(zeroVec,0),ZeroVectorException);
75
76 // use a normalvector and an offset vector
77 CPPUNIT_ASSERT_NO_THROW(Plane(unitVec[0],zeroVec));
78 // and the bad zeroVector again
79 CPPUNIT_ASSERT_THROW(Plane(zeroVec,zeroVec),ZeroVectorException);
80}
81
82
83// we need to test normals independent of the direction
84bool testNormal(const Vector &normal1, const Vector &normal2){
85 return (normal1==normal2) || (normal1==-1*normal2);
86}
87
88void PlaneUnittest::constructionResultTest(){
89 {
90 // construct with three points on plane
91 Plane p1(unitVec[0],unitVec[1],zeroVec);
92 CPPUNIT_ASSERT(testNormal(unitVec[2],p1.getNormal()));
93 CPPUNIT_ASSERT_EQUAL(0.,p1.getOffset());
94
95 Plane p2(unitVec[0],unitVec[2],zeroVec);
96 CPPUNIT_ASSERT(testNormal(unitVec[1],p2.getNormal()));
97 CPPUNIT_ASSERT_EQUAL(0.,p2.getOffset());
98
99 Plane p3(unitVec[1],unitVec[2],zeroVec);
100 CPPUNIT_ASSERT(testNormal(unitVec[0],p3.getNormal()));
101 CPPUNIT_ASSERT_EQUAL(0.,p3.getOffset());
102 }
103 {
104 // construct with two directions + offset
105 Plane p1(unitVec[0],unitVec[1],0);
106 CPPUNIT_ASSERT(testNormal(unitVec[2],p1.getNormal()));
107 CPPUNIT_ASSERT_EQUAL(0.,p1.getOffset());
108
109 Plane p2(unitVec[0],unitVec[2],0);
110 CPPUNIT_ASSERT(testNormal(unitVec[1],p2.getNormal()));
111 CPPUNIT_ASSERT_EQUAL(0.,p2.getOffset());
112
113 Plane p3(unitVec[1],unitVec[2],0);
114 CPPUNIT_ASSERT(testNormal(unitVec[0],p3.getNormal()));
115 CPPUNIT_ASSERT_EQUAL(0.,p3.getOffset());
116 }
117}
118
119void PlaneUnittest::pointsTest(){
120 std::vector<Vector> points1 = p1->getPointsOnPlane();
121 CPPUNIT_ASSERT(p1->isContained(points1[0]));
122 CPPUNIT_ASSERT(p1->isContained(points1[1]));
123 CPPUNIT_ASSERT(p1->isContained(points1[2]));
124 // check that the three points differ
125 CPPUNIT_ASSERT(points1[0]!=points1[1]);
126 CPPUNIT_ASSERT(points1[0]!=points1[2]);
127 CPPUNIT_ASSERT(points1[1]!=points1[2]);
128
129
130 std::vector<Vector> points2 = p2->getPointsOnPlane();
131 CPPUNIT_ASSERT(p2->isContained(points2[0]));
132 CPPUNIT_ASSERT(p2->isContained(points2[1]));
133 CPPUNIT_ASSERT(p2->isContained(points2[2]));
134 // check that the three points differ
135 CPPUNIT_ASSERT(points2[0]!=points2[1]);
136 CPPUNIT_ASSERT(points2[0]!=points2[2]);
137 CPPUNIT_ASSERT(points2[1]!=points2[2]);
138
139 std::vector<Vector> points3 = p3->getPointsOnPlane();
140 CPPUNIT_ASSERT(p3->isContained(points3[0]));
141 CPPUNIT_ASSERT(p3->isContained(points3[1]));
142 CPPUNIT_ASSERT(p3->isContained(points3[2]));
143 // check that the three points differ
144 CPPUNIT_ASSERT(points3[0]!=points3[1]);
145 CPPUNIT_ASSERT(points3[0]!=points3[2]);
146 CPPUNIT_ASSERT(points3[1]!=points3[2]);
147
148 std::vector<Vector> points4 = p4->getPointsOnPlane();
149 CPPUNIT_ASSERT(p4->isContained(points4[0]));
150 CPPUNIT_ASSERT(p4->isContained(points4[1]));
151 CPPUNIT_ASSERT(p4->isContained(points4[2]));
152 // check that the three points differ
153 CPPUNIT_ASSERT(points4[0]!=points4[1]);
154 CPPUNIT_ASSERT(points4[0]!=points4[2]);
155 CPPUNIT_ASSERT(points4[1]!=points4[2]);
156}
157
158
159void PlaneUnittest::operationsTest(){
160 {
161 Vector t = (1./3.)*(unitVec[0]+unitVec[1]+unitVec[2]);
162 CPPUNIT_ASSERT(fabs(p1->distance(zeroVec)-t.Norm()) <= LINALG_MYEPSILON);
163 CPPUNIT_ASSERT_EQUAL(t,p1->getClosestPoint(zeroVec));
164 }
165
166 CPPUNIT_ASSERT(fabs(p2->distance(unitVec[2])-1) <= LINALG_MYEPSILON);
167 CPPUNIT_ASSERT_EQUAL(zeroVec,p2->getClosestPoint(unitVec[2]));
168 CPPUNIT_ASSERT(fabs(p3->distance(unitVec[1])-1) <= LINALG_MYEPSILON);
169 CPPUNIT_ASSERT_EQUAL(zeroVec,p3->getClosestPoint(unitVec[1]));
170 CPPUNIT_ASSERT(fabs(p4->distance(unitVec[0])-1) <= LINALG_MYEPSILON);
171 CPPUNIT_ASSERT_EQUAL(zeroVec,p4->getClosestPoint(unitVec[0]));
172}
173
174void PlaneUnittest::mirrorTest(){
175 Vector fixture;
176
177 // some Vectors that lie on the planes
178 fixture = p1->mirrorVector(unitVec[0]);
179 CPPUNIT_ASSERT_EQUAL(fixture,unitVec[0]);
180 fixture = p1->mirrorVector(unitVec[1]);
181 CPPUNIT_ASSERT_EQUAL(fixture,unitVec[1]);
182 fixture = p1->mirrorVector(unitVec[2]);
183 CPPUNIT_ASSERT_EQUAL(fixture,unitVec[2]);
184
185 fixture = p2->mirrorVector(zeroVec);
186 CPPUNIT_ASSERT_EQUAL(fixture,zeroVec);
187 fixture = p2->mirrorVector(unitVec[0]);
188 CPPUNIT_ASSERT_EQUAL(fixture,unitVec[0]);
189 fixture = p2->mirrorVector(unitVec[1]);
190 CPPUNIT_ASSERT_EQUAL(fixture,unitVec[1]);
191
192 fixture = p3->mirrorVector(zeroVec);
193 CPPUNIT_ASSERT_EQUAL(fixture,zeroVec);
194 fixture = p3->mirrorVector(unitVec[0]);
195 CPPUNIT_ASSERT_EQUAL(fixture,unitVec[0]);
196 fixture = p3->mirrorVector(unitVec[2]);
197 CPPUNIT_ASSERT_EQUAL(fixture,unitVec[2]);
198
199 fixture = p4->mirrorVector(zeroVec);
200 CPPUNIT_ASSERT_EQUAL(fixture,zeroVec);
201 fixture = p4->mirrorVector(unitVec[1]);
202 CPPUNIT_ASSERT_EQUAL(fixture,unitVec[1]);
203 fixture = p4->mirrorVector(unitVec[2]);
204 CPPUNIT_ASSERT_EQUAL(fixture,unitVec[2]);
205
206 // some Vectors outside of the planes
207 {
208 Vector t = (2./3.)*(unitVec[0]+unitVec[1]+unitVec[2]);
209 fixture = p1->mirrorVector(zeroVec);
210 CPPUNIT_ASSERT_EQUAL(fixture,t);
211 }
212
213 fixture = p2->mirrorVector(unitVec[2]);
214 CPPUNIT_ASSERT_EQUAL(fixture,-1*unitVec[2]);
215 fixture = p3->mirrorVector(unitVec[1]);
216 CPPUNIT_ASSERT_EQUAL(fixture,-1*unitVec[1]);
217 fixture = p4->mirrorVector(unitVec[0]);
218 CPPUNIT_ASSERT_EQUAL(fixture,-1*unitVec[0]);
219}
220
221void PlaneUnittest::LineIntersectionTest(){
222 Vector fixture;
223 // plane at (0,0,0) normal to (1,0,0) cuts line from (0,0,0) to (2,1,0) at ???
224 Line l1 = makeLineThrough(zeroVec,Vector(2,1,0));
225 CPPUNIT_ASSERT_NO_THROW(fixture = Plane(unitVec[0], zeroVec).GetIntersection(l1) );
226 CPPUNIT_ASSERT_EQUAL( zeroVec, fixture );
227
228 // plane at (2,1,0) normal to (0,1,0) cuts line from (1,0,0) to (0,1,1) at ???
229 Line l2 = makeLineThrough(unitVec[0],Vector(0,1,1));
230 CPPUNIT_ASSERT_NO_THROW(fixture = Plane(unitVec[1], Vector(2,1,0)).GetIntersection(l2) );
231 CPPUNIT_ASSERT_EQUAL( Vector(0., 1., 1.), fixture );
232}
Note: See TracBrowser for help on using the repository browser.