Subversion Repositories gelsvn

Rev

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