Chaste  Build::
LacunarityCalculator.cpp
1 /*
2 
3 Copyright (c) 2005-2016, University of Oxford.
4  All rights reserved.
5 
6  University of Oxford means the Chancellor, Masters and Scholars of the
7  University of Oxford, having an administrative office at Wellington
8  Square, Oxford OX1 2JD, UK.
9 
10  This file is part of Chaste.
11 
12  Redistribution and use in source and binary forms, with or without
13  modification, are permitted provided that the following conditions are met:
14  * Redistributions of source code must retain the above copyright notice,
15  this list of conditions and the following disclaimer.
16  * Redistributions in binary form must reproduce the above copyright notice,
17  this list of conditions and the following disclaimer in the documentation
18  and/or other materials provided with the distribution.
19  * Neither the name of the University of Oxford nor the names of its
20  contributors may be used to endorse or promote products derived from this
21  software without specific prior written permission.
22 
23  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
24  AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25  IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26  ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
27  LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
28  CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
29  GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30  HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31  LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
32  OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
33 
34  */
35 
36 #include "VesselSegment.hpp"
37 #include "ChastePoint.hpp"
38 #include "GeometryTools.hpp"
39 #include "LacunarityCalculator.hpp"
40 
41 template<unsigned DIM>
44 {
45 
46 }
47 
48 template<unsigned DIM>
49 boost::shared_ptr<LacunarityCalculator<DIM> > LacunarityCalculator<DIM>::Create()
50 {
51  MAKE_PTR(LacunarityCalculator, pSelf);
52  return pSelf;
53 }
54 
55 template<unsigned DIM>
57 {
58 
59 }
60 
61 template<unsigned DIM>
62 void LacunarityCalculator<DIM>::SetVesselNetwork(boost::shared_ptr<VesselNetwork<DIM> > pNetwork)
63 {
64  mpNetwork = pNetwork;
65 }
66 
67 template<unsigned DIM>
69 {
70  unsigned extents_x = this->mpRegularGrid->GetExtents()[0];
71 
72  std::vector<boost::shared_ptr<VesselSegment<DIM> > > segments;
73  segments = this->mpNetwork->GetVesselSegments();
74 
75  // Get the box widths
76  std::vector<unsigned> width_factors;
77  width_factors.push_back(1);
78  width_factors.push_back(2);
79  width_factors.push_back(4);
80  width_factors.push_back(8);
81  width_factors.push_back(16);
82 
83  std::ofstream output_file((this->mpOutputFileHandler->GetOutputDirectoryFullPath() + "output.dat").c_str());
84  if (output_file.is_open())
85  {
86  output_file << "Lacunarity, Box\n";
87  }
88 
89  units::quantity<unit::length> length_scale = this->mpRegularGrid->GetReferenceLengthScale();
90  for (unsigned width_index = 0; width_index < width_factors.size(); width_index++)
91  {
92  double box_size = (double(extents_x - 1) / double(width_factors[width_index]));
93  units::quantity<unit::length> q1 = 0.0* unit::metres;
94  units::quantity<unit::area> q2 = 0.0* unit::metres*unit::metres;
95 
96  unsigned z_extent = width_factors[width_index];
97  z_extent = 1;
98 
99  for (unsigned kdx = 0; kdx < z_extent; kdx++)
100  {
101  for (unsigned jdx = 0; jdx < width_factors[width_index]; jdx++)
102  {
103  for (unsigned idx = 0; idx < width_factors[width_index]; idx++)
104  {
105  c_vector<double, DIM> box_location;
106  box_location[0] = double(idx) * box_size + box_size / 2.0;
107  box_location[1] = double(jdx) * box_size + box_size / 2.0;
108  box_location[2] = double(kdx) * box_size + box_size / 2.0;
109 
110  units::quantity<unit::length> vessel_length = 0.0 * unit::metres;
111  for (unsigned seg_index = 0; seg_index < segments.size(); seg_index++)
112  {
113  vessel_length += LengthOfLineInBox<DIM>(segments[seg_index]->GetNode(0)->rGetLocation(),
114  segments[seg_index]->GetNode(1)->rGetLocation(),
115  DimensionalChastePoint<DIM>(box_location, length_scale), box_size*length_scale);
116  }
117  q1 += vessel_length;
118  q2 += vessel_length * vessel_length;
119 
120  }
121  }
122  }
123  unsigned num_boxes = width_factors[width_index] * width_factors[width_index] * z_extent;
124  double lacunarity = double(num_boxes) * q2 / (q1 * q1);
125 
126  if (output_file.is_open())
127  {
128  output_file << lacunarity << ", " << box_size << " \n";
129  }
130  }
131  output_file.close();
132 }
133 
134 // Explicit instantiation
135 template class LacunarityCalculator<3> ;
boost::shared_ptr< OutputFileHandler > mpOutputFileHandler
boost::shared_ptr< VesselNetwork< DIM > > mpNetwork