@@ -37,35 +37,37 @@ Octree::~Octree()
3737// ////////////////////////////////////////
3838void Octree::findBoundingBox ()
3939{
40- m_maxPointX = m_pointArray[0 ];
41- m_maxPointY = m_pointArray[1 ];
42- m_maxPointZ = m_pointArray[2 ];
40+ DatasetManager *pDatMan = DatasetManager::getInstance ();
4341
44- m_minPointX = m_pointArray[ 0 ] ;
45- m_minPointY = m_pointArray[ 1 ] ;
46- m_minPointZ = m_pointArray[ 2 ] ;
42+ m_maxPointX = pDatMan-> getColumns () * pDatMan-> getVoxelX () ;
43+ m_maxPointY = pDatMan-> getRows () * pDatMan-> getVoxelY () ;
44+ m_maxPointZ = pDatMan-> getFrames () * pDatMan-> getVoxelZ () ;
4745
48- // Find the bounding box for the dataSet
49- for (int i=0 ; i < m_countPoints; i++)
50- {
51- if (m_pointArray[i*3 ] > m_maxPointX)
52- m_maxPointX = m_pointArray[i*3 ];
46+ m_minPointX = 0 .0f ;
47+ m_minPointY = 0 .0f ;
48+ m_minPointZ = 0 .0f ;
5349
54- if (m_pointArray[i*3 +1 ] > m_maxPointY)
55- m_maxPointY = m_pointArray[i*3 +1 ];
50+ // //Find the bounding box for the dataSet
51+ // for(int i=0; i < m_countPoints; i++)
52+ // {
53+ // if(m_pointArray[i*3] > m_maxPointX)
54+ // m_maxPointX = m_pointArray[i*3];
5655
57- if (m_pointArray[i*3 +2 ] > m_maxPointZ )
58- m_maxPointZ = m_pointArray[i*3 +2 ];
56+ // if(m_pointArray[i*3+1 ] > m_maxPointY )
57+ // m_maxPointY = m_pointArray[i*3+1 ];
5958
60- if (m_pointArray[i*3 ] < m_minPointX )
61- m_minPointX = m_pointArray[i*3 ];
59+ // if(m_pointArray[i*3+2] > m_maxPointZ )
60+ // m_maxPointZ = m_pointArray[i*3+2 ];
6261
63- if (m_pointArray[i*3 + 1 ] < m_minPointY )
64- m_minPointY = m_pointArray[i*3 + 1 ];
62+ // if(m_pointArray[i*3] < m_minPointX )
63+ // m_minPointX = m_pointArray[i*3];
6564
66- if (m_pointArray[i*3 +2 ] < m_minPointZ)
67- m_minPointZ = m_pointArray[i*3 +2 ];
68- }
65+ // if(m_pointArray[i*3+1] < m_minPointY)
66+ // m_minPointY = m_pointArray[i*3+1];
67+
68+ // if(m_pointArray[i*3+2] < m_minPointZ)
69+ // m_minPointZ = m_pointArray[i*3+2];
70+ // }
6971}
7072
7173// ////////////////////////////////////////
0 commit comments