- Timestamp:
- 12/02/05 08:45:09 (19 years ago)
- Location:
- trunk/VUT
- Files:
-
- 5 edited
Legend:
- Unmodified
- Added
- Removed
-
trunk/VUT/GtpVisibilityPreprocessor/src/ViewCellBsp.h
r442 r443 495 495 void ConstructGeometry(BspViewCell *vc, PolygonContainer &cell) const; 496 496 497 /** Constructs geometry of view cell returning a BSP node geometry type. 498 */ 497 499 void ConstructGeometry(BspNode *n, BspNodeGeometry &cell) const; 498 500 -
trunk/VUT/GtpVisibilityPreprocessor/src/ViewCellsManager.cpp
r442 r443 1230 1230 const RayContainer &rays) 1231 1231 { 1232 return 0;// TODO 1232 1233 if (!ViewCellsConstructed()) 1233 1234 { … … 1241 1242 int pvsSize = 0; 1242 1243 1243 BspViewCellsStatistics vcStats;1244 mVspBspTree->EvaluateViewCellsStats( 1244 VspBspViewCellsStatistics vcStats; 1245 mVspBspTree->EvaluateViewCellsStats(vcStats); 1245 1246 Debug << "original view cell partition:\n" << vcStats << endl; 1246 1247 … … 1294 1295 iit = ray->bspIntersections.begin(); 1295 1296 1296 BspLeaf *previousLeaf =(*iit).mLeaf;1297 VspBspLeaf *previousLeaf = NULL;//TODO(*iit).mLeaf; 1297 1298 ++ iit; 1298 1299 1299 1300 for (; iit != ray->bspIntersections.end(); ++ iit) 1300 1301 { 1301 BspLeaf *leaf =(*iit).mLeaf;1302 VspBspLeaf *leaf = NULL;//TODO(*iit).mLeaf; 1302 1303 1303 1304 if (ShouldMerge(leaf, previousLeaf)) 1304 1305 { 1305 Merge BspLeafViewCells(leaf, previousLeaf);1306 MergeVspBspLeafViewCells(leaf, previousLeaf); 1306 1307 1307 1308 ++ merged; … … 1329 1330 const RayContainer &sampleRays) 1330 1331 { 1332 return; // TODO 1331 1333 if (!ViewCellsConstructed()) 1332 1334 return; 1333 1335 1334 1336 //-- recount pvs 1335 BspViewCellsStatistics vcStats;1337 VspBspViewCellsStatistics vcStats; 1336 1338 mVspBspTree->EvaluateViewCellsStats(vcStats); 1337 1339 … … 1361 1363 } 1362 1364 1363 ExportVspBspPvs(objects, sampleRays);1365 //TODO ExportVspBspPvs(objects, sampleRays); 1364 1366 } 1365 1367 … … 1474 1476 else 1475 1477 { 1476 PolygonContainer cell; 1478 PolygonContainer vcGeom; 1479 1477 1480 // export view cell geometry 1478 mVspBspTree->ConstructGeometry(vc, cell);1479 exporter->ExportPolygons( cell);1480 CLEAR_CONTAINER( cell);1481 mVspBspTree->ConstructGeometry(vc, vcGeom); 1482 exporter->ExportPolygons(vcGeom); 1483 CLEAR_CONTAINER(vcGeom); 1481 1484 } 1482 1485 … … 1547 1550 for (int j = 0; j < (int)ray->bspIntersections.size(); ++ j) 1548 1551 { 1549 VspBspLeaf *leaf ; // TODO = ray->bspIntersections[j].mLeaf;1552 VspBspLeaf *leaf = NULL; // TODO = ray->bspIntersections[j].mLeaf; 1550 1553 1551 1554 if (vc == leaf->GetViewCell()) … … 1571 1574 else 1572 1575 { 1573 PolygonContainer cell;1576 PolygonContainer vcGeom; 1574 1577 // export view cell 1575 mVspBspTree->ConstructGeometry(vc, cell);1576 exporter->ExportPolygons( cell);1577 CLEAR_CONTAINER( cell);1578 mVspBspTree->ConstructGeometry(vc, vcGeom); 1579 exporter->ExportPolygons(vcGeom); 1580 CLEAR_CONTAINER(vcGeom); 1578 1581 } 1579 1582 -
trunk/VUT/GtpVisibilityPreprocessor/src/VspBspTree.cpp
r442 r443 1688 1688 } 1689 1689 1690 void VspBspTree::ConstructGeometry(BspViewCell *vc, PolygonContainer &cell) const 1691 { 1692 /* 1693 TODO 1694 vector<VspBspLeaf *> leaves = vc->mBspLeaves; 1695 1696 vector<VspBspLeaf *>::const_iterator it, it_end = leaves.end(); 1697 1698 for (it = leaves.begin(); it != it_end; ++ it) 1699 ConstructGeometry(*it, vcGeom);*/ 1700 } 1690 1701 1691 1702 int VspBspTree::FindNeighbors(VspBspNode *n, vector<VspBspLeaf *> &neighbors, -
trunk/VUT/GtpVisibilityPreprocessor/src/VspBspTree.h
r442 r443 457 457 void ConstructGeometry(VspBspNode *n, PolygonContainer &cell) const; 458 458 459 /** Constructs geometry associated with the half space intersections 460 leading to this node. 461 */ 462 void ConstructGeometry(BspViewCell *vc, PolygonContainer &cell) const; 463 459 464 /** Construct geometry and stores it in a geometry node container. 460 465 */
Note: See TracChangeset
for help on using the changeset viewer.