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
|
/***************************************************************************
* Copyright (C) 2007 by Bjorn Harpe,,, *
* bjorn@Ouelong.com *
* *
* This program is free software; you can redistribute it and/or modify *
* it under the terms of the GNU General Public License as published by *
* the Free Software Foundation; either version 2 of the License, or *
* (at your option) any later version. *
* *
* This program 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 General Public License for more details. *
* *
* You should have received a copy of the GNU General Public License *
* along with this program; if not, write to the *
* Free Software Foundation, Inc., *
* 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *
***************************************************************************/
#ifndef CONTOURS_H
#define CONTOURS_H
#include <vector>
#include <algorithm>
#define DIFFERENCE 0.0005
#define EQ(_x_,_y_) (((_x_-_y_<DIFFERENCE)&&(_y_-_x_<DIFFERENCE))?1:0)
#define xsect(p1,p2) (h[p2]*xh[p1]-h[p1]*xh[p2])/(h[p2]-h[p1])
#define ysect(p1,p2) (h[p2]*yh[p1]-h[p1]*yh[p2])/(h[p2]-h[p1])
//#define min(x,y) (x<y?x:y)
//#define max(x,y) (x>y?x:y)
using namespace std;
struct SVector
{
double dx,dy;
};
struct SPoint
{
SPoint(double x,double y){this->x=x;this->y=y;}
SPoint(){}
double x,y;
};
struct SPair
{
SPair(SPoint p1, SPoint p2){this->p1=p1;this->p2=p2;}
SPair reverse(){return(SPair(p2,p1));}
SPoint p1,p2;
};
bool operator <(SPoint p1, SPoint p2);
bool operator <(SPair p1,SPair p2);
bool operator ==(SPoint p1,SPoint p2);
bool operator !=(SPoint p1,SPoint p2);
SPoint operator +=(SPoint p, SVector v);
class CContour
{
public:
CContour(){contour=NULL;}
~CContour();
int merge(CContour *c);
int reverse();
int add_vector(SPoint start,SPoint end);
int condense(double difference = 0.000000001);
int dump();
bool closed(){return(_start==_end);}
SPoint start(){return(_start);}
SPoint end(){return(_end);}
vector<SPoint> contourPoints();
vector<SVector> *contour;
private:
SPoint _start,_end;
};
class CRaster
{
public:
CRaster(){}
virtual double value(double, double){return(0);}
virtual SPoint upper_bound(){return(SPoint(0,0));}
virtual SPoint lower_bound(){return(SPoint(0,0));}
virtual ~CRaster(){}
};
class CContourLevel
{
public:
CContourLevel(){contour_lines=NULL;raw=NULL;}
int dump();
int merge();
int consolidate();
vector<CContour*> *contour_lines;
vector<SPair> *raw;
~CContourLevel();
};
class CContourMap
{
public:
CContourMap();
int generate_levels(double min,double max, int num);
int generate_levels_zero(double min,double max, int num);
int add_segment(SPair t,int level);
int dump();
int contour(CRaster *r);
int consolidate();
CContourLevel* level(int i){return contour_level ? ((*contour_level)[i]) : 0;}
double alt(int i){return(levels[i]);}
~CContourMap();
private:
vector<CContourLevel*> *contour_level;
int n_levels;
double *levels;
};
#endif
|
