- Timestamp:
- Apr 28, 2021, 10:02:49 PM (5 years ago)
- Branches:
- Candidate_v1.7.0, stable
- Children:
- e0e77e
- Parents:
- 87c1cc
- git-author:
- Frederik Heber <frederik.heber@…> (04/17/21 09:41:33)
- git-committer:
- Frederik Heber <frederik.heber@…> (04/28/21 22:02:49)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
src/Fragmentation/Exporters/SphericalPointDistribution.cpp
r87c1cc r2390e6 882 882 SphericalPointDistribution::getRemainingPoints( 883 883 const WeightedPolygon_t &_polygon, 884 const int _N) 884 const int _num_spots, 885 const int _num_spots_available) 885 886 { 886 887 SphericalPointDistribution::Polygon_t remainingpoints; 887 888 888 889 // initialze to given number of points 889 initSelf(_ N);890 initSelf(_num_spots); 890 891 LOG(2, "INFO: Matching old polygon " << _polygon 891 892 << " with new polygon " << points); 892 893 893 894 // check whether any points will remain vacant 894 int RemainingPoints = _ N;895 int RemainingPoints = _num_spots_available; 895 896 for (WeightedPolygon_t::const_iterator iter = _polygon.begin(); 896 897 iter != _polygon.end(); ++iter) … … 899 900 return remainingpoints; 900 901 901 if (_ N> 0) {902 if (_num_spots_available > 0) { 902 903 IndexList_t bestmatching = findBestMatching(_polygon); 903 904 LOG(2, "INFO: Best matching is " << bestmatching); … … 1024 1025 SphericalPointDistribution::Polygon_t remainingpoints = 1025 1026 removeMatchingPoints(rotatednewSet); 1027 // when less spots unoccupied than the ideal polygon has nodes, remove some 1028 if (RemainingPoints < remainingpoints.size()) 1029 remainingpoints.resize(RemainingPoints); 1026 1030 LOG(2, "INFO: Remaining points are " << remainingpoints); 1027 1031 return remainingpoints;
Note:
See TracChangeset
for help on using the changeset viewer.
