[brlcad-commits] SF.net SVN: brlcad:[52842] brlcad/trunk/src/librt/primitives/dsp/dsp.c
Open Source Solid Modeling CAD
Brought to you by:
brlcad
From: <car...@us...> - 2012-10-05 16:26:47
|
Revision: 52842 http://brlcad.svn.sourceforge.net/brlcad/?rev=52842&view=rev Author: carlmoore Date: 2012-10-05 16:26:37 +0000 (Fri, 05 Oct 2012) Log Message: ----------- fix spellings, including, in a comment, rt_dsp_internal Modified Paths: -------------- brlcad/trunk/src/librt/primitives/dsp/dsp.c Modified: brlcad/trunk/src/librt/primitives/dsp/dsp.c =================================================================== --- brlcad/trunk/src/librt/primitives/dsp/dsp.c 2012-10-05 16:19:37 UTC (rev 52841) +++ brlcad/trunk/src/librt/primitives/dsp/dsp.c 2012-10-05 16:26:37 UTC (rev 52842) @@ -151,7 +151,7 @@ * per-solid ray tracing form of solid, including precomputed terms * * The dsp_i element MUST BE FIRST so that we can cast a pointer to a - * dsp_specific to a rt_dsp_intermal. + * dsp_specific to a rt_dsp_internal. */ struct dsp_specific { struct rt_dsp_internal dsp_i; /* MUST BE FIRST */ @@ -942,7 +942,7 @@ dsp->dsp_pl_dist[ZMAX] = (fastf_t)dsp_max; dsp->dsp_pl_dist[ZMID] = (fastf_t)dsp_min; - /* compute enlarged bounding box and spere */ + /* compute enlarged bounding box and sphere */ #define BBOX_PT(_x, _y, _z) \ VSET(pt, (fastf_t)_x, (fastf_t)_y, (fastf_t)_z); \ @@ -996,7 +996,7 @@ * * Note: because the stand-along bbox calculation requires much * of the prep logic, the in-prep bbox calculations are left - * in to avoid dupliation rather than calling rt_dsp_bbox. + * in to avoid duplication rather than calling rt_dsp_bbox. */ int rt_dsp_prep(struct soltab *stp, struct rt_db_internal *ip, struct rt_i *rtip) @@ -1075,7 +1075,7 @@ dsp->dsp_pl_dist[ZMAX] = (fastf_t)dsp_max; dsp->dsp_pl_dist[ZMID] = (fastf_t)dsp_min; - /* compute enlarged bounding box and spere */ + /* compute enlarged bounding box and sphere */ #define BBOX_PT(_x, _y, _z) \ VSET(pt, (fastf_t)_x, (fastf_t)_y, (fastf_t)_z); \ @@ -1358,7 +1358,7 @@ plane_t N; /* Normal for plane of triangle */ fastf_t NdotDir; fastf_t alpha, beta; /* barycentric distances */ - fastf_t hitdist; /* distance to ray/trianlge intercept */ + fastf_t hitdist; /* distance to ray/triangle intercept */ fastf_t toldist; /* distance tolerance from isect->tol */ #ifdef FULL_DSP_DEBUGGING @@ -1484,7 +1484,7 @@ } #endif - /* Oridnarily, in 2D we would say: + /* Ordinarily, in 2D we would say: * * beta = AB[X] * AP[X] + AB[Y] * AP[Y]; * alpha = AC[X] * AP[X] + AC[Y] * AP[Y]; @@ -1539,7 +1539,7 @@ * P E R M U T E _ C E L L * * For adaptive diagonal selection or for Upper-Left to lower right - * cell cut, we must permute the verticies of the cell before handing + * cell cut, we must permute the vertices of the cell before handing * them to the intersection algorithm. That's what this function * does. */ @@ -1802,8 +1802,8 @@ * I S E C T _ R A Y _ C E L L _ T O P * * Return - * 0 continue intesection calculations - * 1 Terminate intesection computation + * 0 continue intersection calculations + * 1 Terminate intersection computation */ HIDDEN int isect_ray_cell_top(struct isect_stuff *isect, struct dsp_bb *dsp_bb) @@ -2068,7 +2068,7 @@ /** * D S P _ I N _ R P P * - * Compute the intersections of a ray with a rectangular parallelpiped + * Compute the intersections of a ray with a rectangular parallelepiped * (RPP) that has faces parallel to the coordinate planes * * The algorithm here was developed by Gary Kuehl for GIFT. A good @@ -2218,8 +2218,8 @@ * R E C U R S E _ D S P _ B B * * Return - * 0 continue intesection calculations - * 1 Terminate intesection computation + * 0 continue intersection calculations + * 1 Terminate intersection computation */ HIDDEN int recurse_dsp_bb(struct isect_stuff *isect, @@ -2385,8 +2385,8 @@ * of rt_dsp_shot() * * Return - * 0 continue intesection calculations - * 1 Terminate intesection computation + * 0 continue intersection calculations + * 1 Terminate intersection computation */ HIDDEN int isect_ray_dsp_bb(struct isect_stuff *isect, struct dsp_bb *dsp_bb) @@ -2896,7 +2896,7 @@ /* We've hit one of the sides or bottom, or the user didn't * ask for smoothing of the elevation data, so there's no * interpolation to do. Just transform the normal to model - * space, and comput the actual hit point + * space, and compute the actual hit point */ /* transform normal into model space */ @@ -2999,7 +2999,7 @@ if ((ZERO(hitp->hit_vpriv[Z]) && dot > 0.0)/* in-hit needs fix */ || (ZERO(hitp->hit_vpriv[Z] - 1.0) && dot < 0.0)/* out-hit needs fix */) { - /* bring the normal back to being perpindicular to the ray to + /* bring the normal back to being perpendicular to the ray to * avoid "flipped normal" warnings */ VCROSS(A, rp->r_dir, N); @@ -3505,7 +3505,7 @@ fastf_t c02, c13; /* curvature in direction 0<->2, and 1<->3 */ if (dsp_ip->dsp_cuttype != DSP_CUT_DIR_ADAPT) { - /* not using adpative cut type, so just return the cut type */ + /* not using adaptive cut type, so just return the cut type */ return dsp_ip->dsp_cuttype; } This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. |