X-Git-Url: http://de.git.xonotic.org/?p=xonotic%2Fdarkplaces.git;a=blobdiff_plain;f=polygon.c;h=99ceb0b9d7680abecec324bd44d4d66429aaa013;hp=403dca3520922c2f846c4085a94477397ce431ab;hb=19487ef2ebada39fb6a6a372b30ca4f66bb78ada;hpb=9fa8ce6f31c95105ed4ac684b37f79f133b9c960

diff --git a/polygon.c b/polygon.c
index 403dca35..99ceb0b9 100644
--- a/polygon.c
+++ b/polygon.c
@@ -96,18 +96,20 @@ void PolygonD_QuadForPlane(double *outpoints, double planenormalx, double planen
 	outpoints[11] = planedist * planenormalz - quadsize * quadright[2] - quadsize * quadup[2];
 }
 
-void PolygonF_Divide(int innumpoints, const float *inpoints, float planenormalx, float planenormaly, float planenormalz, float planedist, float epsilon, int outfrontmaxpoints, float *outfrontpoints, int *neededfrontpoints, int outbackmaxpoints, float *outbackpoints, int *neededbackpoints)
+int PolygonF_Clip(int innumpoints, const float *inpoints, float planenormalx, float planenormaly, float planenormalz, float planedist, float epsilon, int outfrontmaxpoints, float *outfrontpoints)
 {
-	int i, frontcount, backcount;
+	int i, frontcount = 0;
 	const float *n, *p;
 	float frac, pdist, ndist;
-	frontcount = 0;
-	backcount = 0;
-	for (i = 0;i < innumpoints;i++)
+	if (innumpoints < 1)
+		return 0;
+	n = inpoints;
+	ndist = n[0] * planenormalx + n[1] * planenormaly + n[2] * planenormalz - planedist;
+	for(i = 0;i < innumpoints;i++)
 	{
-		p = inpoints + i * 3;
+		p = n;
+		pdist = ndist;
 		n = inpoints + ((i + 1) < innumpoints ? (i + 1) : 0) * 3;
-		pdist = p[0] * planenormalx + p[1] * planenormaly + p[2] * planenormalz - planedist;
 		ndist = n[0] * planenormalx + n[1] * planenormaly + n[2] * planenormalz - planedist;
 		if (pdist >= -epsilon)
 		{
@@ -119,16 +121,6 @@ void PolygonF_Divide(int innumpoints, const float *inpoints, float planenormalx,
 			}
 			frontcount++;
 		}
-		if (pdist <= epsilon)
-		{
-			if (backcount < outbackmaxpoints)
-			{
-				*outbackpoints++ = p[0];
-				*outbackpoints++ = p[1];
-				*outbackpoints++ = p[2];
-			}
-			backcount++;
-		}
 		if ((pdist > epsilon && ndist < -epsilon) || (pdist < -epsilon && ndist > epsilon))
 		{
 			frac = pdist / (pdist - ndist);
@@ -139,33 +131,25 @@ void PolygonF_Divide(int innumpoints, const float *inpoints, float planenormalx,
 				*outfrontpoints++ = p[2] + frac * (n[2] - p[2]);
 			}
 			frontcount++;
-			if (backcount < outbackmaxpoints)
-			{
-				*outbackpoints++ = p[0] + frac * (n[0] - p[0]);
-				*outbackpoints++ = p[1] + frac * (n[1] - p[1]);
-				*outbackpoints++ = p[2] + frac * (n[2] - p[2]);
-			}
-			backcount++;
 		}
 	}
-	if (neededfrontpoints)
-		*neededfrontpoints = frontcount;
-	if (neededbackpoints)
-		*neededbackpoints = backcount;
+	return frontcount;
 }
 
