Blame - tests/PolyUtilsTest.cpp - platform/external/skia

Jim Van Verth

6784ffa

2018-07-03 16:12:39 -0400

[diff] [blame]

/*

*

* Use of this source code is governed by a BSD-style license that can be

5

* found in the LICENSE file.

6

*/

7

#include "Test.h"

8

#include "SkPolyUtils.h"

9

10

DEF_TEST(PolyUtils, reporter) {

11

12

SkTDArray<SkPoint> poly;

13

// init simple index map

14

uint16_t indexMap[256];

15

for (int i = 0; i < 256; ++i) {

16

indexMap[i] = i;

17

}

18

SkTDArray<uint16_t> triangleIndices;

19

20

// skinny triangle

21

*poly.push() = SkPoint::Make(-100, 55);

22

*poly.push() = SkPoint::Make(100, 55);

23

*poly.push() = SkPoint::Make(102.5f, 54.330127f);

24

REPORTER_ASSERT(reporter, SkGetPolygonWinding(poly.begin(), poly.count()) < 0);

25

REPORTER_ASSERT(reporter, SkIsConvexPolygon(poly.begin(), poly.count()));

26

REPORTER_ASSERT(reporter, SkIsSimplePolygon(poly.begin(), poly.count()));

27

REPORTER_ASSERT(reporter, SkTriangulateSimplePolygon(poly.begin(), indexMap, poly.count(),

&triangleIndices));

// switch winding

poly[2].set(102.5f, 55.330127f);

32

REPORTER_ASSERT(reporter, SkGetPolygonWinding(poly.begin(), poly.count()) > 0);

33

REPORTER_ASSERT(reporter, SkIsConvexPolygon(poly.begin(), poly.count()));

34

REPORTER_ASSERT(reporter, SkIsSimplePolygon(poly.begin(), poly.count()));

35

triangleIndices.reset();

36

REPORTER_ASSERT(reporter, SkTriangulateSimplePolygon(poly.begin(), indexMap, poly.count(),

&triangleIndices));

// make degenerate

poly[2].set(100 + 2.5f, 55);

41

REPORTER_ASSERT(reporter, SkGetPolygonWinding(poly.begin(), poly.count()) == 0);

42

// TODO: should these fail?

43

REPORTER_ASSERT(reporter, SkIsConvexPolygon(poly.begin(), poly.count()));

44

REPORTER_ASSERT(reporter, SkIsSimplePolygon(poly.begin(), poly.count()));

45

triangleIndices.reset();

46

REPORTER_ASSERT(reporter, !SkTriangulateSimplePolygon(poly.begin(), indexMap, poly.count(),

&triangleIndices));

// giant triangle

poly[0].set(-1.0e+37f, 1.0e+37f);

51

poly[1].set(1.0e+37f, 1.0e+37f);

52

poly[2].set(-1.0e+37f, -1.0e+37f);

53

REPORTER_ASSERT(reporter, SkGetPolygonWinding(poly.begin(), poly.count()) < 0);

54

REPORTER_ASSERT(reporter, SkIsConvexPolygon(poly.begin(), poly.count()));

55

REPORTER_ASSERT(reporter, SkIsSimplePolygon(poly.begin(), poly.count()));

56

triangleIndices.reset();

57

REPORTER_ASSERT(reporter, SkTriangulateSimplePolygon(poly.begin(), indexMap, poly.count(),

&triangleIndices));

// teeny triangle

poly[0].set(-1.0e-38f, 1.0e-38f);

62

poly[1].set(-1.0e-38f, -1.0e-38f);

63

poly[2].set(1.0e-38f, 1.0e-38f);

64

REPORTER_ASSERT(reporter, SkGetPolygonWinding(poly.begin(), poly.count()) == 0);

65

// TODO: should these fail?

66

REPORTER_ASSERT(reporter, SkIsConvexPolygon(poly.begin(), poly.count()));

67

REPORTER_ASSERT(reporter, SkIsSimplePolygon(poly.begin(), poly.count()));

68

triangleIndices.reset();

69

REPORTER_ASSERT(reporter, !SkTriangulateSimplePolygon(poly.begin(), indexMap, poly.count(),

70

&triangleIndices));

71

72

// triangle way off in space (relative to size so we don't completely obliterate values)

73

poly[0].set(-100 + 1.0e+9f, 55 - 1.0e+9f);

74

poly[1].set(100 + 1.0e+9f, 55 - 1.0e+9f);

75

poly[2].set(150 + 1.0e+9f, 100 - 1.0e+9f);

76

REPORTER_ASSERT(reporter, SkGetPolygonWinding(poly.begin(), poly.count()) > 0);

77

REPORTER_ASSERT(reporter, SkIsConvexPolygon(poly.begin(), poly.count()));

78

REPORTER_ASSERT(reporter, SkIsSimplePolygon(poly.begin(), poly.count()));

79

triangleIndices.reset();

80

REPORTER_ASSERT(reporter, SkTriangulateSimplePolygon(poly.begin(), indexMap, poly.count(),

81

&triangleIndices));

82

83

///////////////////////////////////////////////////////////////////////

84

// round rect

85

poly.reset();

86

*poly.push() = SkPoint::Make(-100, 55);

87

*poly.push() = SkPoint::Make(100, 55);

88

*poly.push() = SkPoint::Make(100 + 2.5f, 50 + 4.330127f);

89

*poly.push() = SkPoint::Make(100 + 3.535534f, 50 + 3.535534f);

90

*poly.push() = SkPoint::Make(100 + 4.330127f, 50 + 2.5f);

91

*poly.push() = SkPoint::Make(105, 50);

92

*poly.push() = SkPoint::Make(105, -50);

93

*poly.push() = SkPoint::Make(100 + 4.330127f, -50 - 2.5f);

94

*poly.push() = SkPoint::Make(100 + 3.535534f, -50 - 3.535534f);

95

*poly.push() = SkPoint::Make(100 + 2.5f, -50 - 4.330127f);

96

*poly.push() = SkPoint::Make(100, -55);

97

*poly.push() = SkPoint::Make(-100, -55);

98

*poly.push() = SkPoint::Make(-100 - 2.5f, -50 - 4.330127f);

99

*poly.push() = SkPoint::Make(-100 - 3.535534f, -50 - 3.535534f);

100

*poly.push() = SkPoint::Make(-100 - 4.330127f, -50 - 2.5f);

101

*poly.push() = SkPoint::Make(-105, -50);

102

*poly.push() = SkPoint::Make(-105, 50);

103

*poly.push() = SkPoint::Make(-100 - 4.330127f, 50 + 2.5f);

104

*poly.push() = SkPoint::Make(-100 - 3.535534f, 50 + 3.535534f);

105

*poly.push() = SkPoint::Make(-100 - 2.5f, 50 + 4.330127f);

106

REPORTER_ASSERT(reporter, SkGetPolygonWinding(poly.begin(), poly.count()) < 0);

107

REPORTER_ASSERT(reporter, SkIsConvexPolygon(poly.begin(), poly.count()));

108

REPORTER_ASSERT(reporter, SkIsSimplePolygon(poly.begin(), poly.count()));

109

triangleIndices.reset();

110

REPORTER_ASSERT(reporter, SkTriangulateSimplePolygon(poly.begin(), indexMap, poly.count(),

111

&triangleIndices));

112

113

// translate far enough to obliterate some low bits

114

for (int i = 0; i < poly.count(); ++i) {

115

poly[i].offset(1.0e+7f, 1.0e+7f);

116

}

117

REPORTER_ASSERT(reporter, SkGetPolygonWinding(poly.begin(), poly.count()) < 0);

118

// Due to floating point error it's no longer convex

119

REPORTER_ASSERT(reporter, !SkIsConvexPolygon(poly.begin(), poly.count()));

120

REPORTER_ASSERT(reporter, SkIsSimplePolygon(poly.begin(), poly.count()));

121

triangleIndices.reset();

122

REPORTER_ASSERT(reporter, SkTriangulateSimplePolygon(poly.begin(), indexMap, poly.count(),

123

&triangleIndices));

124

125

// translate a little farther to create some coincident vertices

126

for (int i = 0; i < poly.count(); ++i) {

127

poly[i].offset(4.0e+7f, 4.0e+7f);

128

}

129

REPORTER_ASSERT(reporter, SkGetPolygonWinding(poly.begin(), poly.count()) < 0);

130

REPORTER_ASSERT(reporter, SkIsConvexPolygon(poly.begin(), poly.count()));

131

// These can't handle coincident vertices

132

REPORTER_ASSERT(reporter, !SkIsSimplePolygon(poly.begin(), poly.count()));

133

triangleIndices.reset();

134

REPORTER_ASSERT(reporter, !SkTriangulateSimplePolygon(poly.begin(), indexMap, poly.count(),

135

&triangleIndices));

136

137

// troublesome case -- clipped roundrect

138

poly.reset();

139

*poly.push() = SkPoint::Make(335.928101f, 428.219055f);

140

*poly.push() = SkPoint::Make(330.414459f, 423.034912f);

141

*poly.push() = SkPoint::Make(325.749084f, 417.395508f);

142

*poly.push() = SkPoint::Make(321.931946f, 411.300842f);

143

*poly.push() = SkPoint::Make(318.963074f, 404.750977f);

144

*poly.push() = SkPoint::Make(316.842468f, 397.745850f);

145

*poly.push() = SkPoint::Make(315.570068f, 390.285522f);

146

*poly.push() = SkPoint::Make(315.145966f, 382.369965f);

147

*poly.push() = SkPoint::Make(315.570068f, 374.454346f);

148

*poly.push() = SkPoint::Make(316.842468f, 366.994019f);

149

*poly.push() = SkPoint::Make(318.963074f, 359.988892f);

150

*poly.push() = SkPoint::Make(321.931946f, 353.439056f);

151

*poly.push() = SkPoint::Make(325.749084f, 347.344421f);

152

*poly.push() = SkPoint::Make(330.414459f, 341.705017f);

153

*poly.push() = SkPoint::Make(335.928101f, 336.520813f);

154

*poly.push() = SkPoint::Make(342.289948f, 331.791901f);

155

*poly.push() = SkPoint::Make(377.312134f, 331.791901f);

156

*poly.push() = SkPoint::Make(381.195313f, 332.532593f);

157

*poly.push() = SkPoint::Make(384.464935f, 334.754700f);

158

*poly.push() = SkPoint::Make(386.687042f, 338.024292f);

159

*poly.push() = SkPoint::Make(387.427765f, 341.907532f);

160

*poly.push() = SkPoint::Make(387.427765f, 422.832367f);

161

*poly.push() = SkPoint::Make(386.687042f, 426.715576f);

162

*poly.push() = SkPoint::Make(384.464935f, 429.985168f);

163

*poly.push() = SkPoint::Make(381.195313f, 432.207275f);

164

*poly.push() = SkPoint::Make(377.312134f, 432.947998f);

165

*poly.push() = SkPoint::Make(342.289948f, 432.947998f);

166

REPORTER_ASSERT(reporter, SkGetPolygonWinding(poly.begin(), poly.count()) > 0);

167

REPORTER_ASSERT(reporter, SkIsConvexPolygon(poly.begin(), poly.count()));

168

REPORTER_ASSERT(reporter, SkIsSimplePolygon(poly.begin(), poly.count()));

169

triangleIndices.reset();

170

REPORTER_ASSERT(reporter, SkTriangulateSimplePolygon(poly.begin(), indexMap, poly.count(),

&triangleIndices));

// a star is born

poly.reset();

*poly.push() = SkPoint::Make(0.0f, -50.0f);

176

*poly.push() = SkPoint::Make(14.43f, -25.0f);

177

*poly.push() = SkPoint::Make(43.30f, -25.0f);

178

*poly.push() = SkPoint::Make(28.86f, 0.0f);

179

*poly.push() = SkPoint::Make(43.30f, 25.0f);

180

*poly.push() = SkPoint::Make(14.43f, 25.0f);

181

*poly.push() = SkPoint::Make(0.0f, 50.0f);

182

*poly.push() = SkPoint::Make(-14.43f, 25.0f);

183

*poly.push() = SkPoint::Make(-43.30f, 25.0f);

184

*poly.push() = SkPoint::Make(-28.86f, 0.0f);

185

*poly.push() = SkPoint::Make(-43.30f, -25.0f);

186

*poly.push() = SkPoint::Make(-14.43f, -25.0f);

187

REPORTER_ASSERT(reporter, SkGetPolygonWinding(poly.begin(), poly.count()) > 0);

188

REPORTER_ASSERT(reporter, !SkIsConvexPolygon(poly.begin(), poly.count()));

189

REPORTER_ASSERT(reporter, SkIsSimplePolygon(poly.begin(), poly.count()));

190

triangleIndices.reset();

191

REPORTER_ASSERT(reporter, SkTriangulateSimplePolygon(poly.begin(), indexMap, poly.count(),

192

&triangleIndices));

193

194

// self-intersecting polygon

195

poly.reset();

196

*poly.push() = SkPoint::Make(0.0f, -50.0f);

197

*poly.push() = SkPoint::Make(14.43f, -25.0f);

198

*poly.push() = SkPoint::Make(43.30f, -25.0f);

199

*poly.push() = SkPoint::Make(-28.86f, 0.0f);

200

*poly.push() = SkPoint::Make(43.30f, 25.0f);

201

*poly.push() = SkPoint::Make(14.43f, 25.0f);

202

*poly.push() = SkPoint::Make(0.0f, 50.0f);

203

*poly.push() = SkPoint::Make(-14.43f, 25.0f);

204

*poly.push() = SkPoint::Make(-43.30f, 25.0f);

205

*poly.push() = SkPoint::Make(28.86f, 0.0f);

206

*poly.push() = SkPoint::Make(-43.30f, -25.0f);

207

*poly.push() = SkPoint::Make(-14.43f, -25.0f);

208

REPORTER_ASSERT(reporter, SkGetPolygonWinding(poly.begin(), poly.count()) > 0);

209

REPORTER_ASSERT(reporter, !SkIsConvexPolygon(poly.begin(), poly.count()));

210

REPORTER_ASSERT(reporter, !SkIsSimplePolygon(poly.begin(), poly.count()));

211

triangleIndices.reset();

212

// running this just to make sure it doesn't crash

213

// the fact that it succeeds doesn't mean anything since the input is not simple

214

REPORTER_ASSERT(reporter, SkTriangulateSimplePolygon(poly.begin(), indexMap, poly.count(),

215

&triangleIndices));

216

217

// self-intersecting polygon with coincident point

218

poly.reset();

219

*poly.push() = SkPoint::Make(0.0f, 0.0f);

220

*poly.push() = SkPoint::Make(-50, -50);

221

*poly.push() = SkPoint::Make(50, -50);

222

*poly.push() = SkPoint::Make(0.00000001f, -0.00000001f);

223

*poly.push() = SkPoint::Make(-50, 50);

224

*poly.push() = SkPoint::Make(50, 50);

225

REPORTER_ASSERT(reporter, SkGetPolygonWinding(poly.begin(), poly.count()) == 0);

226

REPORTER_ASSERT(reporter, !SkIsConvexPolygon(poly.begin(), poly.count()));

227

REPORTER_ASSERT(reporter, !SkIsSimplePolygon(poly.begin(), poly.count()));

228

triangleIndices.reset();

229

// running this just to make sure it doesn't crash

230

REPORTER_ASSERT(reporter, !SkTriangulateSimplePolygon(poly.begin(), indexMap, poly.count(),

231

&triangleIndices));

232

}