--- ray/src/common/face.c	2003/02/25 02:47:21	2.7
+++ ray/src/common/face.c	2003/06/26 00:58:09	2.11
@@ -1,5 +1,5 @@
 #ifndef lint
-static const char	RCSid[] = "$Id: face.c,v 2.7 2003/02/25 02:47:21 greg Exp $";
+static const char RCSid[] = "$Id: face.c,v 2.11 2003/06/26 00:58:09 schorsch Exp $";
 #endif
 /*
  *  face.c - routines dealing with polygonal faces.
@@ -25,9 +25,9 @@ static const char	RCSid[] = "$Id: face.c,v 2.7 2003/02
  */
 
 #ifdef  SMLFLT
-#define  VERTEPS	1e-2		/* allowed vertex error */
+#define  VERTEPS	1e-3		/* allowed vertex error */
 #else
-#define  VERTEPS	1e-4		/* allowed vertex error */
+#define  VERTEPS	1e-5		/* allowed vertex error */
 #endif
 
 
@@ -36,7 +36,7 @@ getface(o)			/* get arguments for a face */
 OBJREC  *o;
 {
 	double  d1;
-	int  badvert;
+	int  smalloff, badvert;
 	FVECT  v1, v2, v3;
 	register FACE  *f;
 	register int  i;
@@ -84,13 +84,17 @@ OBJREC  *o;
 						/* compute offset */
 	badvert = 0;
 	f->offset = DOT(f->norm, VERTEX(f,0));
+	smalloff = fabs(f->offset) <= VERTEPS;
 	for (i = 1; i < f->nv; i++) {
 		d1 = DOT(f->norm, VERTEX(f,i));
-		badvert += fabs(d1 - f->offset/i) > VERTEPS;
+		if (smalloff)
+			badvert += fabs(d1 - f->offset/i) > VERTEPS;
+		else
+			badvert += fabs(1.0 - d1*i/f->offset) > VERTEPS;
 		f->offset += d1;
 	}
 	f->offset /= (double)f->nv;
-	if (badvert)
+	if (f->nv > 3 && badvert)
 		objerror(o, WARNING, "non-planar vertex");
 						/* find axis */
 	f->ax = fabs(f->norm[0]) > fabs(f->norm[1]) ? 0 : 1;
@@ -119,8 +123,9 @@ FACE  *f;
 {
 	int  ncross, n;
 	double  x, y;
+	int  tst;
 	register int  xi, yi;
-	register FLOAT  *p0, *p1;
+	register RREAL  *p0, *p1;
 
 	xi = (f->ax+1)%3;
 	yi = (f->ax+2)%3;
@@ -132,13 +137,15 @@ FACE  *f;
 	ncross = 0;
 					/* positive x axis cross test */
 	while (n--) {
-		if ((p0[yi] > y) ^ (p1[yi] > y))
-			if (p0[xi] > x && p1[xi] > x)
+		if ((p0[yi] > y) ^ (p1[yi] > y)) {
+			tst = (p0[xi] > x) + (p1[xi] > x);
+			if (tst == 2)
 				ncross++;
-			else if (p0[xi] > x || p1[xi] > x)
+			else if (tst)
 				ncross += (p1[yi] > p0[yi]) ^
 						((p0[yi]-y)*(p1[xi]-x) >
 						(p0[xi]-x)*(p1[yi]-y));
+		}
 		p0 = p1;
 		p1 += 3;
 	}