Geant4 Cross Reference

Cross-Referencing   Geant4
Geant4/examples/extended/medical/DICOM/dicomReader/src/DicomROIContour.cc

Version: [ ReleaseNotes ] [ 1.0 ] [ 1.1 ] [ 2.0 ] [ 3.0 ] [ 3.1 ] [ 3.2 ] [ 4.0 ] [ 4.0.p1 ] [ 4.0.p2 ] [ 4.1 ] [ 4.1.p1 ] [ 5.0 ] [ 5.0.p1 ] [ 5.1 ] [ 5.1.p1 ] [ 5.2 ] [ 5.2.p1 ] [ 5.2.p2 ] [ 6.0 ] [ 6.0.p1 ] [ 6.1 ] [ 6.2 ] [ 6.2.p1 ] [ 6.2.p2 ] [ 7.0 ] [ 7.0.p1 ] [ 7.1 ] [ 7.1.p1 ] [ 8.0 ] [ 8.0.p1 ] [ 8.1 ] [ 8.1.p1 ] [ 8.1.p2 ] [ 8.2 ] [ 8.2.p1 ] [ 8.3 ] [ 8.3.p1 ] [ 8.3.p2 ] [ 9.0 ] [ 9.0.p1 ] [ 9.0.p2 ] [ 9.1 ] [ 9.1.p1 ] [ 9.1.p2 ] [ 9.1.p3 ] [ 9.2 ] [ 9.2.p1 ] [ 9.2.p2 ] [ 9.2.p3 ] [ 9.2.p4 ] [ 9.3 ] [ 9.3.p1 ] [ 9.3.p2 ] [ 9.4 ] [ 9.4.p1 ] [ 9.4.p2 ] [ 9.4.p3 ] [ 9.4.p4 ] [ 9.5 ] [ 9.5.p1 ] [ 9.5.p2 ] [ 9.6 ] [ 9.6.p1 ] [ 9.6.p2 ] [ 9.6.p3 ] [ 9.6.p4 ] [ 10.0 ] [ 10.0.p1 ] [ 10.0.p2 ] [ 10.0.p3 ] [ 10.0.p4 ] [ 10.1 ] [ 10.1.p1 ] [ 10.1.p2 ] [ 10.1.p3 ] [ 10.2 ] [ 10.2.p1 ] [ 10.2.p2 ] [ 10.2.p3 ] [ 10.3 ] [ 10.3.p1 ] [ 10.3.p2 ] [ 10.3.p3 ] [ 10.4 ] [ 10.4.p1 ] [ 10.4.p2 ] [ 10.4.p3 ] [ 10.5 ] [ 10.5.p1 ] [ 10.6 ] [ 10.6.p1 ] [ 10.6.p2 ] [ 10.6.p3 ] [ 10.7 ] [ 10.7.p1 ] [ 10.7.p2 ] [ 10.7.p3 ] [ 10.7.p4 ] [ 11.0 ] [ 11.0.p1 ] [ 11.0.p2 ] [ 11.0.p3, ] [ 11.0.p4 ] [ 11.1 ] [ 11.1.1 ] [ 11.1.2 ] [ 11.1.3 ] [ 11.2 ] [ 11.2.1 ] [ 11.2.2 ] [ 11.3.0 ]

Diff markup

