Changeset 6cb1cd for src/Fragmentation


Ignore:
Timestamp:
Sep 12, 2016, 2:03:15 PM (8 years ago)
Author:
Frederik Heber <heber@…>
Branches:
Action_Thermostats, Add_AtomRandomPerturbation, Add_FitFragmentPartialChargesAction, Add_RotateAroundBondAction, Add_SelectAtomByNameAction, Adding_Graph_to_ChangeBondActions, Adding_MD_integration_tests, Adding_StructOpt_integration_tests, Automaking_mpqc_open, AutomationFragmentation_failures, Candidate_v1.5.4, Candidate_v1.6.0, Candidate_v1.6.1, ChangeBugEmailaddress, ChangingTestPorts, ChemicalSpaceEvaluator, 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_ChargeSampling_PBC, Fix_ChronosMutex, Fix_FitPartialCharges, Fix_FitPotential_needs_atomicnumbers, Fix_ForceAnnealing, Fix_IndependentFragmentGrids, Fix_ParseParticles, Fix_ParseParticles_split_forward_backward_Actions, Fix_StatusMsg, Fix_StepWorldTime_single_argument, Fix_Verbose_Codepatterns, ForceAnnealing_goodresults, ForceAnnealing_oldresults, ForceAnnealing_tocheck, ForceAnnealing_with_BondGraph, ForceAnnealing_with_BondGraph_continued, ForceAnnealing_with_BondGraph_continued_betteresults, ForceAnnealing_with_BondGraph_contraction-expansion, GeometryObjects, Gui_displays_atomic_force_velocity, IndependentFragmentGrids, IndependentFragmentGrids_IndividualZeroInstances, IndependentFragmentGrids_IntegrationTest, IndependentFragmentGrids_Sole_NN_Calculation, JobMarket_RobustOnKillsSegFaults, JobMarket_StableWorkerPool, JobMarket_unresolvable_hostname_fix, ODR_violation_mpqc_open, PartialCharges_OrthogonalSummation, PythonUI_with_named_parameters, QtGui_reactivate_TimeChanged_changes, Recreated_GuiChecks, RotateToPrincipalAxisSystem_UndoRedo, SaturateAtoms_findBestMatching, StoppableMakroAction, Subpackage_CodePatterns, Subpackage_JobMarket, Subpackage_LinearAlgebra, Subpackage_levmar, Subpackage_mpqc_open, Subpackage_vmg, ThirdParty_MPQC_rebuilt_buildsystem, TrajectoryDependenant_MaxOrder, TremoloParser_IncreasedPrecision, TremoloParser_MultipleTimesteps, Ubuntu_1604_changes, stable
Children:
7e81ca
Parents:
0c42f2
git-author:
Frederik Heber <heber@…> (05/10/16 20:35:20)
git-committer:
Frederik Heber <heber@…> (09/12/16 14:03:15)
Message:

Removing SphericalPointDistribution::getSimplePolygon() to allow for easy rebasing of very old branch on top.

Location:
src/Fragmentation/Exporters
Files:
2 edited

Legend:

Unmodified
Added
Removed
  • src/Fragmentation/Exporters/SphericalPointDistribution.cpp

    r0c42f2 r6cb1cd  
    308308      }
    309309    }
     310    LOG(3, "INFO: (x,y,z) angles are" << angles);
    310311    const Line RotationAxis(zeroVec, newCenter);
    311312    const double RotationAngle =
    312313        newCenter.Angle(remainingold[0])
    313314        - newCenter.Angle(remainingnew[*MCS.bestmatching.begin()]);
     315    LOG(3, "INFO: Rotate around self is " << RotationAngle
     316        << " around axis " << RotationAxis);
    314317
    315318    // rotate _newpolygon
    316319    SphericalPointDistribution::Polygon_t rotated_newpolygon =
    317320        rotatePolygon(_newpolygon, angles, RotationAxis, RotationAngle);
     321    LOG(3, "INFO: Rotated new polygon is " << rotated_newpolygon);
    318322
    319323    // remove all returnpolygon in matching and return remaining ones
     
    322326    return _newpolygon;
    323327}
    324 
    325 SphericalPointDistribution::Polygon_t
    326 SphericalPointDistribution::getSimplePolygon(const int _NumberOfPoints) const
    327 {
    328   Polygon_t returnpolygon;
    329 
    330         switch (_NumberOfPoints)
    331         {
    332           case 0:
    333             returnpolygon = get<0>();
    334             break;
    335           case 1:
    336             returnpolygon = get<1>();
    337             break;
    338           case 2:
    339             returnpolygon = get<2>();
    340             break;
    341           case 3:
    342             returnpolygon = get<3>();
    343             break;
    344           case 4:
    345             returnpolygon = get<4>();
    346             break;
    347           case 5:
    348             returnpolygon = get<5>();
    349             break;
    350           case 6:
    351             returnpolygon = get<6>();
    352             break;
    353           case 7:
    354             returnpolygon = get<7>();
    355             break;
    356           case 8:
    357             returnpolygon = get<8>();
    358             break;
    359           case 9:
    360             returnpolygon = get<9>();
    361             break;
    362           case 10:
    363             returnpolygon = get<10>();
    364             break;
    365           case 11:
    366             returnpolygon = get<11>();
    367             break;
    368           case 12:
    369             returnpolygon = get<12>();
    370             break;
    371           case 14:
    372             returnpolygon = get<14>();
    373             break;
    374           default:
    375             ASSERT(0, "SphericalPointDistribution::initSelf() - cannot deal with the case "
    376                 +toString(_NumberOfPoints)+".");
    377         }
    378 
    379         return returnpolygon;
    380 }
    381 
  • src/Fragmentation/Exporters/SphericalPointDistribution.hpp

    r0c42f2 r6cb1cd  
    5757  }
    5858
    59   /** Initializes the polygon with the given \a _NumberOfPoints.
    60    *
    61    * \param _NumberOfPoints number of points
    62    */
    63   Polygon_t getSimplePolygon(const int _NumberOfPoints) const;
    64 
    6559  /** Matches a given spherical distribution with another containing more
    6660   * points.
Note: See TracChangeset for help on using the changeset viewer.