提升rtree的框与段有错误的交集

Adr*_*san 2 c++ boost r-tree boost-geometry

Boost rtree为段查询的某些交集提供了错误的交集结果.在这种情况下,边界框是y = 0时的y平面10×10平方.我正在查询从(2,1,0)到(2,1,10)的z对齐线.有趣的是,如果我使用一个框进行查询而不是一个段,那么它会按预期工作.当框不是平面时,也会出现此行为,只需将最小角移动到(0,-5,0),它仍然会发生.

我使用这个错误还是增强中的错误?

编辑:在Boost 1.56和1.59上试过这个.

#include <vector>
#include "gtest/gtest.h"
#include "gmock/gmock.h"
#include <boost/geometry.hpp>
#include <boost/geometry/geometries/point.hpp>
#include <boost/geometry/geometries/box.hpp>
#include <boost/geometry/geometries/segment.hpp>
#include <boost/geometry/index/rtree.hpp>
#include <vector>
#include <iterator>
#include <memory>

namespace bg = boost::geometry;
namespace bgi = boost::geometry::index;
typedef bg::model::point<double, 3, bg::cs::cartesian> point_def;
typedef bg::model::box<point_def> box;
typedef bg::model::segment<point_def> segment;
typedef std::pair<box, size_t> tri_box;
typedef bgi::rtree< tri_box, bgi::linear<8>> tree_type;

using namespace std;

TEST(boost_rtree, cant_intersect_box_with_segment) {
  vector<tri_box> buff(1);
  buff[0].first = box{point_def{0, 0, 0}, point_def{10, 0, 10}};
  buff[0].second = 1;
  tree_type tree(buff);

  segment query{point_def{2, 1, 0}, point_def{2, 1, 10}};
//  box query{point_def{2, 1, 0}, point_def{2, 1, 10}};
  vector<tri_box> out;

  size_t count = tree.query(bgi::intersects(query), back_inserter(out));

  ASSERT_EQ(0, count); // fails here
  ASSERT_EQ(0, out.size());
}
Run Code Online (Sandbox Code Playgroud)

编辑:问题正在移动以提升邮件列表:lists.boost.org/geometry/2015/09/3472.php

seh*_*ehe 5

尽管看起来不太可能,但在我看来这是一个错误.

甚至编译它的第一个版本是Boost 1.56.所有以前的版本都失败了

BOOST_MPL_ASSERT_MSG
    (
        false, NOT_OR_NOT_YET_IMPLEMENTED_FOR_THIS_GEOMETRY_TYPE
        , (types<Geometry>)
    );
Run Code Online (Sandbox Code Playgroud)

但是,即使编译代码,它似乎也不正确......:intersects查询谓词本身的调用似乎返回"误报".

很简化: Live On Coliru

#include <boost/geometry.hpp>
#include <boost/geometry/geometries/box.hpp>
#include <boost/geometry/geometries/segment.hpp>

namespace bg  = boost::geometry;

typedef bg::model::point<int, 3, bg::cs::cartesian> point;
typedef bg::model::box<point>     box;
typedef bg::model::segment<point> segment;

int main() {
    box y0rect = box{point{0, 0, 0}, point{10, 0, 10}};
    segment seg{point{2, 1, 0}, point{2, 1, 10}};

    bg::correct(y0rect);
    bg::correct(seg);
    assert(!bg::intersects(seg, y0rect));
}
Run Code Online (Sandbox Code Playgroud)

UPDATE

有趣的是,它似乎有时正常工作2d.我不确定结果是不是简单的未定义......

Live On Coliru

#include <boost/geometry.hpp>
#include <boost/geometry/geometries/box.hpp>
#include <boost/geometry/geometries/segment.hpp>

namespace bg  = boost::geometry;

typedef bg::model::point<int, 4, bg::cs::cartesian> point;
typedef bg::model::box<point>     box;
typedef bg::model::segment<point> segment;

int main() {
    box y0rect = box{point{0, 0}, point{10, 10}};
    bg::correct(y0rect);

    {
        segment seg{point{12, 0}, point{20, 10}};
        bg::correct(seg);
        assert(!bg::intersects(seg, y0rect));
    }
    {
        segment seg{point{2, 0}, point{8, 6}};
        bg::correct(seg);
        assert(bg::intersects(seg, y0rect));
    }
    {
        segment seg{point{2, 0}, point{18, 6}};
        bg::correct(seg);
        assert(bg::intersects(seg, y0rect)); // OOPS BREAKS?
    }
}
Run Code Online (Sandbox Code Playgroud)