Panda3D
Loading...
Searching...
No Matches
geometricBoundingVolume.cxx
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 geometricBoundingVolume.cxx
10 * @author drose
11 * @date 1999-10-07
12 */
13
15
16TypeHandle GeometricBoundingVolume::_type_handle;
17
18
19/**
20 * Virtual downcast method. Returns this object as a pointer of the indicated
21 * type, if it is in fact that type. Returns NULL if it is not that type.
22 */
27
28/**
29 * Virtual downcast method. Returns this object as a pointer of the indicated
30 * type, if it is in fact that type. Returns NULL if it is not that type.
31 */
36
37/**
38 * Extends the volume to include the indicated point. Returns true if
39 * possible, false if not.
40 */
41bool GeometricBoundingVolume::
42extend_by_point(const LPoint3 &) {
43 return false;
44}
45
46/**
47 * Puts the volume around the indicated list of points, identified by an STL-
48 * style begin/end list.
49 */
50bool GeometricBoundingVolume::
51around_points(const LPoint3 *, const LPoint3 *) {
52 _flags = F_empty;
53 return false;
54}
55
56/**
57 * Tests whether the volume contains the indicated point.
58 */
59int GeometricBoundingVolume::
60contains_point(const LPoint3 &) const {
61 return IF_dont_understand;
62}
63
64/**
65 * Tests whether the volume contains the indicated line segment.
66 */
67int GeometricBoundingVolume::
68contains_lineseg(const LPoint3 &, const LPoint3 &) const {
69 return IF_dont_understand;
70}
This is another abstract class, for a general class of bounding volumes that actually enclose points ...
virtual GeometricBoundingVolume * as_geometric_bounding_volume() final
Virtual downcast method.
TypeHandle is the identifier used to differentiate C++ class types.
Definition typeHandle.h:81
PANDA 3D SOFTWARE Copyright (c) Carnegie Mellon University.