mirror of
https://github.com/RGBCube/serenity
synced 2025-05-22 19:45:08 +00:00
677568e3d4
This allows the painter to render filled complex shapes better, by constructing a path graph for (interesting) intersecting lines and omitting lines from the containing segments if they are detected to take no part in defining the edges of a shape. This approach would still fail if there are multiple logical shapes that are confined to the collection of lines. For instance, two polygons intersecting each other in a way that one vertex of polygon A ends up inside polygon B. we would detect that polygon A's edges are part of the shape (technically correct) even though they are not a part of polygon B at all.
135 lines
3.8 KiB
C++
135 lines
3.8 KiB
C++
/*
|
|
* Copyright (c) 2020, Andreas Kling <kling@serenityos.org>
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are met:
|
|
*
|
|
* 1. Redistributions of source code must retain the above copyright notice, this
|
|
* list of conditions and the following disclaimer.
|
|
*
|
|
* 2. Redistributions in binary form must reproduce the above copyright notice,
|
|
* this list of conditions and the following disclaimer in the documentation
|
|
* and/or other materials provided with the distribution.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
|
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
|
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
|
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <AK/HashMap.h>
|
|
#include <AK/Optional.h>
|
|
#include <AK/Vector.h>
|
|
#include <LibGfx/FloatPoint.h>
|
|
#include <LibGfx/Forward.h>
|
|
|
|
namespace Gfx {
|
|
|
|
class Path {
|
|
public:
|
|
struct Segment {
|
|
enum class Type {
|
|
Invalid,
|
|
MoveTo,
|
|
LineTo,
|
|
QuadraticBezierCurveTo,
|
|
};
|
|
|
|
Type type { Type::Invalid };
|
|
FloatPoint point;
|
|
Optional<FloatPoint> through {};
|
|
};
|
|
|
|
Path() { }
|
|
|
|
void move_to(const FloatPoint& point)
|
|
{
|
|
m_segments.append({ Segment::Type::MoveTo, point });
|
|
}
|
|
|
|
void line_to(const FloatPoint& point)
|
|
{
|
|
m_segments.append({ Segment::Type::LineTo, point });
|
|
invalidate_split_lines();
|
|
}
|
|
|
|
void quadratic_bezier_curve_to(const FloatPoint& through, const FloatPoint& point)
|
|
{
|
|
m_segments.append({ Segment::Type::QuadraticBezierCurveTo, point, through });
|
|
invalidate_split_lines();
|
|
}
|
|
|
|
void close();
|
|
|
|
struct LineSegment {
|
|
Point from, to;
|
|
float inverse_slope;
|
|
float x_of_minimum_y;
|
|
float maximum_y;
|
|
float minimum_y;
|
|
float x;
|
|
};
|
|
|
|
enum ShapeKind {
|
|
Simple,
|
|
Complex,
|
|
};
|
|
|
|
const Vector<Segment>& segments() const { return m_segments; }
|
|
Vector<LineSegment> split_lines(ShapeKind);
|
|
const auto& split_lines()
|
|
{
|
|
if (m_split_lines.has_value())
|
|
return m_split_lines.value();
|
|
segmentize_path();
|
|
ASSERT(m_split_lines.has_value());
|
|
return m_split_lines.value();
|
|
}
|
|
|
|
String to_string() const;
|
|
|
|
private:
|
|
void invalidate_split_lines()
|
|
{
|
|
m_split_lines.clear();
|
|
m_graph_node_map.clear();
|
|
}
|
|
void segmentize_path();
|
|
void generate_path_graph();
|
|
bool is_part_of_closed_polygon(const Point& p0, const Point& p1);
|
|
static unsigned hash_line(const Point& from, const Point& to);
|
|
|
|
Vector<Segment> m_segments;
|
|
|
|
Optional<Vector<LineSegment>> m_split_lines {};
|
|
|
|
struct PathGraphNode {
|
|
PathGraphNode(u32 hash, const LineSegment& line)
|
|
: hash(hash)
|
|
, line(line)
|
|
{
|
|
}
|
|
|
|
Vector<const PathGraphNode*> children;
|
|
u32 hash;
|
|
LineSegment line;
|
|
};
|
|
|
|
Optional<HashMap<u32, OwnPtr<PathGraphNode>>> m_graph_node_map;
|
|
};
|
|
|
|
inline const LogStream& operator<<(const LogStream& stream, const Path& path)
|
|
{
|
|
return stream << path.to_string();
|
|
}
|
|
|
|
}
|