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
|
/**********************************************************************
* $Id: TestSweepLineSpeed.cpp,v 1.13 2004/07/19 10:35:23 strk Exp $
*
* GEOS - Geometry Engine Open Source
* http://geos.refractions.net
*
* Copyright (C) 2001-2002 Vivid Solutions Inc.
*
* This is free software; you can redistribute and/or modify it under
* the terms of the GNU Lesser General Public Licence as published
* by the Free Software Foundation.
* See the COPYING file for more information.
*
**********************************************************************
* $Log: TestSweepLineSpeed.cpp,v $
* Revision 1.13 2004/07/19 10:35:23 strk
* bigtest.h moved to local dir
*
* Revision 1.12 2004/07/02 13:28:26 strk
* Fixed all #include lines to reflect headers layout change.
* Added client application build tips in README.
*
* Revision 1.11 2003/11/07 01:23:42 pramsey
* Add standard CVS headers licence notices and copyrights to all cpp and h
* files.
*
*
**********************************************************************/
//#define _CRTDBG_MAP_ALLOC
#include <stdlib.h>
//#include <crtdbg.h>
#include <stdio.h>
#include <time.h>
#include <geos/geom.h>
#include <geos/io.h>
#include "bigtest.h"
using namespace geos;
/**
* Run relate between two large geometries to test the performance
* of the sweepline intersection detection algorithm
*/
void run(int nPts, GeometryFactory *fact) {
clock_t startTime, endTime;
double size=100.0;
double armLen=50.0;
int nArms=10;
Polygon *poly=GeometryTestFactory::createSineStar(fact,0.0,0.0,size,armLen,nArms,nPts);
Polygon *box=GeometryTestFactory::createSineStar(fact,0.0,size/2,size,armLen,nArms,nPts);
// Polygon *box=GeometryTestFactory::createBox(fact,0,0,1,100.0);
startTime=clock();
poly->intersects(box);
endTime=clock();
double totalTime=(double)(endTime-startTime);
printf( "n Pts: %i Executed in %6.0f ms.\n",nPts,totalTime);
// cout << "n Pts: " << nPts << " Executed in " << totalTime << endl;
}
int main(int argC, char* argV[]) {
GeometryFactory *fact=new GeometryFactory();
run(1000,fact);
run(2000,fact);
run(4000,fact);
run(8000,fact);
run(16000,fact);
run(32000,fact);
run(64000,fact);
run(128000,fact);
run(256000,fact);
run(512000,fact);
run(1024000,fact);
// _CrtDumpMemoryLeaks();
cout << "Done" << endl;
return 0;
}
|
