- Timestamp:
- Aug 20, 2014, 1:06:16 PM (11 years ago)
- Children:
- ff72fb
- Parents:
- 0b517b
- git-author:
- Frederik Heber <heber@…> (07/12/14 19:07:44)
- git-committer:
- Frederik Heber <heber@…> (08/20/14 13:06:16)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
src/Fragmentation/Exporters/SphericalPointDistribution.hpp
r0b517b re6ca85 73 73 } 74 74 75 /** Matches a given spherical distribution with another containing more76 * points.75 /** Returns vacant spots to fill to get a complete spherical point distribution from 76 * given points \a _polygon, containing then \a _N in total. 77 77 * 78 78 * The idea is to produce a matching from all points in \a _polygon to those … … 86 86 * hydrogens. 87 87 * 88 * \param _polygon current occupied positions 89 * \param _newpolygon ideal distribution to match best with current occupied 90 * positions 91 * \return remaining vacant positions relative to \a _polygon 92 */ 93 static Polygon_t matchSphericalPointDistributions( 94 const WeightedPolygon_t &_polygon, 95 Polygon_t &_newpolygon 96 ); 88 * \param _polygon already filled places to match 89 * \param _N desired total number fo points 90 */ 91 Polygon_t getRemainingPoints(const WeightedPolygon_t &_polygon, const int _N); 97 92 98 93 //!> default radius of the spherical distribution … … 137 132 138 133 private: 134 //!> points for the ideal distribution 135 Polygon_t points; 136 //!> connection information between these ideal points 137 adjacency_t adjacency; 138 139 /** Initialize inner status (points and adjacency) to desired number of 140 * points. 141 * 142 * \param _N number of points 143 */ 144 void initSelf(const int _N); 145 146 private: 139 147 //!> grant unit tests access to private parts 140 148 friend class SphericalPointDistributionTest; … … 149 157 150 158 struct MatchingControlStructure { 159 MatchingControlStructure( 160 const adjacency_t &_adjacency, 161 const VectorArray_t &_oldpoints, 162 const VectorArray_t &_newpoints, 163 const WeightsArray_t &_weights 164 ); 151 165 bool foundflag; 152 166 double bestL2; 167 const adjacency_t &adjacency; 168 const VectorArray_t oldpoints; 169 const VectorArray_t newpoints; 170 const WeightsArray_t weights; 153 171 IndexTupleList_t bestmatching; 154 VectorArray_t oldpoints;155 VectorArray_t newpoints;156 WeightsArray_t weights;157 172 }; 158 173 … … 166 181 ); 167 182 168 static IndexList_t findBestMatching( 169 const WeightedPolygon_t &_polygon, 170 Polygon_t &_newpolygon 171 ); 183 IndexList_t findBestMatching(const WeightedPolygon_t &_polygon); 172 184 173 185 static IndexList_t joinPoints(
Note:
See TracChangeset
for help on using the changeset viewer.