Differences between /examples/extended/medical/DICOM/dicomReader/src/DicomROIContour.cc (Version 11.3.0) and /examples/extended/medical/DICOM/dicomReader/src/DicomROIContour.cc (Version 10.7.p3)


  1 //                                                  1 //
  2 // *******************************************      2 // ********************************************************************
  3 // * License and Disclaimer                         3 // * License and Disclaimer                                           *
  4 // *                                                4 // *                                                                  *
  5 // * The  Geant4 software  is  copyright of th      5 // * The  Geant4 software  is  copyright of the Copyright Holders  of *
  6 // * the Geant4 Collaboration.  It is provided      6 // * the Geant4 Collaboration.  It is provided  under  the terms  and *
  7 // * conditions of the Geant4 Software License      7 // * conditions of the Geant4 Software License,  included in the file *
  8 // * LICENSE and available at  http://cern.ch/      8 // * LICENSE and available at  http://cern.ch/geant4/license .  These *
  9 // * include a list of copyright holders.           9 // * include a list of copyright holders.                             *
 10 // *                                               10 // *                                                                  *
 11 // * Neither the authors of this software syst     11 // * Neither the authors of this software system, nor their employing *
 12 // * institutes,nor the agencies providing fin     12 // * institutes,nor the agencies providing financial support for this *
 13 // * work  make  any representation or  warran     13 // * work  make  any representation or  warranty, express or implied, *
 14 // * regarding  this  software system or assum     14 // * regarding  this  software system or assume any liability for its *
 15 // * use.  Please see the license in the file      15 // * use.  Please see the license in the file  LICENSE  and URL above *
 16 // * for the full disclaimer and the limitatio     16 // * for the full disclaimer and the limitation of liability.         *
 17 // *                                               17 // *                                                                  *
 18 // * This  code  implementation is the result      18 // * This  code  implementation is the result of  the  scientific and *
 19 // * technical work of the GEANT4 collaboratio     19 // * technical work of the GEANT4 collaboration.                      *
 20 // * By using,  copying,  modifying or  distri     20 // * By using,  copying,  modifying or  distributing the software (or *
 21 // * any work based  on the software)  you  ag     21 // * any work based  on the software)  you  agree  to acknowledge its *
 22 // * use  in  resulting  scientific  publicati     22 // * use  in  resulting  scientific  publications,  and indicate your *
 23 // * acceptance of all terms of the Geant4 Sof     23 // * acceptance of all terms of the Geant4 Software license.          *
 24 // *******************************************     24 // ********************************************************************
 25 //                                                 25 //
 26 #include "DicomROIContour.hh"                      26 #include "DicomROIContour.hh"
 27                                                    27 
 28 //....oooOO0OOooo........oooOO0OOooo........oo     28 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo......
 29 DicomROIContour::DicomROIContour() {}          <<  29 DicomROIContour::DicomROIContour()
                                                   >>  30 {
                                                   >>  31 }
 30                                                    32 
 31 //....oooOO0OOooo........oooOO0OOooo........oo     33 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo......
 32 void DicomROIContour::SetData(std::vector<G4Th <<  34 void DicomROIContour::SetData( std::vector<G4ThreeVector> data )
 33 {                                                  35 {
 34   thePoints = data;                                36   thePoints = data;
 35   if (theGeomType == "CLOSED_PLANAR") {        <<  37   if( theGeomType == "CLOSED_PLANAR" ){
 36     // add a last point to close the circle    <<  38     //add a last point to close the circle
 37     thePoints.push_back(thePoints[0]);         <<  39     thePoints.push_back( thePoints[0] );
 38     for (size_t ii = 1; ii < thePoints.size(); <<  40     for( size_t ii = 1; ii < thePoints.size(); ii++ ){
 39       theDirections.push_back(thePoints[ii] -  <<  41       theDirections.push_back( thePoints[ii] - thePoints[ii-1] );
 40     }                                              42     }
 41     theDirections.push_back(thePoints[0] - the <<  43     theDirections.push_back( thePoints[0] - thePoints[thePoints.size()-1] ); // (0,0)
 42   }                                                44   }
 43 }                                                  45 }
 44                                                    46 
 45 //....oooOO0OOooo........oooOO0OOooo........oo     47 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo......
 46 G4double DicomROIContour::GetZ()                   48 G4double DicomROIContour::GetZ()
 47 {                                                  49 {
 48   if (thePoints.size() == 0) {                 <<  50   if( thePoints.size() == 0 ) {
 49     G4Exception("DicomROIContour::GetZ", "DRC0 <<  51     G4Exception("DicomROIContour::GetZ",
                                                   >>  52                 "DRC001",
                                                   >>  53                 FatalException,
                                                   >>  54                 "No Point in contour");
 50     Print(G4cout);                                 55     Print(G4cout);
 51     return DBL_MAX;                                56     return DBL_MAX;
 52   }                                                57   }
 53   return thePoints[0].z();                         58   return thePoints[0].z();
 54 }                                                  59 }
 55                                                    60 
 56 //....oooOO0OOooo........oooOO0OOooo........oo     61 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo......
 57 void DicomROIContour::AddPoints(std::vector<G4 <<  62 void DicomROIContour::AddPoints( std::vector<G4ThreeVector> points )
 58 {                                                  63 {
 59   points.push_back(points[0]);                 <<  64   points.push_back( points[0] );
 60   size_t npold = thePoints.size();                 65   size_t npold = thePoints.size();
 61   for (size_t ii = 0; ii < points.size(); ii++ <<  66   for( size_t ii = 0; ii < points.size(); ii++ ) {
 62     thePoints.push_back(points[ii]);           <<  67     thePoints.push_back( points[ii] );
 63   }                                                68   }
 64                                                    69 
 65   for (size_t ii = npold + 1; ii < thePoints.s <<  70   for( size_t ii = npold+1; ii < thePoints.size(); ii++ ){
 66     theDirections.push_back(thePoints[ii] - th <<  71     theDirections.push_back( thePoints[ii] - thePoints[ii-1] );
 67   }                                                72   }
 68   theDirections.push_back(thePoints[npold] - t <<  73   theDirections.push_back( thePoints[npold] - thePoints[thePoints.size()-1] );
                                                   >>  74   
 69 }                                                  75 }
 70                                                    76 
 71 //....oooOO0OOooo........oooOO0OOooo........oo     77 //....oooOO0OOooo........oooOO0OOooo........oooOO0OOooo........oooOO0OOooo......
 72 void DicomROIContour::Print(std::ostream& out) <<  78 void DicomROIContour::Print( std::ostream& out )
 73 {                                                  79 {
                                                   >>  80 
 74   out << this << "@@@ NUMBER OF ContourImageSe     81   out << this << "@@@ NUMBER OF ContourImageSequences " << theImageIUIDs.size() << G4endl;
 75   for (size_t ii = 0; ii < theImageIUIDs.size( <<  82   for( size_t ii = 0; ii < theImageIUIDs.size(); ii++ ) {
 76     out << "ContourImageSequence I= " << theIm     83     out << "ContourImageSequence I= " << theImageIUIDs[ii] << G4endl;
 77   }                                                84   }
 78   out << "@@@ GeomType " << theGeomType << " N     85   out << "@@@ GeomType " << theGeomType << " NPOINTS " << thePoints.size() << G4endl;
 79   for (size_t ii = 0; ii < thePoints.size(); i <<  86   for( size_t ii = 0; ii < thePoints.size(); ii++ ) {
 80     out << "(" << thePoints[ii].x() << "," <<  <<  87     out << "(" << thePoints[ii].x()<< "," << thePoints[ii].y()<< "," << thePoints[ii].z() 
 81         << G4endl;                             <<  88         << ")" << G4endl;
 82   }                                                89   }
                                                   >>  90 
 83 }                                                  91 }
 84                                                    92