-void PolygonD_Divide(int innumpoints, const double *inpoints, double planenormalx, double planenormaly, double planenormalz, double planedist, double epsilon, int outfrontmaxpoints, double *outfrontpoints, int *neededfrontpoints, int outbackmaxpoints, double *outbackpoints, int *neededbackpoints)
+int PolygonD_Clip(int innumpoints, const double *inpoints, double planenormalx, double planenormaly, double planenormalz, double planedist, double epsilon, int outfrontmaxpoints, double *outfrontpoints)
 {
-	int i, frontcount, backcount;
+	int i, frontcount = 0;
 	const double *n, *p;
 	double frac, pdist, ndist;
-	frontcount = 0;
-	backcount = 0;
-	for (i = 0;i < innumpoints;i++)
+	if (innumpoints < 1)
+		return 0;
+	n = inpoints;
+	ndist = n[0] * planenormalx + n[1] * planenormaly + n[2] * planenormalz - planedist;
+	for(i = 0;i < innumpoints;i++)
 	{
-		p = inpoints + i * 3;
+		p = n;
+		pdist = ndist;
 		n = inpoints + ((i + 1) < innumpoints ? (i + 1) : 0) * 3;
-		pdist = p[0] * planenormalx + p[1] * planenormaly + p[2] * planenormalz - planedist;
 		ndist = n[0] * planenormalx + n[1] * planenormaly + n[2] * planenormalz - planedist;
 		if (pdist >= -epsilon)
 		{
@@ -177,16 +161,6 @@ void PolygonD_Divide(int innumpoints, const double *inpoints, double planenormal
 			}
 			frontcount++;
 		}
-		if (pdist <= epsilon)
-		{
-			if (backcount < outbackmaxpoints)
-			{
-				*outbackpoints++ = p[0];
-				*outbackpoints++ = p[1];
-				*outbackpoints++ = p[2];
-			}
-			backcount++;
-		}
 		if ((pdist > epsilon && ndist < -epsilon) || (pdist < -epsilon && ndist > epsilon))
 		{
 			frac = pdist / (pdist - ndist);
@@ -197,18 +171,140 @@ void PolygonD_Divide(int innumpoints, const double *inpoints, double planenormal
 				*outfrontpoints++ = p[2] + frac * (n[2] - p[2]);
 			}
 			frontcount++;
-			if (backcount < outbackmaxpoints)
+		}
+	}
+	return frontcount;
+}
+
+void PolygonF_Divide(int innumpoints, const float *inpoints, float planenormalx, float planenormaly, float planenormalz, float planedist, float epsilon, int outfrontmaxpoints, float *outfrontpoints, int *neededfrontpoints, int outbackmaxpoints, float *outbackpoints, int *neededbackpoints, int *oncountpointer)
+{
+	int i, frontcount = 0, backcount = 0, oncount = 0;
+	const float *n, *p;
+	float frac, pdist, ndist;
+	if (innumpoints)
+	{
+		n = inpoints;
+		ndist = n[0] * planenormalx + n[1] * planenormaly + n[2] * planenormalz - planedist;
+		for(i = 0;i < innumpoints;i++)
+		{
+			p = n;
+			pdist = ndist;
+			n = inpoints + ((i + 1) < innumpoints ? (i + 1) : 0) * 3;
+			ndist = n[0] * planenormalx + n[1] * planenormaly + n[2] * planenormalz - planedist;
+			if (pdist >= -epsilon)
+			{
+				if (pdist <= epsilon)
+					oncount++;
+				if (frontcount < outfrontmaxpoints)
+				{
+					*outfrontpoints++ = p[0];
+					*outfrontpoints++ = p[1];
+					*outfrontpoints++ = p[2];
+				}
+				frontcount++;
+			}
+			if (pdist <= epsilon)
+			{
+				if (backcount < outbackmaxpoints)
+				{
+					*outbackpoints++ = p[0];
+					*outbackpoints++ = p[1];
+					*outbackpoints++ = p[2];
+				}
+				backcount++;
+			}
+			if ((pdist > epsilon && ndist < -epsilon) || (pdist < -epsilon && ndist > epsilon))
+			{
+				oncount++;
+				frac = pdist / (pdist - ndist);
+				if (frontcount < outfrontmaxpoints)
+				{
+					*outfrontpoints++ = p[0] + frac * (n[0] - p[0]);
+					*outfrontpoints++ = p[1] + frac * (n[1] - p[1]);
+					*outfrontpoints++ = p[2] + frac * (n[2] - p[2]);
+				}
+				frontcount++;
+				if (backcount < outbackmaxpoints)
+				{
+					*outbackpoints++ = p[0] + frac * (n[0] - p[0]);
+					*outbackpoints++ = p[1] + frac * (n[1] - p[1]);
+					*outbackpoints++ = p[2] + frac * (n[2] - p[2]);
+				}
+				backcount++;
+			}
+		}
+	}
+	if (neededfrontpoints)
+		*neededfrontpoints = frontcount;
+	if (neededbackpoints)
+		*neededbackpoints = backcount;
+	if (oncountpointer)
+		*oncountpointer = oncount;
+}
+
+void PolygonD_Divide(int innumpoints, const double *inpoints, double planenormalx, double planenormaly, double planenormalz, double planedist, double epsilon, int outfrontmaxpoints, double *outfrontpoints, int *neededfrontpoints, int outbackmaxpoints, double *outbackpoints, int *neededbackpoints, int *oncountpointer)
+{
+	int i = 0, frontcount = 0, backcount = 0, oncount = 0;
+	const double *n, *p;
+	double frac, pdist, ndist;
+	if (innumpoints)
+	{
+		n = inpoints;
+		ndist = n[0] * planenormalx + n[1] * planenormaly + n[2] * planenormalz - planedist;
+		for(i = 0;i < innumpoints;i++)
+		{
+			p = n;
+			pdist = ndist;
+			n = inpoints + ((i + 1) < innumpoints ? (i + 1) : 0) * 3;
+			ndist = n[0] * planenormalx + n[1] * planenormaly + n[2] * planenormalz - planedist;
+			if (pdist >= -epsilon)
+			{
+				if (pdist <= epsilon)
+					oncount++;
+				if (frontcount < outfrontmaxpoints)
+				{
+					*outfrontpoints++ = p[0];
+					*outfrontpoints++ = p[1];
+					*outfrontpoints++ = p[2];
+				}
+				frontcount++;
+			}
+			if (pdist <= epsilon)
+			{
+				if (backcount < outbackmaxpoints)
+				{
+					*outbackpoints++ = p[0];
+					*outbackpoints++ = p[1];
+					*outbackpoints++ = p[2];
+				}
+				backcount++;
+			}
+			if ((pdist > epsilon && ndist < -epsilon) || (pdist < -epsilon && ndist > epsilon))
 			{
-				*outbackpoints++ = p[0] + frac * (n[0] - p[0]);
-				*outbackpoints++ = p[1] + frac * (n[1] - p[1]);
-				*outbackpoints++ = p[2] + frac * (n[2] - p[2]);
+				oncount++;
+				frac = pdist / (pdist - ndist);
+				if (frontcount < outfrontmaxpoints)
+				{
+					*outfrontpoints++ = p[0] + frac * (n[0] - p[0]);
+					*outfrontpoints++ = p[1] + frac * (n[1] - p[1]);
+					*outfrontpoints++ = p[2] + frac * (n[2] - p[2]);
+				}
+				frontcount++;
+				if (backcount < outbackmaxpoints)
+				{
+					*outbackpoints++ = p[0] + frac * (n[0] - p[0]);
+					*outbackpoints++ = p[1] + frac * (n[1] - p[1]);
+					*outbackpoints++ = p[2] + frac * (n[2] - p[2]);
+				}
+				backcount++;
 			}
-			backcount++;
 		}
 	}
 	if (neededfrontpoints)
 		*neededfrontpoints = frontcount;
 	if (neededbackpoints)
 		*neededbackpoints = backcount;
+	if (oncountpointer)
+		*oncountpointer = oncount;
 }