1e9709e831954c3427d5cb839e84221a177bfedebethannicholas/* 2e9709e831954c3427d5cb839e84221a177bfedebethannicholas * Copyright 2015 Google Inc. 3e9709e831954c3427d5cb839e84221a177bfedebethannicholas * 4e9709e831954c3427d5cb839e84221a177bfedebethannicholas * Use of this source code is governed by a BSD-style license that can be 5e9709e831954c3427d5cb839e84221a177bfedebethannicholas * found in the LICENSE file. 6e9709e831954c3427d5cb839e84221a177bfedebethannicholas */ 7e9709e831954c3427d5cb839e84221a177bfedebethannicholas 8e9709e831954c3427d5cb839e84221a177bfedebethannicholas#include "GrTessellator.h" 9e9709e831954c3427d5cb839e84221a177bfedebethannicholas 10f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco#include "GrDefaultGeoProcFactory.h" 11e9709e831954c3427d5cb839e84221a177bfedebethannicholas#include "GrPathUtils.h" 12e9709e831954c3427d5cb839e84221a177bfedebethannicholas 135cdc9dda330db41d34e452a91b6b0995b5a57626Herb Derby#include "SkArenaAlloc.h" 146599efffeef3168dfc68dca99c30454c5c23b859senorblanco#include "SkGeometry.h" 156599efffeef3168dfc68dca99c30454c5c23b859senorblanco#include "SkPath.h" 16e9709e831954c3427d5cb839e84221a177bfedebethannicholas 17e9709e831954c3427d5cb839e84221a177bfedebethannicholas#include <stdio.h> 18e9709e831954c3427d5cb839e84221a177bfedebethannicholas 19e9709e831954c3427d5cb839e84221a177bfedebethannicholas/* 20f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco * There are six stages to the basic algorithm: 21e9709e831954c3427d5cb839e84221a177bfedebethannicholas * 22e9709e831954c3427d5cb839e84221a177bfedebethannicholas * 1) Linearize the path contours into piecewise linear segments (path_to_contours()). 23e9709e831954c3427d5cb839e84221a177bfedebethannicholas * 2) Build a mesh of edges connecting the vertices (build_edges()). 24e9709e831954c3427d5cb839e84221a177bfedebethannicholas * 3) Sort the vertices in Y (and secondarily in X) (merge_sort()). 25e9709e831954c3427d5cb839e84221a177bfedebethannicholas * 4) Simplify the mesh by inserting new vertices at intersecting edges (simplify()). 26e9709e831954c3427d5cb839e84221a177bfedebethannicholas * 5) Tessellate the simplified mesh into monotone polygons (tessellate()). 27e9709e831954c3427d5cb839e84221a177bfedebethannicholas * 6) Triangulate the monotone polygons directly into a vertex buffer (polys_to_triangles()). 28e9709e831954c3427d5cb839e84221a177bfedebethannicholas * 29f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco * For screenspace antialiasing, the algorithm is modified as follows: 30f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco * 31f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco * Run steps 1-5 above to produce polygons. 32f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco * 5b) Apply fill rules to extract boundary contours from the polygons (extract_boundaries()). 33bda29c076bf3d6811bde142d57e54e5792727481Stephen White * 5c) Simplify boundaries to remove "pointy" vertices that cause inversions (simplify_boundary()). 34f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco * 5d) Displace edges by half a pixel inward and outward along their normals. Intersect to find 35f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco * new vertices, and set zero alpha on the exterior and one alpha on the interior. Build a new 36bda29c076bf3d6811bde142d57e54e5792727481Stephen White * antialiased mesh from those vertices (stroke_boundary()). 37f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco * Run steps 3-6 above on the new mesh, and produce antialiased triangles. 38f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco * 39e9709e831954c3427d5cb839e84221a177bfedebethannicholas * The vertex sorting in step (3) is a merge sort, since it plays well with the linked list 40e9709e831954c3427d5cb839e84221a177bfedebethannicholas * of vertices (and the necessity of inserting new vertices on intersection). 41e9709e831954c3427d5cb839e84221a177bfedebethannicholas * 42bda29c076bf3d6811bde142d57e54e5792727481Stephen White * Stages (4) and (5) use an active edge list -- a list of all edges for which the 43e9709e831954c3427d5cb839e84221a177bfedebethannicholas * sweep line has crossed the top vertex, but not the bottom vertex. It's sorted 44e9709e831954c3427d5cb839e84221a177bfedebethannicholas * left-to-right based on the point where both edges are active (when both top vertices 45e9709e831954c3427d5cb839e84221a177bfedebethannicholas * have been seen, so the "lower" top vertex of the two). If the top vertices are equal 46e9709e831954c3427d5cb839e84221a177bfedebethannicholas * (shared), it's sorted based on the last point where both edges are active, so the 47e9709e831954c3427d5cb839e84221a177bfedebethannicholas * "upper" bottom vertex. 48e9709e831954c3427d5cb839e84221a177bfedebethannicholas * 49e9709e831954c3427d5cb839e84221a177bfedebethannicholas * The most complex step is the simplification (4). It's based on the Bentley-Ottman 50e9709e831954c3427d5cb839e84221a177bfedebethannicholas * line-sweep algorithm, but due to floating point inaccuracy, the intersection points are 51e9709e831954c3427d5cb839e84221a177bfedebethannicholas * not exact and may violate the mesh topology or active edge list ordering. We 52e9709e831954c3427d5cb839e84221a177bfedebethannicholas * accommodate this by adjusting the topology of the mesh and AEL to match the intersection 53e9709e831954c3427d5cb839e84221a177bfedebethannicholas * points. This occurs in three ways: 54e9709e831954c3427d5cb839e84221a177bfedebethannicholas * 55e9709e831954c3427d5cb839e84221a177bfedebethannicholas * A) Intersections may cause a shortened edge to no longer be ordered with respect to its 56e9709e831954c3427d5cb839e84221a177bfedebethannicholas * neighbouring edges at the top or bottom vertex. This is handled by merging the 57e9709e831954c3427d5cb839e84221a177bfedebethannicholas * edges (merge_collinear_edges()). 58e9709e831954c3427d5cb839e84221a177bfedebethannicholas * B) Intersections may cause an edge to violate the left-to-right ordering of the 59e9709e831954c3427d5cb839e84221a177bfedebethannicholas * active edge list. This is handled by splitting the neighbour edge on the 60e9709e831954c3427d5cb839e84221a177bfedebethannicholas * intersected vertex (cleanup_active_edges()). 61e9709e831954c3427d5cb839e84221a177bfedebethannicholas * C) Shortening an edge may cause an active edge to become inactive or an inactive edge 62e9709e831954c3427d5cb839e84221a177bfedebethannicholas * to become active. This is handled by removing or inserting the edge in the active 63e9709e831954c3427d5cb839e84221a177bfedebethannicholas * edge list (fix_active_state()). 64e9709e831954c3427d5cb839e84221a177bfedebethannicholas * 65e9709e831954c3427d5cb839e84221a177bfedebethannicholas * The tessellation steps (5) and (6) are based on "Triangulating Simple Polygons and 66e9709e831954c3427d5cb839e84221a177bfedebethannicholas * Equivalent Problems" (Fournier and Montuno); also a line-sweep algorithm. Note that it 67e9709e831954c3427d5cb839e84221a177bfedebethannicholas * currently uses a linked list for the active edge list, rather than a 2-3 tree as the 68e9709e831954c3427d5cb839e84221a177bfedebethannicholas * paper describes. The 2-3 tree gives O(lg N) lookups, but insertion and removal also 69e9709e831954c3427d5cb839e84221a177bfedebethannicholas * become O(lg N). In all the test cases, it was found that the cost of frequent O(lg N) 70e9709e831954c3427d5cb839e84221a177bfedebethannicholas * insertions and removals was greater than the cost of infrequent O(N) lookups with the 71e9709e831954c3427d5cb839e84221a177bfedebethannicholas * linked list implementation. With the latter, all removals are O(1), and most insertions 72e9709e831954c3427d5cb839e84221a177bfedebethannicholas * are O(1), since we know the adjacent edge in the active edge list based on the topology. 73e9709e831954c3427d5cb839e84221a177bfedebethannicholas * Only type 2 vertices (see paper) require the O(N) lookups, and these are much less 74e9709e831954c3427d5cb839e84221a177bfedebethannicholas * frequent. There may be other data structures worth investigating, however. 75e9709e831954c3427d5cb839e84221a177bfedebethannicholas * 76e9709e831954c3427d5cb839e84221a177bfedebethannicholas * Note that the orientation of the line sweep algorithms is determined by the aspect ratio of the 77e9709e831954c3427d5cb839e84221a177bfedebethannicholas * path bounds. When the path is taller than it is wide, we sort vertices based on increasing Y 78e9709e831954c3427d5cb839e84221a177bfedebethannicholas * coordinate, and secondarily by increasing X coordinate. When the path is wider than it is tall, 79e9709e831954c3427d5cb839e84221a177bfedebethannicholas * we sort by increasing X coordinate, but secondarily by *decreasing* Y coordinate. This is so 80e9709e831954c3427d5cb839e84221a177bfedebethannicholas * that the "left" and "right" orientation in the code remains correct (edges to the left are 81e9709e831954c3427d5cb839e84221a177bfedebethannicholas * increasing in Y; edges to the right are decreasing in Y). That is, the setting rotates 90 82e9709e831954c3427d5cb839e84221a177bfedebethannicholas * degrees counterclockwise, rather that transposing. 83e9709e831954c3427d5cb839e84221a177bfedebethannicholas */ 84e9709e831954c3427d5cb839e84221a177bfedebethannicholas 85e9709e831954c3427d5cb839e84221a177bfedebethannicholas#define LOGGING_ENABLED 0 86e9709e831954c3427d5cb839e84221a177bfedebethannicholas 87e9709e831954c3427d5cb839e84221a177bfedebethannicholas#if LOGGING_ENABLED 88e9709e831954c3427d5cb839e84221a177bfedebethannicholas#define LOG printf 89e9709e831954c3427d5cb839e84221a177bfedebethannicholas#else 90e9709e831954c3427d5cb839e84221a177bfedebethannicholas#define LOG(...) 91e9709e831954c3427d5cb839e84221a177bfedebethannicholas#endif 92e9709e831954c3427d5cb839e84221a177bfedebethannicholas 93e9709e831954c3427d5cb839e84221a177bfedebethannicholasnamespace { 94e9709e831954c3427d5cb839e84221a177bfedebethannicholas 9511f65e0bb44f33b18e8bbb792d4f904ce1da0d5bStephen Whiteconst int kArenaChunkSize = 16 * 1024; 9611f65e0bb44f33b18e8bbb792d4f904ce1da0d5bStephen White 97e9709e831954c3427d5cb839e84221a177bfedebethannicholasstruct Vertex; 98e9709e831954c3427d5cb839e84221a177bfedebethannicholasstruct Edge; 99e9709e831954c3427d5cb839e84221a177bfedebethannicholasstruct Poly; 100e9709e831954c3427d5cb839e84221a177bfedebethannicholas 101e9709e831954c3427d5cb839e84221a177bfedebethannicholastemplate <class T, T* T::*Prev, T* T::*Next> 102e6eaa320e8dac34396dc364aa0863574d7b5291csenorblancovoid list_insert(T* t, T* prev, T* next, T** head, T** tail) { 103e9709e831954c3427d5cb839e84221a177bfedebethannicholas t->*Prev = prev; 104e9709e831954c3427d5cb839e84221a177bfedebethannicholas t->*Next = next; 105e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (prev) { 106e9709e831954c3427d5cb839e84221a177bfedebethannicholas prev->*Next = t; 107e9709e831954c3427d5cb839e84221a177bfedebethannicholas } else if (head) { 108e9709e831954c3427d5cb839e84221a177bfedebethannicholas *head = t; 109e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 110e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (next) { 111e9709e831954c3427d5cb839e84221a177bfedebethannicholas next->*Prev = t; 112e9709e831954c3427d5cb839e84221a177bfedebethannicholas } else if (tail) { 113e9709e831954c3427d5cb839e84221a177bfedebethannicholas *tail = t; 114e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 115e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 116e9709e831954c3427d5cb839e84221a177bfedebethannicholas 117e9709e831954c3427d5cb839e84221a177bfedebethannicholastemplate <class T, T* T::*Prev, T* T::*Next> 118e6eaa320e8dac34396dc364aa0863574d7b5291csenorblancovoid list_remove(T* t, T** head, T** tail) { 119e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (t->*Prev) { 120e9709e831954c3427d5cb839e84221a177bfedebethannicholas t->*Prev->*Next = t->*Next; 121e9709e831954c3427d5cb839e84221a177bfedebethannicholas } else if (head) { 122e9709e831954c3427d5cb839e84221a177bfedebethannicholas *head = t->*Next; 123e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 124e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (t->*Next) { 125e9709e831954c3427d5cb839e84221a177bfedebethannicholas t->*Next->*Prev = t->*Prev; 126e9709e831954c3427d5cb839e84221a177bfedebethannicholas } else if (tail) { 127e9709e831954c3427d5cb839e84221a177bfedebethannicholas *tail = t->*Prev; 128e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 129e9709e831954c3427d5cb839e84221a177bfedebethannicholas t->*Prev = t->*Next = nullptr; 130e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 131e9709e831954c3427d5cb839e84221a177bfedebethannicholas 132e9709e831954c3427d5cb839e84221a177bfedebethannicholas/** 133e9709e831954c3427d5cb839e84221a177bfedebethannicholas * Vertices are used in three ways: first, the path contours are converted into a 134e9709e831954c3427d5cb839e84221a177bfedebethannicholas * circularly-linked list of Vertices for each contour. After edge construction, the same Vertices 135e9709e831954c3427d5cb839e84221a177bfedebethannicholas * are re-ordered by the merge sort according to the sweep_lt comparator (usually, increasing 136e9709e831954c3427d5cb839e84221a177bfedebethannicholas * in Y) using the same fPrev/fNext pointers that were used for the contours, to avoid 137e9709e831954c3427d5cb839e84221a177bfedebethannicholas * reallocation. Finally, MonotonePolys are built containing a circularly-linked list of 138e9709e831954c3427d5cb839e84221a177bfedebethannicholas * Vertices. (Currently, those Vertices are newly-allocated for the MonotonePolys, since 139e9709e831954c3427d5cb839e84221a177bfedebethannicholas * an individual Vertex from the path mesh may belong to multiple 140e9709e831954c3427d5cb839e84221a177bfedebethannicholas * MonotonePolys, so the original Vertices cannot be re-used. 141e9709e831954c3427d5cb839e84221a177bfedebethannicholas */ 142e9709e831954c3427d5cb839e84221a177bfedebethannicholas 143e9709e831954c3427d5cb839e84221a177bfedebethannicholasstruct Vertex { 144f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco Vertex(const SkPoint& point, uint8_t alpha) 145e9709e831954c3427d5cb839e84221a177bfedebethannicholas : fPoint(point), fPrev(nullptr), fNext(nullptr) 146e9709e831954c3427d5cb839e84221a177bfedebethannicholas , fFirstEdgeAbove(nullptr), fLastEdgeAbove(nullptr) 147e9709e831954c3427d5cb839e84221a177bfedebethannicholas , fFirstEdgeBelow(nullptr), fLastEdgeBelow(nullptr) 148bda29c076bf3d6811bde142d57e54e5792727481Stephen White , fPartner(nullptr) 149e9709e831954c3427d5cb839e84221a177bfedebethannicholas , fProcessed(false) 150f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco , fAlpha(alpha) 151e9709e831954c3427d5cb839e84221a177bfedebethannicholas#if LOGGING_ENABLED 152e9709e831954c3427d5cb839e84221a177bfedebethannicholas , fID (-1.0f) 153e9709e831954c3427d5cb839e84221a177bfedebethannicholas#endif 154e9709e831954c3427d5cb839e84221a177bfedebethannicholas {} 155e9709e831954c3427d5cb839e84221a177bfedebethannicholas SkPoint fPoint; // Vertex position 156e9709e831954c3427d5cb839e84221a177bfedebethannicholas Vertex* fPrev; // Linked list of contours, then Y-sorted vertices. 157e9709e831954c3427d5cb839e84221a177bfedebethannicholas Vertex* fNext; // " 158e9709e831954c3427d5cb839e84221a177bfedebethannicholas Edge* fFirstEdgeAbove; // Linked list of edges above this vertex. 159e9709e831954c3427d5cb839e84221a177bfedebethannicholas Edge* fLastEdgeAbove; // " 160e9709e831954c3427d5cb839e84221a177bfedebethannicholas Edge* fFirstEdgeBelow; // Linked list of edges below this vertex. 161e9709e831954c3427d5cb839e84221a177bfedebethannicholas Edge* fLastEdgeBelow; // " 162bda29c076bf3d6811bde142d57e54e5792727481Stephen White Vertex* fPartner; // Corresponding inner or outer vertex (for AA). 163e9709e831954c3427d5cb839e84221a177bfedebethannicholas bool fProcessed; // Has this vertex been seen in simplify()? 164f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco uint8_t fAlpha; 165e9709e831954c3427d5cb839e84221a177bfedebethannicholas#if LOGGING_ENABLED 166e9709e831954c3427d5cb839e84221a177bfedebethannicholas float fID; // Identifier used for logging. 167e9709e831954c3427d5cb839e84221a177bfedebethannicholas#endif 168e9709e831954c3427d5cb839e84221a177bfedebethannicholas}; 169e9709e831954c3427d5cb839e84221a177bfedebethannicholas 170e9709e831954c3427d5cb839e84221a177bfedebethannicholas/***************************************************************************************/ 171e9709e831954c3427d5cb839e84221a177bfedebethannicholas 172f57372daf0562a187c24d427366ac6d0cb980c9bsenorblancostruct AAParams { 173f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco bool fTweakAlpha; 174f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco GrColor fColor; 175f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco}; 176f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco 177e9709e831954c3427d5cb839e84221a177bfedebethannicholastypedef bool (*CompareFunc)(const SkPoint& a, const SkPoint& b); 178e9709e831954c3427d5cb839e84221a177bfedebethannicholas 179e9709e831954c3427d5cb839e84221a177bfedebethannicholasbool sweep_lt_horiz(const SkPoint& a, const SkPoint& b) { 18016a40cb65adeb4d94b84479f9946c360ed73e1bbStephen White return a.fX < b.fX || (a.fX == b.fX && a.fY > b.fY); 181e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 182e9709e831954c3427d5cb839e84221a177bfedebethannicholas 183e9709e831954c3427d5cb839e84221a177bfedebethannicholasbool sweep_lt_vert(const SkPoint& a, const SkPoint& b) { 18416a40cb65adeb4d94b84479f9946c360ed73e1bbStephen White return a.fY < b.fY || (a.fY == b.fY && a.fX < b.fX); 185e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 186e9709e831954c3427d5cb839e84221a177bfedebethannicholas 18716a40cb65adeb4d94b84479f9946c360ed73e1bbStephen Whitestruct Comparator { 18816a40cb65adeb4d94b84479f9946c360ed73e1bbStephen White enum class Direction { kVertical, kHorizontal }; 18916a40cb65adeb4d94b84479f9946c360ed73e1bbStephen White Comparator(Direction direction) : fDirection(direction) {} 19016a40cb65adeb4d94b84479f9946c360ed73e1bbStephen White bool sweep_lt(const SkPoint& a, const SkPoint& b) const { 19116a40cb65adeb4d94b84479f9946c360ed73e1bbStephen White return fDirection == Direction::kHorizontal ? sweep_lt_horiz(a, b) : sweep_lt_vert(a, b); 19216a40cb65adeb4d94b84479f9946c360ed73e1bbStephen White } 19316a40cb65adeb4d94b84479f9946c360ed73e1bbStephen White Direction fDirection; 19416a40cb65adeb4d94b84479f9946c360ed73e1bbStephen White}; 19516a40cb65adeb4d94b84479f9946c360ed73e1bbStephen White 196f57372daf0562a187c24d427366ac6d0cb980c9bsenorblancoinline void* emit_vertex(Vertex* v, const AAParams* aaParams, void* data) { 197f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco if (!aaParams) { 198f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco SkPoint* d = static_cast<SkPoint*>(data); 199f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco *d++ = v->fPoint; 200f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco return d; 201f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco } 202f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco if (aaParams->fTweakAlpha) { 203f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco auto d = static_cast<GrDefaultGeoProcFactory::PositionColorAttr*>(data); 204f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco d->fPosition = v->fPoint; 2058c8fceff4d4e8ec09f29748d77ed5510697a2995lsalzman d->fColor = SkAlphaMulQ(aaParams->fColor, SkAlpha255To256(v->fAlpha)); 206f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco d++; 207f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco return d; 208f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco } 209f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco auto d = static_cast<GrDefaultGeoProcFactory::PositionColorCoverageAttr*>(data); 210f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco d->fPosition = v->fPoint; 211f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco d->fColor = aaParams->fColor; 212f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco d->fCoverage = GrNormalizeByteToFloat(v->fAlpha); 213f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco d++; 214f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco return d; 215e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 216e9709e831954c3427d5cb839e84221a177bfedebethannicholas 217f57372daf0562a187c24d427366ac6d0cb980c9bsenorblancovoid* emit_triangle(Vertex* v0, Vertex* v1, Vertex* v2, const AAParams* aaParams, void* data) { 21892eba8a5efc0860d4e95ba7f25052474a0bfca0cStephen White LOG("emit_triangle (%g, %g) %d\n", v0->fPoint.fX, v0->fPoint.fY, v0->fAlpha); 21992eba8a5efc0860d4e95ba7f25052474a0bfca0cStephen White LOG(" (%g, %g) %d\n", v1->fPoint.fX, v1->fPoint.fY, v1->fAlpha); 22092eba8a5efc0860d4e95ba7f25052474a0bfca0cStephen White LOG(" (%g, %g) %d\n", v2->fPoint.fX, v2->fPoint.fY, v2->fAlpha); 221f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco#if TESSELLATOR_WIREFRAME 222f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco data = emit_vertex(v0, aaParams, data); 223f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco data = emit_vertex(v1, aaParams, data); 224f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco data = emit_vertex(v1, aaParams, data); 225f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco data = emit_vertex(v2, aaParams, data); 226f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco data = emit_vertex(v2, aaParams, data); 227f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco data = emit_vertex(v0, aaParams, data); 228e9709e831954c3427d5cb839e84221a177bfedebethannicholas#else 229f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco data = emit_vertex(v0, aaParams, data); 230f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco data = emit_vertex(v1, aaParams, data); 231f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco data = emit_vertex(v2, aaParams, data); 232e9709e831954c3427d5cb839e84221a177bfedebethannicholas#endif 233e9709e831954c3427d5cb839e84221a177bfedebethannicholas return data; 234e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 235e9709e831954c3427d5cb839e84221a177bfedebethannicholas 236e6eaa320e8dac34396dc364aa0863574d7b5291csenorblancostruct VertexList { 237e6eaa320e8dac34396dc364aa0863574d7b5291csenorblanco VertexList() : fHead(nullptr), fTail(nullptr) {} 23816a40cb65adeb4d94b84479f9946c360ed73e1bbStephen White VertexList(Vertex* head, Vertex* tail) : fHead(head), fTail(tail) {} 239e6eaa320e8dac34396dc364aa0863574d7b5291csenorblanco Vertex* fHead; 240e6eaa320e8dac34396dc364aa0863574d7b5291csenorblanco Vertex* fTail; 241e6eaa320e8dac34396dc364aa0863574d7b5291csenorblanco void insert(Vertex* v, Vertex* prev, Vertex* next) { 242e6eaa320e8dac34396dc364aa0863574d7b5291csenorblanco list_insert<Vertex, &Vertex::fPrev, &Vertex::fNext>(v, prev, next, &fHead, &fTail); 243e6eaa320e8dac34396dc364aa0863574d7b5291csenorblanco } 244e6eaa320e8dac34396dc364aa0863574d7b5291csenorblanco void append(Vertex* v) { 245e6eaa320e8dac34396dc364aa0863574d7b5291csenorblanco insert(v, fTail, nullptr); 246e6eaa320e8dac34396dc364aa0863574d7b5291csenorblanco } 247bda29c076bf3d6811bde142d57e54e5792727481Stephen White void append(const VertexList& list) { 248bda29c076bf3d6811bde142d57e54e5792727481Stephen White if (!list.fHead) { 249bda29c076bf3d6811bde142d57e54e5792727481Stephen White return; 250bda29c076bf3d6811bde142d57e54e5792727481Stephen White } 251bda29c076bf3d6811bde142d57e54e5792727481Stephen White if (fTail) { 252bda29c076bf3d6811bde142d57e54e5792727481Stephen White fTail->fNext = list.fHead; 253bda29c076bf3d6811bde142d57e54e5792727481Stephen White list.fHead->fPrev = fTail; 254bda29c076bf3d6811bde142d57e54e5792727481Stephen White } else { 255bda29c076bf3d6811bde142d57e54e5792727481Stephen White fHead = list.fHead; 256bda29c076bf3d6811bde142d57e54e5792727481Stephen White } 257bda29c076bf3d6811bde142d57e54e5792727481Stephen White fTail = list.fTail; 258bda29c076bf3d6811bde142d57e54e5792727481Stephen White } 259e6eaa320e8dac34396dc364aa0863574d7b5291csenorblanco void prepend(Vertex* v) { 260e6eaa320e8dac34396dc364aa0863574d7b5291csenorblanco insert(v, nullptr, fHead); 261e6eaa320e8dac34396dc364aa0863574d7b5291csenorblanco } 262bf6137e08b703abd98b3e4d938e1cccef2350f4eStephen White void remove(Vertex* v) { 263bf6137e08b703abd98b3e4d938e1cccef2350f4eStephen White list_remove<Vertex, &Vertex::fPrev, &Vertex::fNext>(v, &fHead, &fTail); 264bf6137e08b703abd98b3e4d938e1cccef2350f4eStephen White } 265f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco void close() { 266f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco if (fHead && fTail) { 267f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco fTail->fNext = fHead; 268f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco fHead->fPrev = fTail; 269f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco } 270f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco } 271e6eaa320e8dac34396dc364aa0863574d7b5291csenorblanco}; 272e6eaa320e8dac34396dc364aa0863574d7b5291csenorblanco 273f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco// Round to nearest quarter-pixel. This is used for screenspace tessellation. 274f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco 275f57372daf0562a187c24d427366ac6d0cb980c9bsenorblancoinline void round(SkPoint* p) { 276f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco p->fX = SkScalarRoundToScalar(p->fX * SkFloatToScalar(4.0f)) * SkFloatToScalar(0.25f); 277f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco p->fY = SkScalarRoundToScalar(p->fY * SkFloatToScalar(4.0f)) * SkFloatToScalar(0.25f); 278f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco} 279f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco 28049df8d17c56ee08ecf860289d501913d356f67dcsenorblanco// A line equation in implicit form. fA * x + fB * y + fC = 0, for all points (x, y) on the line. 28149df8d17c56ee08ecf860289d501913d356f67dcsenorblancostruct Line { 28249df8d17c56ee08ecf860289d501913d356f67dcsenorblanco Line(Vertex* p, Vertex* q) : Line(p->fPoint, q->fPoint) {} 28349df8d17c56ee08ecf860289d501913d356f67dcsenorblanco Line(const SkPoint& p, const SkPoint& q) 28449df8d17c56ee08ecf860289d501913d356f67dcsenorblanco : fA(static_cast<double>(q.fY) - p.fY) // a = dY 28549df8d17c56ee08ecf860289d501913d356f67dcsenorblanco , fB(static_cast<double>(p.fX) - q.fX) // b = -dX 28649df8d17c56ee08ecf860289d501913d356f67dcsenorblanco , fC(static_cast<double>(p.fY) * q.fX - // c = cross(q, p) 28749df8d17c56ee08ecf860289d501913d356f67dcsenorblanco static_cast<double>(p.fX) * q.fY) {} 28849df8d17c56ee08ecf860289d501913d356f67dcsenorblanco double dist(const SkPoint& p) const { 28949df8d17c56ee08ecf860289d501913d356f67dcsenorblanco return fA * p.fX + fB * p.fY + fC; 29049df8d17c56ee08ecf860289d501913d356f67dcsenorblanco } 29149df8d17c56ee08ecf860289d501913d356f67dcsenorblanco double magSq() const { 29249df8d17c56ee08ecf860289d501913d356f67dcsenorblanco return fA * fA + fB * fB; 29349df8d17c56ee08ecf860289d501913d356f67dcsenorblanco } 29449df8d17c56ee08ecf860289d501913d356f67dcsenorblanco 29549df8d17c56ee08ecf860289d501913d356f67dcsenorblanco // Compute the intersection of two (infinite) Lines. 29649df8d17c56ee08ecf860289d501913d356f67dcsenorblanco bool intersect(const Line& other, SkPoint* point) { 29749df8d17c56ee08ecf860289d501913d356f67dcsenorblanco double denom = fA * other.fB - fB * other.fA; 29849df8d17c56ee08ecf860289d501913d356f67dcsenorblanco if (denom == 0.0) { 29949df8d17c56ee08ecf860289d501913d356f67dcsenorblanco return false; 30049df8d17c56ee08ecf860289d501913d356f67dcsenorblanco } 30149df8d17c56ee08ecf860289d501913d356f67dcsenorblanco double scale = 1.0f / denom; 30249df8d17c56ee08ecf860289d501913d356f67dcsenorblanco point->fX = SkDoubleToScalar((fB * other.fC - other.fB * fC) * scale); 30349df8d17c56ee08ecf860289d501913d356f67dcsenorblanco point->fY = SkDoubleToScalar((other.fA * fC - fA * other.fC) * scale); 304b56dedf70bdbf1a5e1e04dfbc83a374bffe6b00fStephen White round(point); 30549df8d17c56ee08ecf860289d501913d356f67dcsenorblanco return true; 30649df8d17c56ee08ecf860289d501913d356f67dcsenorblanco } 30749df8d17c56ee08ecf860289d501913d356f67dcsenorblanco double fA, fB, fC; 30849df8d17c56ee08ecf860289d501913d356f67dcsenorblanco}; 30949df8d17c56ee08ecf860289d501913d356f67dcsenorblanco 310e9709e831954c3427d5cb839e84221a177bfedebethannicholas/** 311e9709e831954c3427d5cb839e84221a177bfedebethannicholas * An Edge joins a top Vertex to a bottom Vertex. Edge ordering for the list of "edges above" and 312e9709e831954c3427d5cb839e84221a177bfedebethannicholas * "edge below" a vertex as well as for the active edge list is handled by isLeftOf()/isRightOf(). 313e9709e831954c3427d5cb839e84221a177bfedebethannicholas * Note that an Edge will give occasionally dist() != 0 for its own endpoints (because floating 314bda29c076bf3d6811bde142d57e54e5792727481Stephen White * point). For speed, that case is only tested by the callers that require it (e.g., 315e9709e831954c3427d5cb839e84221a177bfedebethannicholas * cleanup_active_edges()). Edges also handle checking for intersection with other edges. 316e9709e831954c3427d5cb839e84221a177bfedebethannicholas * Currently, this converts the edges to the parametric form, in order to avoid doing a division 317e9709e831954c3427d5cb839e84221a177bfedebethannicholas * until an intersection has been confirmed. This is slightly slower in the "found" case, but 318e9709e831954c3427d5cb839e84221a177bfedebethannicholas * a lot faster in the "not found" case. 319e9709e831954c3427d5cb839e84221a177bfedebethannicholas * 320e9709e831954c3427d5cb839e84221a177bfedebethannicholas * The coefficients of the line equation stored in double precision to avoid catastrphic 321e9709e831954c3427d5cb839e84221a177bfedebethannicholas * cancellation in the isLeftOf() and isRightOf() checks. Using doubles ensures that the result is 322e9709e831954c3427d5cb839e84221a177bfedebethannicholas * correct in float, since it's a polynomial of degree 2. The intersect() function, being 323e9709e831954c3427d5cb839e84221a177bfedebethannicholas * degree 5, is still subject to catastrophic cancellation. We deal with that by assuming its 324e9709e831954c3427d5cb839e84221a177bfedebethannicholas * output may be incorrect, and adjusting the mesh topology to match (see comment at the top of 325e9709e831954c3427d5cb839e84221a177bfedebethannicholas * this file). 326e9709e831954c3427d5cb839e84221a177bfedebethannicholas */ 327e9709e831954c3427d5cb839e84221a177bfedebethannicholas 328e9709e831954c3427d5cb839e84221a177bfedebethannicholasstruct Edge { 3292f4686fa25ef7a14961f68be18e63de3567d0a15Stephen White enum class Type { kInner, kOuter, kConnector }; 3302f4686fa25ef7a14961f68be18e63de3567d0a15Stephen White Edge(Vertex* top, Vertex* bottom, int winding, Type type) 331e9709e831954c3427d5cb839e84221a177bfedebethannicholas : fWinding(winding) 332e9709e831954c3427d5cb839e84221a177bfedebethannicholas , fTop(top) 333e9709e831954c3427d5cb839e84221a177bfedebethannicholas , fBottom(bottom) 3342f4686fa25ef7a14961f68be18e63de3567d0a15Stephen White , fType(type) 335e9709e831954c3427d5cb839e84221a177bfedebethannicholas , fLeft(nullptr) 336e9709e831954c3427d5cb839e84221a177bfedebethannicholas , fRight(nullptr) 337e9709e831954c3427d5cb839e84221a177bfedebethannicholas , fPrevEdgeAbove(nullptr) 338e9709e831954c3427d5cb839e84221a177bfedebethannicholas , fNextEdgeAbove(nullptr) 339e9709e831954c3427d5cb839e84221a177bfedebethannicholas , fPrevEdgeBelow(nullptr) 340e9709e831954c3427d5cb839e84221a177bfedebethannicholas , fNextEdgeBelow(nullptr) 341e9709e831954c3427d5cb839e84221a177bfedebethannicholas , fLeftPoly(nullptr) 342531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco , fRightPoly(nullptr) 343531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco , fLeftPolyPrev(nullptr) 344531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco , fLeftPolyNext(nullptr) 345531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco , fRightPolyPrev(nullptr) 34670f5251cc59191040a14cd0f1567aa2129e1f7c6senorblanco , fRightPolyNext(nullptr) 34770f5251cc59191040a14cd0f1567aa2129e1f7c6senorblanco , fUsedInLeftPoly(false) 34849df8d17c56ee08ecf860289d501913d356f67dcsenorblanco , fUsedInRightPoly(false) 34949df8d17c56ee08ecf860289d501913d356f67dcsenorblanco , fLine(top, bottom) { 350e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 351e9709e831954c3427d5cb839e84221a177bfedebethannicholas int fWinding; // 1 == edge goes downward; -1 = edge goes upward. 352e9709e831954c3427d5cb839e84221a177bfedebethannicholas Vertex* fTop; // The top vertex in vertex-sort-order (sweep_lt). 353e9709e831954c3427d5cb839e84221a177bfedebethannicholas Vertex* fBottom; // The bottom vertex in vertex-sort-order. 3542f4686fa25ef7a14961f68be18e63de3567d0a15Stephen White Type fType; 355e9709e831954c3427d5cb839e84221a177bfedebethannicholas Edge* fLeft; // The linked list of edges in the active edge list. 356e9709e831954c3427d5cb839e84221a177bfedebethannicholas Edge* fRight; // " 357e9709e831954c3427d5cb839e84221a177bfedebethannicholas Edge* fPrevEdgeAbove; // The linked list of edges in the bottom Vertex's "edges above". 358e9709e831954c3427d5cb839e84221a177bfedebethannicholas Edge* fNextEdgeAbove; // " 359e9709e831954c3427d5cb839e84221a177bfedebethannicholas Edge* fPrevEdgeBelow; // The linked list of edges in the top Vertex's "edges below". 360e9709e831954c3427d5cb839e84221a177bfedebethannicholas Edge* fNextEdgeBelow; // " 361e9709e831954c3427d5cb839e84221a177bfedebethannicholas Poly* fLeftPoly; // The Poly to the left of this edge, if any. 362e9709e831954c3427d5cb839e84221a177bfedebethannicholas Poly* fRightPoly; // The Poly to the right of this edge, if any. 363531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco Edge* fLeftPolyPrev; 364531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco Edge* fLeftPolyNext; 365531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco Edge* fRightPolyPrev; 366531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco Edge* fRightPolyNext; 36770f5251cc59191040a14cd0f1567aa2129e1f7c6senorblanco bool fUsedInLeftPoly; 36870f5251cc59191040a14cd0f1567aa2129e1f7c6senorblanco bool fUsedInRightPoly; 36949df8d17c56ee08ecf860289d501913d356f67dcsenorblanco Line fLine; 370e9709e831954c3427d5cb839e84221a177bfedebethannicholas double dist(const SkPoint& p) const { 37149df8d17c56ee08ecf860289d501913d356f67dcsenorblanco return fLine.dist(p); 372e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 373e9709e831954c3427d5cb839e84221a177bfedebethannicholas bool isRightOf(Vertex* v) const { 37449df8d17c56ee08ecf860289d501913d356f67dcsenorblanco return fLine.dist(v->fPoint) < 0.0; 375e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 376e9709e831954c3427d5cb839e84221a177bfedebethannicholas bool isLeftOf(Vertex* v) const { 37749df8d17c56ee08ecf860289d501913d356f67dcsenorblanco return fLine.dist(v->fPoint) > 0.0; 378e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 379e9709e831954c3427d5cb839e84221a177bfedebethannicholas void recompute() { 38049df8d17c56ee08ecf860289d501913d356f67dcsenorblanco fLine = Line(fTop, fBottom); 381e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 382dab4811661720e8f14675a09ca1a3b8f82e45680Ben Wagner bool intersect(const Edge& other, SkPoint* p, uint8_t* alpha = nullptr) { 383e9709e831954c3427d5cb839e84221a177bfedebethannicholas LOG("intersecting %g -> %g with %g -> %g\n", 384e9709e831954c3427d5cb839e84221a177bfedebethannicholas fTop->fID, fBottom->fID, 385e9709e831954c3427d5cb839e84221a177bfedebethannicholas other.fTop->fID, other.fBottom->fID); 386e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (fTop == other.fTop || fBottom == other.fBottom) { 387e9709e831954c3427d5cb839e84221a177bfedebethannicholas return false; 388e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 38949df8d17c56ee08ecf860289d501913d356f67dcsenorblanco double denom = fLine.fA * other.fLine.fB - fLine.fB * other.fLine.fA; 390e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (denom == 0.0) { 391e9709e831954c3427d5cb839e84221a177bfedebethannicholas return false; 392e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 3938a0bfc5201f14c994fe8062ecf1ca34a172de9d3Stephen White double dx = static_cast<double>(other.fTop->fPoint.fX) - fTop->fPoint.fX; 3948a0bfc5201f14c994fe8062ecf1ca34a172de9d3Stephen White double dy = static_cast<double>(other.fTop->fPoint.fY) - fTop->fPoint.fY; 3958a0bfc5201f14c994fe8062ecf1ca34a172de9d3Stephen White double sNumer = dy * other.fLine.fB + dx * other.fLine.fA; 3968a0bfc5201f14c994fe8062ecf1ca34a172de9d3Stephen White double tNumer = dy * fLine.fB + dx * fLine.fA; 397e9709e831954c3427d5cb839e84221a177bfedebethannicholas // If (sNumer / denom) or (tNumer / denom) is not in [0..1], exit early. 398e9709e831954c3427d5cb839e84221a177bfedebethannicholas // This saves us doing the divide below unless absolutely necessary. 399e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (denom > 0.0 ? (sNumer < 0.0 || sNumer > denom || tNumer < 0.0 || tNumer > denom) 400e9709e831954c3427d5cb839e84221a177bfedebethannicholas : (sNumer > 0.0 || sNumer < denom || tNumer > 0.0 || tNumer < denom)) { 401e9709e831954c3427d5cb839e84221a177bfedebethannicholas return false; 402e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 403e9709e831954c3427d5cb839e84221a177bfedebethannicholas double s = sNumer / denom; 404e9709e831954c3427d5cb839e84221a177bfedebethannicholas SkASSERT(s >= 0.0 && s <= 1.0); 40549df8d17c56ee08ecf860289d501913d356f67dcsenorblanco p->fX = SkDoubleToScalar(fTop->fPoint.fX - s * fLine.fB); 40649df8d17c56ee08ecf860289d501913d356f67dcsenorblanco p->fY = SkDoubleToScalar(fTop->fPoint.fY + s * fLine.fA); 40756158ae600a73ac2e74f5a5862de0fab466b52b6Stephen White if (alpha) { 40892eba8a5efc0860d4e95ba7f25052474a0bfca0cStephen White if (fType == Type::kConnector) { 40992eba8a5efc0860d4e95ba7f25052474a0bfca0cStephen White *alpha = (1.0 - s) * fTop->fAlpha + s * fBottom->fAlpha; 41092eba8a5efc0860d4e95ba7f25052474a0bfca0cStephen White } else if (other.fType == Type::kConnector) { 41192eba8a5efc0860d4e95ba7f25052474a0bfca0cStephen White double t = tNumer / denom; 41292eba8a5efc0860d4e95ba7f25052474a0bfca0cStephen White *alpha = (1.0 - t) * other.fTop->fAlpha + t * other.fBottom->fAlpha; 41356158ae600a73ac2e74f5a5862de0fab466b52b6Stephen White } else if (fType == Type::kOuter && other.fType == Type::kOuter) { 41456158ae600a73ac2e74f5a5862de0fab466b52b6Stephen White *alpha = 0; 41556158ae600a73ac2e74f5a5862de0fab466b52b6Stephen White } else { 41692eba8a5efc0860d4e95ba7f25052474a0bfca0cStephen White *alpha = 255; 41756158ae600a73ac2e74f5a5862de0fab466b52b6Stephen White } 41856158ae600a73ac2e74f5a5862de0fab466b52b6Stephen White } 419e9709e831954c3427d5cb839e84221a177bfedebethannicholas return true; 420e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 421f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco}; 422f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco 423f57372daf0562a187c24d427366ac6d0cb980c9bsenorblancostruct EdgeList { 4245ad721e94682b51b9f773d95704f11990468fef6Stephen White EdgeList() : fHead(nullptr), fTail(nullptr) {} 425f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco Edge* fHead; 426f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco Edge* fTail; 427f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco void insert(Edge* edge, Edge* prev, Edge* next) { 428f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco list_insert<Edge, &Edge::fLeft, &Edge::fRight>(edge, prev, next, &fHead, &fTail); 429f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco } 430f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco void append(Edge* e) { 431f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco insert(e, fTail, nullptr); 432f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco } 433f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco void remove(Edge* edge) { 434f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco list_remove<Edge, &Edge::fLeft, &Edge::fRight>(edge, &fHead, &fTail); 435f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco } 436bda29c076bf3d6811bde142d57e54e5792727481Stephen White void removeAll() { 437bda29c076bf3d6811bde142d57e54e5792727481Stephen White while (fHead) { 438bda29c076bf3d6811bde142d57e54e5792727481Stephen White this->remove(fHead); 439bda29c076bf3d6811bde142d57e54e5792727481Stephen White } 440bda29c076bf3d6811bde142d57e54e5792727481Stephen White } 441f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco void close() { 442f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco if (fHead && fTail) { 443f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco fTail->fRight = fHead; 444f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco fHead->fLeft = fTail; 445f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco } 446f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco } 447f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco bool contains(Edge* edge) const { 448f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco return edge->fLeft || edge->fRight || fHead == edge; 449e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 450e9709e831954c3427d5cb839e84221a177bfedebethannicholas}; 451e9709e831954c3427d5cb839e84221a177bfedebethannicholas 452e9709e831954c3427d5cb839e84221a177bfedebethannicholas/***************************************************************************************/ 453e9709e831954c3427d5cb839e84221a177bfedebethannicholas 454e9709e831954c3427d5cb839e84221a177bfedebethannicholasstruct Poly { 455531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco Poly(Vertex* v, int winding) 456531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco : fFirstVertex(v) 457531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco , fWinding(winding) 458e9709e831954c3427d5cb839e84221a177bfedebethannicholas , fHead(nullptr) 459e9709e831954c3427d5cb839e84221a177bfedebethannicholas , fTail(nullptr) 460e9709e831954c3427d5cb839e84221a177bfedebethannicholas , fNext(nullptr) 461e9709e831954c3427d5cb839e84221a177bfedebethannicholas , fPartner(nullptr) 462e9709e831954c3427d5cb839e84221a177bfedebethannicholas , fCount(0) 463e9709e831954c3427d5cb839e84221a177bfedebethannicholas { 464e9709e831954c3427d5cb839e84221a177bfedebethannicholas#if LOGGING_ENABLED 465e9709e831954c3427d5cb839e84221a177bfedebethannicholas static int gID = 0; 466e9709e831954c3427d5cb839e84221a177bfedebethannicholas fID = gID++; 467e9709e831954c3427d5cb839e84221a177bfedebethannicholas LOG("*** created Poly %d\n", fID); 468e9709e831954c3427d5cb839e84221a177bfedebethannicholas#endif 469e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 470531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco typedef enum { kLeft_Side, kRight_Side } Side; 471e9709e831954c3427d5cb839e84221a177bfedebethannicholas struct MonotonePoly { 472531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco MonotonePoly(Edge* edge, Side side) 473531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco : fSide(side) 474531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco , fFirstEdge(nullptr) 475531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco , fLastEdge(nullptr) 476e9709e831954c3427d5cb839e84221a177bfedebethannicholas , fPrev(nullptr) 477531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco , fNext(nullptr) { 478531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco this->addEdge(edge); 479531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco } 480e9709e831954c3427d5cb839e84221a177bfedebethannicholas Side fSide; 481531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco Edge* fFirstEdge; 482531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco Edge* fLastEdge; 483e9709e831954c3427d5cb839e84221a177bfedebethannicholas MonotonePoly* fPrev; 484e9709e831954c3427d5cb839e84221a177bfedebethannicholas MonotonePoly* fNext; 485531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco void addEdge(Edge* edge) { 486e6eaa320e8dac34396dc364aa0863574d7b5291csenorblanco if (fSide == kRight_Side) { 487212c7c389e81053b84a3ed7775f2031d76d5ee70senorblanco SkASSERT(!edge->fUsedInRightPoly); 488531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco list_insert<Edge, &Edge::fRightPolyPrev, &Edge::fRightPolyNext>( 489531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco edge, fLastEdge, nullptr, &fFirstEdge, &fLastEdge); 49070f5251cc59191040a14cd0f1567aa2129e1f7c6senorblanco edge->fUsedInRightPoly = true; 491e9709e831954c3427d5cb839e84221a177bfedebethannicholas } else { 492212c7c389e81053b84a3ed7775f2031d76d5ee70senorblanco SkASSERT(!edge->fUsedInLeftPoly); 493531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco list_insert<Edge, &Edge::fLeftPolyPrev, &Edge::fLeftPolyNext>( 494531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco edge, fLastEdge, nullptr, &fFirstEdge, &fLastEdge); 49570f5251cc59191040a14cd0f1567aa2129e1f7c6senorblanco edge->fUsedInLeftPoly = true; 496e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 497e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 498e9709e831954c3427d5cb839e84221a177bfedebethannicholas 499f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco void* emit(const AAParams* aaParams, void* data) { 500531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco Edge* e = fFirstEdge; 501531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco VertexList vertices; 502531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco vertices.append(e->fTop); 503651cbe9af67b49c5a3ad3788c3a50a003827a8e2Stephen White int count = 1; 504531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco while (e != nullptr) { 505531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco if (kRight_Side == fSide) { 506531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco vertices.append(e->fBottom); 507531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco e = e->fRightPolyNext; 508531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco } else { 509531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco vertices.prepend(e->fBottom); 510531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco e = e->fLeftPolyNext; 511531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco } 512651cbe9af67b49c5a3ad3788c3a50a003827a8e2Stephen White count++; 513531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco } 514531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco Vertex* first = vertices.fHead; 515e9709e831954c3427d5cb839e84221a177bfedebethannicholas Vertex* v = first->fNext; 516531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco while (v != vertices.fTail) { 517e9709e831954c3427d5cb839e84221a177bfedebethannicholas SkASSERT(v && v->fPrev && v->fNext); 518e9709e831954c3427d5cb839e84221a177bfedebethannicholas Vertex* prev = v->fPrev; 519e9709e831954c3427d5cb839e84221a177bfedebethannicholas Vertex* curr = v; 520e9709e831954c3427d5cb839e84221a177bfedebethannicholas Vertex* next = v->fNext; 521651cbe9af67b49c5a3ad3788c3a50a003827a8e2Stephen White if (count == 3) { 522651cbe9af67b49c5a3ad3788c3a50a003827a8e2Stephen White return emit_triangle(prev, curr, next, aaParams, data); 523651cbe9af67b49c5a3ad3788c3a50a003827a8e2Stephen White } 524e9709e831954c3427d5cb839e84221a177bfedebethannicholas double ax = static_cast<double>(curr->fPoint.fX) - prev->fPoint.fX; 525e9709e831954c3427d5cb839e84221a177bfedebethannicholas double ay = static_cast<double>(curr->fPoint.fY) - prev->fPoint.fY; 526e9709e831954c3427d5cb839e84221a177bfedebethannicholas double bx = static_cast<double>(next->fPoint.fX) - curr->fPoint.fX; 527e9709e831954c3427d5cb839e84221a177bfedebethannicholas double by = static_cast<double>(next->fPoint.fY) - curr->fPoint.fY; 528e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (ax * by - ay * bx >= 0.0) { 529f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco data = emit_triangle(prev, curr, next, aaParams, data); 530e9709e831954c3427d5cb839e84221a177bfedebethannicholas v->fPrev->fNext = v->fNext; 531e9709e831954c3427d5cb839e84221a177bfedebethannicholas v->fNext->fPrev = v->fPrev; 532651cbe9af67b49c5a3ad3788c3a50a003827a8e2Stephen White count--; 533e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (v->fPrev == first) { 534e9709e831954c3427d5cb839e84221a177bfedebethannicholas v = v->fNext; 535e9709e831954c3427d5cb839e84221a177bfedebethannicholas } else { 536e9709e831954c3427d5cb839e84221a177bfedebethannicholas v = v->fPrev; 537e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 538e9709e831954c3427d5cb839e84221a177bfedebethannicholas } else { 539e9709e831954c3427d5cb839e84221a177bfedebethannicholas v = v->fNext; 540e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 541e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 542e9709e831954c3427d5cb839e84221a177bfedebethannicholas return data; 543e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 544e9709e831954c3427d5cb839e84221a177bfedebethannicholas }; 5455cdc9dda330db41d34e452a91b6b0995b5a57626Herb Derby Poly* addEdge(Edge* e, Side side, SkArenaAlloc& alloc) { 54670f5251cc59191040a14cd0f1567aa2129e1f7c6senorblanco LOG("addEdge (%g -> %g) to poly %d, %s side\n", 54770f5251cc59191040a14cd0f1567aa2129e1f7c6senorblanco e->fTop->fID, e->fBottom->fID, fID, side == kLeft_Side ? "left" : "right"); 548e9709e831954c3427d5cb839e84221a177bfedebethannicholas Poly* partner = fPartner; 549e9709e831954c3427d5cb839e84221a177bfedebethannicholas Poly* poly = this; 550212c7c389e81053b84a3ed7775f2031d76d5ee70senorblanco if (side == kRight_Side) { 551212c7c389e81053b84a3ed7775f2031d76d5ee70senorblanco if (e->fUsedInRightPoly) { 552212c7c389e81053b84a3ed7775f2031d76d5ee70senorblanco return this; 553212c7c389e81053b84a3ed7775f2031d76d5ee70senorblanco } 554212c7c389e81053b84a3ed7775f2031d76d5ee70senorblanco } else { 555212c7c389e81053b84a3ed7775f2031d76d5ee70senorblanco if (e->fUsedInLeftPoly) { 556212c7c389e81053b84a3ed7775f2031d76d5ee70senorblanco return this; 557212c7c389e81053b84a3ed7775f2031d76d5ee70senorblanco } 558212c7c389e81053b84a3ed7775f2031d76d5ee70senorblanco } 559e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (partner) { 560e9709e831954c3427d5cb839e84221a177bfedebethannicholas fPartner = partner->fPartner = nullptr; 561e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 562531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco if (!fTail) { 5635cdc9dda330db41d34e452a91b6b0995b5a57626Herb Derby fHead = fTail = alloc.make<MonotonePoly>(e, side); 564531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco fCount += 2; 56593e3fff79eaaa86bc2fb740a42111a074ccc73absenorblanco } else if (e->fBottom == fTail->fLastEdge->fBottom) { 56693e3fff79eaaa86bc2fb740a42111a074ccc73absenorblanco return poly; 567531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco } else if (side == fTail->fSide) { 568531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco fTail->addEdge(e); 569531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco fCount++; 570531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco } else { 5715cdc9dda330db41d34e452a91b6b0995b5a57626Herb Derby e = alloc.make<Edge>(fTail->fLastEdge->fBottom, e->fBottom, 1, Edge::Type::kInner); 572531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco fTail->addEdge(e); 573531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco fCount++; 574e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (partner) { 575531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco partner->addEdge(e, side, alloc); 576e9709e831954c3427d5cb839e84221a177bfedebethannicholas poly = partner; 577e9709e831954c3427d5cb839e84221a177bfedebethannicholas } else { 5785cdc9dda330db41d34e452a91b6b0995b5a57626Herb Derby MonotonePoly* m = alloc.make<MonotonePoly>(e, side); 579531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco m->fPrev = fTail; 580531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco fTail->fNext = m; 581531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco fTail = m; 582e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 583e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 584e9709e831954c3427d5cb839e84221a177bfedebethannicholas return poly; 585e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 586f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco void* emit(const AAParams* aaParams, void *data) { 587e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (fCount < 3) { 588e9709e831954c3427d5cb839e84221a177bfedebethannicholas return data; 589e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 590e9709e831954c3427d5cb839e84221a177bfedebethannicholas LOG("emit() %d, size %d\n", fID, fCount); 591e9709e831954c3427d5cb839e84221a177bfedebethannicholas for (MonotonePoly* m = fHead; m != nullptr; m = m->fNext) { 592f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco data = m->emit(aaParams, data); 593e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 594e9709e831954c3427d5cb839e84221a177bfedebethannicholas return data; 595e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 596531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco Vertex* lastVertex() const { return fTail ? fTail->fLastEdge->fBottom : fFirstVertex; } 597531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco Vertex* fFirstVertex; 598e9709e831954c3427d5cb839e84221a177bfedebethannicholas int fWinding; 599e9709e831954c3427d5cb839e84221a177bfedebethannicholas MonotonePoly* fHead; 600e9709e831954c3427d5cb839e84221a177bfedebethannicholas MonotonePoly* fTail; 601e9709e831954c3427d5cb839e84221a177bfedebethannicholas Poly* fNext; 602e9709e831954c3427d5cb839e84221a177bfedebethannicholas Poly* fPartner; 603e9709e831954c3427d5cb839e84221a177bfedebethannicholas int fCount; 604e9709e831954c3427d5cb839e84221a177bfedebethannicholas#if LOGGING_ENABLED 605e9709e831954c3427d5cb839e84221a177bfedebethannicholas int fID; 606e9709e831954c3427d5cb839e84221a177bfedebethannicholas#endif 607e9709e831954c3427d5cb839e84221a177bfedebethannicholas}; 608e9709e831954c3427d5cb839e84221a177bfedebethannicholas 609e9709e831954c3427d5cb839e84221a177bfedebethannicholas/***************************************************************************************/ 610e9709e831954c3427d5cb839e84221a177bfedebethannicholas 611e9709e831954c3427d5cb839e84221a177bfedebethannicholasbool coincident(const SkPoint& a, const SkPoint& b) { 612e9709e831954c3427d5cb839e84221a177bfedebethannicholas return a == b; 613e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 614e9709e831954c3427d5cb839e84221a177bfedebethannicholas 6155cdc9dda330db41d34e452a91b6b0995b5a57626Herb DerbyPoly* new_poly(Poly** head, Vertex* v, int winding, SkArenaAlloc& alloc) { 6165cdc9dda330db41d34e452a91b6b0995b5a57626Herb Derby Poly* poly = alloc.make<Poly>(v, winding); 617e9709e831954c3427d5cb839e84221a177bfedebethannicholas poly->fNext = *head; 618e9709e831954c3427d5cb839e84221a177bfedebethannicholas *head = poly; 619e9709e831954c3427d5cb839e84221a177bfedebethannicholas return poly; 620e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 621e9709e831954c3427d5cb839e84221a177bfedebethannicholas 6223a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen Whitevoid append_point_to_contour(const SkPoint& p, VertexList* contour, SkArenaAlloc& alloc) { 6235cdc9dda330db41d34e452a91b6b0995b5a57626Herb Derby Vertex* v = alloc.make<Vertex>(p, 255); 624e9709e831954c3427d5cb839e84221a177bfedebethannicholas#if LOGGING_ENABLED 625e9709e831954c3427d5cb839e84221a177bfedebethannicholas static float gID = 0.0f; 626e9709e831954c3427d5cb839e84221a177bfedebethannicholas v->fID = gID++; 627e9709e831954c3427d5cb839e84221a177bfedebethannicholas#endif 6283a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White contour->append(v); 629e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 630e9709e831954c3427d5cb839e84221a177bfedebethannicholas 6313a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen Whitevoid generate_quadratic_points(const SkPoint& p0, 6323a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White const SkPoint& p1, 6333a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White const SkPoint& p2, 6343a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White SkScalar tolSqd, 6353a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White VertexList* contour, 6363a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White int pointsLeft, 6373a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White SkArenaAlloc& alloc) { 638e9709e831954c3427d5cb839e84221a177bfedebethannicholas SkScalar d = p1.distanceToLineSegmentBetweenSqd(p0, p2); 639e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (pointsLeft < 2 || d < tolSqd || !SkScalarIsFinite(d)) { 6403a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White append_point_to_contour(p2, contour, alloc); 6413a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White return; 642e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 643e9709e831954c3427d5cb839e84221a177bfedebethannicholas 644e9709e831954c3427d5cb839e84221a177bfedebethannicholas const SkPoint q[] = { 645e9709e831954c3427d5cb839e84221a177bfedebethannicholas { SkScalarAve(p0.fX, p1.fX), SkScalarAve(p0.fY, p1.fY) }, 646e9709e831954c3427d5cb839e84221a177bfedebethannicholas { SkScalarAve(p1.fX, p2.fX), SkScalarAve(p1.fY, p2.fY) }, 647e9709e831954c3427d5cb839e84221a177bfedebethannicholas }; 648e9709e831954c3427d5cb839e84221a177bfedebethannicholas const SkPoint r = { SkScalarAve(q[0].fX, q[1].fX), SkScalarAve(q[0].fY, q[1].fY) }; 649e9709e831954c3427d5cb839e84221a177bfedebethannicholas 650e9709e831954c3427d5cb839e84221a177bfedebethannicholas pointsLeft >>= 1; 6513a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White generate_quadratic_points(p0, q[0], r, tolSqd, contour, pointsLeft, alloc); 6523a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White generate_quadratic_points(r, q[1], p2, tolSqd, contour, pointsLeft, alloc); 653e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 654e9709e831954c3427d5cb839e84221a177bfedebethannicholas 6553a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen Whitevoid generate_cubic_points(const SkPoint& p0, 6563a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White const SkPoint& p1, 6573a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White const SkPoint& p2, 6583a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White const SkPoint& p3, 6593a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White SkScalar tolSqd, 6603a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White VertexList* contour, 6613a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White int pointsLeft, 6623a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White SkArenaAlloc& alloc) { 663e9709e831954c3427d5cb839e84221a177bfedebethannicholas SkScalar d1 = p1.distanceToLineSegmentBetweenSqd(p0, p3); 664e9709e831954c3427d5cb839e84221a177bfedebethannicholas SkScalar d2 = p2.distanceToLineSegmentBetweenSqd(p0, p3); 665e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (pointsLeft < 2 || (d1 < tolSqd && d2 < tolSqd) || 666e9709e831954c3427d5cb839e84221a177bfedebethannicholas !SkScalarIsFinite(d1) || !SkScalarIsFinite(d2)) { 6673a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White append_point_to_contour(p3, contour, alloc); 6683a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White return; 669e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 670e9709e831954c3427d5cb839e84221a177bfedebethannicholas const SkPoint q[] = { 671e9709e831954c3427d5cb839e84221a177bfedebethannicholas { SkScalarAve(p0.fX, p1.fX), SkScalarAve(p0.fY, p1.fY) }, 672e9709e831954c3427d5cb839e84221a177bfedebethannicholas { SkScalarAve(p1.fX, p2.fX), SkScalarAve(p1.fY, p2.fY) }, 673e9709e831954c3427d5cb839e84221a177bfedebethannicholas { SkScalarAve(p2.fX, p3.fX), SkScalarAve(p2.fY, p3.fY) } 674e9709e831954c3427d5cb839e84221a177bfedebethannicholas }; 675e9709e831954c3427d5cb839e84221a177bfedebethannicholas const SkPoint r[] = { 676e9709e831954c3427d5cb839e84221a177bfedebethannicholas { SkScalarAve(q[0].fX, q[1].fX), SkScalarAve(q[0].fY, q[1].fY) }, 677e9709e831954c3427d5cb839e84221a177bfedebethannicholas { SkScalarAve(q[1].fX, q[2].fX), SkScalarAve(q[1].fY, q[2].fY) } 678e9709e831954c3427d5cb839e84221a177bfedebethannicholas }; 679e9709e831954c3427d5cb839e84221a177bfedebethannicholas const SkPoint s = { SkScalarAve(r[0].fX, r[1].fX), SkScalarAve(r[0].fY, r[1].fY) }; 680e9709e831954c3427d5cb839e84221a177bfedebethannicholas pointsLeft >>= 1; 6813a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White generate_cubic_points(p0, q[0], r[0], s, tolSqd, contour, pointsLeft, alloc); 6823a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White generate_cubic_points(s, r[1], q[2], p3, tolSqd, contour, pointsLeft, alloc); 683e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 684e9709e831954c3427d5cb839e84221a177bfedebethannicholas 685e9709e831954c3427d5cb839e84221a177bfedebethannicholas// Stage 1: convert the input path to a set of linear contours (linked list of Vertices). 686e9709e831954c3427d5cb839e84221a177bfedebethannicholas 687e9709e831954c3427d5cb839e84221a177bfedebethannicholasvoid path_to_contours(const SkPath& path, SkScalar tolerance, const SkRect& clipBounds, 6883a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White VertexList* contours, SkArenaAlloc& alloc, bool *isLinear) { 689e9709e831954c3427d5cb839e84221a177bfedebethannicholas SkScalar toleranceSqd = tolerance * tolerance; 690e9709e831954c3427d5cb839e84221a177bfedebethannicholas 691e9709e831954c3427d5cb839e84221a177bfedebethannicholas SkPoint pts[4]; 692e9709e831954c3427d5cb839e84221a177bfedebethannicholas *isLinear = true; 6933a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White VertexList* contour = contours; 694e9709e831954c3427d5cb839e84221a177bfedebethannicholas SkPath::Iter iter(path, false); 695e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (path.isInverseFillType()) { 696e9709e831954c3427d5cb839e84221a177bfedebethannicholas SkPoint quad[4]; 697e9709e831954c3427d5cb839e84221a177bfedebethannicholas clipBounds.toQuad(quad); 6987ab96e92196dd74d5b95d33c8477b256813f3046senorblanco for (int i = 3; i >= 0; i--) { 6993a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White append_point_to_contour(quad[i], contours, alloc); 700e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 7013a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White contour++; 702e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 703e9709e831954c3427d5cb839e84221a177bfedebethannicholas SkAutoConicToQuads converter; 7043a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White SkPath::Verb verb; 7053a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White while ((verb = iter.next(pts)) != SkPath::kDone_Verb) { 706e9709e831954c3427d5cb839e84221a177bfedebethannicholas switch (verb) { 707e9709e831954c3427d5cb839e84221a177bfedebethannicholas case SkPath::kConic_Verb: { 708e9709e831954c3427d5cb839e84221a177bfedebethannicholas SkScalar weight = iter.conicWeight(); 709e9709e831954c3427d5cb839e84221a177bfedebethannicholas const SkPoint* quadPts = converter.computeQuads(pts, weight, toleranceSqd); 710e9709e831954c3427d5cb839e84221a177bfedebethannicholas for (int i = 0; i < converter.countQuads(); ++i) { 711e9709e831954c3427d5cb839e84221a177bfedebethannicholas int pointsLeft = GrPathUtils::quadraticPointCount(quadPts, tolerance); 7123a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White generate_quadratic_points(quadPts[0], quadPts[1], quadPts[2], toleranceSqd, 7133a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White contour, pointsLeft, alloc); 714e9709e831954c3427d5cb839e84221a177bfedebethannicholas quadPts += 2; 715e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 716e9709e831954c3427d5cb839e84221a177bfedebethannicholas *isLinear = false; 717e9709e831954c3427d5cb839e84221a177bfedebethannicholas break; 718e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 719e9709e831954c3427d5cb839e84221a177bfedebethannicholas case SkPath::kMove_Verb: 7203a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White if (contour->fHead) { 7213a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White contour++; 722e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 7233a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White append_point_to_contour(pts[0], contour, alloc); 724e9709e831954c3427d5cb839e84221a177bfedebethannicholas break; 725e9709e831954c3427d5cb839e84221a177bfedebethannicholas case SkPath::kLine_Verb: { 7263a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White append_point_to_contour(pts[1], contour, alloc); 727e9709e831954c3427d5cb839e84221a177bfedebethannicholas break; 728e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 729e9709e831954c3427d5cb839e84221a177bfedebethannicholas case SkPath::kQuad_Verb: { 730e9709e831954c3427d5cb839e84221a177bfedebethannicholas int pointsLeft = GrPathUtils::quadraticPointCount(pts, tolerance); 7313a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White generate_quadratic_points(pts[0], pts[1], pts[2], toleranceSqd, contour, 7323a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White pointsLeft, alloc); 733e9709e831954c3427d5cb839e84221a177bfedebethannicholas *isLinear = false; 734e9709e831954c3427d5cb839e84221a177bfedebethannicholas break; 735e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 736e9709e831954c3427d5cb839e84221a177bfedebethannicholas case SkPath::kCubic_Verb: { 737e9709e831954c3427d5cb839e84221a177bfedebethannicholas int pointsLeft = GrPathUtils::cubicPointCount(pts, tolerance); 7383a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White generate_cubic_points(pts[0], pts[1], pts[2], pts[3], toleranceSqd, contour, 7393a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White pointsLeft, alloc); 740e9709e831954c3427d5cb839e84221a177bfedebethannicholas *isLinear = false; 741e9709e831954c3427d5cb839e84221a177bfedebethannicholas break; 742e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 743e9709e831954c3427d5cb839e84221a177bfedebethannicholas case SkPath::kClose_Verb: 744e9709e831954c3427d5cb839e84221a177bfedebethannicholas case SkPath::kDone_Verb: 745e9709e831954c3427d5cb839e84221a177bfedebethannicholas break; 746e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 747e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 748e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 749e9709e831954c3427d5cb839e84221a177bfedebethannicholas 750497890630b80a381a2ac4cbb9114b0320560bf8cStephen Whiteinline bool apply_fill_type(SkPath::FillType fillType, int winding) { 751e9709e831954c3427d5cb839e84221a177bfedebethannicholas switch (fillType) { 752e9709e831954c3427d5cb839e84221a177bfedebethannicholas case SkPath::kWinding_FillType: 753e9709e831954c3427d5cb839e84221a177bfedebethannicholas return winding != 0; 754e9709e831954c3427d5cb839e84221a177bfedebethannicholas case SkPath::kEvenOdd_FillType: 755e9709e831954c3427d5cb839e84221a177bfedebethannicholas return (winding & 1) != 0; 756e9709e831954c3427d5cb839e84221a177bfedebethannicholas case SkPath::kInverseWinding_FillType: 7577ab96e92196dd74d5b95d33c8477b256813f3046senorblanco return winding == 1; 758e9709e831954c3427d5cb839e84221a177bfedebethannicholas case SkPath::kInverseEvenOdd_FillType: 759e9709e831954c3427d5cb839e84221a177bfedebethannicholas return (winding & 1) == 1; 760e9709e831954c3427d5cb839e84221a177bfedebethannicholas default: 761e9709e831954c3427d5cb839e84221a177bfedebethannicholas SkASSERT(false); 762e9709e831954c3427d5cb839e84221a177bfedebethannicholas return false; 763e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 764e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 765e9709e831954c3427d5cb839e84221a177bfedebethannicholas 766497890630b80a381a2ac4cbb9114b0320560bf8cStephen Whiteinline bool apply_fill_type(SkPath::FillType fillType, Poly* poly) { 767497890630b80a381a2ac4cbb9114b0320560bf8cStephen White return poly && apply_fill_type(fillType, poly->fWinding); 768497890630b80a381a2ac4cbb9114b0320560bf8cStephen White} 769497890630b80a381a2ac4cbb9114b0320560bf8cStephen White 7705cdc9dda330db41d34e452a91b6b0995b5a57626Herb DerbyEdge* new_edge(Vertex* prev, Vertex* next, Edge::Type type, Comparator& c, SkArenaAlloc& alloc) { 7712f4686fa25ef7a14961f68be18e63de3567d0a15Stephen White int winding = c.sweep_lt(prev->fPoint, next->fPoint) ? 1 : -1; 772e9709e831954c3427d5cb839e84221a177bfedebethannicholas Vertex* top = winding < 0 ? next : prev; 773e9709e831954c3427d5cb839e84221a177bfedebethannicholas Vertex* bottom = winding < 0 ? prev : next; 7745cdc9dda330db41d34e452a91b6b0995b5a57626Herb Derby return alloc.make<Edge>(top, bottom, winding, type); 775e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 776e9709e831954c3427d5cb839e84221a177bfedebethannicholas 777e9709e831954c3427d5cb839e84221a177bfedebethannicholasvoid remove_edge(Edge* edge, EdgeList* edges) { 778e9709e831954c3427d5cb839e84221a177bfedebethannicholas LOG("removing edge %g -> %g\n", edge->fTop->fID, edge->fBottom->fID); 779f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco SkASSERT(edges->contains(edge)); 780f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco edges->remove(edge); 781e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 782e9709e831954c3427d5cb839e84221a177bfedebethannicholas 783e9709e831954c3427d5cb839e84221a177bfedebethannicholasvoid insert_edge(Edge* edge, Edge* prev, EdgeList* edges) { 784e9709e831954c3427d5cb839e84221a177bfedebethannicholas LOG("inserting edge %g -> %g\n", edge->fTop->fID, edge->fBottom->fID); 785f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco SkASSERT(!edges->contains(edge)); 786e9709e831954c3427d5cb839e84221a177bfedebethannicholas Edge* next = prev ? prev->fRight : edges->fHead; 787f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco edges->insert(edge, prev, next); 788e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 789e9709e831954c3427d5cb839e84221a177bfedebethannicholas 790e9709e831954c3427d5cb839e84221a177bfedebethannicholasvoid find_enclosing_edges(Vertex* v, EdgeList* edges, Edge** left, Edge** right) { 79190732fd36e22cbf0699ab1d0f08eb7e247dda30bStephen White if (v->fFirstEdgeAbove && v->fLastEdgeAbove) { 792e9709e831954c3427d5cb839e84221a177bfedebethannicholas *left = v->fFirstEdgeAbove->fLeft; 793e9709e831954c3427d5cb839e84221a177bfedebethannicholas *right = v->fLastEdgeAbove->fRight; 794e9709e831954c3427d5cb839e84221a177bfedebethannicholas return; 795e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 796e9709e831954c3427d5cb839e84221a177bfedebethannicholas Edge* next = nullptr; 797e9709e831954c3427d5cb839e84221a177bfedebethannicholas Edge* prev; 798e9709e831954c3427d5cb839e84221a177bfedebethannicholas for (prev = edges->fTail; prev != nullptr; prev = prev->fLeft) { 799e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (prev->isLeftOf(v)) { 800e9709e831954c3427d5cb839e84221a177bfedebethannicholas break; 801e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 802e9709e831954c3427d5cb839e84221a177bfedebethannicholas next = prev; 803e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 804e9709e831954c3427d5cb839e84221a177bfedebethannicholas *left = prev; 805e9709e831954c3427d5cb839e84221a177bfedebethannicholas *right = next; 806e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 807e9709e831954c3427d5cb839e84221a177bfedebethannicholas 808e9709e831954c3427d5cb839e84221a177bfedebethannicholasvoid find_enclosing_edges(Edge* edge, EdgeList* edges, Comparator& c, Edge** left, Edge** right) { 809e9709e831954c3427d5cb839e84221a177bfedebethannicholas Edge* prev = nullptr; 810e9709e831954c3427d5cb839e84221a177bfedebethannicholas Edge* next; 811e9709e831954c3427d5cb839e84221a177bfedebethannicholas for (next = edges->fHead; next != nullptr; next = next->fRight) { 812e30cf80c8893db8ec61d29322f1992591dad3b6bStephen White if ((c.sweep_lt(next->fTop->fPoint, edge->fTop->fPoint) && next->isRightOf(edge->fTop)) || 813e30cf80c8893db8ec61d29322f1992591dad3b6bStephen White (c.sweep_lt(edge->fTop->fPoint, next->fTop->fPoint) && edge->isLeftOf(next->fTop)) || 814e9709e831954c3427d5cb839e84221a177bfedebethannicholas (c.sweep_lt(edge->fBottom->fPoint, next->fBottom->fPoint) && 815e9709e831954c3427d5cb839e84221a177bfedebethannicholas next->isRightOf(edge->fBottom)) || 816e9709e831954c3427d5cb839e84221a177bfedebethannicholas (c.sweep_lt(next->fBottom->fPoint, edge->fBottom->fPoint) && 817e9709e831954c3427d5cb839e84221a177bfedebethannicholas edge->isLeftOf(next->fBottom))) { 818e9709e831954c3427d5cb839e84221a177bfedebethannicholas break; 819e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 820e9709e831954c3427d5cb839e84221a177bfedebethannicholas prev = next; 821e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 822e9709e831954c3427d5cb839e84221a177bfedebethannicholas *left = prev; 823e9709e831954c3427d5cb839e84221a177bfedebethannicholas *right = next; 824e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 825e9709e831954c3427d5cb839e84221a177bfedebethannicholas 826e9709e831954c3427d5cb839e84221a177bfedebethannicholasvoid fix_active_state(Edge* edge, EdgeList* activeEdges, Comparator& c) { 8272f4686fa25ef7a14961f68be18e63de3567d0a15Stephen White if (!activeEdges) { 8282f4686fa25ef7a14961f68be18e63de3567d0a15Stephen White return; 8292f4686fa25ef7a14961f68be18e63de3567d0a15Stephen White } 8302f4686fa25ef7a14961f68be18e63de3567d0a15Stephen White if (activeEdges->contains(edge)) { 831e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (edge->fBottom->fProcessed || !edge->fTop->fProcessed) { 832e9709e831954c3427d5cb839e84221a177bfedebethannicholas remove_edge(edge, activeEdges); 833e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 834e9709e831954c3427d5cb839e84221a177bfedebethannicholas } else if (edge->fTop->fProcessed && !edge->fBottom->fProcessed) { 835e9709e831954c3427d5cb839e84221a177bfedebethannicholas Edge* left; 836e9709e831954c3427d5cb839e84221a177bfedebethannicholas Edge* right; 837e9709e831954c3427d5cb839e84221a177bfedebethannicholas find_enclosing_edges(edge, activeEdges, c, &left, &right); 838e9709e831954c3427d5cb839e84221a177bfedebethannicholas insert_edge(edge, left, activeEdges); 839e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 840e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 841e9709e831954c3427d5cb839e84221a177bfedebethannicholas 842e9709e831954c3427d5cb839e84221a177bfedebethannicholasvoid insert_edge_above(Edge* edge, Vertex* v, Comparator& c) { 843e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (edge->fTop->fPoint == edge->fBottom->fPoint || 844e30cf80c8893db8ec61d29322f1992591dad3b6bStephen White c.sweep_lt(edge->fBottom->fPoint, edge->fTop->fPoint)) { 845e9709e831954c3427d5cb839e84221a177bfedebethannicholas return; 846e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 847e9709e831954c3427d5cb839e84221a177bfedebethannicholas LOG("insert edge (%g -> %g) above vertex %g\n", edge->fTop->fID, edge->fBottom->fID, v->fID); 848e9709e831954c3427d5cb839e84221a177bfedebethannicholas Edge* prev = nullptr; 849e9709e831954c3427d5cb839e84221a177bfedebethannicholas Edge* next; 850e9709e831954c3427d5cb839e84221a177bfedebethannicholas for (next = v->fFirstEdgeAbove; next; next = next->fNextEdgeAbove) { 851e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (next->isRightOf(edge->fTop)) { 852e9709e831954c3427d5cb839e84221a177bfedebethannicholas break; 853e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 854e9709e831954c3427d5cb839e84221a177bfedebethannicholas prev = next; 855e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 856e6eaa320e8dac34396dc364aa0863574d7b5291csenorblanco list_insert<Edge, &Edge::fPrevEdgeAbove, &Edge::fNextEdgeAbove>( 857e9709e831954c3427d5cb839e84221a177bfedebethannicholas edge, prev, next, &v->fFirstEdgeAbove, &v->fLastEdgeAbove); 858e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 859e9709e831954c3427d5cb839e84221a177bfedebethannicholas 860e9709e831954c3427d5cb839e84221a177bfedebethannicholasvoid insert_edge_below(Edge* edge, Vertex* v, Comparator& c) { 861e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (edge->fTop->fPoint == edge->fBottom->fPoint || 862e30cf80c8893db8ec61d29322f1992591dad3b6bStephen White c.sweep_lt(edge->fBottom->fPoint, edge->fTop->fPoint)) { 863e9709e831954c3427d5cb839e84221a177bfedebethannicholas return; 864e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 865e9709e831954c3427d5cb839e84221a177bfedebethannicholas LOG("insert edge (%g -> %g) below vertex %g\n", edge->fTop->fID, edge->fBottom->fID, v->fID); 866e9709e831954c3427d5cb839e84221a177bfedebethannicholas Edge* prev = nullptr; 867e9709e831954c3427d5cb839e84221a177bfedebethannicholas Edge* next; 868e9709e831954c3427d5cb839e84221a177bfedebethannicholas for (next = v->fFirstEdgeBelow; next; next = next->fNextEdgeBelow) { 869e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (next->isRightOf(edge->fBottom)) { 870e9709e831954c3427d5cb839e84221a177bfedebethannicholas break; 871e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 872e9709e831954c3427d5cb839e84221a177bfedebethannicholas prev = next; 873e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 874e6eaa320e8dac34396dc364aa0863574d7b5291csenorblanco list_insert<Edge, &Edge::fPrevEdgeBelow, &Edge::fNextEdgeBelow>( 875e9709e831954c3427d5cb839e84221a177bfedebethannicholas edge, prev, next, &v->fFirstEdgeBelow, &v->fLastEdgeBelow); 876e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 877e9709e831954c3427d5cb839e84221a177bfedebethannicholas 878e9709e831954c3427d5cb839e84221a177bfedebethannicholasvoid remove_edge_above(Edge* edge) { 879e9709e831954c3427d5cb839e84221a177bfedebethannicholas LOG("removing edge (%g -> %g) above vertex %g\n", edge->fTop->fID, edge->fBottom->fID, 880e9709e831954c3427d5cb839e84221a177bfedebethannicholas edge->fBottom->fID); 881e6eaa320e8dac34396dc364aa0863574d7b5291csenorblanco list_remove<Edge, &Edge::fPrevEdgeAbove, &Edge::fNextEdgeAbove>( 882e9709e831954c3427d5cb839e84221a177bfedebethannicholas edge, &edge->fBottom->fFirstEdgeAbove, &edge->fBottom->fLastEdgeAbove); 883e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 884e9709e831954c3427d5cb839e84221a177bfedebethannicholas 885e9709e831954c3427d5cb839e84221a177bfedebethannicholasvoid remove_edge_below(Edge* edge) { 886e9709e831954c3427d5cb839e84221a177bfedebethannicholas LOG("removing edge (%g -> %g) below vertex %g\n", edge->fTop->fID, edge->fBottom->fID, 887e9709e831954c3427d5cb839e84221a177bfedebethannicholas edge->fTop->fID); 888e6eaa320e8dac34396dc364aa0863574d7b5291csenorblanco list_remove<Edge, &Edge::fPrevEdgeBelow, &Edge::fNextEdgeBelow>( 889e9709e831954c3427d5cb839e84221a177bfedebethannicholas edge, &edge->fTop->fFirstEdgeBelow, &edge->fTop->fLastEdgeBelow); 890e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 891e9709e831954c3427d5cb839e84221a177bfedebethannicholas 892e7a364d435843a868dcac2c61d78c34e5d3e326cStephen Whitevoid disconnect(Edge* edge) 893e7a364d435843a868dcac2c61d78c34e5d3e326cStephen White{ 894e9709e831954c3427d5cb839e84221a177bfedebethannicholas remove_edge_above(edge); 895e9709e831954c3427d5cb839e84221a177bfedebethannicholas remove_edge_below(edge); 896e7a364d435843a868dcac2c61d78c34e5d3e326cStephen White} 897e7a364d435843a868dcac2c61d78c34e5d3e326cStephen White 898e7a364d435843a868dcac2c61d78c34e5d3e326cStephen Whitevoid erase_edge(Edge* edge, EdgeList* edges) { 899e7a364d435843a868dcac2c61d78c34e5d3e326cStephen White LOG("erasing edge (%g -> %g)\n", edge->fTop->fID, edge->fBottom->fID); 900e7a364d435843a868dcac2c61d78c34e5d3e326cStephen White disconnect(edge); 901f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco if (edges && edges->contains(edge)) { 902e9709e831954c3427d5cb839e84221a177bfedebethannicholas remove_edge(edge, edges); 903e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 904e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 905e9709e831954c3427d5cb839e84221a177bfedebethannicholas 906e9709e831954c3427d5cb839e84221a177bfedebethannicholasvoid merge_collinear_edges(Edge* edge, EdgeList* activeEdges, Comparator& c); 907e9709e831954c3427d5cb839e84221a177bfedebethannicholas 908e9709e831954c3427d5cb839e84221a177bfedebethannicholasvoid set_top(Edge* edge, Vertex* v, EdgeList* activeEdges, Comparator& c) { 909e9709e831954c3427d5cb839e84221a177bfedebethannicholas remove_edge_below(edge); 910e9709e831954c3427d5cb839e84221a177bfedebethannicholas edge->fTop = v; 911e9709e831954c3427d5cb839e84221a177bfedebethannicholas edge->recompute(); 912e9709e831954c3427d5cb839e84221a177bfedebethannicholas insert_edge_below(edge, v, c); 913e9709e831954c3427d5cb839e84221a177bfedebethannicholas fix_active_state(edge, activeEdges, c); 914e9709e831954c3427d5cb839e84221a177bfedebethannicholas merge_collinear_edges(edge, activeEdges, c); 915e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 916e9709e831954c3427d5cb839e84221a177bfedebethannicholas 917e9709e831954c3427d5cb839e84221a177bfedebethannicholasvoid set_bottom(Edge* edge, Vertex* v, EdgeList* activeEdges, Comparator& c) { 918e9709e831954c3427d5cb839e84221a177bfedebethannicholas remove_edge_above(edge); 919e9709e831954c3427d5cb839e84221a177bfedebethannicholas edge->fBottom = v; 920e9709e831954c3427d5cb839e84221a177bfedebethannicholas edge->recompute(); 921e9709e831954c3427d5cb839e84221a177bfedebethannicholas insert_edge_above(edge, v, c); 922e9709e831954c3427d5cb839e84221a177bfedebethannicholas fix_active_state(edge, activeEdges, c); 923e9709e831954c3427d5cb839e84221a177bfedebethannicholas merge_collinear_edges(edge, activeEdges, c); 924e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 925e9709e831954c3427d5cb839e84221a177bfedebethannicholas 926e9709e831954c3427d5cb839e84221a177bfedebethannicholasvoid merge_edges_above(Edge* edge, Edge* other, EdgeList* activeEdges, Comparator& c) { 927e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (coincident(edge->fTop->fPoint, other->fTop->fPoint)) { 928e9709e831954c3427d5cb839e84221a177bfedebethannicholas LOG("merging coincident above edges (%g, %g) -> (%g, %g)\n", 929e9709e831954c3427d5cb839e84221a177bfedebethannicholas edge->fTop->fPoint.fX, edge->fTop->fPoint.fY, 930e9709e831954c3427d5cb839e84221a177bfedebethannicholas edge->fBottom->fPoint.fX, edge->fBottom->fPoint.fY); 931e9709e831954c3427d5cb839e84221a177bfedebethannicholas other->fWinding += edge->fWinding; 932e7a364d435843a868dcac2c61d78c34e5d3e326cStephen White erase_edge(edge, activeEdges); 933e9709e831954c3427d5cb839e84221a177bfedebethannicholas } else if (c.sweep_lt(edge->fTop->fPoint, other->fTop->fPoint)) { 934e9709e831954c3427d5cb839e84221a177bfedebethannicholas other->fWinding += edge->fWinding; 935e9709e831954c3427d5cb839e84221a177bfedebethannicholas set_bottom(edge, other->fTop, activeEdges, c); 936e9709e831954c3427d5cb839e84221a177bfedebethannicholas } else { 937e9709e831954c3427d5cb839e84221a177bfedebethannicholas edge->fWinding += other->fWinding; 938e9709e831954c3427d5cb839e84221a177bfedebethannicholas set_bottom(other, edge->fTop, activeEdges, c); 939e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 940e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 941e9709e831954c3427d5cb839e84221a177bfedebethannicholas 942e9709e831954c3427d5cb839e84221a177bfedebethannicholasvoid merge_edges_below(Edge* edge, Edge* other, EdgeList* activeEdges, Comparator& c) { 943e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (coincident(edge->fBottom->fPoint, other->fBottom->fPoint)) { 944e9709e831954c3427d5cb839e84221a177bfedebethannicholas LOG("merging coincident below edges (%g, %g) -> (%g, %g)\n", 945e9709e831954c3427d5cb839e84221a177bfedebethannicholas edge->fTop->fPoint.fX, edge->fTop->fPoint.fY, 946e9709e831954c3427d5cb839e84221a177bfedebethannicholas edge->fBottom->fPoint.fX, edge->fBottom->fPoint.fY); 947e9709e831954c3427d5cb839e84221a177bfedebethannicholas other->fWinding += edge->fWinding; 948e7a364d435843a868dcac2c61d78c34e5d3e326cStephen White erase_edge(edge, activeEdges); 949e9709e831954c3427d5cb839e84221a177bfedebethannicholas } else if (c.sweep_lt(edge->fBottom->fPoint, other->fBottom->fPoint)) { 950e9709e831954c3427d5cb839e84221a177bfedebethannicholas edge->fWinding += other->fWinding; 951e9709e831954c3427d5cb839e84221a177bfedebethannicholas set_top(other, edge->fBottom, activeEdges, c); 952e9709e831954c3427d5cb839e84221a177bfedebethannicholas } else { 953e9709e831954c3427d5cb839e84221a177bfedebethannicholas other->fWinding += edge->fWinding; 954e9709e831954c3427d5cb839e84221a177bfedebethannicholas set_top(edge, other->fBottom, activeEdges, c); 955e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 956e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 957e9709e831954c3427d5cb839e84221a177bfedebethannicholas 958e9709e831954c3427d5cb839e84221a177bfedebethannicholasvoid merge_collinear_edges(Edge* edge, EdgeList* activeEdges, Comparator& c) { 959e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (edge->fPrevEdgeAbove && (edge->fTop == edge->fPrevEdgeAbove->fTop || 960e9709e831954c3427d5cb839e84221a177bfedebethannicholas !edge->fPrevEdgeAbove->isLeftOf(edge->fTop))) { 961e9709e831954c3427d5cb839e84221a177bfedebethannicholas merge_edges_above(edge, edge->fPrevEdgeAbove, activeEdges, c); 962e9709e831954c3427d5cb839e84221a177bfedebethannicholas } else if (edge->fNextEdgeAbove && (edge->fTop == edge->fNextEdgeAbove->fTop || 963e9709e831954c3427d5cb839e84221a177bfedebethannicholas !edge->isLeftOf(edge->fNextEdgeAbove->fTop))) { 964e9709e831954c3427d5cb839e84221a177bfedebethannicholas merge_edges_above(edge, edge->fNextEdgeAbove, activeEdges, c); 965e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 966e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (edge->fPrevEdgeBelow && (edge->fBottom == edge->fPrevEdgeBelow->fBottom || 967e9709e831954c3427d5cb839e84221a177bfedebethannicholas !edge->fPrevEdgeBelow->isLeftOf(edge->fBottom))) { 968e9709e831954c3427d5cb839e84221a177bfedebethannicholas merge_edges_below(edge, edge->fPrevEdgeBelow, activeEdges, c); 969e9709e831954c3427d5cb839e84221a177bfedebethannicholas } else if (edge->fNextEdgeBelow && (edge->fBottom == edge->fNextEdgeBelow->fBottom || 970e9709e831954c3427d5cb839e84221a177bfedebethannicholas !edge->isLeftOf(edge->fNextEdgeBelow->fBottom))) { 971e9709e831954c3427d5cb839e84221a177bfedebethannicholas merge_edges_below(edge, edge->fNextEdgeBelow, activeEdges, c); 972e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 973e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 974e9709e831954c3427d5cb839e84221a177bfedebethannicholas 9755cdc9dda330db41d34e452a91b6b0995b5a57626Herb Derbyvoid split_edge(Edge* edge, Vertex* v, EdgeList* activeEdges, Comparator& c, SkArenaAlloc& alloc); 976e9709e831954c3427d5cb839e84221a177bfedebethannicholas 9775cdc9dda330db41d34e452a91b6b0995b5a57626Herb Derbyvoid cleanup_active_edges(Edge* edge, EdgeList* activeEdges, Comparator& c, SkArenaAlloc& alloc) { 978e9709e831954c3427d5cb839e84221a177bfedebethannicholas Vertex* top = edge->fTop; 979e9709e831954c3427d5cb839e84221a177bfedebethannicholas Vertex* bottom = edge->fBottom; 980e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (edge->fLeft) { 981e9709e831954c3427d5cb839e84221a177bfedebethannicholas Vertex* leftTop = edge->fLeft->fTop; 982e9709e831954c3427d5cb839e84221a177bfedebethannicholas Vertex* leftBottom = edge->fLeft->fBottom; 983e30cf80c8893db8ec61d29322f1992591dad3b6bStephen White if (c.sweep_lt(leftTop->fPoint, top->fPoint) && !edge->fLeft->isLeftOf(top)) { 984e9709e831954c3427d5cb839e84221a177bfedebethannicholas split_edge(edge->fLeft, edge->fTop, activeEdges, c, alloc); 985e30cf80c8893db8ec61d29322f1992591dad3b6bStephen White } else if (c.sweep_lt(top->fPoint, leftTop->fPoint) && !edge->isRightOf(leftTop)) { 986e9709e831954c3427d5cb839e84221a177bfedebethannicholas split_edge(edge, leftTop, activeEdges, c, alloc); 987e9709e831954c3427d5cb839e84221a177bfedebethannicholas } else if (c.sweep_lt(bottom->fPoint, leftBottom->fPoint) && 988e9709e831954c3427d5cb839e84221a177bfedebethannicholas !edge->fLeft->isLeftOf(bottom)) { 989e9709e831954c3427d5cb839e84221a177bfedebethannicholas split_edge(edge->fLeft, bottom, activeEdges, c, alloc); 990e9709e831954c3427d5cb839e84221a177bfedebethannicholas } else if (c.sweep_lt(leftBottom->fPoint, bottom->fPoint) && !edge->isRightOf(leftBottom)) { 991e9709e831954c3427d5cb839e84221a177bfedebethannicholas split_edge(edge, leftBottom, activeEdges, c, alloc); 992e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 993e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 994e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (edge->fRight) { 995e9709e831954c3427d5cb839e84221a177bfedebethannicholas Vertex* rightTop = edge->fRight->fTop; 996e9709e831954c3427d5cb839e84221a177bfedebethannicholas Vertex* rightBottom = edge->fRight->fBottom; 997e30cf80c8893db8ec61d29322f1992591dad3b6bStephen White if (c.sweep_lt(rightTop->fPoint, top->fPoint) && !edge->fRight->isRightOf(top)) { 998e9709e831954c3427d5cb839e84221a177bfedebethannicholas split_edge(edge->fRight, top, activeEdges, c, alloc); 999e30cf80c8893db8ec61d29322f1992591dad3b6bStephen White } else if (c.sweep_lt(top->fPoint, rightTop->fPoint) && !edge->isLeftOf(rightTop)) { 1000e9709e831954c3427d5cb839e84221a177bfedebethannicholas split_edge(edge, rightTop, activeEdges, c, alloc); 1001e9709e831954c3427d5cb839e84221a177bfedebethannicholas } else if (c.sweep_lt(bottom->fPoint, rightBottom->fPoint) && 1002e9709e831954c3427d5cb839e84221a177bfedebethannicholas !edge->fRight->isRightOf(bottom)) { 1003e9709e831954c3427d5cb839e84221a177bfedebethannicholas split_edge(edge->fRight, bottom, activeEdges, c, alloc); 1004e9709e831954c3427d5cb839e84221a177bfedebethannicholas } else if (c.sweep_lt(rightBottom->fPoint, bottom->fPoint) && 1005e9709e831954c3427d5cb839e84221a177bfedebethannicholas !edge->isLeftOf(rightBottom)) { 1006e9709e831954c3427d5cb839e84221a177bfedebethannicholas split_edge(edge, rightBottom, activeEdges, c, alloc); 1007e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1008e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1009e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 1010e9709e831954c3427d5cb839e84221a177bfedebethannicholas 10115cdc9dda330db41d34e452a91b6b0995b5a57626Herb Derbyvoid split_edge(Edge* edge, Vertex* v, EdgeList* activeEdges, Comparator& c, SkArenaAlloc& alloc) { 1012e9709e831954c3427d5cb839e84221a177bfedebethannicholas LOG("splitting edge (%g -> %g) at vertex %g (%g, %g)\n", 1013e9709e831954c3427d5cb839e84221a177bfedebethannicholas edge->fTop->fID, edge->fBottom->fID, 1014e9709e831954c3427d5cb839e84221a177bfedebethannicholas v->fID, v->fPoint.fX, v->fPoint.fY); 1015e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (c.sweep_lt(v->fPoint, edge->fTop->fPoint)) { 1016e9709e831954c3427d5cb839e84221a177bfedebethannicholas set_top(edge, v, activeEdges, c); 1017e30cf80c8893db8ec61d29322f1992591dad3b6bStephen White } else if (c.sweep_lt(edge->fBottom->fPoint, v->fPoint)) { 1018e9709e831954c3427d5cb839e84221a177bfedebethannicholas set_bottom(edge, v, activeEdges, c); 1019e9709e831954c3427d5cb839e84221a177bfedebethannicholas } else { 10205cdc9dda330db41d34e452a91b6b0995b5a57626Herb Derby Edge* newEdge = alloc.make<Edge>(v, edge->fBottom, edge->fWinding, edge->fType); 1021e9709e831954c3427d5cb839e84221a177bfedebethannicholas insert_edge_below(newEdge, v, c); 1022e9709e831954c3427d5cb839e84221a177bfedebethannicholas insert_edge_above(newEdge, edge->fBottom, c); 1023e9709e831954c3427d5cb839e84221a177bfedebethannicholas set_bottom(edge, v, activeEdges, c); 1024e9709e831954c3427d5cb839e84221a177bfedebethannicholas cleanup_active_edges(edge, activeEdges, c, alloc); 1025e9709e831954c3427d5cb839e84221a177bfedebethannicholas fix_active_state(newEdge, activeEdges, c); 1026e9709e831954c3427d5cb839e84221a177bfedebethannicholas merge_collinear_edges(newEdge, activeEdges, c); 1027e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1028e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 1029e9709e831954c3427d5cb839e84221a177bfedebethannicholas 10305cdc9dda330db41d34e452a91b6b0995b5a57626Herb DerbyEdge* connect(Vertex* prev, Vertex* next, Edge::Type type, Comparator& c, SkArenaAlloc& alloc, 103148ded38da99c1171ba1bb469f6500f8214e9105cStephen White int winding_scale = 1) { 1032bf6137e08b703abd98b3e4d938e1cccef2350f4eStephen White Edge* edge = new_edge(prev, next, type, c, alloc); 10338a0bfc5201f14c994fe8062ecf1ca34a172de9d3Stephen White insert_edge_below(edge, edge->fTop, c); 10348a0bfc5201f14c994fe8062ecf1ca34a172de9d3Stephen White insert_edge_above(edge, edge->fBottom, c); 103548ded38da99c1171ba1bb469f6500f8214e9105cStephen White edge->fWinding *= winding_scale; 1036f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco merge_collinear_edges(edge, nullptr, c); 1037f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco return edge; 1038f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco} 1039f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco 1040bf6137e08b703abd98b3e4d938e1cccef2350f4eStephen Whitevoid merge_vertices(Vertex* src, Vertex* dst, VertexList* mesh, Comparator& c, 10415cdc9dda330db41d34e452a91b6b0995b5a57626Herb Derby SkArenaAlloc& alloc) { 1042e9709e831954c3427d5cb839e84221a177bfedebethannicholas LOG("found coincident verts at %g, %g; merging %g into %g\n", src->fPoint.fX, src->fPoint.fY, 1043e9709e831954c3427d5cb839e84221a177bfedebethannicholas src->fID, dst->fID); 1044f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco dst->fAlpha = SkTMax(src->fAlpha, dst->fAlpha); 1045bda29c076bf3d6811bde142d57e54e5792727481Stephen White if (src->fPartner) { 1046bda29c076bf3d6811bde142d57e54e5792727481Stephen White src->fPartner->fPartner = dst; 1047bda29c076bf3d6811bde142d57e54e5792727481Stephen White } 1048e9709e831954c3427d5cb839e84221a177bfedebethannicholas for (Edge* edge = src->fFirstEdgeAbove; edge;) { 1049e9709e831954c3427d5cb839e84221a177bfedebethannicholas Edge* next = edge->fNextEdgeAbove; 1050e9709e831954c3427d5cb839e84221a177bfedebethannicholas set_bottom(edge, dst, nullptr, c); 1051e9709e831954c3427d5cb839e84221a177bfedebethannicholas edge = next; 1052e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1053e9709e831954c3427d5cb839e84221a177bfedebethannicholas for (Edge* edge = src->fFirstEdgeBelow; edge;) { 1054e9709e831954c3427d5cb839e84221a177bfedebethannicholas Edge* next = edge->fNextEdgeBelow; 1055e9709e831954c3427d5cb839e84221a177bfedebethannicholas set_top(edge, dst, nullptr, c); 1056e9709e831954c3427d5cb839e84221a177bfedebethannicholas edge = next; 1057e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1058bf6137e08b703abd98b3e4d938e1cccef2350f4eStephen White mesh->remove(src); 1059e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 1060e9709e831954c3427d5cb839e84221a177bfedebethannicholas 1061f57372daf0562a187c24d427366ac6d0cb980c9bsenorblancouint8_t max_edge_alpha(Edge* a, Edge* b) { 106256158ae600a73ac2e74f5a5862de0fab466b52b6Stephen White if (a->fType == Edge::Type::kInner || b->fType == Edge::Type::kInner) { 10632f4686fa25ef7a14961f68be18e63de3567d0a15Stephen White return 255; 10642f4686fa25ef7a14961f68be18e63de3567d0a15Stephen White } else if (a->fType == Edge::Type::kOuter && b->fType == Edge::Type::kOuter) { 10652f4686fa25ef7a14961f68be18e63de3567d0a15Stephen White return 0; 10662f4686fa25ef7a14961f68be18e63de3567d0a15Stephen White } else { 10672f4686fa25ef7a14961f68be18e63de3567d0a15Stephen White return SkTMax(SkTMax(a->fTop->fAlpha, a->fBottom->fAlpha), 10682f4686fa25ef7a14961f68be18e63de3567d0a15Stephen White SkTMax(b->fTop->fAlpha, b->fBottom->fAlpha)); 10692f4686fa25ef7a14961f68be18e63de3567d0a15Stephen White } 1070f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco} 1071f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco 1072e9709e831954c3427d5cb839e84221a177bfedebethannicholasVertex* check_for_intersection(Edge* edge, Edge* other, EdgeList* activeEdges, Comparator& c, 10735cdc9dda330db41d34e452a91b6b0995b5a57626Herb Derby SkArenaAlloc& alloc) { 1074e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (!edge || !other) { 1075e9709e831954c3427d5cb839e84221a177bfedebethannicholas return nullptr; 1076e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 107756158ae600a73ac2e74f5a5862de0fab466b52b6Stephen White SkPoint p; 107856158ae600a73ac2e74f5a5862de0fab466b52b6Stephen White uint8_t alpha; 107956158ae600a73ac2e74f5a5862de0fab466b52b6Stephen White if (edge->intersect(*other, &p, &alpha)) { 1080e9709e831954c3427d5cb839e84221a177bfedebethannicholas Vertex* v; 1081e9709e831954c3427d5cb839e84221a177bfedebethannicholas LOG("found intersection, pt is %g, %g\n", p.fX, p.fY); 1082e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (p == edge->fTop->fPoint || c.sweep_lt(p, edge->fTop->fPoint)) { 1083e9709e831954c3427d5cb839e84221a177bfedebethannicholas split_edge(other, edge->fTop, activeEdges, c, alloc); 1084e9709e831954c3427d5cb839e84221a177bfedebethannicholas v = edge->fTop; 1085e30cf80c8893db8ec61d29322f1992591dad3b6bStephen White } else if (p == edge->fBottom->fPoint || c.sweep_lt(edge->fBottom->fPoint, p)) { 1086e9709e831954c3427d5cb839e84221a177bfedebethannicholas split_edge(other, edge->fBottom, activeEdges, c, alloc); 1087e9709e831954c3427d5cb839e84221a177bfedebethannicholas v = edge->fBottom; 1088e9709e831954c3427d5cb839e84221a177bfedebethannicholas } else if (p == other->fTop->fPoint || c.sweep_lt(p, other->fTop->fPoint)) { 1089e9709e831954c3427d5cb839e84221a177bfedebethannicholas split_edge(edge, other->fTop, activeEdges, c, alloc); 1090e9709e831954c3427d5cb839e84221a177bfedebethannicholas v = other->fTop; 1091e30cf80c8893db8ec61d29322f1992591dad3b6bStephen White } else if (p == other->fBottom->fPoint || c.sweep_lt(other->fBottom->fPoint, p)) { 1092e9709e831954c3427d5cb839e84221a177bfedebethannicholas split_edge(edge, other->fBottom, activeEdges, c, alloc); 1093e9709e831954c3427d5cb839e84221a177bfedebethannicholas v = other->fBottom; 1094e9709e831954c3427d5cb839e84221a177bfedebethannicholas } else { 1095e9709e831954c3427d5cb839e84221a177bfedebethannicholas Vertex* nextV = edge->fTop; 1096e9709e831954c3427d5cb839e84221a177bfedebethannicholas while (c.sweep_lt(p, nextV->fPoint)) { 1097e9709e831954c3427d5cb839e84221a177bfedebethannicholas nextV = nextV->fPrev; 1098e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1099e9709e831954c3427d5cb839e84221a177bfedebethannicholas while (c.sweep_lt(nextV->fPoint, p)) { 1100e9709e831954c3427d5cb839e84221a177bfedebethannicholas nextV = nextV->fNext; 1101e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1102e9709e831954c3427d5cb839e84221a177bfedebethannicholas Vertex* prevV = nextV->fPrev; 1103e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (coincident(prevV->fPoint, p)) { 1104e9709e831954c3427d5cb839e84221a177bfedebethannicholas v = prevV; 1105e9709e831954c3427d5cb839e84221a177bfedebethannicholas } else if (coincident(nextV->fPoint, p)) { 1106e9709e831954c3427d5cb839e84221a177bfedebethannicholas v = nextV; 1107e9709e831954c3427d5cb839e84221a177bfedebethannicholas } else { 11085cdc9dda330db41d34e452a91b6b0995b5a57626Herb Derby v = alloc.make<Vertex>(p, alpha); 1109e9709e831954c3427d5cb839e84221a177bfedebethannicholas LOG("inserting between %g (%g, %g) and %g (%g, %g)\n", 1110e9709e831954c3427d5cb839e84221a177bfedebethannicholas prevV->fID, prevV->fPoint.fX, prevV->fPoint.fY, 1111e9709e831954c3427d5cb839e84221a177bfedebethannicholas nextV->fID, nextV->fPoint.fX, nextV->fPoint.fY); 1112e9709e831954c3427d5cb839e84221a177bfedebethannicholas#if LOGGING_ENABLED 1113e9709e831954c3427d5cb839e84221a177bfedebethannicholas v->fID = (nextV->fID + prevV->fID) * 0.5f; 1114e9709e831954c3427d5cb839e84221a177bfedebethannicholas#endif 1115e9709e831954c3427d5cb839e84221a177bfedebethannicholas v->fPrev = prevV; 1116e9709e831954c3427d5cb839e84221a177bfedebethannicholas v->fNext = nextV; 1117e9709e831954c3427d5cb839e84221a177bfedebethannicholas prevV->fNext = v; 1118e9709e831954c3427d5cb839e84221a177bfedebethannicholas nextV->fPrev = v; 1119e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1120e9709e831954c3427d5cb839e84221a177bfedebethannicholas split_edge(edge, v, activeEdges, c, alloc); 1121e9709e831954c3427d5cb839e84221a177bfedebethannicholas split_edge(other, v, activeEdges, c, alloc); 1122e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 112392eba8a5efc0860d4e95ba7f25052474a0bfca0cStephen White v->fAlpha = SkTMax(v->fAlpha, alpha); 1124e9709e831954c3427d5cb839e84221a177bfedebethannicholas return v; 1125e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1126e9709e831954c3427d5cb839e84221a177bfedebethannicholas return nullptr; 1127e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 1128e9709e831954c3427d5cb839e84221a177bfedebethannicholas 11293a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen Whitevoid sanitize_contours(VertexList* contours, int contourCnt, bool approximate) { 11303a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White for (VertexList* contour = contours; contourCnt > 0; --contourCnt, ++contour) { 11313a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White SkASSERT(contour->fHead); 11323a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White Vertex* prev = contour->fTail; 11335926f2da752d1bff0051fda4137bb967f9e91d5fStephen White if (approximate) { 11343a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White round(&prev->fPoint); 11355926f2da752d1bff0051fda4137bb967f9e91d5fStephen White } 11363a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White for (Vertex* v = contour->fHead; v;) { 1137f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco if (approximate) { 1138f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco round(&v->fPoint); 1139f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco } 11403a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White Vertex* next = v->fNext; 11413a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White if (coincident(prev->fPoint, v->fPoint)) { 1142e9709e831954c3427d5cb839e84221a177bfedebethannicholas LOG("vertex %g,%g coincident; removing\n", v->fPoint.fX, v->fPoint.fY); 11433a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White contour->remove(v); 1144e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 11453a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White prev = v; 11463a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White v = next; 1147e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1148e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1149e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 1150e9709e831954c3427d5cb839e84221a177bfedebethannicholas 11515cdc9dda330db41d34e452a91b6b0995b5a57626Herb Derbyvoid merge_coincident_vertices(VertexList* mesh, Comparator& c, SkArenaAlloc& alloc) { 1152bda29c076bf3d6811bde142d57e54e5792727481Stephen White if (!mesh->fHead) { 1153bda29c076bf3d6811bde142d57e54e5792727481Stephen White return; 1154bda29c076bf3d6811bde142d57e54e5792727481Stephen White } 1155bf6137e08b703abd98b3e4d938e1cccef2350f4eStephen White for (Vertex* v = mesh->fHead->fNext; v != nullptr; v = v->fNext) { 1156e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (c.sweep_lt(v->fPoint, v->fPrev->fPoint)) { 1157e9709e831954c3427d5cb839e84221a177bfedebethannicholas v->fPoint = v->fPrev->fPoint; 1158e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1159e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (coincident(v->fPrev->fPoint, v->fPoint)) { 1160bf6137e08b703abd98b3e4d938e1cccef2350f4eStephen White merge_vertices(v->fPrev, v, mesh, c, alloc); 1161e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1162e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1163e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 1164e9709e831954c3427d5cb839e84221a177bfedebethannicholas 1165e9709e831954c3427d5cb839e84221a177bfedebethannicholas// Stage 2: convert the contours to a mesh of edges connecting the vertices. 1166e9709e831954c3427d5cb839e84221a177bfedebethannicholas 11673a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen Whitevoid build_edges(VertexList* contours, int contourCnt, VertexList* mesh, Comparator& c, 11685cdc9dda330db41d34e452a91b6b0995b5a57626Herb Derby SkArenaAlloc& alloc) { 11693a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White for (VertexList* contour = contours; contourCnt > 0; --contourCnt, ++contour) { 11703a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White Vertex* prev = contour->fTail; 11713a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White for (Vertex* v = contour->fHead; v;) { 11723a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White Vertex* next = v->fNext; 11733a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White connect(prev, v, Edge::Type::kInner, c, alloc); 11743a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White mesh->append(v); 1175e9709e831954c3427d5cb839e84221a177bfedebethannicholas prev = v; 11763a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White v = next; 1177e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1178e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1179e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 1180e9709e831954c3427d5cb839e84221a177bfedebethannicholas 1181bda29c076bf3d6811bde142d57e54e5792727481Stephen Whitevoid connect_partners(VertexList* outerVertices, Comparator& c, SkArenaAlloc& alloc) { 1182bda29c076bf3d6811bde142d57e54e5792727481Stephen White for (Vertex* outer = outerVertices->fHead; outer; outer = outer->fNext) { 1183bda29c076bf3d6811bde142d57e54e5792727481Stephen White if (Vertex* inner = outer->fPartner) { 1184bda29c076bf3d6811bde142d57e54e5792727481Stephen White // Connector edges get zero winding, since they're only structural (i.e., to ensure 1185bda29c076bf3d6811bde142d57e54e5792727481Stephen White // no 0-0-0 alpha triangles are produced), and shouldn't affect the poly winding number. 1186bda29c076bf3d6811bde142d57e54e5792727481Stephen White connect(outer, inner, Edge::Type::kConnector, c, alloc, 0); 1187bda29c076bf3d6811bde142d57e54e5792727481Stephen White inner->fPartner = outer->fPartner = nullptr; 1188bda29c076bf3d6811bde142d57e54e5792727481Stephen White } 1189bda29c076bf3d6811bde142d57e54e5792727481Stephen White } 1190bda29c076bf3d6811bde142d57e54e5792727481Stephen White} 1191bda29c076bf3d6811bde142d57e54e5792727481Stephen White 1192bda29c076bf3d6811bde142d57e54e5792727481Stephen Whitetemplate <CompareFunc sweep_lt> 1193bda29c076bf3d6811bde142d57e54e5792727481Stephen Whitevoid sorted_merge(VertexList* front, VertexList* back, VertexList* result) { 1194bda29c076bf3d6811bde142d57e54e5792727481Stephen White Vertex* a = front->fHead; 1195bda29c076bf3d6811bde142d57e54e5792727481Stephen White Vertex* b = back->fHead; 1196bda29c076bf3d6811bde142d57e54e5792727481Stephen White while (a && b) { 1197bda29c076bf3d6811bde142d57e54e5792727481Stephen White if (sweep_lt(a->fPoint, b->fPoint)) { 1198bda29c076bf3d6811bde142d57e54e5792727481Stephen White front->remove(a); 1199bda29c076bf3d6811bde142d57e54e5792727481Stephen White result->append(a); 1200bda29c076bf3d6811bde142d57e54e5792727481Stephen White a = front->fHead; 1201bda29c076bf3d6811bde142d57e54e5792727481Stephen White } else { 1202bda29c076bf3d6811bde142d57e54e5792727481Stephen White back->remove(b); 1203bda29c076bf3d6811bde142d57e54e5792727481Stephen White result->append(b); 1204bda29c076bf3d6811bde142d57e54e5792727481Stephen White b = back->fHead; 1205bda29c076bf3d6811bde142d57e54e5792727481Stephen White } 1206bda29c076bf3d6811bde142d57e54e5792727481Stephen White } 1207bda29c076bf3d6811bde142d57e54e5792727481Stephen White result->append(*front); 1208bda29c076bf3d6811bde142d57e54e5792727481Stephen White result->append(*back); 1209bda29c076bf3d6811bde142d57e54e5792727481Stephen White} 1210bda29c076bf3d6811bde142d57e54e5792727481Stephen White 1211bda29c076bf3d6811bde142d57e54e5792727481Stephen Whitevoid sorted_merge(VertexList* front, VertexList* back, VertexList* result, Comparator& c) { 1212bda29c076bf3d6811bde142d57e54e5792727481Stephen White if (c.fDirection == Comparator::Direction::kHorizontal) { 1213bda29c076bf3d6811bde142d57e54e5792727481Stephen White sorted_merge<sweep_lt_horiz>(front, back, result); 1214bda29c076bf3d6811bde142d57e54e5792727481Stephen White } else { 1215bda29c076bf3d6811bde142d57e54e5792727481Stephen White sorted_merge<sweep_lt_vert>(front, back, result); 1216bda29c076bf3d6811bde142d57e54e5792727481Stephen White } 1217bda29c076bf3d6811bde142d57e54e5792727481Stephen White} 1218bda29c076bf3d6811bde142d57e54e5792727481Stephen White 1219e9709e831954c3427d5cb839e84221a177bfedebethannicholas// Stage 3: sort the vertices by increasing sweep direction. 1220e9709e831954c3427d5cb839e84221a177bfedebethannicholas 122116a40cb65adeb4d94b84479f9946c360ed73e1bbStephen Whitetemplate <CompareFunc sweep_lt> 122216a40cb65adeb4d94b84479f9946c360ed73e1bbStephen Whitevoid merge_sort(VertexList* vertices) { 122316a40cb65adeb4d94b84479f9946c360ed73e1bbStephen White Vertex* slow = vertices->fHead; 122416a40cb65adeb4d94b84479f9946c360ed73e1bbStephen White if (!slow) { 1225e9709e831954c3427d5cb839e84221a177bfedebethannicholas return; 1226e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 122716a40cb65adeb4d94b84479f9946c360ed73e1bbStephen White Vertex* fast = slow->fNext; 122816a40cb65adeb4d94b84479f9946c360ed73e1bbStephen White if (!fast) { 122916a40cb65adeb4d94b84479f9946c360ed73e1bbStephen White return; 123016a40cb65adeb4d94b84479f9946c360ed73e1bbStephen White } 123116a40cb65adeb4d94b84479f9946c360ed73e1bbStephen White do { 123216a40cb65adeb4d94b84479f9946c360ed73e1bbStephen White fast = fast->fNext; 123316a40cb65adeb4d94b84479f9946c360ed73e1bbStephen White if (fast) { 123416a40cb65adeb4d94b84479f9946c360ed73e1bbStephen White fast = fast->fNext; 123516a40cb65adeb4d94b84479f9946c360ed73e1bbStephen White slow = slow->fNext; 123616a40cb65adeb4d94b84479f9946c360ed73e1bbStephen White } 123716a40cb65adeb4d94b84479f9946c360ed73e1bbStephen White } while (fast); 123816a40cb65adeb4d94b84479f9946c360ed73e1bbStephen White VertexList front(vertices->fHead, slow); 123916a40cb65adeb4d94b84479f9946c360ed73e1bbStephen White VertexList back(slow->fNext, vertices->fTail); 124016a40cb65adeb4d94b84479f9946c360ed73e1bbStephen White front.fTail->fNext = back.fHead->fPrev = nullptr; 1241e9709e831954c3427d5cb839e84221a177bfedebethannicholas 124216a40cb65adeb4d94b84479f9946c360ed73e1bbStephen White merge_sort<sweep_lt>(&front); 124316a40cb65adeb4d94b84479f9946c360ed73e1bbStephen White merge_sort<sweep_lt>(&back); 1244e9709e831954c3427d5cb839e84221a177bfedebethannicholas 124516a40cb65adeb4d94b84479f9946c360ed73e1bbStephen White vertices->fHead = vertices->fTail = nullptr; 1246bda29c076bf3d6811bde142d57e54e5792727481Stephen White sorted_merge<sweep_lt>(&front, &back, vertices); 1247e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 1248e9709e831954c3427d5cb839e84221a177bfedebethannicholas 1249e9709e831954c3427d5cb839e84221a177bfedebethannicholas// Stage 4: Simplify the mesh by inserting new vertices at intersecting edges. 1250e9709e831954c3427d5cb839e84221a177bfedebethannicholas 12515cdc9dda330db41d34e452a91b6b0995b5a57626Herb Derbyvoid simplify(const VertexList& vertices, Comparator& c, SkArenaAlloc& alloc) { 1252e9709e831954c3427d5cb839e84221a177bfedebethannicholas LOG("simplifying complex polygons\n"); 1253e9709e831954c3427d5cb839e84221a177bfedebethannicholas EdgeList activeEdges; 1254bf6137e08b703abd98b3e4d938e1cccef2350f4eStephen White for (Vertex* v = vertices.fHead; v != nullptr; v = v->fNext) { 1255e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (!v->fFirstEdgeAbove && !v->fFirstEdgeBelow) { 1256e9709e831954c3427d5cb839e84221a177bfedebethannicholas continue; 1257e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1258e9709e831954c3427d5cb839e84221a177bfedebethannicholas#if LOGGING_ENABLED 1259f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco LOG("\nvertex %g: (%g,%g), alpha %d\n", v->fID, v->fPoint.fX, v->fPoint.fY, v->fAlpha); 1260e9709e831954c3427d5cb839e84221a177bfedebethannicholas#endif 12618a0bfc5201f14c994fe8062ecf1ca34a172de9d3Stephen White Edge* leftEnclosingEdge; 12628a0bfc5201f14c994fe8062ecf1ca34a172de9d3Stephen White Edge* rightEnclosingEdge; 1263e9709e831954c3427d5cb839e84221a177bfedebethannicholas bool restartChecks; 1264e9709e831954c3427d5cb839e84221a177bfedebethannicholas do { 1265e9709e831954c3427d5cb839e84221a177bfedebethannicholas restartChecks = false; 1266e9709e831954c3427d5cb839e84221a177bfedebethannicholas find_enclosing_edges(v, &activeEdges, &leftEnclosingEdge, &rightEnclosingEdge); 1267e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (v->fFirstEdgeBelow) { 1268bf6137e08b703abd98b3e4d938e1cccef2350f4eStephen White for (Edge* edge = v->fFirstEdgeBelow; edge; edge = edge->fNextEdgeBelow) { 1269e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (check_for_intersection(edge, leftEnclosingEdge, &activeEdges, c, alloc)) { 1270e9709e831954c3427d5cb839e84221a177bfedebethannicholas restartChecks = true; 1271e9709e831954c3427d5cb839e84221a177bfedebethannicholas break; 1272e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1273e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (check_for_intersection(edge, rightEnclosingEdge, &activeEdges, c, alloc)) { 1274e9709e831954c3427d5cb839e84221a177bfedebethannicholas restartChecks = true; 1275e9709e831954c3427d5cb839e84221a177bfedebethannicholas break; 1276e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1277e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1278e9709e831954c3427d5cb839e84221a177bfedebethannicholas } else { 1279e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (Vertex* pv = check_for_intersection(leftEnclosingEdge, rightEnclosingEdge, 1280e9709e831954c3427d5cb839e84221a177bfedebethannicholas &activeEdges, c, alloc)) { 1281e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (c.sweep_lt(pv->fPoint, v->fPoint)) { 1282e9709e831954c3427d5cb839e84221a177bfedebethannicholas v = pv; 1283e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1284e9709e831954c3427d5cb839e84221a177bfedebethannicholas restartChecks = true; 1285e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1286e9709e831954c3427d5cb839e84221a177bfedebethannicholas 1287e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1288e9709e831954c3427d5cb839e84221a177bfedebethannicholas } while (restartChecks); 1289f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco if (v->fAlpha == 0) { 129048ded38da99c1171ba1bb469f6500f8214e9105cStephen White if ((leftEnclosingEdge && leftEnclosingEdge->fWinding < 0) && 129148ded38da99c1171ba1bb469f6500f8214e9105cStephen White (rightEnclosingEdge && rightEnclosingEdge->fWinding > 0)) { 1292f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco v->fAlpha = max_edge_alpha(leftEnclosingEdge, rightEnclosingEdge); 1293f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco } 1294f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco } 1295e9709e831954c3427d5cb839e84221a177bfedebethannicholas for (Edge* e = v->fFirstEdgeAbove; e; e = e->fNextEdgeAbove) { 1296e9709e831954c3427d5cb839e84221a177bfedebethannicholas remove_edge(e, &activeEdges); 1297e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1298e9709e831954c3427d5cb839e84221a177bfedebethannicholas Edge* leftEdge = leftEnclosingEdge; 1299e9709e831954c3427d5cb839e84221a177bfedebethannicholas for (Edge* e = v->fFirstEdgeBelow; e; e = e->fNextEdgeBelow) { 1300e9709e831954c3427d5cb839e84221a177bfedebethannicholas insert_edge(e, leftEdge, &activeEdges); 1301e9709e831954c3427d5cb839e84221a177bfedebethannicholas leftEdge = e; 1302e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1303e9709e831954c3427d5cb839e84221a177bfedebethannicholas v->fProcessed = true; 1304e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1305e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 1306e9709e831954c3427d5cb839e84221a177bfedebethannicholas 1307bda29c076bf3d6811bde142d57e54e5792727481Stephen White// This is a stripped-down version of simplify() (the Bentley-Ottmann algorithm) that 1308bda29c076bf3d6811bde142d57e54e5792727481Stephen White// early-returns true on the first found intersection, false if none. 1309bda29c076bf3d6811bde142d57e54e5792727481Stephen Whitebool is_complex(const VertexList& vertices) { 1310bda29c076bf3d6811bde142d57e54e5792727481Stephen White LOG("testing polygon complexity\n"); 1311bda29c076bf3d6811bde142d57e54e5792727481Stephen White EdgeList activeEdges; 1312bda29c076bf3d6811bde142d57e54e5792727481Stephen White for (Vertex* v = vertices.fHead; v != nullptr; v = v->fNext) { 1313bda29c076bf3d6811bde142d57e54e5792727481Stephen White if (!v->fFirstEdgeAbove && !v->fFirstEdgeBelow) { 1314bda29c076bf3d6811bde142d57e54e5792727481Stephen White continue; 1315bda29c076bf3d6811bde142d57e54e5792727481Stephen White } 1316bda29c076bf3d6811bde142d57e54e5792727481Stephen White Edge* leftEnclosingEdge; 1317bda29c076bf3d6811bde142d57e54e5792727481Stephen White Edge* rightEnclosingEdge; 1318bda29c076bf3d6811bde142d57e54e5792727481Stephen White find_enclosing_edges(v, &activeEdges, &leftEnclosingEdge, &rightEnclosingEdge); 1319bda29c076bf3d6811bde142d57e54e5792727481Stephen White SkPoint dummy; 1320bda29c076bf3d6811bde142d57e54e5792727481Stephen White if (v->fFirstEdgeBelow) { 1321bda29c076bf3d6811bde142d57e54e5792727481Stephen White for (Edge* edge = v->fFirstEdgeBelow; edge; edge = edge->fNextEdgeBelow) { 1322bda29c076bf3d6811bde142d57e54e5792727481Stephen White if (edge && leftEnclosingEdge && edge->intersect(*leftEnclosingEdge, &dummy)) { 1323bda29c076bf3d6811bde142d57e54e5792727481Stephen White activeEdges.removeAll(); 1324bda29c076bf3d6811bde142d57e54e5792727481Stephen White return true; 1325bda29c076bf3d6811bde142d57e54e5792727481Stephen White } 1326bda29c076bf3d6811bde142d57e54e5792727481Stephen White if (edge && rightEnclosingEdge && edge->intersect(*rightEnclosingEdge, &dummy)) { 1327bda29c076bf3d6811bde142d57e54e5792727481Stephen White activeEdges.removeAll(); 1328bda29c076bf3d6811bde142d57e54e5792727481Stephen White return true; 1329bda29c076bf3d6811bde142d57e54e5792727481Stephen White } 1330bda29c076bf3d6811bde142d57e54e5792727481Stephen White } 1331bda29c076bf3d6811bde142d57e54e5792727481Stephen White } else if (leftEnclosingEdge && rightEnclosingEdge && 1332bda29c076bf3d6811bde142d57e54e5792727481Stephen White leftEnclosingEdge->intersect(*rightEnclosingEdge, &dummy)) { 1333bda29c076bf3d6811bde142d57e54e5792727481Stephen White activeEdges.removeAll(); 1334bda29c076bf3d6811bde142d57e54e5792727481Stephen White return true; 1335bda29c076bf3d6811bde142d57e54e5792727481Stephen White } 1336bda29c076bf3d6811bde142d57e54e5792727481Stephen White for (Edge* e = v->fFirstEdgeAbove; e; e = e->fNextEdgeAbove) { 1337bda29c076bf3d6811bde142d57e54e5792727481Stephen White remove_edge(e, &activeEdges); 1338bda29c076bf3d6811bde142d57e54e5792727481Stephen White } 1339bda29c076bf3d6811bde142d57e54e5792727481Stephen White Edge* leftEdge = leftEnclosingEdge; 1340bda29c076bf3d6811bde142d57e54e5792727481Stephen White for (Edge* e = v->fFirstEdgeBelow; e; e = e->fNextEdgeBelow) { 1341bda29c076bf3d6811bde142d57e54e5792727481Stephen White insert_edge(e, leftEdge, &activeEdges); 1342bda29c076bf3d6811bde142d57e54e5792727481Stephen White leftEdge = e; 1343bda29c076bf3d6811bde142d57e54e5792727481Stephen White } 1344bda29c076bf3d6811bde142d57e54e5792727481Stephen White } 1345bda29c076bf3d6811bde142d57e54e5792727481Stephen White activeEdges.removeAll(); 1346bda29c076bf3d6811bde142d57e54e5792727481Stephen White return false; 1347bda29c076bf3d6811bde142d57e54e5792727481Stephen White} 1348bda29c076bf3d6811bde142d57e54e5792727481Stephen White 1349e9709e831954c3427d5cb839e84221a177bfedebethannicholas// Stage 5: Tessellate the simplified mesh into monotone polygons. 1350e9709e831954c3427d5cb839e84221a177bfedebethannicholas 13515cdc9dda330db41d34e452a91b6b0995b5a57626Herb DerbyPoly* tessellate(const VertexList& vertices, SkArenaAlloc& alloc) { 1352e9709e831954c3427d5cb839e84221a177bfedebethannicholas LOG("tessellating simple polygons\n"); 1353e9709e831954c3427d5cb839e84221a177bfedebethannicholas EdgeList activeEdges; 1354e9709e831954c3427d5cb839e84221a177bfedebethannicholas Poly* polys = nullptr; 1355bf6137e08b703abd98b3e4d938e1cccef2350f4eStephen White for (Vertex* v = vertices.fHead; v != nullptr; v = v->fNext) { 1356e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (!v->fFirstEdgeAbove && !v->fFirstEdgeBelow) { 1357e9709e831954c3427d5cb839e84221a177bfedebethannicholas continue; 1358e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1359e9709e831954c3427d5cb839e84221a177bfedebethannicholas#if LOGGING_ENABLED 1360f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco LOG("\nvertex %g: (%g,%g), alpha %d\n", v->fID, v->fPoint.fX, v->fPoint.fY, v->fAlpha); 1361e9709e831954c3427d5cb839e84221a177bfedebethannicholas#endif 13628a0bfc5201f14c994fe8062ecf1ca34a172de9d3Stephen White Edge* leftEnclosingEdge; 13638a0bfc5201f14c994fe8062ecf1ca34a172de9d3Stephen White Edge* rightEnclosingEdge; 1364e9709e831954c3427d5cb839e84221a177bfedebethannicholas find_enclosing_edges(v, &activeEdges, &leftEnclosingEdge, &rightEnclosingEdge); 13658a0bfc5201f14c994fe8062ecf1ca34a172de9d3Stephen White Poly* leftPoly; 13668a0bfc5201f14c994fe8062ecf1ca34a172de9d3Stephen White Poly* rightPoly; 1367e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (v->fFirstEdgeAbove) { 1368e9709e831954c3427d5cb839e84221a177bfedebethannicholas leftPoly = v->fFirstEdgeAbove->fLeftPoly; 1369e9709e831954c3427d5cb839e84221a177bfedebethannicholas rightPoly = v->fLastEdgeAbove->fRightPoly; 1370e9709e831954c3427d5cb839e84221a177bfedebethannicholas } else { 1371e9709e831954c3427d5cb839e84221a177bfedebethannicholas leftPoly = leftEnclosingEdge ? leftEnclosingEdge->fRightPoly : nullptr; 1372e9709e831954c3427d5cb839e84221a177bfedebethannicholas rightPoly = rightEnclosingEdge ? rightEnclosingEdge->fLeftPoly : nullptr; 1373e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1374e9709e831954c3427d5cb839e84221a177bfedebethannicholas#if LOGGING_ENABLED 1375e9709e831954c3427d5cb839e84221a177bfedebethannicholas LOG("edges above:\n"); 1376e9709e831954c3427d5cb839e84221a177bfedebethannicholas for (Edge* e = v->fFirstEdgeAbove; e; e = e->fNextEdgeAbove) { 1377e9709e831954c3427d5cb839e84221a177bfedebethannicholas LOG("%g -> %g, lpoly %d, rpoly %d\n", e->fTop->fID, e->fBottom->fID, 1378e9709e831954c3427d5cb839e84221a177bfedebethannicholas e->fLeftPoly ? e->fLeftPoly->fID : -1, e->fRightPoly ? e->fRightPoly->fID : -1); 1379e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1380e9709e831954c3427d5cb839e84221a177bfedebethannicholas LOG("edges below:\n"); 1381e9709e831954c3427d5cb839e84221a177bfedebethannicholas for (Edge* e = v->fFirstEdgeBelow; e; e = e->fNextEdgeBelow) { 1382e9709e831954c3427d5cb839e84221a177bfedebethannicholas LOG("%g -> %g, lpoly %d, rpoly %d\n", e->fTop->fID, e->fBottom->fID, 1383e9709e831954c3427d5cb839e84221a177bfedebethannicholas e->fLeftPoly ? e->fLeftPoly->fID : -1, e->fRightPoly ? e->fRightPoly->fID : -1); 1384e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1385e9709e831954c3427d5cb839e84221a177bfedebethannicholas#endif 1386e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (v->fFirstEdgeAbove) { 1387e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (leftPoly) { 1388531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco leftPoly = leftPoly->addEdge(v->fFirstEdgeAbove, Poly::kRight_Side, alloc); 1389e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1390e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (rightPoly) { 1391531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco rightPoly = rightPoly->addEdge(v->fLastEdgeAbove, Poly::kLeft_Side, alloc); 1392e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1393e9709e831954c3427d5cb839e84221a177bfedebethannicholas for (Edge* e = v->fFirstEdgeAbove; e != v->fLastEdgeAbove; e = e->fNextEdgeAbove) { 1394e9709e831954c3427d5cb839e84221a177bfedebethannicholas Edge* rightEdge = e->fNextEdgeAbove; 13958a0bfc5201f14c994fe8062ecf1ca34a172de9d3Stephen White SkASSERT(rightEdge->isRightOf(e->fTop)); 13968a0bfc5201f14c994fe8062ecf1ca34a172de9d3Stephen White remove_edge(e, &activeEdges); 13978a0bfc5201f14c994fe8062ecf1ca34a172de9d3Stephen White if (e->fRightPoly) { 13988a0bfc5201f14c994fe8062ecf1ca34a172de9d3Stephen White e->fRightPoly->addEdge(e, Poly::kLeft_Side, alloc); 1399e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 14008a0bfc5201f14c994fe8062ecf1ca34a172de9d3Stephen White if (rightEdge->fLeftPoly && rightEdge->fLeftPoly != e->fRightPoly) { 1401531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco rightEdge->fLeftPoly->addEdge(e, Poly::kRight_Side, alloc); 1402e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1403e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1404e9709e831954c3427d5cb839e84221a177bfedebethannicholas remove_edge(v->fLastEdgeAbove, &activeEdges); 1405e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (!v->fFirstEdgeBelow) { 1406e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (leftPoly && rightPoly && leftPoly != rightPoly) { 1407e9709e831954c3427d5cb839e84221a177bfedebethannicholas SkASSERT(leftPoly->fPartner == nullptr && rightPoly->fPartner == nullptr); 1408e9709e831954c3427d5cb839e84221a177bfedebethannicholas rightPoly->fPartner = leftPoly; 1409e9709e831954c3427d5cb839e84221a177bfedebethannicholas leftPoly->fPartner = rightPoly; 1410e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1411e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1412e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1413e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (v->fFirstEdgeBelow) { 1414e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (!v->fFirstEdgeAbove) { 141593e3fff79eaaa86bc2fb740a42111a074ccc73absenorblanco if (leftPoly && rightPoly) { 1416531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco if (leftPoly == rightPoly) { 1417531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco if (leftPoly->fTail && leftPoly->fTail->fSide == Poly::kLeft_Side) { 1418531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco leftPoly = new_poly(&polys, leftPoly->lastVertex(), 1419531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco leftPoly->fWinding, alloc); 1420531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco leftEnclosingEdge->fRightPoly = leftPoly; 1421531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco } else { 1422531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco rightPoly = new_poly(&polys, rightPoly->lastVertex(), 1423531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco rightPoly->fWinding, alloc); 1424531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco rightEnclosingEdge->fLeftPoly = rightPoly; 1425531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco } 1426e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 14275cdc9dda330db41d34e452a91b6b0995b5a57626Herb Derby Edge* join = alloc.make<Edge>(leftPoly->lastVertex(), v, 1, Edge::Type::kInner); 1428531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco leftPoly = leftPoly->addEdge(join, Poly::kRight_Side, alloc); 1429531237ef3aaf0d3c86e0853fde3b4c8f517bc662senorblanco rightPoly = rightPoly->addEdge(join, Poly::kLeft_Side, alloc); 1430e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1431e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1432e9709e831954c3427d5cb839e84221a177bfedebethannicholas Edge* leftEdge = v->fFirstEdgeBelow; 1433e9709e831954c3427d5cb839e84221a177bfedebethannicholas leftEdge->fLeftPoly = leftPoly; 1434e9709e831954c3427d5cb839e84221a177bfedebethannicholas insert_edge(leftEdge, leftEnclosingEdge, &activeEdges); 1435e9709e831954c3427d5cb839e84221a177bfedebethannicholas for (Edge* rightEdge = leftEdge->fNextEdgeBelow; rightEdge; 1436e9709e831954c3427d5cb839e84221a177bfedebethannicholas rightEdge = rightEdge->fNextEdgeBelow) { 1437e9709e831954c3427d5cb839e84221a177bfedebethannicholas insert_edge(rightEdge, leftEdge, &activeEdges); 1438e9709e831954c3427d5cb839e84221a177bfedebethannicholas int winding = leftEdge->fLeftPoly ? leftEdge->fLeftPoly->fWinding : 0; 1439e9709e831954c3427d5cb839e84221a177bfedebethannicholas winding += leftEdge->fWinding; 1440e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (winding != 0) { 1441e9709e831954c3427d5cb839e84221a177bfedebethannicholas Poly* poly = new_poly(&polys, v, winding, alloc); 1442e9709e831954c3427d5cb839e84221a177bfedebethannicholas leftEdge->fRightPoly = rightEdge->fLeftPoly = poly; 1443e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1444e9709e831954c3427d5cb839e84221a177bfedebethannicholas leftEdge = rightEdge; 1445e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1446e9709e831954c3427d5cb839e84221a177bfedebethannicholas v->fLastEdgeBelow->fRightPoly = rightPoly; 1447e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1448e9709e831954c3427d5cb839e84221a177bfedebethannicholas#if LOGGING_ENABLED 1449e9709e831954c3427d5cb839e84221a177bfedebethannicholas LOG("\nactive edges:\n"); 1450e9709e831954c3427d5cb839e84221a177bfedebethannicholas for (Edge* e = activeEdges.fHead; e != nullptr; e = e->fRight) { 1451e9709e831954c3427d5cb839e84221a177bfedebethannicholas LOG("%g -> %g, lpoly %d, rpoly %d\n", e->fTop->fID, e->fBottom->fID, 1452e9709e831954c3427d5cb839e84221a177bfedebethannicholas e->fLeftPoly ? e->fLeftPoly->fID : -1, e->fRightPoly ? e->fRightPoly->fID : -1); 1453e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1454e9709e831954c3427d5cb839e84221a177bfedebethannicholas#endif 1455e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1456e9709e831954c3427d5cb839e84221a177bfedebethannicholas return polys; 1457e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 1458e9709e831954c3427d5cb839e84221a177bfedebethannicholas 1459bf6137e08b703abd98b3e4d938e1cccef2350f4eStephen Whitevoid remove_non_boundary_edges(const VertexList& mesh, SkPath::FillType fillType, 14605cdc9dda330db41d34e452a91b6b0995b5a57626Herb Derby SkArenaAlloc& alloc) { 1461497890630b80a381a2ac4cbb9114b0320560bf8cStephen White LOG("removing non-boundary edges\n"); 1462497890630b80a381a2ac4cbb9114b0320560bf8cStephen White EdgeList activeEdges; 1463bf6137e08b703abd98b3e4d938e1cccef2350f4eStephen White for (Vertex* v = mesh.fHead; v != nullptr; v = v->fNext) { 1464497890630b80a381a2ac4cbb9114b0320560bf8cStephen White if (!v->fFirstEdgeAbove && !v->fFirstEdgeBelow) { 1465497890630b80a381a2ac4cbb9114b0320560bf8cStephen White continue; 1466497890630b80a381a2ac4cbb9114b0320560bf8cStephen White } 1467497890630b80a381a2ac4cbb9114b0320560bf8cStephen White Edge* leftEnclosingEdge; 1468497890630b80a381a2ac4cbb9114b0320560bf8cStephen White Edge* rightEnclosingEdge; 1469497890630b80a381a2ac4cbb9114b0320560bf8cStephen White find_enclosing_edges(v, &activeEdges, &leftEnclosingEdge, &rightEnclosingEdge); 1470497890630b80a381a2ac4cbb9114b0320560bf8cStephen White bool prevFilled = leftEnclosingEdge && 1471497890630b80a381a2ac4cbb9114b0320560bf8cStephen White apply_fill_type(fillType, leftEnclosingEdge->fWinding); 1472497890630b80a381a2ac4cbb9114b0320560bf8cStephen White for (Edge* e = v->fFirstEdgeAbove; e;) { 1473497890630b80a381a2ac4cbb9114b0320560bf8cStephen White Edge* next = e->fNextEdgeAbove; 1474497890630b80a381a2ac4cbb9114b0320560bf8cStephen White remove_edge(e, &activeEdges); 1475497890630b80a381a2ac4cbb9114b0320560bf8cStephen White bool filled = apply_fill_type(fillType, e->fWinding); 1476497890630b80a381a2ac4cbb9114b0320560bf8cStephen White if (filled == prevFilled) { 1477e7a364d435843a868dcac2c61d78c34e5d3e326cStephen White disconnect(e); 1478f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco } 1479497890630b80a381a2ac4cbb9114b0320560bf8cStephen White prevFilled = filled; 1480f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco e = next; 1481f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco } 1482497890630b80a381a2ac4cbb9114b0320560bf8cStephen White Edge* prev = leftEnclosingEdge; 1483497890630b80a381a2ac4cbb9114b0320560bf8cStephen White for (Edge* e = v->fFirstEdgeBelow; e; e = e->fNextEdgeBelow) { 1484497890630b80a381a2ac4cbb9114b0320560bf8cStephen White if (prev) { 1485497890630b80a381a2ac4cbb9114b0320560bf8cStephen White e->fWinding += prev->fWinding; 1486497890630b80a381a2ac4cbb9114b0320560bf8cStephen White } 1487497890630b80a381a2ac4cbb9114b0320560bf8cStephen White insert_edge(e, prev, &activeEdges); 1488497890630b80a381a2ac4cbb9114b0320560bf8cStephen White prev = e; 1489497890630b80a381a2ac4cbb9114b0320560bf8cStephen White } 1490682580fb204b72925a48d1d6fe8c9c30fa53bb67senorblanco } 1491f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco} 1492f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco 14936641212397be28b6263e91340b7ed76bd29b3035Stephen White// Note: this is the normal to the edge, but not necessarily unit length. 1494f57372daf0562a187c24d427366ac6d0cb980c9bsenorblancovoid get_edge_normal(const Edge* e, SkVector* normal) { 14956641212397be28b6263e91340b7ed76bd29b3035Stephen White normal->set(SkDoubleToScalar(e->fLine.fA) * e->fWinding, 14966641212397be28b6263e91340b7ed76bd29b3035Stephen White SkDoubleToScalar(e->fLine.fB) * e->fWinding); 1497f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco} 1498f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco 1499f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco// Stage 5c: detect and remove "pointy" vertices whose edge normals point in opposite directions 1500f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco// and whose adjacent vertices are less than a quarter pixel from an edge. These are guaranteed to 1501f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco// invert on stroking. 1502f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco 15035cdc9dda330db41d34e452a91b6b0995b5a57626Herb Derbyvoid simplify_boundary(EdgeList* boundary, Comparator& c, SkArenaAlloc& alloc) { 1504f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco Edge* prevEdge = boundary->fTail; 1505f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco SkVector prevNormal; 1506f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco get_edge_normal(prevEdge, &prevNormal); 1507f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco for (Edge* e = boundary->fHead; e != nullptr;) { 1508f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco Vertex* prev = prevEdge->fWinding == 1 ? prevEdge->fTop : prevEdge->fBottom; 1509f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco Vertex* next = e->fWinding == 1 ? e->fBottom : e->fTop; 1510f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco double dist = e->dist(prev->fPoint); 1511f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco SkVector normal; 1512f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco get_edge_normal(e, &normal); 15136641212397be28b6263e91340b7ed76bd29b3035Stephen White double denom = 0.0625f * e->fLine.magSq(); 1514f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco if (prevNormal.dot(normal) < 0.0 && (dist * dist) <= denom) { 1515bf6137e08b703abd98b3e4d938e1cccef2350f4eStephen White Edge* join = new_edge(prev, next, Edge::Type::kInner, c, alloc); 1516f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco insert_edge(join, e, boundary); 1517f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco remove_edge(prevEdge, boundary); 1518f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco remove_edge(e, boundary); 1519f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco if (join->fLeft && join->fRight) { 1520f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco prevEdge = join->fLeft; 1521f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco e = join; 1522f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco } else { 1523f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco prevEdge = boundary->fTail; 1524f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco e = boundary->fHead; // join->fLeft ? join->fLeft : join; 1525f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco } 1526f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco get_edge_normal(prevEdge, &prevNormal); 1527f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco } else { 1528f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco prevEdge = e; 1529f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco prevNormal = normal; 1530f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco e = e->fRight; 1531f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco } 1532f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco } 1533f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco} 1534f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco 1535dab4811661720e8f14675a09ca1a3b8f82e45680Ben Wagnervoid fix_inversions(Vertex* prev, Vertex* next, Edge* prevBisector, Edge* nextBisector, 153692eba8a5efc0860d4e95ba7f25052474a0bfca0cStephen White Edge* prevEdge, Comparator& c) { 153792eba8a5efc0860d4e95ba7f25052474a0bfca0cStephen White if (!prev || !next) { 153892eba8a5efc0860d4e95ba7f25052474a0bfca0cStephen White return; 153992eba8a5efc0860d4e95ba7f25052474a0bfca0cStephen White } 154092eba8a5efc0860d4e95ba7f25052474a0bfca0cStephen White int winding = c.sweep_lt(prev->fPoint, next->fPoint) ? 1 : -1; 154192eba8a5efc0860d4e95ba7f25052474a0bfca0cStephen White SkPoint p; 154292eba8a5efc0860d4e95ba7f25052474a0bfca0cStephen White uint8_t alpha; 1543dab4811661720e8f14675a09ca1a3b8f82e45680Ben Wagner if (winding != prevEdge->fWinding && prevBisector->intersect(*nextBisector, &p, &alpha)) { 154492eba8a5efc0860d4e95ba7f25052474a0bfca0cStephen White prev->fPoint = next->fPoint = p; 154592eba8a5efc0860d4e95ba7f25052474a0bfca0cStephen White prev->fAlpha = next->fAlpha = alpha; 154692eba8a5efc0860d4e95ba7f25052474a0bfca0cStephen White } 154792eba8a5efc0860d4e95ba7f25052474a0bfca0cStephen White} 154892eba8a5efc0860d4e95ba7f25052474a0bfca0cStephen White 1549f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco// Stage 5d: Displace edges by half a pixel inward and outward along their normals. Intersect to 1550f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco// find new vertices, and set zero alpha on the exterior and one alpha on the interior. Build a 1551f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco// new antialiased mesh from those vertices. 1552f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco 1553bda29c076bf3d6811bde142d57e54e5792727481Stephen Whitevoid stroke_boundary(EdgeList* boundary, VertexList* innerMesh, VertexList* outerMesh, 1554bda29c076bf3d6811bde142d57e54e5792727481Stephen White Comparator& c, SkArenaAlloc& alloc) { 15558a0bfc5201f14c994fe8062ecf1ca34a172de9d3Stephen White // A boundary with fewer than 3 edges is degenerate. 15568a0bfc5201f14c994fe8062ecf1ca34a172de9d3Stephen White if (!boundary->fHead || !boundary->fHead->fRight || !boundary->fHead->fRight->fRight) { 15578a0bfc5201f14c994fe8062ecf1ca34a172de9d3Stephen White return; 15588a0bfc5201f14c994fe8062ecf1ca34a172de9d3Stephen White } 1559f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco Edge* prevEdge = boundary->fTail; 1560f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco float radius = 0.5f; 156149df8d17c56ee08ecf860289d501913d356f67dcsenorblanco double offset = radius * sqrt(prevEdge->fLine.magSq()) * prevEdge->fWinding; 15626641212397be28b6263e91340b7ed76bd29b3035Stephen White Line prevInner(prevEdge->fLine); 1563f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco prevInner.fC -= offset; 15646641212397be28b6263e91340b7ed76bd29b3035Stephen White Line prevOuter(prevEdge->fLine); 1565f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco prevOuter.fC += offset; 1566f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco VertexList innerVertices; 1567f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco VertexList outerVertices; 1568dab4811661720e8f14675a09ca1a3b8f82e45680Ben Wagner Edge* prevBisector = nullptr; 1569f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco for (Edge* e = boundary->fHead; e != nullptr; e = e->fRight) { 157049df8d17c56ee08ecf860289d501913d356f67dcsenorblanco double offset = radius * sqrt(e->fLine.magSq()) * e->fWinding; 15716641212397be28b6263e91340b7ed76bd29b3035Stephen White Line inner(e->fLine); 1572f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco inner.fC -= offset; 15736641212397be28b6263e91340b7ed76bd29b3035Stephen White Line outer(e->fLine); 1574f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco outer.fC += offset; 1575f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco SkPoint innerPoint, outerPoint; 157649df8d17c56ee08ecf860289d501913d356f67dcsenorblanco if (prevInner.intersect(inner, &innerPoint) && 157749df8d17c56ee08ecf860289d501913d356f67dcsenorblanco prevOuter.intersect(outer, &outerPoint)) { 15785cdc9dda330db41d34e452a91b6b0995b5a57626Herb Derby Vertex* innerVertex = alloc.make<Vertex>(innerPoint, 255); 15795cdc9dda330db41d34e452a91b6b0995b5a57626Herb Derby Vertex* outerVertex = alloc.make<Vertex>(outerPoint, 0); 1580dab4811661720e8f14675a09ca1a3b8f82e45680Ben Wagner Edge* bisector = new_edge(outerVertex, innerVertex, Edge::Type::kConnector, c, alloc); 158192eba8a5efc0860d4e95ba7f25052474a0bfca0cStephen White fix_inversions(innerVertices.fTail, innerVertex, prevBisector, bisector, prevEdge, c); 158292eba8a5efc0860d4e95ba7f25052474a0bfca0cStephen White fix_inversions(outerVertices.fTail, outerVertex, prevBisector, bisector, prevEdge, c); 1583bda29c076bf3d6811bde142d57e54e5792727481Stephen White innerVertex->fPartner = outerVertex; 1584bda29c076bf3d6811bde142d57e54e5792727481Stephen White outerVertex->fPartner = innerVertex; 158592eba8a5efc0860d4e95ba7f25052474a0bfca0cStephen White innerVertices.append(innerVertex); 158692eba8a5efc0860d4e95ba7f25052474a0bfca0cStephen White outerVertices.append(outerVertex); 158792eba8a5efc0860d4e95ba7f25052474a0bfca0cStephen White prevBisector = bisector; 1588f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco } 1589f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco prevInner = inner; 1590f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco prevOuter = outer; 159186cc841e23a81af69269de87224c57be274f40d1Stephen White prevEdge = e; 1592f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco } 1593f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco 1594f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco Vertex* innerVertex = innerVertices.fHead; 1595f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco Vertex* outerVertex = outerVertices.fHead; 1596f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco if (!innerVertex || !outerVertex) { 1597f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco return; 1598f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco } 1599dab4811661720e8f14675a09ca1a3b8f82e45680Ben Wagner Edge* bisector = new_edge(outerVertices.fHead, innerVertices.fHead, Edge::Type::kConnector, c, 1600dab4811661720e8f14675a09ca1a3b8f82e45680Ben Wagner alloc); 160192eba8a5efc0860d4e95ba7f25052474a0bfca0cStephen White fix_inversions(innerVertices.fTail, innerVertices.fHead, prevBisector, bisector, prevEdge, c); 160292eba8a5efc0860d4e95ba7f25052474a0bfca0cStephen White fix_inversions(outerVertices.fTail, outerVertices.fHead, prevBisector, bisector, prevEdge, c); 1603bda29c076bf3d6811bde142d57e54e5792727481Stephen White Vertex* prevInnerVertex = innerVertices.fTail; 1604bda29c076bf3d6811bde142d57e54e5792727481Stephen White Vertex* prevOuterVertex = outerVertices.fTail; 1605bda29c076bf3d6811bde142d57e54e5792727481Stephen White while (innerVertex && outerVertex) { 160648ded38da99c1171ba1bb469f6500f8214e9105cStephen White // Connect vertices into a quad mesh. Outer edges get default (1) winding. 160748ded38da99c1171ba1bb469f6500f8214e9105cStephen White // Inner edges get -2 winding. This ensures that the interior is always filled 160848ded38da99c1171ba1bb469f6500f8214e9105cStephen White // (-1 winding number for normal cases, 3 for thin features where the interior inverts). 1609bda29c076bf3d6811bde142d57e54e5792727481Stephen White connect(prevOuterVertex, outerVertex, Edge::Type::kOuter, c, alloc); 1610bda29c076bf3d6811bde142d57e54e5792727481Stephen White connect(prevInnerVertex, innerVertex, Edge::Type::kInner, c, alloc, -2); 1611bda29c076bf3d6811bde142d57e54e5792727481Stephen White prevInnerVertex = innerVertex; 1612bda29c076bf3d6811bde142d57e54e5792727481Stephen White prevOuterVertex = outerVertex; 1613bda29c076bf3d6811bde142d57e54e5792727481Stephen White innerVertex = innerVertex->fNext; 1614bda29c076bf3d6811bde142d57e54e5792727481Stephen White outerVertex = outerVertex->fNext; 1615bda29c076bf3d6811bde142d57e54e5792727481Stephen White } 1616bda29c076bf3d6811bde142d57e54e5792727481Stephen White innerMesh->append(innerVertices); 1617bda29c076bf3d6811bde142d57e54e5792727481Stephen White outerMesh->append(outerVertices); 1618f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco} 1619f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco 16205cdc9dda330db41d34e452a91b6b0995b5a57626Herb Derbyvoid extract_boundary(EdgeList* boundary, Edge* e, SkPath::FillType fillType, SkArenaAlloc& alloc) { 1621497890630b80a381a2ac4cbb9114b0320560bf8cStephen White bool down = apply_fill_type(fillType, e->fWinding); 1622f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco while (e) { 1623f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco e->fWinding = down ? 1 : -1; 1624f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco Edge* next; 1625f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco boundary->append(e); 1626f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco if (down) { 1627f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco // Find outgoing edge, in clockwise order. 1628f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco if ((next = e->fNextEdgeAbove)) { 1629f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco down = false; 1630f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco } else if ((next = e->fBottom->fLastEdgeBelow)) { 1631f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco down = true; 1632f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco } else if ((next = e->fPrevEdgeAbove)) { 1633f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco down = false; 1634f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco } 1635f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco } else { 1636f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco // Find outgoing edge, in counter-clockwise order. 1637f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco if ((next = e->fPrevEdgeBelow)) { 1638f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco down = true; 1639f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco } else if ((next = e->fTop->fFirstEdgeAbove)) { 1640f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco down = false; 1641f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco } else if ((next = e->fNextEdgeBelow)) { 1642f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco down = true; 1643f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco } 1644f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco } 1645e7a364d435843a868dcac2c61d78c34e5d3e326cStephen White disconnect(e); 1646f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco e = next; 1647f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco } 1648f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco} 1649f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco 16505ad721e94682b51b9f773d95704f11990468fef6Stephen White// Stage 5b: Extract boundaries from mesh, simplify and stroke them into a new mesh. 1651f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco 1652bda29c076bf3d6811bde142d57e54e5792727481Stephen Whitevoid extract_boundaries(const VertexList& inMesh, VertexList* innerVertices, 1653bda29c076bf3d6811bde142d57e54e5792727481Stephen White VertexList* outerVertices, SkPath::FillType fillType, 16545ad721e94682b51b9f773d95704f11990468fef6Stephen White Comparator& c, SkArenaAlloc& alloc) { 16555ad721e94682b51b9f773d95704f11990468fef6Stephen White remove_non_boundary_edges(inMesh, fillType, alloc); 16565ad721e94682b51b9f773d95704f11990468fef6Stephen White for (Vertex* v = inMesh.fHead; v; v = v->fNext) { 1657f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco while (v->fFirstEdgeBelow) { 16585ad721e94682b51b9f773d95704f11990468fef6Stephen White EdgeList boundary; 16595ad721e94682b51b9f773d95704f11990468fef6Stephen White extract_boundary(&boundary, v->fFirstEdgeBelow, fillType, alloc); 16605ad721e94682b51b9f773d95704f11990468fef6Stephen White simplify_boundary(&boundary, c, alloc); 1661bda29c076bf3d6811bde142d57e54e5792727481Stephen White stroke_boundary(&boundary, innerVertices, outerVertices, c, alloc); 1662f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco } 1663f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco } 1664f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco} 1665f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco 1666bda29c076bf3d6811bde142d57e54e5792727481Stephen White// This is a driver function that calls stages 2-5 in turn. 1667f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco 16683a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen Whitevoid contours_to_mesh(VertexList* contours, int contourCnt, bool antialias, 16695cdc9dda330db41d34e452a91b6b0995b5a57626Herb Derby VertexList* mesh, Comparator& c, SkArenaAlloc& alloc) { 1670e9709e831954c3427d5cb839e84221a177bfedebethannicholas#if LOGGING_ENABLED 1671e9709e831954c3427d5cb839e84221a177bfedebethannicholas for (int i = 0; i < contourCnt; ++i) { 16723a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White Vertex* v = contours[i].fHead; 1673e9709e831954c3427d5cb839e84221a177bfedebethannicholas SkASSERT(v); 1674e9709e831954c3427d5cb839e84221a177bfedebethannicholas LOG("path.moveTo(%20.20g, %20.20g);\n", v->fPoint.fX, v->fPoint.fY); 16753a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White for (v = v->fNext; v; v = v->fNext) { 1676e9709e831954c3427d5cb839e84221a177bfedebethannicholas LOG("path.lineTo(%20.20g, %20.20g);\n", v->fPoint.fX, v->fPoint.fY); 1677e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1678e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1679e9709e831954c3427d5cb839e84221a177bfedebethannicholas#endif 1680f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco sanitize_contours(contours, contourCnt, antialias); 1681bf6137e08b703abd98b3e4d938e1cccef2350f4eStephen White build_edges(contours, contourCnt, mesh, c, alloc); 1682f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco} 1683f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco 1684bda29c076bf3d6811bde142d57e54e5792727481Stephen Whitevoid sort_mesh(VertexList* vertices, Comparator& c, SkArenaAlloc& alloc) { 1685bf6137e08b703abd98b3e4d938e1cccef2350f4eStephen White if (!vertices || !vertices->fHead) { 16862f4686fa25ef7a14961f68be18e63de3567d0a15Stephen White return; 1687e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1688e9709e831954c3427d5cb839e84221a177bfedebethannicholas 1689e9709e831954c3427d5cb839e84221a177bfedebethannicholas // Sort vertices in Y (secondarily in X). 169016a40cb65adeb4d94b84479f9946c360ed73e1bbStephen White if (c.fDirection == Comparator::Direction::kHorizontal) { 169116a40cb65adeb4d94b84479f9946c360ed73e1bbStephen White merge_sort<sweep_lt_horiz>(vertices); 169216a40cb65adeb4d94b84479f9946c360ed73e1bbStephen White } else { 169316a40cb65adeb4d94b84479f9946c360ed73e1bbStephen White merge_sort<sweep_lt_vert>(vertices); 169416a40cb65adeb4d94b84479f9946c360ed73e1bbStephen White } 1695e9709e831954c3427d5cb839e84221a177bfedebethannicholas#if LOGGING_ENABLED 16962e2cb9bc768bd13e1beeafc9acf8b8f19bea3215Stephen White for (Vertex* v = vertices->fHead; v != nullptr; v = v->fNext) { 1697e9709e831954c3427d5cb839e84221a177bfedebethannicholas static float gID = 0.0f; 1698e9709e831954c3427d5cb839e84221a177bfedebethannicholas v->fID = gID++; 1699e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1700e9709e831954c3427d5cb839e84221a177bfedebethannicholas#endif 17012f4686fa25ef7a14961f68be18e63de3567d0a15Stephen White} 17022f4686fa25ef7a14961f68be18e63de3567d0a15Stephen White 17033a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen WhitePoly* contours_to_polys(VertexList* contours, int contourCnt, SkPath::FillType fillType, 1704bda29c076bf3d6811bde142d57e54e5792727481Stephen White const SkRect& pathBounds, bool antialias, VertexList* outerMesh, 17055cdc9dda330db41d34e452a91b6b0995b5a57626Herb Derby SkArenaAlloc& alloc) { 170616a40cb65adeb4d94b84479f9946c360ed73e1bbStephen White Comparator c(pathBounds.width() > pathBounds.height() ? Comparator::Direction::kHorizontal 170716a40cb65adeb4d94b84479f9946c360ed73e1bbStephen White : Comparator::Direction::kVertical); 1708bf6137e08b703abd98b3e4d938e1cccef2350f4eStephen White VertexList mesh; 1709bf6137e08b703abd98b3e4d938e1cccef2350f4eStephen White contours_to_mesh(contours, contourCnt, antialias, &mesh, c, alloc); 1710bda29c076bf3d6811bde142d57e54e5792727481Stephen White sort_mesh(&mesh, c, alloc); 1711bda29c076bf3d6811bde142d57e54e5792727481Stephen White merge_coincident_vertices(&mesh, c, alloc); 1712bda29c076bf3d6811bde142d57e54e5792727481Stephen White simplify(mesh, c, alloc); 1713f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco if (antialias) { 1714bda29c076bf3d6811bde142d57e54e5792727481Stephen White VertexList innerMesh; 1715bda29c076bf3d6811bde142d57e54e5792727481Stephen White extract_boundaries(mesh, &innerMesh, outerMesh, fillType, c, alloc); 1716bda29c076bf3d6811bde142d57e54e5792727481Stephen White sort_mesh(&innerMesh, c, alloc); 1717bda29c076bf3d6811bde142d57e54e5792727481Stephen White sort_mesh(outerMesh, c, alloc); 1718bda29c076bf3d6811bde142d57e54e5792727481Stephen White if (is_complex(innerMesh) || is_complex(*outerMesh)) { 1719bda29c076bf3d6811bde142d57e54e5792727481Stephen White LOG("found complex mesh; taking slow path\n"); 1720bda29c076bf3d6811bde142d57e54e5792727481Stephen White VertexList aaMesh; 1721bda29c076bf3d6811bde142d57e54e5792727481Stephen White connect_partners(outerMesh, c, alloc); 1722bda29c076bf3d6811bde142d57e54e5792727481Stephen White sorted_merge(&innerMesh, outerMesh, &aaMesh, c); 1723bda29c076bf3d6811bde142d57e54e5792727481Stephen White merge_coincident_vertices(&aaMesh, c, alloc); 1724bda29c076bf3d6811bde142d57e54e5792727481Stephen White simplify(aaMesh, c, alloc); 1725bda29c076bf3d6811bde142d57e54e5792727481Stephen White outerMesh->fHead = outerMesh->fTail = nullptr; 1726bda29c076bf3d6811bde142d57e54e5792727481Stephen White return tessellate(aaMesh, alloc); 1727bda29c076bf3d6811bde142d57e54e5792727481Stephen White } else { 1728bda29c076bf3d6811bde142d57e54e5792727481Stephen White LOG("no complex polygons; taking fast path\n"); 1729bda29c076bf3d6811bde142d57e54e5792727481Stephen White merge_coincident_vertices(&innerMesh, c, alloc); 1730bda29c076bf3d6811bde142d57e54e5792727481Stephen White return tessellate(innerMesh, alloc); 1731bda29c076bf3d6811bde142d57e54e5792727481Stephen White } 1732497890630b80a381a2ac4cbb9114b0320560bf8cStephen White } else { 1733497890630b80a381a2ac4cbb9114b0320560bf8cStephen White return tessellate(mesh, alloc); 1734f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco } 1735f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco} 1736f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco 1737f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco// Stage 6: Triangulate the monotone polygons into a vertex buffer. 1738f57372daf0562a187c24d427366ac6d0cb980c9bsenorblancovoid* polys_to_triangles(Poly* polys, SkPath::FillType fillType, const AAParams* aaParams, 1739f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco void* data) { 1740f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco for (Poly* poly = polys; poly; poly = poly->fNext) { 1741f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco if (apply_fill_type(fillType, poly)) { 1742f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco data = poly->emit(aaParams, data); 1743f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco } 1744f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco } 1745f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco return data; 1746e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 1747e9709e831954c3427d5cb839e84221a177bfedebethannicholas 17489d524f22bfde5dc3dc8f48e1be39bdebd3bb0304halcanaryPoly* path_to_polys(const SkPath& path, SkScalar tolerance, const SkRect& clipBounds, 1749bda29c076bf3d6811bde142d57e54e5792727481Stephen White int contourCnt, SkArenaAlloc& alloc, bool antialias, bool* isLinear, 1750bda29c076bf3d6811bde142d57e54e5792727481Stephen White VertexList* outerMesh) { 1751e9709e831954c3427d5cb839e84221a177bfedebethannicholas SkPath::FillType fillType = path.getFillType(); 1752e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (SkPath::IsInverseFillType(fillType)) { 1753e9709e831954c3427d5cb839e84221a177bfedebethannicholas contourCnt++; 1754e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 17553a9aab9ef0874d7fe661e48608a334c3ef98c6baStephen White std::unique_ptr<VertexList[]> contours(new VertexList[contourCnt]); 1756e9709e831954c3427d5cb839e84221a177bfedebethannicholas 1757e9709e831954c3427d5cb839e84221a177bfedebethannicholas path_to_contours(path, tolerance, clipBounds, contours.get(), alloc, isLinear); 1758f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco return contours_to_polys(contours.get(), contourCnt, path.getFillType(), path.getBounds(), 1759bda29c076bf3d6811bde142d57e54e5792727481Stephen White antialias, outerMesh, alloc); 1760e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 1761e9709e831954c3427d5cb839e84221a177bfedebethannicholas 176211f65e0bb44f33b18e8bbb792d4f904ce1da0d5bStephen Whiteint get_contour_count(const SkPath& path, SkScalar tolerance) { 176311f65e0bb44f33b18e8bbb792d4f904ce1da0d5bStephen White int contourCnt; 176411f65e0bb44f33b18e8bbb792d4f904ce1da0d5bStephen White int maxPts = GrPathUtils::worstCasePointCount(path, &contourCnt, tolerance); 1765e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (maxPts <= 0) { 176611f65e0bb44f33b18e8bbb792d4f904ce1da0d5bStephen White return 0; 1767e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1768e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (maxPts > ((int)SK_MaxU16 + 1)) { 1769e9709e831954c3427d5cb839e84221a177bfedebethannicholas SkDebugf("Path not rendered, too many verts (%d)\n", maxPts); 177011f65e0bb44f33b18e8bbb792d4f904ce1da0d5bStephen White return 0; 1771e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 177211f65e0bb44f33b18e8bbb792d4f904ce1da0d5bStephen White return contourCnt; 1773e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 1774e9709e831954c3427d5cb839e84221a177bfedebethannicholas 1775e9709e831954c3427d5cb839e84221a177bfedebethannicholasint count_points(Poly* polys, SkPath::FillType fillType) { 1776e9709e831954c3427d5cb839e84221a177bfedebethannicholas int count = 0; 1777e9709e831954c3427d5cb839e84221a177bfedebethannicholas for (Poly* poly = polys; poly; poly = poly->fNext) { 1778f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco if (apply_fill_type(fillType, poly) && poly->fCount >= 3) { 1779e9709e831954c3427d5cb839e84221a177bfedebethannicholas count += (poly->fCount - 2) * (TESSELLATOR_WIREFRAME ? 6 : 3); 1780e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1781e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1782e9709e831954c3427d5cb839e84221a177bfedebethannicholas return count; 1783e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 1784e9709e831954c3427d5cb839e84221a177bfedebethannicholas 1785bda29c076bf3d6811bde142d57e54e5792727481Stephen Whiteint count_outer_mesh_points(const VertexList& outerMesh) { 1786bda29c076bf3d6811bde142d57e54e5792727481Stephen White int count = 0; 1787bda29c076bf3d6811bde142d57e54e5792727481Stephen White for (Vertex* v = outerMesh.fHead; v; v = v->fNext) { 1788bda29c076bf3d6811bde142d57e54e5792727481Stephen White for (Edge* e = v->fFirstEdgeBelow; e; e = e->fNextEdgeBelow) { 1789bda29c076bf3d6811bde142d57e54e5792727481Stephen White count += TESSELLATOR_WIREFRAME ? 12 : 6; 1790bda29c076bf3d6811bde142d57e54e5792727481Stephen White } 1791bda29c076bf3d6811bde142d57e54e5792727481Stephen White } 1792bda29c076bf3d6811bde142d57e54e5792727481Stephen White return count; 1793bda29c076bf3d6811bde142d57e54e5792727481Stephen White} 1794bda29c076bf3d6811bde142d57e54e5792727481Stephen White 1795bda29c076bf3d6811bde142d57e54e5792727481Stephen Whitevoid* outer_mesh_to_triangles(const VertexList& outerMesh, const AAParams* aaParams, void* data) { 1796bda29c076bf3d6811bde142d57e54e5792727481Stephen White for (Vertex* v = outerMesh.fHead; v; v = v->fNext) { 1797bda29c076bf3d6811bde142d57e54e5792727481Stephen White for (Edge* e = v->fFirstEdgeBelow; e; e = e->fNextEdgeBelow) { 1798bda29c076bf3d6811bde142d57e54e5792727481Stephen White Vertex* v0 = e->fTop; 1799bda29c076bf3d6811bde142d57e54e5792727481Stephen White Vertex* v1 = e->fBottom; 1800bda29c076bf3d6811bde142d57e54e5792727481Stephen White Vertex* v2 = e->fBottom->fPartner; 1801bda29c076bf3d6811bde142d57e54e5792727481Stephen White Vertex* v3 = e->fTop->fPartner; 1802bda29c076bf3d6811bde142d57e54e5792727481Stephen White data = emit_triangle(v0, v1, v2, aaParams, data); 1803bda29c076bf3d6811bde142d57e54e5792727481Stephen White data = emit_triangle(v0, v2, v3, aaParams, data); 1804bda29c076bf3d6811bde142d57e54e5792727481Stephen White } 1805bda29c076bf3d6811bde142d57e54e5792727481Stephen White } 1806bda29c076bf3d6811bde142d57e54e5792727481Stephen White return data; 1807bda29c076bf3d6811bde142d57e54e5792727481Stephen White} 1808bda29c076bf3d6811bde142d57e54e5792727481Stephen White 1809e9709e831954c3427d5cb839e84221a177bfedebethannicholas} // namespace 1810e9709e831954c3427d5cb839e84221a177bfedebethannicholas 1811e9709e831954c3427d5cb839e84221a177bfedebethannicholasnamespace GrTessellator { 1812e9709e831954c3427d5cb839e84221a177bfedebethannicholas 1813e9709e831954c3427d5cb839e84221a177bfedebethannicholas// Stage 6: Triangulate the monotone polygons into a vertex buffer. 1814e9709e831954c3427d5cb839e84221a177bfedebethannicholas 18159d524f22bfde5dc3dc8f48e1be39bdebd3bb0304halcanaryint PathToTriangles(const SkPath& path, SkScalar tolerance, const SkRect& clipBounds, 1816f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco VertexAllocator* vertexAllocator, bool antialias, const GrColor& color, 1817f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco bool canTweakAlphaForCoverage, bool* isLinear) { 181811f65e0bb44f33b18e8bbb792d4f904ce1da0d5bStephen White int contourCnt = get_contour_count(path, tolerance); 1819e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (contourCnt <= 0) { 1820e9709e831954c3427d5cb839e84221a177bfedebethannicholas *isLinear = true; 1821e9709e831954c3427d5cb839e84221a177bfedebethannicholas return 0; 1822e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 182311f65e0bb44f33b18e8bbb792d4f904ce1da0d5bStephen White SkArenaAlloc alloc(kArenaChunkSize); 1824bda29c076bf3d6811bde142d57e54e5792727481Stephen White VertexList outerMesh; 1825f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco Poly* polys = path_to_polys(path, tolerance, clipBounds, contourCnt, alloc, antialias, 1826bda29c076bf3d6811bde142d57e54e5792727481Stephen White isLinear, &outerMesh); 18277ab96e92196dd74d5b95d33c8477b256813f3046senorblanco SkPath::FillType fillType = antialias ? SkPath::kWinding_FillType : path.getFillType(); 1828e9709e831954c3427d5cb839e84221a177bfedebethannicholas int count = count_points(polys, fillType); 1829e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (0 == count) { 1830e9709e831954c3427d5cb839e84221a177bfedebethannicholas return 0; 1831e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1832bda29c076bf3d6811bde142d57e54e5792727481Stephen White if (antialias) { 1833bda29c076bf3d6811bde142d57e54e5792727481Stephen White count += count_outer_mesh_points(outerMesh); 1834bda29c076bf3d6811bde142d57e54e5792727481Stephen White } 1835e9709e831954c3427d5cb839e84221a177bfedebethannicholas 1836f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco void* verts = vertexAllocator->lock(count); 18376599efffeef3168dfc68dca99c30454c5c23b859senorblanco if (!verts) { 1838e9709e831954c3427d5cb839e84221a177bfedebethannicholas SkDebugf("Could not allocate vertices\n"); 1839e9709e831954c3427d5cb839e84221a177bfedebethannicholas return 0; 1840e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1841f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco 1842f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco LOG("emitting %d verts\n", count); 1843f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco AAParams aaParams; 1844f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco aaParams.fTweakAlpha = canTweakAlphaForCoverage; 1845f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco aaParams.fColor = color; 1846f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco 1847f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco void* end = polys_to_triangles(polys, fillType, antialias ? &aaParams : nullptr, verts); 1848bda29c076bf3d6811bde142d57e54e5792727481Stephen White end = outer_mesh_to_triangles(outerMesh, &aaParams, end); 1849f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco int actualCount = static_cast<int>((static_cast<uint8_t*>(end) - static_cast<uint8_t*>(verts)) 1850f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco / vertexAllocator->stride()); 1851e9709e831954c3427d5cb839e84221a177bfedebethannicholas SkASSERT(actualCount <= count); 18526599efffeef3168dfc68dca99c30454c5c23b859senorblanco vertexAllocator->unlock(actualCount); 1853e9709e831954c3427d5cb839e84221a177bfedebethannicholas return actualCount; 1854e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 1855e9709e831954c3427d5cb839e84221a177bfedebethannicholas 18569d524f22bfde5dc3dc8f48e1be39bdebd3bb0304halcanaryint PathToVertices(const SkPath& path, SkScalar tolerance, const SkRect& clipBounds, 1857e9709e831954c3427d5cb839e84221a177bfedebethannicholas GrTessellator::WindingVertex** verts) { 185811f65e0bb44f33b18e8bbb792d4f904ce1da0d5bStephen White int contourCnt = get_contour_count(path, tolerance); 1859e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (contourCnt <= 0) { 1860e9709e831954c3427d5cb839e84221a177bfedebethannicholas return 0; 1861e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 186211f65e0bb44f33b18e8bbb792d4f904ce1da0d5bStephen White SkArenaAlloc alloc(kArenaChunkSize); 1863e9709e831954c3427d5cb839e84221a177bfedebethannicholas bool isLinear; 1864bda29c076bf3d6811bde142d57e54e5792727481Stephen White Poly* polys = path_to_polys(path, tolerance, clipBounds, contourCnt, alloc, false, &isLinear, 1865bda29c076bf3d6811bde142d57e54e5792727481Stephen White nullptr); 1866e9709e831954c3427d5cb839e84221a177bfedebethannicholas SkPath::FillType fillType = path.getFillType(); 1867e9709e831954c3427d5cb839e84221a177bfedebethannicholas int count = count_points(polys, fillType); 1868e9709e831954c3427d5cb839e84221a177bfedebethannicholas if (0 == count) { 1869e9709e831954c3427d5cb839e84221a177bfedebethannicholas *verts = nullptr; 1870e9709e831954c3427d5cb839e84221a177bfedebethannicholas return 0; 1871e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1872e9709e831954c3427d5cb839e84221a177bfedebethannicholas 1873e9709e831954c3427d5cb839e84221a177bfedebethannicholas *verts = new GrTessellator::WindingVertex[count]; 1874e9709e831954c3427d5cb839e84221a177bfedebethannicholas GrTessellator::WindingVertex* vertsEnd = *verts; 1875e9709e831954c3427d5cb839e84221a177bfedebethannicholas SkPoint* points = new SkPoint[count]; 1876e9709e831954c3427d5cb839e84221a177bfedebethannicholas SkPoint* pointsEnd = points; 1877e9709e831954c3427d5cb839e84221a177bfedebethannicholas for (Poly* poly = polys; poly; poly = poly->fNext) { 1878f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco if (apply_fill_type(fillType, poly)) { 1879e9709e831954c3427d5cb839e84221a177bfedebethannicholas SkPoint* start = pointsEnd; 1880f57372daf0562a187c24d427366ac6d0cb980c9bsenorblanco pointsEnd = static_cast<SkPoint*>(poly->emit(nullptr, pointsEnd)); 1881e9709e831954c3427d5cb839e84221a177bfedebethannicholas while (start != pointsEnd) { 1882e9709e831954c3427d5cb839e84221a177bfedebethannicholas vertsEnd->fPos = *start; 1883e9709e831954c3427d5cb839e84221a177bfedebethannicholas vertsEnd->fWinding = poly->fWinding; 1884e9709e831954c3427d5cb839e84221a177bfedebethannicholas ++start; 1885e9709e831954c3427d5cb839e84221a177bfedebethannicholas ++vertsEnd; 1886e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1887e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1888e9709e831954c3427d5cb839e84221a177bfedebethannicholas } 1889e9709e831954c3427d5cb839e84221a177bfedebethannicholas int actualCount = static_cast<int>(vertsEnd - *verts); 1890e9709e831954c3427d5cb839e84221a177bfedebethannicholas SkASSERT(actualCount <= count); 1891e9709e831954c3427d5cb839e84221a177bfedebethannicholas SkASSERT(pointsEnd - points == actualCount); 1892e9709e831954c3427d5cb839e84221a177bfedebethannicholas delete[] points; 1893e9709e831954c3427d5cb839e84221a177bfedebethannicholas return actualCount; 1894e9709e831954c3427d5cb839e84221a177bfedebethannicholas} 1895e9709e831954c3427d5cb839e84221a177bfedebethannicholas 1896e9709e831954c3427d5cb839e84221a177bfedebethannicholas} // namespace 1897