diff options
author | Norbert Preining <norbert@preining.info> | 2020-08-07 03:02:55 +0000 |
---|---|---|
committer | Norbert Preining <norbert@preining.info> | 2020-08-07 03:02:55 +0000 |
commit | 3710c23789342d9d88783cbe9ad23eb5263a7c33 (patch) | |
tree | 1c40b2bfb9f6b652f7877ad0991f5d6b44391154 /graphics/asymptote/Delaunay.cc | |
parent | d99fea72e367e8d4d2809b43b3b0206b1bb526b8 (diff) |
CTAN sync 202008070302
Diffstat (limited to 'graphics/asymptote/Delaunay.cc')
-rw-r--r-- | graphics/asymptote/Delaunay.cc | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/graphics/asymptote/Delaunay.cc b/graphics/asymptote/Delaunay.cc index 3e9e5507f2..2090ddfeb3 100644 --- a/graphics/asymptote/Delaunay.cc +++ b/graphics/asymptote/Delaunay.cc @@ -13,7 +13,7 @@ inline double max(double a, double b) return (a > b) ? a : b; } -int XYZCompare(const void *v1, const void *v2) +int XYZCompare(const void *v1, const void *v2) { double x1=((XYZ*)v1)->p[0]; double x2=((XYZ*)v2)->p[0]; @@ -48,7 +48,7 @@ Int Triangulate(Int nv, XYZ pxyz[], ITRIANGLE v[], Int &ntri, if(presort) qsort(pxyz,nv,sizeof(XYZ),XYZCompare); else postsort=false; - + /* Allocate memory for the completeness list, flag for each triangle */ Int trimax = 4 * nv; Int *complete = new Int[trimax]; @@ -114,14 +114,14 @@ Int Triangulate(Int nv, XYZ pxyz[], ITRIANGLE v[], Int &ntri, double *a=pxyz[vj->p1].p; double *b=pxyz[vj->p2].p; double *c=pxyz[vj->p3].p; - + if(incircle(a,b,c,d) <= 0.0) { // Point d is inside or on circumcircle /* Check that we haven't exceeded the edge list size */ if(nedge + 3 >= emax) { emax += 100; IEDGE *p_EdgeTemp = new IEDGE[emax]; for (Int i = 0; i < nedge; i++) { - p_EdgeTemp[i] = edges[i]; + p_EdgeTemp[i] = edges[i]; } delete[] edges; edges = p_EdgeTemp; @@ -199,7 +199,7 @@ Int Triangulate(Int nv, XYZ pxyz[], ITRIANGLE v[], Int &ntri, delete[] edges; delete[] complete; - if(postsort) { + if(postsort) { for(Int i = 0; i < ntri; i++) { ITRIANGLE *vi=v+i; vi->p1=pxyz[vi->p1].i; @@ -209,4 +209,4 @@ Int Triangulate(Int nv, XYZ pxyz[], ITRIANGLE v[], Int &ntri, } return 0; -} +} |