54359294a7
Replace the implicit curve intersection with a geometric curve intersection. The implicit intersection proved mathematically unstable and took a long time to zero in on an answer. Use pointers instead of indices to refer to parts of curves. Indices required awkward renumbering. Unify t and point values so that small intervals can be eliminated in one pass. Break cubics up front to eliminate loops and cusps. Make the Simplify and Op code more regular and eliminate arbitrary differences. Add a builder that takes an array of paths and operators. Delete unused code. BUG=skia:3588 R=reed@google.com Review URL: https://codereview.chromium.org/1037573004
27 lines
803 B
C
27 lines
803 B
C
/*
|
|
* Copyright 2012 Google Inc.
|
|
*
|
|
* Use of this source code is governed by a BSD-style license that can be
|
|
* found in the LICENSE file.
|
|
*/
|
|
#ifndef PathOpsTestCommon_DEFINED
|
|
#define PathOpsTestCommon_DEFINED
|
|
|
|
#include "SkPathOpsQuad.h"
|
|
#include "SkTArray.h"
|
|
|
|
struct SkPathOpsBounds;
|
|
|
|
void CubicPathToQuads(const SkPath& cubicPath, SkPath* quadPath);
|
|
void CubicPathToSimple(const SkPath& cubicPath, SkPath* simplePath);
|
|
void CubicToQuads(const SkDCubic& cubic, double precision, SkTArray<SkDQuad, true>& quads);
|
|
bool ValidBounds(const SkPathOpsBounds&);
|
|
bool ValidCubic(const SkDCubic& cubic);
|
|
bool ValidLine(const SkDLine& line);
|
|
bool ValidPoint(const SkDPoint& pt);
|
|
bool ValidPoints(const SkPoint* pts, int count);
|
|
bool ValidQuad(const SkDQuad& quad);
|
|
bool ValidVector(const SkDVector& v);
|
|
|
|
#endif
|