我使用升压几何模型创建了线段。我想知道是否有一种方法可以将线段分为N个相等的线段。

请不要将此问题视为this的重复版本。
(编辑)
因为过时,我已经尝试过为该问题提供答案。

最佳答案

想到的最简单的事情是:

Live On Coliru

#include <boost/geometry/geometry.hpp>
#include <boost/geometry/io/io.hpp>
#include <boost/geometry/arithmetic/arithmetic.hpp>
#include <boost/geometry/geometries/segment.hpp>
#include <boost/geometry/geometries/point_xy.hpp>
#include <boost/geometry/geometries/linestring.hpp>

#include <iostream>

template <typename Segment, typename Point = typename boost::geometry::point_type<Segment>::type>
auto split_into(unsigned N, Segment const& s) {
    using namespace boost::geometry;
    assert(N>1);

    auto step = s.second;
    subtract_point(step, s.first);
    divide_value(step, N-1);

    std::vector<Point> segments;
    std::generate_n(back_inserter(segments), N, [accu=s.first, step] () mutable { Point p = accu; return add_point(accu, step), p; });

    return model::linestring<Point> {segments.begin(), segments.end()};
}

using namespace boost::geometry;
using Point = model::d2::point_xy<double>;

int main() {
    model::segment<Point> const line { {1,3}, {11,33} };

    std::cout << wkt(line) << "\n";
    std::cout << wkt(split_into(5, line)) << "\n";
}

版画
LINESTRING(1 3,11 33)
LINESTRING(1 3,3.5 10.5,6 18,8.5 25.5,11 33)

花式系列

对于较大的N,可能会更好地扩展:

Live On Coliru
#include <boost/range/adaptors.hpp>
#include <boost/range/irange.hpp>

template <typename Segment, typename Point = typename boost::geometry::point_type<Segment>::type>
auto split_into(unsigned N, Segment const& s) {
    using namespace boost::geometry;
    using namespace boost::adaptors;
    assert(N>1);

    auto step = s.second;
    subtract_point(step, s.first);
    divide_value(step, N-1);

    auto gen = boost::irange(0u, N) | transformed([=](int i) { auto p = step; multiply_value(p, i); add_point(p, s.first); return p; });
    return model::linestring<Point> { boost::begin(gen), boost::end(gen) };
}

版画
LINESTRING(1 3,11 33)
LINESTRING(1 3,3.5 10.5,6 18,8.5 25.5,11 33)

关于c++ - 使用增压几何将增压段划分为N个相等的段,我们在Stack Overflow上找到一个类似的问题:https://stackoverflow.com/questions/36127895/

10-11 18:12