Revision: 53430
http://brlcad.svn.sourceforge.net/brlcad/?rev=53430&view=rev
Author: carlmoore
Date: 2012-11-01 20:04:56 +0000 (Thu, 01 Nov 2012)
Log Message:
-----------
fix spellings
Modified Paths:
--------------
brlcad/trunk/src/util/pixmorph.c
Modified: brlcad/trunk/src/util/pixmorph.c
===================================================================
--- brlcad/trunk/src/util/pixmorph.c 2012-11-01 20:03:26 UTC (rev 53429)
+++ brlcad/trunk/src/util/pixmorph.c 2012-11-01 20:04:56 UTC (rev 53430)
@@ -73,7 +73,7 @@
#define MAXLEN 65536
/* gprof tells me that 73% of the time to execute was spent in those two
- pow() function calls. So, we "memoize" a little bit, and don't call those
+ pow() function calls. So, we "memorize" a little bit, and don't call those
pow()s for weights already calculated (they only depend on length and dist,
which range from 0 to MAXLEN.) Truncating them to integers changes things
*very* little...trust me. */
@@ -157,7 +157,7 @@
/* This is a fairly straightforward implementation of the
algorithm in Beier and Neely's paper.
We work only with vector components here... note that
- Perpindicular((a, b)) = (b, -a). */
+ Perpendicular((a, b)) = (b, -a). */
x_minus_p_x = x_x - tlines->s[MIDDLE].x_1;
x_minus_p_y = x_y - tlines->s[MIDDLE].y_1;
@@ -485,7 +485,7 @@
return 1;
}
- /* The following is our memoizing table for weight calculation. */
+ /* The following is our memorizing table for weight calculation. */
for (i = 0; i < MAXLEN; i++)
weightlookup[i] = -1.0;
This was sent by the SourceForge.net collaborative development platform, the
world's largest Open Source development site.
------------------------------------------------------------------------------
Everyone hates slow websites. So do we.
Make your web apps faster with AppDynamics
Download AppDynamics Lite for free today:
http://p.sf.net/sfu/appdyn_sfd2d_oct
_______________________________________________
BRL-CAD Source Commits mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/brlcad-commits
