Changeset d22a30 for molecuilder
- Timestamp:
- Apr 22, 2010, 2:07:14 PM (16 years ago)
- Children:
- fda112
- Parents:
- 2cd534
- File:
-
- 1 edited
-
molecuilder/src/tesselation.cpp (modified) (4 diffs)
Legend:
- Unmodified
- Added
- Removed
-
molecuilder/src/tesselation.cpp
r2cd534 rd22a30 7 7 8 8 #include <fstream> 9 #include <assert.h> 9 10 10 11 #include "helpers.hpp" … … 2538 2539 baseline = Runner->second; 2539 2540 if (baseline->pointlist.empty()) { 2541 assert((baseline->BaseLine->triangles.size() == 1) && ("Open line without exactly one attached triangle")); 2540 2542 T = (((baseline->BaseLine->triangles.begin()))->second); 2541 2543 DoLog(1) && (Log() << Verbose(1) << "Finding best candidate for open line " << *baseline->BaseLine << " of triangle " << *T << endl); … … 2590 2592 if (Sprinter != connectedClosestPoints->end()) { 2591 2593 // fill the internal open lines with its respective candidate (otherwise lines in degenerate case are not picked) 2592 FindDegeneratedCandidatesforOpenLines(*Sprinter, &CandidateLine.OptCenter); 2594 FindDegeneratedCandidatesforOpenLines(*Sprinter, &CandidateLine.OptCenter); // Assume BTS contains last triangle 2593 2595 DoLog(0) && (Log() << Verbose(0) << " There are still more triangles to add." << endl); 2594 2596 } … … 2631 2633 else { 2632 2634 DoLog(1) && (Log() << Verbose(1) << "INFO: line " << *(FindLine->second) << " is open with no candidate, setting to next Sprinter" << (*Sprinter) << endl); 2635 Finder->second->T = BTS; // is last triangle 2633 2636 Finder->second->pointlist.push_back(Sprinter); 2634 2637 Finder->second->ShortestAngle = 0.;
Note:
See TracChangeset
for help on using the changeset viewer.
