File size: 4,255 Bytes
985c397
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
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
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
// SPDX-License-Identifier: BSD-3-Clause

// Box2D.h

/*==============================
Copyright (c) 2011-2015 Dan Heeks

Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
   notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
   notice, this list of conditions and the following disclaimer in the
   documentation and/or other materials provided with the distribution.
3. The name of the author may not be used to endorse or promote products
   derived from this software without specific prior written permission.

THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
==============================*/

#pragma once

#include <string.h>  // for memcpy() prototype
#include <cmath>     // for sqrt() prototype

class CBox2D
{
public:
    Point m_minxy;
    Point m_maxxy;
    bool m_valid;

    CBox2D()
        : m_valid(false)
    {}
    CBox2D(const Point& minxy, const Point& maxxy)
        : m_minxy(minxy)
        , m_maxxy(maxxy)
        , m_valid(true)
    {}

    bool operator==(const CBox2D& rhs) const
    {
        if (m_minxy != rhs.m_minxy) {
            return false;
        }
        if (m_maxxy != rhs.m_maxxy) {
            return false;
        }
        if (m_valid != rhs.m_valid) {
            return (false);
        }

        return (true);
    }

    bool operator!=(const CBox2D& rhs) const
    {
        return (!(*this == rhs));
    }


    void Insert(const Point& p)
    {  // insert a point
        if (m_valid) {
            if (p.x < m_minxy.x) {
                m_minxy.x = p.x;
            }
            if (p.y < m_minxy.y) {
                m_minxy.y = p.y;
            }
            if (p.x > m_maxxy.x) {
                m_maxxy.x = p.x;
            }
            if (p.y > m_maxxy.y) {
                m_maxxy.y = p.y;
            }
        }
        else {
            m_valid = true;
            m_minxy = p;
            m_maxxy = p;
        }
    }

    void Insert(const CBox2D& b)
    {
        if (b.m_valid) {
            if (m_valid) {
                if (b.m_minxy.x < m_minxy.x) {
                    m_minxy.x = b.m_minxy.x;
                }
                if (b.m_minxy.y < m_minxy.y) {
                    m_minxy.y = b.m_minxy.y;
                }
                if (b.m_maxxy.x > m_maxxy.x) {
                    m_maxxy.x = b.m_maxxy.x;
                }
                if (b.m_maxxy.y > m_maxxy.y) {
                    m_maxxy.y = b.m_maxxy.y;
                }
            }
            else {
                m_valid = b.m_valid;
                m_minxy = b.m_minxy;
                m_maxxy = b.m_maxxy;
            }
        }
    }
    Point Centre() const
    {
        return (m_minxy + m_maxxy) * 0.5;
    }
    double Width() const
    {
        if (m_valid) {
            return m_maxxy.x - m_minxy.x;
        }
        else {
            return 0.0;
        }
    }
    double Height() const
    {
        if (m_valid) {
            return m_maxxy.y - m_minxy.y;
        }
        else {
            return 0.0;
        }
    }
    double Radius() const
    {
        return sqrt(Width() * Width() + Height() * Height()) / 2;
    }
    double MinX() const
    {
        return (m_minxy.x);
    }
    double MaxX() const
    {
        return (m_maxxy.x);
    }
    double MinY() const
    {
        return (m_minxy.y);
    }
    double MaxY() const
    {
        return (m_maxxy.y);
    }
};