Question

我修改了计算几何cgal库（link）给出的示例，该示例演示了在2D平面上的增量搜索（第49.3.2节）。该示例使用仿函数来设置空间边界，以便仅搜索平面上的正点。

我想修改仿函数，以便传递k，如struct X_not_positive_k所示。下面的完整示例程序显示了修改后的代码和原始代码。

#include <CGAL/Simple_cartesian.h>
#include <CGAL/Orthogonal_incremental_neighbor_search.h>
#include <CGAL/Search_traits_2.h>

typedef CGAL::Simple_cartesian<double> K;
typedef K::Point_2 Point_d;
typedef CGAL::Search_traits_2<K> TreeTraits;
typedef CGAL::Orthogonal_incremental_neighbor_search<TreeTraits> NN_incremental_search;
typedef NN_incremental_search::iterator NN_iterator;
typedef NN_incremental_search::Tree Tree;

int main() {

    Tree tree;
    tree.insert(Point_d(0,0));
    tree.insert(Point_d(1,1));
    tree.insert(Point_d(0,1));
    tree.insert(Point_d(10,110));
    tree.insert(Point_d(45,0));
    tree.insert(Point_d(0,2340));
    tree.insert(Point_d(0,30));

    Point_d query(0,0);

    // A functor that returns true, iff the x-coordinate of a dD point is not positive
    // [ORIGINAL CODE]
    struct X_not_positive {
        bool operator()(const NN_iterator& it) { return ((*it).first)[0]<0;  }
    };

    // [MODIFIED CODE]
    // This does not work when used below.
    struct X_not_positive_k {
    public:
        void assign_k(int k) {this->k = k; }
        bool operator()(const NN_iterator& it) { return ((*it).first)[0] < k;  }
    private:
        int k;
    };
    X_not_positive_k Xk;
    Xk.assign_k(1);

    // An iterator that only enumerates dD points with positive x-coordinate
    // [ORIGINAL CODE]
    // typedef CGAL::Filter_iterator<NN_iterator, X_not_positive> NN_positive_x_iterator;

    // [MODIFIED CODE]
    typedef CGAL::Filter_iterator<NN_iterator, X_not_positive_k> NN_positive_x_iterator;

    NN_incremental_search NN(tree, query);

    // [ORIGINAL CODE]
    // NN_positive_x_iterator it(NN.end(), X_not_positive(), NN.begin()), end(NN.end(), X_not_positive());

    // [MODIFIED CODE]
    NN_positive_x_iterator it(NN.end(), Xk(), NN.begin()), end(NN.end(), Xk()); 
    // error occurs here

    std::cout <<  "The first 5 nearest neighbours with positive x-coord are: " << std::endl;
    for (int j=0; (j < 5)&&(it!=end); ++j,++it)
        std::cout <<   (*it).first << "  at squared distance = " << (*it).second << std::endl;

return 0;
}

但是，编译此程序（Windows 7与Visual Studio 2010）会导致以下编译器错误。错误的位置标记在上面的代码中。

2>..\main.cpp(56): error C2064: term does not evaluate to a function taking 0 arguments
2>          class does not define an 'operator()' or a user defined conversion operator to a pointer-to-function or reference-to-function that takes appropriate number of arguments
2>..\main.cpp(56): error C2064: term does not evaluate to a function taking 0 arguments
2>          class does not define an 'operator()' or a user defined conversion operator to a pointer-to-function or reference-to-function that takes appropriate number of arguments
2>

可以做些什么来摆脱错误？还有另一种方法可以设置k变量吗？

Answer 1

只需将您的Xk()替换为第56行中的Xk

或者用构造函数参数替换assign(k)，然后替换Xk() 与X_not_positive_k(1)

实际上真正的麻烦是算子的名字！将姓名X_not_positive_k替换为X_less_than - 因此第56行的X_less_than(1)调用看起来不错

像这样：

struct X_less_than {
public:
    X_less_than(int i)
      : k(i)
    {
    }
    bool operator()(const NN_iterator& it) { return ((*it).first)[0] < k;  }
private:
    int k;
};

Answer 2

你的错误在于

NN_positive_x_iterator it(.., X_not_positive(), .. )

X_not_positive是类型，X_not_positive()是构造函数的调用，

在代码中

NN_positive_x_iterator it(.., Xk(),.. )

Xk不是类型而是对象，Xk()是对operator()的调用这是具有零参数的函数运算符，因此也就是错误消息。

安德烈亚斯

使用cgal进行增量空间搜索时修改仿函数变量

2 个答案: