summaryrefslogtreecommitdiff
path: root/libs/pbd/pbd/cartesian.h
blob: b44a12cd3dc58c5406d7ff2648c13633be055ec1 (plain)
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
/*
    Copyright (C) 2010 Paul Davis

    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., 675 Mass Ave, Cambridge, MA 02139, USA.
*/

#ifndef __libpbd_cartesian_h__
#define __libpbd_cartesian_h__

#include <cfloat>
#include <cmath>

namespace PBD {

void azi_ele_to_cart (double azi, double ele, double& x, double& y, double& z);
void cart_to_azi_ele (double x, double y, double z, double& azi, double& ele);
        
struct AngularVector;

struct CartesianVector {
    double x;
    double y;
    double z;

    CartesianVector () : x(0.0), y(0.0), z(0.0) {}
    CartesianVector (double xp, double yp, double zp = 0.0) : x(xp), y(yp), z(zp) {}

    CartesianVector& translate (CartesianVector& other, double xtranslate, double ytranslate, double ztranslate = 0.0) {
            other.x += xtranslate;
            other.y += ytranslate;
            other.z += ztranslate;
            return other;
    }

    CartesianVector& scale (CartesianVector& other, double xscale, double yscale, double zscale = 1.0) {
            other.x *= xscale;
            other.y *= yscale;
            other.z *= zscale;
            return other;
    }

    void angular (AngularVector&) const;
};

struct AngularVector {
    double azi;
    double ele;
    double length;

    AngularVector () : azi(0.0), ele(0.0), length (0.0) {}
    AngularVector (double a, double e, double l = 1.0) : azi(a), ele(e), length (l) {}

    AngularVector operator- (const AngularVector& other) const {
            AngularVector r;
            r.azi = azi - other.azi;
            r.ele = ele - other.ele;
            r.length = length - other.length;
            return r;
    }

    AngularVector operator+ (const AngularVector& other) const {
            AngularVector r;
            r.azi = azi + other.azi;
            r.ele = ele + other.ele;
            r.length = length + other.length;
            return r;
    }

    bool operator== (const AngularVector& other) const {
            return fabs (azi - other.azi) <= FLT_EPSILON &&
                    fabs (ele - other.ele) <= FLT_EPSILON &&
                    fabs (length - other.length) <= FLT_EPSILON;
    }

    bool operator!= (const AngularVector& other) const {
            return fabs (azi - other.azi) > FLT_EPSILON ||
                    fabs (ele - other.ele) > FLT_EPSILON ||
                    fabs (length - other.length) > FLT_EPSILON;
    }

    void cartesian (CartesianVector& c) const {
            azi_ele_to_cart (azi, ele, c.x, c.y, c.z);
    }
};

inline
void CartesianVector::angular (AngularVector& a) const {
        cart_to_azi_ele (x, y, z, a.azi, a.ele);
}

}

#endif /* __libpbd_cartesian_h__ */