25 m_nMaxZenithBins = nMaxZenithBins;
26 m_nMaxAzimuthBins = nMaxAzimuthBins;
33 while (nMaxZenithBins != 0)
37 m_Tables.push_back(pTable);
42 nMaxZenithBins /= m_nSubDivision;
43 nMaxAzimuthBins /= m_nSubDivision;
49 std::list<CGraphLookupTable*>::iterator iter = m_Tables.begin();
51 while (iter != m_Tables.end())
62 std::list<CGraphLookupTable*>::iterator iter = m_Tables.begin();
64 while (iter != m_Tables.end())
66 (*iter)->buildLookupTable(pGraph);
84 bool bFinished =
false;
85 std::list<CGraphLookupTable*>::iterator iter = m_Tables.begin();
90 while (iter != m_Tables.end())
92 nIndex = (*iter)->getClosestNode(position, bFinished);
106 printf(
"CGraphPyramidLookupTable:: no closest node found\n");