Package com.nr.cg

Examples of com.nr.cg.KDtree.locatenear()

52
53
54
55
56
57
58
59
60
61
62
    Point[] qolist=new Point[M];

    testpt.x[0]=0.6;
    testpt.x[1]=0.7;
    r=0.1;
    nkd=kd.locatenear(testpt,r,kdlist,M);
    nqo=qo.locatenear(testpt,r,qolist,M);

    // See if KDtree and Nearpoints found the same number of
    // neighbors withing radius r
    localflag = (nkd != nqo);
View Full Code Here
103
104
105
106
107
108
109
110
111
112
113
    test3pt.x[0]=0.6;
    test3pt.x[1]=0.7;
    test3pt.x[2]=0.6;
    r=0.1;
    nkd=kd3.locatenear(test3pt,r,kd3list,M);
    nqo=qo3.locatenear(test3pt,r,qo3list,M);

    // See if KDtree and Nearpoints found the same number of
    // neighbors withing radius r
    localflag = (nkd != nqo);
View Full Code Here
174
175
176
177
178
179
180
181
182
183
184
    int nmax=N/10;
    int[] list=new int[nmax];
    double r=0.1;
    y.x[0]=0.5;
    y.x[1]=0.5;
    int nret=tree2.locatenear(y,r,list,nmax);
    // Check the result by brute force
    int[] list2=new int[nmax];
    int nret2=0;
    for (i=0;i<N;i++) {
      if ((dist(y,kd2[i]) < r) && (nret2 < nmax)) {
View Full Code Here
345
346
347
348
349
350
351
352
353
354
355
    // Test locatenear() method in 3D
    r=0.2;
    yy.x[0]=0.5;
    yy.x[1]=0.5;
    yy.x[2]=0.5;
    nret=tree3.locatenear(yy,r,list,nmax);
    // Check the result by brute force
    nret2=0;
    for (i=0;i<N;i++) {
      if ((dist(yy,kd3[i]) < r) && (nret2 < nmax)) {
        list2[nret2]=i;
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.