c++ - 如何从 Subdiv2D Delaunay 三角剖分获取顶点索引

Question

我正在使用 OpenCV 3.1，想知道如何在 Subdiv2D Delaunay 三角剖分中获取边的顶点索引，而不仅仅是顶点坐标？我想使用这个索引来保留顶点值以进行进一步的插值。

例如:

cv::Subdiv2D subdiv(rect);
// Insert some points to subdiv....
cv::Point2f org, dst;
subdiv.edgeOrg(edge, &org); // starting point of edge

这只给我 org 中的顶点坐标。

我看到在 OpenCV 2.4 中，我们可以使用 CvSubdiv2DPoint类型，除了标准的 Point32f 之外，它还包含 id。在 OpenCV 3.1 中，我找不到这个结构，看起来它由于某种原因已被删除。

Answer 1

如果有人看那个问题。您可以创建一个继承自 subdiv2D 的类，并实现您自己的以这种方式返回索引的函数:

.h

#ifndef __Subdiv2DIndex__
#define __Subdiv2DIndex__

#include <vector>
#include <opencv2\opencv.hpp>
using namespace cv;

class Subdiv2DIndex : public Subdiv2D
{
public :
  Subdiv2DIndex(Rect rectangle);

  //Source code of Subdiv2D: https://github.com/opencv/opencv/blob/master/modules/imgproc/src/subdivision2d.cpp#L762
  //The implementation tweaks getTrianglesList() so that only the indice of the triangle inside the image are returned
  void getTrianglesIndices(std::vector<int> &ind) const;
};

#endif

.cpp #include "Subdiv2DIndex.h"

Subdiv2DIndex::Subdiv2DIndex(Rect rectangle) : Subdiv2D{rectangle}
{
}

void Subdiv2DIndex::getTrianglesIndices(std::vector<int> &triangleList) const
{
  triangleList.clear();
  int i, total = (int)(qedges.size() * 4);
  std::vector<bool> edgemask(total, false);
  const bool filterPoints = true;
  Rect2f rect(topLeft.x, topLeft.y, bottomRight.x - topLeft.x, bottomRight.y - topLeft.y);

  for (i = 4; i < total; i += 2)
  {
    if (edgemask[i])
      continue;
    Point2f a, b, c;
    int edge_a = i;
    int indexA = edgeOrg(edge_a, &a) -4;
    if (filterPoints && !rect.contains(a))
      continue;
    int edge_b = getEdge(edge_a, NEXT_AROUND_LEFT);
    int indexB = edgeOrg(edge_b, &b) - 4;
    if (filterPoints && !rect.contains(b))
      continue;
    int edge_c = getEdge(edge_b, NEXT_AROUND_LEFT);
    int indexC = edgeOrg(edge_c, &c) - 4;
    if (filterPoints && !rect.contains(c))
      continue;
    edgemask[edge_a] = true;
    edgemask[edge_b] = true;
    edgemask[edge_c] = true;

    triangleList.push_back(indexA);
    triangleList.push_back(indexB);
    triangleList.push_back(indexC);
  }
}