Subversion Repositories gelsvn

Rev

Rev 291 | Rev 309 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed

Rev Author Line No. Line
290 jrf 1 
#include <cfloat>
2 
#include "AABox.h"
3 
 
4 
using namespace std;
5 
using namespace CGLA;
6 
 
291 jrf 7 
namespace Geometry
8 
{
9 
 
290 jrf 10 
bool AABox::intersect(const CGLA::Vec3f& p, const CGLA::Vec3f& dir) const
11 
{
12 
	Vec3f t0,t1;
13 
	for(int i=0;i<3;++i)
14 
		{
15 
			t0[i] = (pmin[i]-p[i])/dir[i];
16 
			t1[i] = (pmax[i]-p[i])/dir[i];
17 
		}
18 
	float tmin = max(min(t0[0],t1[0]),max(min(t0[1],t1[1]),min(t0[2],t1[2])));
19 
	float tmax = min(max(t0[0],t1[0]),min(max(t0[1],t1[1]),max(t0[2],t1[2])));
20 
 
21 
	return ( (tmin + CGLA::TINY) <tmax);
22 
}
23 
 
24 
void AABox::minmax_sq_dist(const CGLA::Vec3f& p,
25 
													 float& dmin, float& dmax) const
26 
{
27 
	const Vec3f a = 0.5*pmax-0.5*pmin;
28 
	const Vec3f p0 = pmin + a;
29 
 	Vec3f d = p-p0;
30 
 	Vec3f f(d);
31 
 
32 
	for(int i=0;i<3;++i)
33 
		{
34 
 			if(f[i]>=0)
35 
 				f[i] = p[i]-pmin[i];
36 
 			else
37 
 				f[i] = p[i]-pmax[i];
38 
 
39 
			if(d[i]<-a[i])
40 
				d[i] = p[i]-pmin[i];
41 
			else if(d[i]>a[i])
42 
				d[i] = p[i]-pmax[i];
43 
			else
44 
				d[i] = 0;
45 
		}
46 
	dmin = sqr_length(d);
47 
//  	dmax = sqr_length(p-interior_point);
48 
	dmax = sqr_length(f);
49 
	assert(dmin<=dmax);
50 
}
51 
 
52 
AABox AABox::box_triangle(const Triangle& t)
53 
{
54 
	return AABox(t.get_pmin(), t.get_pmax(), t.get_centre());
55 
}
56 
 
57 
 
58 
AABox AABox::box_and_split(const std::vector<Triangle>& invec,
59 
													 std::vector<Triangle>& lvec,
60 
													 std::vector<Triangle>& rvec)
61 
{
62 
	const int N = invec.size();
63 
	Vec3f tri_pmin(FLT_MAX), tri_pmax(-FLT_MAX);
64 
 
65 
	for(int i=0;i<N;++i)
66 
		{
67 
			tri_pmin = v_min(invec[i].get_pmin(), tri_pmin);
68 
			tri_pmax = v_max(invec[i].get_pmax(), tri_pmax);
69 
		}
70 
	Vec3f diff = tri_pmax - tri_pmin;
71 
 
72 
	// Find the point closest to the centre.
73 
	Vec3f centre = tri_pmin + diff;
74 
	Vec3f centre_close = invec[0].get_v0();
75 
	float min_dist = FLT_MAX;
76 
	for(int i=0;i<N;++i)
77 
		{
78 
			Vec3f v0 = invec[i].get_v0();
79 
			Vec3f v1 = invec[i].get_v1();
80 
			Vec3f v2 = invec[i].get_v2();
81 
			float sl0 = sqr_length(centre-v0);
82 
			if(sl0 < min_dist)
83 
				{
84 
					min_dist = sl0;
85 
					centre_close = v0;
86 
				}
87 
			float sl1 = sqr_length(centre-v1);
88 
			if(sl1 < min_dist)
89 
				{
90 
					min_dist = sl1;
91 
					centre_close = v1;
92 
				}
93 
			float sl2 = sqr_length(centre-v2);
94 
			if(sl2 < min_dist)
95 
				{
96 
					min_dist = sl2;
97 
					centre_close = v2;
98 
				}
99 
		}
100 
 
101 
	int k;
102 
	if(diff[0]>diff[1])
103 
		{
104 
			if(diff[0]>diff[2])
105 
				k = 0;
106 
			else
107 
				k = 2;
108 
		}
109 
	else
110 
		{
111 
			if(diff[1]>diff[2])
112 
				k = 1;
113 
			else
114 
				k = 2;
115 
		}
116 
 
117 
	float thresh = diff[k]/2.0f + tri_pmin[k];
118 
 
119 
 	for(int i=0;i<N;++i)
120 
		{
121 
			if(invec[i].get_centre()[k] > thresh)
122 
				rvec.push_back(invec[i]);
123 
			else
124 
				lvec.push_back(invec[i]);
125 
		}
126 
	if(lvec.empty() || rvec.empty())
127 
		{
128 
			lvec.clear();
129 
			lvec.insert(lvec.end(),
130 
									invec.begin(),
131 
									invec.begin()+N/2);
132 
			rvec.clear();
133 
			rvec.insert(rvec.end(),
134 
									invec.begin()+N/2,
135 
									invec.end());
136 
		}
137 
	assert(!lvec.empty());
138 
	assert(!rvec.empty());
139 
	assert(lvec.size()+rvec.size() == invec.size());
140 
	return AABox(tri_pmin, tri_pmax, centre_close);
141 
}
142 
 
291 jrf 143 
}