7
A
回答
5
这是一个相当陈旧的问题,但我发现它试图解决相同问题的时候。分享我遇到的解决方案是公平的,所以下一个可怜的闷棍不必自己弄清楚。
我不知道这是否是做事情特别好的方式,我想,如果你开始使用弧形细胞会挣扎,但我的目的,效果还行。
最根本的问题是,你只有无限的边缘一个顶点,所以你要自己计算的方向向量。使用方向垂直于由边缘分隔的两点之间的矢量。
#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()));
}
}
也可能会丢失一些类变量或方法,但逻辑是这里重要的。
相关问题
- 1. 如何让单边盒子阴影从边缘到边缘出现?
- 2. 边缘到边缘的HTML5视频
- 3. 侧边栏与纯边缘的边缘?
- 4. 使用边缘容器提升astar_search
- 5. 带索引的提升图边缘
- 6. 无边界窗体边缘
- 7. 边缘扩展chrome.storage.local 1MB限制
- 8. 边缘限制包含在一页内?
- 9. 如何在帧边缘接触另一个边缘时获取该边缘?
- 10. 如何从边缘
- 11. Google Sketchup中的明显边缘边缘
- 12. 带有无限边缘坐标的重叠框
- 13. 限制UITableView到其父视图的边缘,无故事板
- 14. 如何限制平移到画布边缘?
- 15. 边缘提取Suggections OpenCV的
- 16. UIBezierPath提供尖锐边缘
- 17. 让文字传播到div的边缘
- 18. networkx边缘到节点节点到边缘的表示
- 19. 如何测量边缘检测图像边缘的长度?
- 20. 如何将边缘标签放置在graphviz的边缘
- 21. 如何设置边缘长度与边缘值成比例
- 22. 如何更改JUNG边缘的边缘标签?
- 23. AForge.net边缘检测 - 如何获得边缘点?
- 24. SVG:边缘到边缘的黑色形状之间的无意的白色边缘
- 25. 边缘叠加
- 26. 边缘 - Cocos2d/Box2D
- 27. 边缘塌陷
- 28. 锐化边缘
- 29. 边缘Cytoscape中
- 30. 由边缘环
耶稣克里斯,为什么我们没有这个落实到库本身? o.O – PiotrK