【问题标题】:how to give make infinite edge in boost to a finite edge?如何在提升有限边缘时赋予无限边缘?
【发布时间】:2013-01-11 15:50:45
【问题描述】:

我发现在boost库中,对于voronoi图,有些边缘数据是无限的。根据说明,它必须被剪裁。但我找不到怎么做。 谁能给我一个示例代码,好吗?

谢谢

【问题讨论】:

    标签: c++ boost voronoi


    【解决方案1】:

    这是一个相当陈旧的问题,但我在尝试解决完全相同的问题时发现了它。分享我遇到的解决方案是公平的,这样下一个可怜的 sap 就不必自己弄清楚了。

    我不知道这是否是一种特别好的做事方式,我怀疑如果你开始使用弯曲单元格会很困难,但它对我的目的来说效果很好。

    基本问题是无限边只有一个顶点,所以必须自己计算方向向量。使用的方向垂直于由边缘隔开的两点之间的向量。

    #include <vector>
    #include <boost/polygon/voronoi.hpp>
    using boost::polygon::voronoi_builder;
    using boost::polygon::voronoi_diagram;
    
    typedef boost::polygon::point_data<int> point;
    typedef voronoi_diagram<double>::cell_type cell_type;
    typedef voronoi_diagram<double>::edge_type edge_type;
    typedef voronoi_diagram<double>::vertex_type vertex_type;
    
    int main(int argc, char *argv[])
    {
       std::vector<point> points;
    
       // Populate with random points
       for (int i = 0; i < 50; i++)
       {
          points.push_back(point(60 + rand() % 500, 60 + rand() % 500));
       }
    
       voronoi_diagram<double> vd;
       construct_voronoi(points.begin(), points.end(), &vd);
    
       // vd now contains the voronoi diagram. Let's visualise it
       // pseudocode 'draw_line(x1, y1, x2, y2)'
    
       for (voronoi_diagram<double>::const_cell_iterator it = vd.cells().begin();
            it != vd.cells().end(); ++it)
       {
          const cell_type& cell = *it;
          const edge_type* edge = cell.incident_edge();
    
          do
          {
             if (edge->is_primary())
             {
                // Easy finite edge case
                if (edge->is_finite())
                {
                   // Without this check each edge would be drawn twice
                   // as they are really half-edges
                   if (edge->cell()->source_index() < 
                       edge->twin()->cell()->source_index())
                   {
                      draw_line(edge->vertex0()->x(), edge->vertex0()->y(),
                                edge->vertex1()->x(), edge->vertex1()->y());
                   }
                }
                else
                {
                   // This covers the infinite edge case in question.
                   const vertex_type* v0 = edge->vertex0();
                   // Again, only consider half the half-edges, ignore edge->vertex1()
                   // to avoid overdrawing the lines
                   if (v0)
                   {
                      // Direction of infinite edge if perpendicular to direction
                      // between the points owning the two half edges. 
                      // Take the rotated right vector and multiply by a large 
                      // enough number to reach your bounding box
                      point p1 = points[edge->cell()->source_index()];
                      point p2 = points[edge->twin()->cell()->source_index()];
                      int end_x = (p1.y() - p2.y()) * 640;
                      int end_y = (p1.x() - p2.x()) * -640;
    
                      draw_line(v0->x(), v0->y(),
                                end_x, end_y);
                   }
                }
             }
             edge = edge->next();
          } while (edge != cell.incident_edge());
       }
    }
    

    【讨论】:

      【解决方案2】:

      我在这里找到了这段代码:http://www.boost.org/doc/libs/1_55_0/libs/polygon/example/voronoi_visualizer.cpp

      void clip_infinite_edge(
            const edge_type& edge, std::vector<point_type>* clipped_edge) {
          const cell_type& cell1 = *edge.cell();
          const cell_type& cell2 = *edge.twin()->cell();
          point_type origin, direction;
          // Infinite edges could not be created by two segment sites.
          if (cell1.contains_point() && cell2.contains_point()) {
            point_type p1 = retrieve_point(cell1);
            point_type p2 = retrieve_point(cell2);
            origin.x((p1.x() + p2.x()) * 0.5);
            origin.y((p1.y() + p2.y()) * 0.5);
            direction.x(p1.y() - p2.y());
            direction.y(p2.x() - p1.x());
          } else {
            origin = cell1.contains_segment() ?
                retrieve_point(cell2) :
                retrieve_point(cell1);
            segment_type segment = cell1.contains_segment() ?
                retrieve_segment(cell1) :
                retrieve_segment(cell2);
            coordinate_type dx = high(segment).x() - low(segment).x();
            coordinate_type dy = high(segment).y() - low(segment).y();
            if ((low(segment) == origin) ^ cell1.contains_point()) {
              direction.x(dy);
              direction.y(-dx);
            } else {
              direction.x(-dy);
              direction.y(dx);
            }
          }
          coordinate_type side = xh(brect_) - xl(brect_);
          coordinate_type koef =
              side / (std::max)(fabs(direction.x()), fabs(direction.y()));
          if (edge.vertex0() == NULL) {
            clipped_edge->push_back(point_type(
                origin.x() - direction.x() * koef,
                origin.y() - direction.y() * koef));
          } else {
            clipped_edge->push_back(
                point_type(edge.vertex0()->x(), edge.vertex0()->y()));
          }
          if (edge.vertex1() == NULL) {
            clipped_edge->push_back(point_type(
                origin.x() + direction.x() * koef,
                origin.y() + direction.y() * koef));
          } else {
            clipped_edge->push_back(
                point_type(edge.vertex1()->x(), edge.vertex1()->y()));
          }
        }
      

      它可能缺少一些类变量或方法,但这里的逻辑很重要。

      【讨论】:

        【解决方案3】:

        我编写了一个程序来裁剪 Voronoi 单元格中的无限边缘,以便将边缘限制在矩形边界框内。代码在 https://github.com/datajaguar/jaguardb/blob/master/src/JagCGAL.cc

        getIntersectionPointWithBox() 方法基本上检查边界框的每一边(总共 4 条边),如果有则获取交点。 fillInCorners() 方法检查边界框周围的缺失点并将角坐标添加到边缘。要为每个单元格制作一个多边形,它会在末尾添加第一个点以使多边形闭合。

        【讨论】:

          猜你喜欢
          • 1970-01-01
          • 1970-01-01
          • 2012-12-30
          • 1970-01-01
          • 2022-07-07
          • 2017-06-13
          • 1970-01-01
          • 2014-09-24
          • 1970-01-01
          相关资源
          最近更新 更多