File: main_flip.cpp

package info (click to toggle)
neartree 5.1.1+dfsg1-1
  • links: PTS, VCS
  • area: main
  • in suites: bullseye, buster, sid
  • size: 1,380 kB
  • sloc: cpp: 12,313; ansic: 5,956; makefile: 495
file content (145 lines) | stat: -rw-r--r-- 5,103 bytes parent folder | download | duplicates (3)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
//*
//*  main.cpp
//*  NearTree
//*
//*  Copyright 2001, 2008 Larry Andrews.  All rights reserved
//*  Revised 12 Dec 2008 for sourceforge release -- H. J. Bernstein


//**********************************************************************
//*                                                                    *
//* YOU MAY REDISTRIBUTE NearTree UNDER THE TERMS OF THE LGPL          *
//*                                                                    *
//**********************************************************************/

//************************* LGPL NOTICES *******************************
//*                                                                    *
//* This library is free software; you can redistribute it and/or      *
//* modify it under the terms of the GNU Lesser General Public         *
//* License as published by the Free Software Foundation; either       *
//* version 2.1 of the License, or (at your option) any later version. *
//*                                                                    *
//* This library is distributed in the hope that it will be useful,    *
//* but WITHOUT ANY WARRANTY; without even the implied warranty of     *
//* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU  *
//* Lesser General Public License for more details.                    *
//*                                                                    *
//* You should have received a copy of the GNU Lesser General Public   *
//* License along with this library; if not, write to the Free         *
//* Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston,    *
//* MA  02110-1301  USA                                                *
//*                                                                    *
//**********************************************************************/

#include <stdio.h>
#include <iostream>
#include <stdlib.h>
#include <limits.h>
#include <time.h>
#include <vector>
#include <float.h>

#include "TNear.h"
#include "v.h"

#ifndef USE_LOCAL_HEADERS
#include <rhrand.h>
#else
#include "rhrand.h"
#endif
RHrand rhr;



int main ( int argc, char* argv[] )
{
    CNearTree <v> vTree;
    v vBest = DBL_MAX;
    long i,j,k;
    const long lMaxRow = 10;
    std::vector <v> vReturn;
    
    if (argc <= 1) {
        rhr.srandom( (unsigned int)time( NULL ) );  /* use the current time to seed the
                                                   random number generator */
    } else {
        rhr.srandom((unsigned int)atoi(argv[1]));
    }
    
    vTree.SetFlags(CNearTree <v>::NTF_ForceFlip,CNearTree <v>::NTF_ForceFlip|CNearTree <v>::NTF_NoFlip);
    
    //---------------------------------------
    // build up a library of points to search among
    //---------------------------------------
    for ( k=-1; k<=lMaxRow; k++ )
    {
        for ( j=-1; j<=lMaxRow; j++) 
        {
            for ( i= lMaxRow ; i>=-1;  i-- ) 
            {
                vTree.insert( v((double)i, (double)j, (double)k) );
            }  // for i
        }     // for j
    }        // for k
    std::cout
    << std::endl;
    
    //---------------------------------------
    //   Done building the tree; now try a retrieval
    //---------------------------------------
    
    double   dRad = 0.6;
    long lReturn;
    for ( i=0;  i<10; i++ )
    {
        dRad += 0.05;
        double x = rhr.urand() * double( lMaxRow ) ;
        double y = x;
        double z = ( 1.25 * double(lMaxRow) - 1.5 * x );
        v vSearch( x, 0.5*(x+y), z );
        std::cout
        << "Trial " << i << " from probe point " << vSearch << std::endl;
        
        
        
        
        // find the nearest point to vSearch
        if ( vTree.NearestNeighbor( dRad, vBest, vSearch ) )
        {
            std::cout
            << " Closest distance " << (double) ( vSearch - vBest ) << " to " << vBest << std::endl;
        }
        else
        {
            std::cout
            << " ***** nothing within " << dRad << " of " << vSearch << std::endl;
        }
        
        // find the farthest point from vSearch
        if ( vTree.FarthestNeighbor ( vBest, vSearch ) )
        {
            std::cout 
            << " Farthest distance " << (double) ( vSearch - vBest ) << " to " << vBest << std::endl;
        }
        else
        {
            std::cout << " No Farthest object found" << std::endl;
        }
        
        // search for all points within a "sphere" out to radius dRad
        if ( ( lReturn = vTree.FindInSphere( dRad, vReturn, vSearch )) > 0 ) 
        {
            std::cout << " Returned " << lReturn << " items within " << dRad << " of "<< vSearch << std::endl;
            std::sort(vReturn.begin( ),vReturn.end( ));
            std::vector <v>::iterator iv;
            for ( iv=vReturn.begin( ); iv<vReturn.end( ); iv++ )
            {
                std::cout << "\t" << *iv << std::endl;
            }
        }
        
        std::cout << " -------------------------------------------------------------"<<std::endl;
    }  // for i
    
    return ( EXIT_SUCCESS );
}