Panda3D

Loading...
Searching...
No Matches
binCullHandler.h
Go to the documentation of this file.
1/**
2 * PANDA 3D SOFTWARE
3 * Copyright (c) Carnegie Mellon University. All rights reserved.
4 *
5 * All use of this software is subject to the terms of the revised BSD
6 * license. You should have received a copy of this license along
7 * with this source code in a file named "LICENSE."
8 *
9 * @file binCullHandler.h
10 * @author drose
11 * @date 2002-02-28
12 */
13
14#ifndef BINCULLHANDLER_H
15#define BINCULLHANDLER_H
16
17#include "pandabase.h"
18#include "cullHandler.h"
19#include "cullResult.h"
20#include "pointerTo.h"
21
22/**
23 * This CullHandler sends all of the geoms it receives into a CullResult
24 * object, for binning (and later drawing). This is the kind of CullHandler
25 * to use for most normal rendering needs.
26 */
27 class EXPCL_PANDA_CULL BinCullHandler : public CullHandler {
28 public:
29 INLINE BinCullHandler(CullResult *cull_result);
30
31 virtual void record_object(CullableObject *object,
32 const CullTraverser *traverser);
33
34 private:
35 PT(CullResult) _cull_result;
36};
37
38#include "binCullHandler.I"
39
40#endif
binCullHandler.I
PANDA 3D SOFTWARE Copyright (c) Carnegie Mellon University.
CullHandler::record_object
virtual void record_object(CullableObject *object, const CullTraverser *traverser)
This callback function is intended to be overridden by a derived class.
Definition cullHandler.cxx:43
CullResult
This stores the result of a BinCullHandler traversal: an ordered collection of CullBins,...
Definition cullResult.h:44
CullTraverser
This object performs a depth-first traversal of the scene graph, with optional view-frustum culling,...
Definition cullTraverser.h:45
CullableObject
The smallest atom of cull.
Definition cullableObject.h:41
cullHandler.h
PANDA 3D SOFTWARE Copyright (c) Carnegie Mellon University.
cullResult.h
PANDA 3D SOFTWARE Copyright (c) Carnegie Mellon University.
pandabase.h
PANDA 3D SOFTWARE Copyright (c) Carnegie Mellon University.
pointerTo.h
PANDA 3D SOFTWARE Copyright (c) Carnegie Mellon University.