diff options
Diffstat (limited to 'source/blender/blenlib/intern/delaunay_2d.cc')
-rw-r--r-- | source/blender/blenlib/intern/delaunay_2d.cc | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/source/blender/blenlib/intern/delaunay_2d.cc b/source/blender/blenlib/intern/delaunay_2d.cc index 7b0f6a658ce..ac3662284d0 100644 --- a/source/blender/blenlib/intern/delaunay_2d.cc +++ b/source/blender/blenlib/intern/delaunay_2d.cc @@ -1031,7 +1031,7 @@ void dc_tri(CDTArrangement<T> *cdt, } return; } - /* Recursive case. Do left (L) and right (R) halves seperately, then join. */ + /* Recursive case. Do left (L) and right (R) halves separately, then join. */ int n2 = n / 2; BLI_assert(n2 >= 2 && end - (start + n2) >= 2); SymEdge<T> *ldo; @@ -1308,7 +1308,7 @@ template<typename T> inline int tri_orient(const SymEdge<T> *t) * For case (a), 'vert' will be the vertex, and lambda will be 0, and 'in' will be the #SymEdge * from 'vert' that has as face the one that you go through to get to this vertex. If you go * exactly along an edge then we set 'in' to NULL, since it won't be needed. The first crossing - * will have 'in' = NULL. We set 'out' to the #SymEdge that has the face we go though to get to the + * will have 'in' = NULL. We set 'out' to the #SymEdge that has the face we go through to get to the * next crossing, or, if the next crossing is a case (a), then it is the edge that goes to that * next vertex. 'out' will be NULL for the last one. * |