TriangleBSPCoreT.cc 6.34 KB
Newer Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
/*===========================================================================*\
 *                                                                           *
 *                              OpenFlipper                                  *
 *      Copyright (C) 2001-2009 by Computer Graphics Group, RWTH Aachen      *
 *                           www.openflipper.org                             *
 *                                                                           *
 *---------------------------------------------------------------------------*
 *  This file is part of OpenFlipper.                                        *
 *                                                                           *
 *  OpenFlipper is free software: you can redistribute it and/or modify      *
 *  it under the terms of the GNU Lesser General Public License as           *
 *  published by the Free Software Foundation, either version 3 of           *
 *  the License, or (at your option) any later version with the              *
 *  following exceptions:                                                    *
 *                                                                           *
 *  If other files instantiate templates or use macros                       *
 *  or inline functions from this file, or you compile this file and         *
 *  link it with other files to produce an executable, this file does        *
 *  not by itself cause the resulting executable to be covered by the        *
 *  GNU Lesser General Public License. This exception does not however       *
 *  invalidate any other reasons why the executable file might be            *
 *  covered by the GNU Lesser General Public License.                        *
 *                                                                           *
 *  OpenFlipper is distributed in the hope that it will be useful,           *
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of           *
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the            *
 *  GNU Lesser General Public License for more details.                      *
 *                                                                           *
 *  You should have received a copy of the GNU LesserGeneral Public          *
 *  License along with OpenFlipper. If not,                                  *
 *  see <http://www.gnu.org/licenses/>.                                      *
 *                                                                           *
\*===========================================================================*/

/*===========================================================================*\
 *                                                                           *
 *   $Revision$                                                         *
 *   $Author$                                                      *
 *   $Date$                   *
 *                                                                           *
\*===========================================================================*/
Jan Möbius's avatar
 
Jan Möbius committed
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73




//=============================================================================
//
//  CLASS TriangleBSPCoreT
//
//=============================================================================

#define TRIANGLEBSPCORET_C

//== INCLUDES =================================================================


#include "TriangleBSPCoreT.hh"


//== CLASS DEFINITION =========================================================

template <class BSPTraits>
void
TriangleBSPCoreT<BSPTraits>::
build(unsigned int _max_handles, unsigned int _max_depth)
{
  // init
  delete root_;
  root_ = new Node(handles_, 0);

  // delete own handles (don't store them twice)
  handles_ = Handles();

74
75
  nodes=1;
  traits_.calculateBoundingBoxRoot (root_);
Jan Möbius's avatar
 
Jan Möbius committed
76
77
  // call recursive helper
  _build(root_, _max_handles, _max_depth);
78
79
  
  std::cout << "Number of nodes:" << nodes << std::endl;
Jan Möbius's avatar
 
Jan Möbius committed
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
}


//-----------------------------------------------------------------------------


template <class BSPTraits>
void
TriangleBSPCoreT<BSPTraits>::
_build(Node*         _node,
       unsigned int  _max_handles, 
       unsigned int  _depth)
{
  // should we stop at this level ?
  if ((_depth == 0) || ((_node->end()-_node->begin()) <= (int)_max_handles))
    return;
96
97
98
99
100
101
  
  Point median;
  int axis;
  // compute bounding boxes for children
  traits_.calculateBoundingBox (_node, median, axis);
  
Jan Möbius's avatar
 
Jan Möbius committed
102
103
  // construct splitting plane
  const Point XYZ[3] = { Point(1,0,0), Point(0,1,0), Point(0,0,1) };
104
  _node->plane_ = Plane(median, XYZ[axis]);
Jan Möbius's avatar
 
Jan Möbius committed
105
106
107
108
109
110

  // partition for left and right child
  Handles lhandles, rhandles;
  lhandles.reserve(_node->handles_.size()/2);
  rhandles.reserve(_node->handles_.size()/2);

111
112
  HandleIter it;
  Point p0, p1, p2;
Jan Möbius's avatar
 
Jan Möbius committed
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
  bool left, right;
  for (it=_node->begin(); it!=_node->end(); ++it)
  {
    traits_.points(*it, p0, p1, p2);
    left = right = false;

    if (_node->plane_(p0))  left  = true;
    else                    right = true;
    if (_node->plane_(p1))  left  = true;
    else                    right = true;
    if (_node->plane_(p2))  left  = true;
    else                    right = true;

    if (left)  lhandles.push_back(*it);
    if (right) rhandles.push_back(*it);
  }

  // check it
  if (lhandles.size() == _node->handles_.size() ||
      rhandles.size() == _node->handles_.size())
    return;
  else
    _node->handles_ = Handles();


  // create children
  _node->left_child_  = new Node(lhandles, _node);  lhandles = Handles();
  _node->right_child_ = new Node(rhandles, _node);  rhandles = Handles();
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
  nodes+=2;
  
  //save bounding boxes for children
  /*
  _node->left_child_->bb_min  = _node->bb_min;
  _node->left_child_->bb_max  = _node->bb_max;
  _node->left_child_->bb_max[axis] = median [axis];
  
  _node->right_child_->bb_min = _node->bb_min;
  _node->right_child_->bb_min[axis] = median [axis];
  _node->right_child_->bb_max = _node->bb_max;
  */
  _node->right_child_->bb_min  = _node->bb_min;
  _node->right_child_->bb_max  = _node->bb_max;
  _node->right_child_->bb_max[axis] = median [axis];
  
  _node->left_child_->bb_min = _node->bb_min;
  _node->left_child_->bb_min[axis] = median [axis];
  _node->left_child_->bb_max = _node->bb_max;
Jan Möbius's avatar
 
Jan Möbius committed
160
161
162
163
164
165
166
167

  // recurse to childen
  _build(_node->left_child_,  _max_handles, _depth-1);
  _build(_node->right_child_, _max_handles, _depth-1);
}


//=============================================================================