diff options
author | Daniel Baumann <daniel.baumann@progress-linux.org> | 2024-04-13 11:50:49 +0000 |
---|---|---|
committer | Daniel Baumann <daniel.baumann@progress-linux.org> | 2024-04-13 11:50:49 +0000 |
commit | c853ffb5b2f75f5a889ed2e3ef89b818a736e87a (patch) | |
tree | 7d13a0883bb7936b84d6ecdd7bc332b41ed04bee /src/helper/geom.h | |
parent | Initial commit. (diff) | |
download | inkscape-c853ffb5b2f75f5a889ed2e3ef89b818a736e87a.tar.xz inkscape-c853ffb5b2f75f5a889ed2e3ef89b818a736e87a.zip |
Adding upstream version 1.3+ds.upstream/1.3+dsupstream
Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>
Diffstat (limited to 'src/helper/geom.h')
-rw-r--r-- | src/helper/geom.h | 159 |
1 files changed, 159 insertions, 0 deletions
diff --git a/src/helper/geom.h b/src/helper/geom.h new file mode 100644 index 0000000..50e434d --- /dev/null +++ b/src/helper/geom.h @@ -0,0 +1,159 @@ +// SPDX-License-Identifier: GPL-2.0-or-later +#ifndef INKSCAPE_HELPER_GEOM_H +#define INKSCAPE_HELPER_GEOM_H + +/** + * @file + * Specific geometry functions for Inkscape, not provided my lib2geom. + */ +/* + * Author: + * Johan Engelen <goejendaagh@zonnet.nl> + * + * Copyright (C) 2008 Johan Engelen + * + * Released under GNU GPL v2+, read the file 'COPYING' for more information. + */ + +#include <vector> +#include <2geom/forward.h> +#include <2geom/rect.h> +#include <2geom/affine.h> +#include "mathfns.h" + +Geom::OptRect bounds_fast_transformed(Geom::PathVector const & pv, Geom::Affine const & t); +Geom::OptRect bounds_exact_transformed(Geom::PathVector const & pv, Geom::Affine const & t); + +void pathv_matrix_point_bbox_wind_distance ( Geom::PathVector const & pathv, Geom::Affine const &m, Geom::Point const &pt, + Geom::Rect *bbox, int *wind, Geom::Coord *dist, + Geom::Coord tolerance, Geom::Rect const *viewbox); + +bool pathvs_have_nonempty_overlap(Geom::PathVector const &a, Geom::PathVector const &b); + +size_t count_pathvector_nodes(Geom::PathVector const &pathv ); +size_t count_path_nodes(Geom::Path const &path); +size_t count_pathvector_degenerations(Geom::PathVector const &pathv ); +size_t count_path_degenerations(Geom::Path const &path); +bool pointInTriangle(Geom::Point const &p, Geom::Point const &p1, Geom::Point const &p2, Geom::Point const &p3); +Geom::PathVector pathv_to_linear_and_cubic_beziers( Geom::PathVector const &pathv ); +Geom::PathVector pathv_to_linear( Geom::PathVector const &pathv, double maxdisp ); +Geom::PathVector pathv_to_cubicbezier( Geom::PathVector const &pathv, bool nolines); +size_t pathv_real_size(Geom::Path path); +bool pathv_similar(Geom::PathVector const &apv, Geom::PathVector const &bpv, double precission = 0.001); +void recursive_bezier4(const double x1, const double y1, const double x2, const double y2, + const double x3, const double y3, const double x4, const double y4, + std::vector<Geom::Point> &pointlist, + int level); +bool approx_dihedral(Geom::Affine const &affine, double eps = 0.0001); +std::pair<Geom::Affine, Geom::Rect> min_bounding_box(std::vector<Geom::Point> const &pts); + +/// Returns signed area of triangle given by points; may be negative. +inline Geom::Coord triangle_area(Geom::Point const &p1, Geom::Point const &p2, Geom::Point const &p3) +{ + using Geom::X; + using Geom::Y; + return p1[X] * p2[Y] + p1[Y] * p3[X] + p2[X] * p3[Y] - p2[Y] * p3[X] - p1[Y] * p2[X] - p1[X] * p3[Y]; +} + +inline auto rounddown(Geom::IntPoint const &a, Geom::IntPoint const &b) +{ + using namespace Inkscape::Util; + return Geom::IntPoint(rounddown(a.x(), b.x()), rounddown(a.y(), b.y())); +} + +inline auto expandedBy(Geom::IntRect rect, int amount) +{ + rect.expandBy(amount); + return rect; +} + +inline auto expandedBy(Geom::Rect rect, double amount) +{ + rect.expandBy(amount); + return rect; +} + +inline Geom::OptRect expandedBy(Geom::OptRect const &rect, double amount) +{ + if (!rect) { + return {}; + } else { + return expandedBy(*rect, amount); + } +} + +inline auto operator/(double a, Geom::Point const &b) +{ + return Geom::Point(a / b.x(), a / b.y()); +} + +inline auto absolute(Geom::Point const &a) +{ + return Geom::Point(std::abs(a.x()), std::abs(a.y())); +} + +inline auto min(Geom::IntPoint const &a) +{ + return std::min(a.x(), a.y()); +} + +inline auto min(Geom::Point const &a) +{ + return std::min(a.x(), a.y()); +} + +inline auto max(Geom::IntPoint const &a) +{ + return std::max(a.x(), a.y()); +} + +inline auto max(Geom::Point const &a) +{ + return std::max(a.x(), a.y()); +} + +/// Get the bounding box of a collection of points. +template <typename... Args> +auto bounds_of(Geom::Point const &pt, Args const &... args) +{ + if constexpr (sizeof...(args) == 0) { + return Geom::Rect(pt, pt); + } else { + auto rect = bounds_of(args...); + rect.expandTo(pt); + return rect; + } +} + +inline auto floor(Geom::Rect const &rect) +{ + return Geom::Rect(rect.min().floor(), rect.max().floor()); +} + +inline auto roundedOutwards(Geom::OptRect const &rect) +{ + return rect ? rect->roundOutwards() : Geom::OptIntRect(); +} + +/** + * Compute the maximum factor by which @a affine can increase a vector's length. + */ +inline double max_expansion(Geom::Affine const &affine) +{ + auto const t = (Geom::sqr(affine[0]) + Geom::sqr(affine[1]) + Geom::sqr(affine[2]) + Geom::sqr(affine[3])) / 2; + auto const d = std::abs(affine.det()); + return std::sqrt(t + std::sqrt(std::max(t - d, 0.0) * (t + d))); +} + +#endif // INKSCAPE_HELPER_GEOM_H + +/* + Local Variables: + mode:c++ + c-file-style:"stroustrup" + c-file-offsets:((innamespace . 0)(inline-open . 0)(case-label . +)) + indent-tabs-mode:nil + fill-column:99 + End: +*/ +// vim: filetype=cpp:expandtab:shiftwidth=4:tabstop=8:softtabstop=4:fileencoding=utf-8:textwidth=99 : |