23 m_nMaxZenithBins = nMaxZenithBins;
24 m_nMaxAzimuthBins = nMaxAzimuthBins;
31 while (nMaxZenithBins != 0)
35 m_Tables.push_back(pTable);
40 nMaxZenithBins /= m_nSubDivision;
41 nMaxAzimuthBins /= m_nSubDivision;
48 std::list<CGraphLookupTable*>::iterator iter = m_Tables.begin();
50 while (iter != m_Tables.end())
60 std::list<CGraphLookupTable*>::iterator iter = m_Tables.begin();
62 while (iter != m_Tables.end())
64 (*iter)->buildLookupTable(pGraph);
80 bool bFinished =
false;
81 std::list<CGraphLookupTable*>::iterator iter = m_Tables.begin();
86 while (iter != m_Tables.end())
88 nIndex = (*iter)->getClosestNode(position, bFinished);
102 printf(
"CGraphPyramidLookupTable:: no closest node found\n");