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
|
/*
* Copyright (C) 2012 Adobe Systems Incorporated. All rights reserved.
*
* 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.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "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
* COPYRIGHT HOLDER OR CONTRIBUTORS 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.
*/
#ifndef FloatPolygon_h
#define FloatPolygon_h
#include "FloatPoint.h"
#include "FloatRect.h"
#include "PODIntervalTree.h"
#include "ValueToString.h"
#include "WindRule.h"
#include <memory>
#include <wtf/Vector.h>
namespace WebCore {
class FloatPolygonEdge;
class FloatPolygon {
public:
FloatPolygon(std::unique_ptr<Vector<FloatPoint>> vertices, WindRule fillRule);
const FloatPoint& vertexAt(unsigned index) const { return (*m_vertices)[index]; }
unsigned numberOfVertices() const { return m_vertices->size(); }
WindRule fillRule() const { return m_fillRule; }
const FloatPolygonEdge& edgeAt(unsigned index) const { return m_edges[index]; }
unsigned numberOfEdges() const { return m_edges.size(); }
FloatRect boundingBox() const { return m_boundingBox; }
bool overlappingEdges(float minY, float maxY, Vector<const FloatPolygonEdge*>& result) const;
bool contains(const FloatPoint&) const;
bool isEmpty() const { return m_empty; }
private:
typedef PODInterval<float, FloatPolygonEdge*> EdgeInterval;
typedef PODIntervalTree<float, FloatPolygonEdge*> EdgeIntervalTree;
bool containsNonZero(const FloatPoint&) const;
bool containsEvenOdd(const FloatPoint&) const;
std::unique_ptr<Vector<FloatPoint>> m_vertices;
WindRule m_fillRule;
FloatRect m_boundingBox;
bool m_empty;
Vector<FloatPolygonEdge> m_edges;
EdgeIntervalTree m_edgeTree; // Each EdgeIntervalTree node stores minY, maxY, and a ("UserData") pointer to a FloatPolygonEdge.
};
class VertexPair {
public:
virtual ~VertexPair() { }
virtual const FloatPoint& vertex1() const = 0;
virtual const FloatPoint& vertex2() const = 0;
float minX() const { return std::min(vertex1().x(), vertex2().x()); }
float minY() const { return std::min(vertex1().y(), vertex2().y()); }
float maxX() const { return std::max(vertex1().x(), vertex2().x()); }
float maxY() const { return std::max(vertex1().y(), vertex2().y()); }
bool overlapsRect(const FloatRect&) const;
bool intersection(const VertexPair&, FloatPoint&) const;
};
class FloatPolygonEdge : public VertexPair {
friend class FloatPolygon;
public:
virtual const FloatPoint& vertex1() const override
{
ASSERT(m_polygon);
return m_polygon->vertexAt(m_vertexIndex1);
}
virtual const FloatPoint& vertex2() const override
{
ASSERT(m_polygon);
return m_polygon->vertexAt(m_vertexIndex2);
}
const FloatPolygonEdge& previousEdge() const
{
ASSERT(m_polygon && m_polygon->numberOfEdges() > 1);
return m_polygon->edgeAt((m_edgeIndex + m_polygon->numberOfEdges() - 1) % m_polygon->numberOfEdges());
}
const FloatPolygonEdge& nextEdge() const
{
ASSERT(m_polygon && m_polygon->numberOfEdges() > 1);
return m_polygon->edgeAt((m_edgeIndex + 1) % m_polygon->numberOfEdges());
}
const FloatPolygon* polygon() const { return m_polygon; }
unsigned vertexIndex1() const { return m_vertexIndex1; }
unsigned vertexIndex2() const { return m_vertexIndex2; }
unsigned edgeIndex() const { return m_edgeIndex; }
private:
// Edge vertex index1 is less than index2, except the last edge, where index2 is 0. When a polygon edge
// is defined by 3 or more colinear vertices, index2 can be the the index of the last colinear vertex.
unsigned m_vertexIndex1;
unsigned m_vertexIndex2;
unsigned m_edgeIndex;
const FloatPolygon* m_polygon;
};
// This structure is used by PODIntervalTree for debugging.
#ifndef NDEBUG
template<> struct ValueToString<FloatPolygonEdge*> {
static String string(const FloatPolygonEdge* edge) { return String::format("%p (%f,%f %f,%f)", edge, edge->vertex1().x(), edge->vertex1().y(), edge->vertex2().x(), edge->vertex2().y()); }
};
#endif
} // namespace WebCore
#endif // FloatPolygon_h
|
