mirror of
https://github.com/ONLYOFFICE/core.git
synced 2026-04-07 13:55:33 +08:00
Refactoring
This commit is contained in:
Oleg Korshul
committed by
Oleg Korshul
Oleg Korshul
parent
1cfd17e2f3
commit
a77987488b
@ -5,245 +5,218 @@
|
||||
#include "boolean_operations_math.h"
|
||||
#include <unordered_map>
|
||||
|
||||
namespace Aggplus {
|
||||
enum BooleanOpType
|
||||
namespace Aggplus
|
||||
{
|
||||
Intersection = 2,
|
||||
Union = 1,
|
||||
Subtraction = 1,
|
||||
Exclusion = 3,
|
||||
Division = 4
|
||||
};
|
||||
struct Location;
|
||||
struct Winding;
|
||||
|
||||
struct Location;
|
||||
struct Winding;
|
||||
struct Segment
|
||||
{
|
||||
PointD P;
|
||||
PointD HI;
|
||||
PointD HO;
|
||||
|
||||
struct Segment
|
||||
{
|
||||
PointD P;
|
||||
PointD HI;
|
||||
PointD HO;
|
||||
|
||||
bool IsCurve;
|
||||
bool Visited;
|
||||
bool IsCurve;
|
||||
bool Visited;
|
||||
|
||||
size_t Index;
|
||||
size_t Id;
|
||||
size_t Index;
|
||||
size_t Id;
|
||||
|
||||
CGraphicsPath *Path;
|
||||
std::shared_ptr<Location> Inters;
|
||||
std::shared_ptr<Winding> Wind;
|
||||
CGraphicsPath* Path;
|
||||
std::shared_ptr<Location> Inters;
|
||||
std::shared_ptr<Winding> Wind;
|
||||
|
||||
Segment();
|
||||
Segment(const std::vector<PointD>& points, bool isCurve,
|
||||
size_t index, size_t id, CGraphicsPath* path);
|
||||
Segment(const PointD& p, const PointD& hi, const PointD& ho);
|
||||
Segment();
|
||||
Segment(const std::vector<PointD>& points, bool isCurve, size_t index, size_t id, CGraphicsPath* path);
|
||||
Segment(const PointD& p, const PointD& hi, const PointD& ho);
|
||||
|
||||
bool IsValid(BooleanOpType op) const;
|
||||
bool operator==(const Segment& other) const;
|
||||
bool operator!=(const Segment& other) const;
|
||||
};
|
||||
|
||||
struct Curve
|
||||
{
|
||||
Segment Segment1;
|
||||
Segment Segment2;
|
||||
|
||||
Curve();
|
||||
Curve(const Segment& segment1, const Segment& segment2);
|
||||
Curve(const std::vector<double>& values);
|
||||
Curve(double x0, double y0, double x1, double y1,
|
||||
double x2, double y2, double x3, double y3);
|
||||
bool IsValid(BooleanOpType op) const;
|
||||
bool operator==(const Segment& other) const;
|
||||
bool operator!=(const Segment& other) const;
|
||||
};
|
||||
|
||||
std::vector<double> GetXValues() const;
|
||||
std::vector<double> GetYValues() const;
|
||||
std::vector<double> GetPeeks() const;
|
||||
struct Curve
|
||||
{
|
||||
Segment Segment1;
|
||||
Segment Segment2;
|
||||
|
||||
double GetLength(double a = 0, double b = 1) const;
|
||||
double GetSquaredLineLength() const;
|
||||
double GetTimeOf(const PointD& point) const ;
|
||||
double GetTimeAt(double offset) const;
|
||||
PointD Get(double t, int type) const;
|
||||
PointD GetPoint(double t) const;
|
||||
PointD GetTangent(double t) const;
|
||||
PointD GetTangent(double t, double offset, bool inside, const PointD& p) const;
|
||||
Curve GetPart(double from, double to) const;
|
||||
std::vector<Curve> GetMonoCurves(bool dir) const;
|
||||
std::vector<std::pair<int, int>> GetOverlaps(const Curve& curve) const;
|
||||
std::vector<double> GetCurveLineIntersection(double px, double py,
|
||||
double vx, double vy) const;
|
||||
|
||||
std::vector<Curve> Subdivide(double t) const;
|
||||
Curve DivideAtTime(double time, std::vector<Segment>& segments,
|
||||
std::vector<Curve>& curves);
|
||||
|
||||
int SolveCubic(size_t coord, int value, std::vector<double>& roots,
|
||||
double mn, double mx) const;
|
||||
int SolveCubic(double a, double b, double c, double d, std::vector<double>& roots,
|
||||
double mn, double mx) const;
|
||||
Curve();
|
||||
Curve(const Segment& segment1, const Segment& segment2);
|
||||
Curve(const std::vector<double>& values);
|
||||
Curve(double x0, double y0, double x1, double y1, double x2, double y2, double x3, double y3);
|
||||
|
||||
void Flip();
|
||||
void ClearHandles();
|
||||
std::vector<double> GetXValues() const;
|
||||
std::vector<double> GetYValues() const;
|
||||
std::vector<double> GetPeeks() const;
|
||||
|
||||
bool IsStraight() const;
|
||||
bool HasHandle() const ;
|
||||
double GetLength(double a = 0, double b = 1) const;
|
||||
double GetSquaredLineLength() const;
|
||||
double GetTimeOf(const PointD& point) const;
|
||||
double GetTimeAt(double offset) const;
|
||||
PointD Get(double t, int type) const;
|
||||
PointD GetPoint(double t) const;
|
||||
PointD GetTangent(double t) const;
|
||||
PointD GetTangent(double t, double offset, bool inside, const PointD& p) const;
|
||||
Curve GetPart(double from, double to) const;
|
||||
std::vector<Curve> GetMonoCurves(bool dir) const;
|
||||
std::vector<std::pair<int, int>> GetOverlaps(const Curve& curve) const;
|
||||
std::vector<double> GetCurveLineIntersection(double px, double py, double vx, double vy) const;
|
||||
|
||||
bool operator==(const Curve& other) const;
|
||||
bool operator!=(const Curve& other) const;
|
||||
};
|
||||
std::vector<Curve> Subdivide(double t) const;
|
||||
Curve DivideAtTime(double time, std::vector<Segment>& segments, std::vector<Curve>& curves);
|
||||
|
||||
struct Location
|
||||
{
|
||||
Curve C;
|
||||
Segment S;
|
||||
double Time;
|
||||
bool Overlap;
|
||||
int SolveCubic(size_t coord, int value, std::vector<double>& roots, double mn, double mx) const;
|
||||
int SolveCubic(double a, double b, double c, double d, std::vector<double>& roots, double mn, double mx) const;
|
||||
|
||||
std::shared_ptr<Location> Inters;
|
||||
std::shared_ptr<Location> Next;
|
||||
std::shared_ptr<Location> Prev;
|
||||
|
||||
Location();
|
||||
Location(const Curve& curve, double time, bool overlap);
|
||||
void Flip();
|
||||
void ClearHandles();
|
||||
|
||||
bool IsTouching();
|
||||
bool operator==(const Location& other);
|
||||
};
|
||||
bool IsStraight() const;
|
||||
bool HasHandle() const;
|
||||
|
||||
struct Branch
|
||||
{
|
||||
double Start;
|
||||
std::vector<Segment> Crossings;
|
||||
std::vector<Segment> Visited;
|
||||
PointD HI;
|
||||
bool operator==(const Curve& other) const;
|
||||
bool operator!=(const Curve& other) const;
|
||||
};
|
||||
|
||||
Branch();
|
||||
Branch(double start, const std::vector<Segment>& crosings, const PointD& hi);
|
||||
};
|
||||
struct Location
|
||||
{
|
||||
Curve C;
|
||||
Segment S;
|
||||
double Time;
|
||||
bool Overlap;
|
||||
|
||||
struct Winding
|
||||
{
|
||||
std::vector<double> Roots;
|
||||
std::vector<Curve> Curves;
|
||||
std::vector<Curve> Curves1;
|
||||
std::vector<Curve> Curves2;
|
||||
std::vector<Curve> CurvesHor;
|
||||
std::vector<Curve> CurvesVer;
|
||||
std::shared_ptr<Location> Inters;
|
||||
std::shared_ptr<Location> Next;
|
||||
std::shared_ptr<Location> Prev;
|
||||
|
||||
Curve Prev;
|
||||
Location();
|
||||
Location(const Curve& curve, double time, bool overlap);
|
||||
|
||||
bool OnPath;
|
||||
bool OnAnyPath;
|
||||
bool Direction;
|
||||
bool DontFlip;
|
||||
bool IsTouching();
|
||||
bool operator==(const Location& other);
|
||||
};
|
||||
|
||||
double W;
|
||||
double Quality;
|
||||
double WindingLeft;
|
||||
double WindingRight;
|
||||
double PointAbscissas;
|
||||
double PointOrdinat;
|
||||
double PathWindingLeft;
|
||||
double PathWindingRight;
|
||||
double PointAbscissasLeft;
|
||||
double PointAbscissasRight;
|
||||
struct Branch
|
||||
{
|
||||
double Start;
|
||||
std::vector<Segment> Crossings;
|
||||
std::vector<Segment> Visited;
|
||||
PointD HI;
|
||||
|
||||
Winding();
|
||||
Branch();
|
||||
Branch(double start, const std::vector<Segment>& crosings, const PointD& hi);
|
||||
};
|
||||
|
||||
void Copy(Winding* wind);
|
||||
void Reset();
|
||||
void SetDirection(bool direction);
|
||||
void SetPoint(const PointD& point);
|
||||
void SetCurves(const std::vector<Curve>& curvesHor, const std::vector<Curve>& curveVer);
|
||||
struct Winding
|
||||
{
|
||||
std::vector<double> Roots;
|
||||
std::vector<Curve> Curves;
|
||||
std::vector<Curve> Curves1;
|
||||
std::vector<Curve> Curves2;
|
||||
std::vector<Curve> CurvesHor;
|
||||
std::vector<Curve> CurvesVer;
|
||||
|
||||
Winding* AddWinding(const Curve& curve);
|
||||
Winding* HandleCurve(const Curve& curve);
|
||||
void GetWinding();
|
||||
Curve Prev;
|
||||
|
||||
// bool IsFirst(Curve curve);
|
||||
Curve GetPreviousCurve(const Curve& curve) const;
|
||||
};
|
||||
bool OnPath;
|
||||
bool OnAnyPath;
|
||||
bool Direction;
|
||||
bool DontFlip;
|
||||
|
||||
class CBooleanOperations
|
||||
{
|
||||
public:
|
||||
CBooleanOperations(CGraphicsPath* path1, CGraphicsPath* path2, BooleanOpType op);
|
||||
CGraphicsPath* GetResult();
|
||||
|
||||
//BooleanOp
|
||||
void TraceBoolean();
|
||||
void TracePaths();
|
||||
//void reorientPaths();
|
||||
double W;
|
||||
double Quality;
|
||||
double WindingLeft;
|
||||
double WindingRight;
|
||||
double PointAbscissas;
|
||||
double PointOrdinat;
|
||||
double PathWindingLeft;
|
||||
double PathWindingRight;
|
||||
double PointAbscissasLeft;
|
||||
double PointAbscissasRight;
|
||||
|
||||
//Path
|
||||
void PreparePath(CGraphicsPath *path, size_t id, std::vector<Segment>& segments,
|
||||
std::vector<Curve>& curves);
|
||||
void InsertSegment(const Segment& segment);
|
||||
Curve GetCurve(const Segment& segment) const;
|
||||
Curve GetPreviousCurve(const Curve& curve) const;
|
||||
Curve GetNextCurve(const Curve& curve) const;
|
||||
Segment GetNextSegment(const Segment& segment) const;
|
||||
std::vector<Curve> GetCurves(const std::vector<int>& indices) const;
|
||||
std::vector<Segment> GetCrossing(const Segment& seg, std::vector<Segment>& starts,
|
||||
bool collectStart) const;
|
||||
Winding();
|
||||
|
||||
//Bounds
|
||||
std::vector<std::vector<double>> GetBoundsForCurves(const std::vector<Curve>& curves) const;
|
||||
std::vector<std::vector<int>> FindCurveBoundsCollisions(const std::vector<Curve>& curves1,
|
||||
const std::vector<Curve>& curves2,
|
||||
double tolerance,
|
||||
bool bothAxis = false);
|
||||
std::vector<std::vector<int>> FindBoundsCollisions(const std::vector<std::vector<double>>& bounds1,
|
||||
const std::vector<std::vector<double>>& bounds2,
|
||||
double tolerance,
|
||||
bool sweepVertical = false,
|
||||
bool onlySweep = false);
|
||||
void Copy(Winding* wind);
|
||||
void Reset();
|
||||
void SetDirection(bool direction);
|
||||
void SetPoint(const PointD& point);
|
||||
void SetCurves(const std::vector<Curve>& curvesHor, const std::vector<Curve>& curveVer);
|
||||
|
||||
//Intersection
|
||||
bool IsCrossing(std::shared_ptr<Location> loc);
|
||||
bool FilterIntersections(std::shared_ptr<Location> loc);
|
||||
bool IntersectsBounds();
|
||||
void GetIntersection();
|
||||
void GetCurveIntersection(const Curve& curve1, const Curve& curve2);
|
||||
void LinkIntersection(std::shared_ptr<Location> form, std::shared_ptr<Location> to);
|
||||
void AddLineIntersection(const Curve& curve1, const Curve& curve2, bool flip);
|
||||
void AddCurveLineIntersection(const Curve& curve1, const Curve& curve2, bool flip);
|
||||
int AddCurveIntersection(const Curve& curve1, const Curve& curve2, bool flip,
|
||||
int recursion = 0, int calls = 0, double tMin = 0,
|
||||
double tMax = 1, double uMin = 0, double uMax = 1);
|
||||
Winding* AddWinding(const Curve& curve);
|
||||
Winding* HandleCurve(const Curve& curve);
|
||||
void GetWinding();
|
||||
|
||||
//Location
|
||||
void DivideLocations();
|
||||
void AddLocation(Curve curve1,Curve curve2, double t1, double t2, bool overlap = false);
|
||||
void InsertLocation(std::shared_ptr<Location> loc);
|
||||
// bool IsFirst(Curve curve);
|
||||
Curve GetPreviousCurve(const Curve& curve) const;
|
||||
};
|
||||
|
||||
//Util
|
||||
void ClearCurveHandles(std::vector<Curve>& curves);
|
||||
void AddOffsets(std::vector<double>& offsets, const Curve& curve, bool end);
|
||||
void PropagateWinding(Segment segment, std::vector<std::vector<Curve>> map);
|
||||
void Collect(const Segment& seg, std::vector<Segment>& crossing, std::vector<Segment>& starts,
|
||||
std::shared_ptr<Location> inter, std::shared_ptr<Location> end,
|
||||
bool collectStarts) const;
|
||||
private:
|
||||
BooleanOpType Op;
|
||||
class CBooleanOperations
|
||||
{
|
||||
public:
|
||||
CBooleanOperations(CGraphicsPath* path1, CGraphicsPath* path2, BooleanOpType op);
|
||||
CGraphicsPath* GetResult();
|
||||
|
||||
CGraphicsPath *Path1;
|
||||
CGraphicsPath *Path2;
|
||||
CGraphicsPath *Result;
|
||||
// BooleanOp
|
||||
void TraceBoolean();
|
||||
void TracePaths();
|
||||
// void reorientPaths();
|
||||
|
||||
std::vector<Segment> Segments;
|
||||
std::vector<Segment> Segments1;
|
||||
std::vector<Segment> Segments2;
|
||||
|
||||
std::vector<Curve> Curves;
|
||||
std::vector<Curve> Curves1;
|
||||
std::vector<Curve> Curves2;
|
||||
// Path
|
||||
void PreparePath(CGraphicsPath* path, size_t id, std::vector<Segment>& segments, std::vector<Curve>& curves);
|
||||
void InsertSegment(const Segment& segment);
|
||||
Curve GetCurve(const Segment& segment) const;
|
||||
Curve GetPreviousCurve(const Curve& curve) const;
|
||||
Curve GetNextCurve(const Curve& curve) const;
|
||||
Segment GetNextSegment(const Segment& segment) const;
|
||||
std::vector<Curve> GetCurves(const std::vector<int>& indices) const;
|
||||
std::vector<Segment> GetCrossing(const Segment& seg, std::vector<Segment>& starts, bool collectStart) const;
|
||||
|
||||
std::vector<std::shared_ptr<Location>> Locations;
|
||||
bool OverlapOnly[2] = {true, true};
|
||||
};
|
||||
// Bounds
|
||||
std::vector<std::vector<double>> GetBoundsForCurves(const std::vector<Curve>& curves) const;
|
||||
std::vector<std::vector<int>> FindCurveBoundsCollisions(const std::vector<Curve>& curves1, const std::vector<Curve>& curves2, double tolerance, bool bothAxis = false);
|
||||
std::vector<std::vector<int>>
|
||||
FindBoundsCollisions(const std::vector<std::vector<double>>& bounds1, const std::vector<std::vector<double>>& bounds2, double tolerance, bool sweepVertical = false, bool onlySweep = false);
|
||||
|
||||
GRAPHICS_DECL CGraphicsPath* BooleanOperation(CGraphicsPath* path1, CGraphicsPath* path2, BooleanOpType op);
|
||||
}
|
||||
// Intersection
|
||||
bool IsCrossing(std::shared_ptr<Location> loc);
|
||||
bool FilterIntersections(std::shared_ptr<Location> loc);
|
||||
bool IntersectsBounds();
|
||||
void GetIntersection();
|
||||
void GetCurveIntersection(const Curve& curve1, const Curve& curve2);
|
||||
void LinkIntersection(std::shared_ptr<Location> form, std::shared_ptr<Location> to);
|
||||
void AddLineIntersection(const Curve& curve1, const Curve& curve2, bool flip);
|
||||
void AddCurveLineIntersection(const Curve& curve1, const Curve& curve2, bool flip);
|
||||
int AddCurveIntersection(const Curve& curve1, const Curve& curve2, bool flip, int recursion = 0, int calls = 0, double tMin = 0, double tMax = 1, double uMin = 0, double uMax = 1);
|
||||
|
||||
#endif //BOOLEANOPERATIONS_H
|
||||
// Location
|
||||
void DivideLocations();
|
||||
void AddLocation(Curve curve1, Curve curve2, double t1, double t2, bool overlap = false);
|
||||
void InsertLocation(std::shared_ptr<Location> loc);
|
||||
|
||||
// Util
|
||||
void ClearCurveHandles(std::vector<Curve>& curves);
|
||||
void AddOffsets(std::vector<double>& offsets, const Curve& curve, bool end);
|
||||
void PropagateWinding(Segment segment, std::vector<std::vector<Curve>> map);
|
||||
void Collect(const Segment& seg, std::vector<Segment>& crossing, std::vector<Segment>& starts, std::shared_ptr<Location> inter, std::shared_ptr<Location> end, bool collectStarts) const;
|
||||
|
||||
private:
|
||||
BooleanOpType Op;
|
||||
|
||||
CGraphicsPath* Path1;
|
||||
CGraphicsPath* Path2;
|
||||
CGraphicsPath* Result;
|
||||
|
||||
std::vector<Segment> Segments;
|
||||
std::vector<Segment> Segments1;
|
||||
std::vector<Segment> Segments2;
|
||||
|
||||
std::vector<Curve> Curves;
|
||||
std::vector<Curve> Curves1;
|
||||
std::vector<Curve> Curves2;
|
||||
|
||||
std::vector<std::shared_ptr<Location>> Locations;
|
||||
bool OverlapOnly[2] = {true, true};
|
||||
};
|
||||
} // namespace Aggplus
|
||||
|
||||
#endif // BOOLEANOPERATIONS_H
|
||||
|
||||
Reference in New Issue
Block a user