Developer Documentation
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Properties Friends Macros Modules Pages
TriangleBSPCoreT.hh
1 /*===========================================================================*\
2 * *
3 * OpenFlipper *
4  * Copyright (c) 2001-2015, RWTH-Aachen University *
5  * Department of Computer Graphics and Multimedia *
6  * All rights reserved. *
7  * www.openflipper.org *
8  * *
9  *---------------------------------------------------------------------------*
10  * This file is part of OpenFlipper. *
11  *---------------------------------------------------------------------------*
12  * *
13  * Redistribution and use in source and binary forms, with or without *
14  * modification, are permitted provided that the following conditions *
15  * are met: *
16  * *
17  * 1. Redistributions of source code must retain the above copyright notice, *
18  * this list of conditions and the following disclaimer. *
19  * *
20  * 2. Redistributions in binary form must reproduce the above copyright *
21  * notice, this list of conditions and the following disclaimer in the *
22  * documentation and/or other materials provided with the distribution. *
23  * *
24  * 3. Neither the name of the copyright holder nor the names of its *
25  * contributors may be used to endorse or promote products derived from *
26  * this software without specific prior written permission. *
27  * *
28  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS *
29  * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED *
30  * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A *
31  * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER *
32  * OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, *
33  * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, *
34  * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR *
35  * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF *
36  * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING *
37  * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS *
38  * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. *
39 * *
40 \*===========================================================================*/
41 
42 /*===========================================================================*\
43 * *
44 * $Revision: 13338 $ *
45 * $LastChangedBy: moebius $ *
46 * $Date: 2012-01-12 10:15:45 +0100 (Thu, 12 Jan 2012) $ *
47 * *
48 \*===========================================================================*/
49 
50 
51 
52 
53 //=============================================================================
54 //
55 // CLASS TriangleBSPCoreT
56 //
57 //=============================================================================
58 
59 #ifndef TRIANGLEBSPCORET_HH
60 #define TRIANGLEBSPCORET_HH
61 
62 
63 //== INCLUDES =================================================================
64 
65 
66 #include <vector>
67 #include <ACG/Geometry/Types/PlaneT.hh>
68 #include <OpenMesh/Core/Geometry/VectorT.hh>
69 
70 #include "TriangleBSPT.hh"
71 
72 
73 //== CLASS DEFINITION =========================================================
74 
75 
76 template <class BSPTraits>
78 {
79 public: //---------------------------------------------------------------------
80 
81  typedef BSPTraits Traits;
82  typedef typename BSPTraits::Point Point;
83  typedef typename BSPTraits::Handle Handle;
84  typedef typename BSPTraits::Node Node;
85  typedef typename Point::value_type Scalar;
87  typedef std::vector<Handle> Handles;
88  typedef typename Handles::iterator HandleIter;
89 
90 
91 public: //---------------------------------------------------------------------
92 
93 
96  TriangleBSPCoreT(const BSPTraits& _traits) : traits_(_traits), root_(0), nodes(0), n_triangles(0) {}
97 
100  delete root_;
101  }
102 
103 
105  void reserve(size_t _n) { handles_.reserve(_n); }
107  void push_back(Handle _h) { handles_.push_back(_h); ++n_triangles; }
108 
112  bool empty() { return n_triangles == 0; }
113 
117  size_t size() { return n_triangles; }
118 
124  void build(unsigned int _max_handles, unsigned int _max_depth);
125 
131  template <typename MeshT>
132  void visualizeTree(MeshT *_object, int _max_depth)
133  {
134  root_->visualizeTree(_object, _max_depth-1);
135  _object->update_normals();
136  }
137 
138 private:
139  /*
140  * Noncopyable because of root_.
141  */
143  TriangleBSPCoreT &operator=(const TriangleBSPCoreT &rhs);
144 
145 
146 private: //---------------------------------------------------------------------
147 
148 
149  // Recursive part of build()
150  void _build(Node* _node,
151  unsigned int _max_handles,
152  unsigned int _depth);
153 
154 
155 
156 
157 protected: //-------------------------------------------------------------------
158 
159 
160  BSPTraits traits_;
161  Handles handles_;
162  Node* root_;
163  int nodes, n_triangles;
164 
165 };
166 
167 
168 //=============================================================================
169 #if defined(OM_INCLUDE_TEMPLATES) && !defined(TRIANGLEBSPCORET_C)
170 # define TRIANGLEBSPCORET_TEMPLATES
171 # include "TriangleBSPCoreT.cc"
172 #endif
173 //=============================================================================
174 #endif // TRIANGLEBSPCORET_HH defined
175 //=============================================================================
void reserve(size_t _n)
Reserve memory for _n entries.
~TriangleBSPCoreT()
Destructor.
void visualizeTree(MeshT *_object, int _max_depth)
Create a PolyMesh object that visualizes the bounding boxes of the BSP tree.
TriangleBSPCoreT(const BSPTraits &_traits)
void push_back(Handle _h)
Add a handle to the BSP.
void build(unsigned int _max_handles, unsigned int _max_depth)