Subject: [Boost-commit] svn:boost r77590 - in sandbox/gtl: boost/polygon/detail doc/images libs/polygon/voronoi_example
From: sydorchuk.andriy_at_[hidden]
Date: 2012-03-27 15:06:29
Author: asydorchuk
Date: 2012-03-27 15:06:28 EDT (Tue, 27 Mar 2012)
New Revision: 77590
URL: http://svn.boost.org/trac/boost/changeset/77590
Log:
Added full code example for the basic Voronoi tutorial.
Adding memory.h header that is required on some Linux machines to the voronoi_ctypes.hpp.
Added:
sandbox/gtl/doc/images/voronoi4.png (contents, props changed)
sandbox/gtl/libs/polygon/voronoi_example/voronoi_basic_tutorial.cpp (contents, props changed)
Text files modified:
sandbox/gtl/boost/polygon/detail/voronoi_ctypes.hpp | 2 ++
sandbox/gtl/libs/polygon/voronoi_example/voronoi_visualizer.cpp | 2 +-
2 files changed, 3 insertions(+), 1 deletions(-)
Modified: sandbox/gtl/boost/polygon/detail/voronoi_ctypes.hpp
==============================================================================
--- sandbox/gtl/boost/polygon/detail/voronoi_ctypes.hpp (original)
+++ sandbox/gtl/boost/polygon/detail/voronoi_ctypes.hpp 2012-03-27 15:06:28 EDT (Tue, 27 Mar 2012)
@@ -11,6 +11,8 @@
#define BOOST_POLYGON_DETAIL_VORONOI_CTYPES
#include <cmath>
+#include <memory.h>
+
#include <boost/cstdint.hpp>
namespace boost {
Added: sandbox/gtl/doc/images/voronoi4.png
==============================================================================
Binary file. No diff available.
Added: sandbox/gtl/libs/polygon/voronoi_example/voronoi_basic_tutorial.cpp
==============================================================================
--- (empty file)
+++ sandbox/gtl/libs/polygon/voronoi_example/voronoi_basic_tutorial.cpp 2012-03-27 15:06:28 EDT (Tue, 27 Mar 2012)
@@ -0,0 +1,191 @@
+// Boost.Polygon library voronoi_basic_tutorial.cpp file
+
+// Copyright Andrii Sydorchuk 2010-2012.
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+
+// See http://www.boost.org for updates, documentation, and revision history.
+
+#include <cstdio>
+#include <vector>
+
+#include "boost/polygon/voronoi.hpp"
+#include "boost/polygon/voronoi_utils.hpp"
+using namespace boost::polygon;
+
+class Point {
+public:
+ Point() {}
+ Point(int x, int y) { x_ = x; y_ = y; }
+
+ // Those accessors are required!
+ int x() const { return x_; }
+ int y() const { return y_; }
+
+private:
+ // Don't forget should be castable to the signed int32 type!
+ int x_;
+ int y_;
+};
+
+class Segment {
+public:
+ Segment() {}
+ Segment(int x1, int y1, int x2, int y2) : p0(x1, y1), p1(x2, y2) {}
+
+ // Those accessors are required!
+ Point low() const { return p0; }
+ Point high() const { return p1; }
+
+private:
+ Point p0;
+ Point p1;
+};
+
+// Traversing Voronoi edges using edge iterator.
+int iterate_primary_edges1(const voronoi_diagram<double> &vd) {
+ int result = 0;
+ for (voronoi_diagram<double>::const_edge_iterator it = vd.edges().begin();
+ it != vd.edges().end(); ++it) {
+ if (it->is_primary())
+ ++result;
+ }
+ return result;
+}
+
+// Traversing Voronoi edges using cell iterator.
+int iterate_primary_edges2(const voronoi_diagram<double> &vd) {
+ int result = 0;
+ for (voronoi_diagram<double>::const_cell_iterator it = vd.cells().begin();
+ it != vd.cells().end(); ++it) {
+ const voronoi_diagram<double>::cell_type &cell = *it;
+ const voronoi_diagram<double>::edge_type *edge = cell.incident_edge();
+ // This is convenient way to iterate edges around Voronoi cell.
+ do {
+ if (edge->is_primary())
+ ++result;
+ edge = edge->next();
+ } while (edge != cell.incident_edge());
+ }
+ return result;
+}
+
+// Traversing Voronoi edges using vertex iterator.
+// As opposite to the above two functions this one will not iterate through edges
+// without finite endpoints and will iterate only once through edges with single
+// finite endpoint.
+int iterate_primary_edges3(const voronoi_diagram<double> &vd) {
+ int result = 0;
+ for (voronoi_diagram<double>::const_vertex_iterator it = vd.vertices().begin();
+ it != vd.vertices().end(); ++it) {
+ const voronoi_diagram<double>::vertex_type &vertex = *it;
+ const voronoi_diagram<double>::edge_type *edge = vertex.incident_edge();
+ // This is convenient way to iterate edges around Voronoi vertex.
+ do {
+ if (edge->is_primary())
+ ++result;
+ edge = edge->rot_next();
+ } while (edge != vertex.incident_edge());
+ }
+ return result;
+}
+
+// Prototype of a function that renders segments.
+void draw_segment(double x1, double y1, double x2, double y2) {
+ printf("Rendering segment: ");
+ printf("%7.3f %7.3f %7.3f %7.3f\n", x1, y1, x2, y2);
+}
+
+void render_diagram(const voronoi_diagram<double> &vd,
+ const voronoi_utils<double>::brect_type &bbox) {
+ int visited = 1;
+ for (voronoi_diagram<double>::const_edge_iterator it = vd.edges().begin();
+ it != vd.edges().end(); ++it) {
+ // We use data pointer to mark visited edges.
+ it->data(&visited);
+ // Don't render the same edge twice.
+ if (it->twin()->data()) continue;
+ voronoi_utils<double>::point_set_type polyline;
+ if (it->is_linear())
+ voronoi_utils<double>::clip(*it, bbox, polyline);
+ else
+ // Parabolic edges are always finite.
+ voronoi_utils<double>::discretize(*it, 1E-1, polyline);
+ // Note: discretized edges may also lie outside of the bbox.
+ // So user might do additional clipping before rendering each such edge.
+ for (int i = 1; i < polyline.size(); ++i)
+ draw_segment(polyline[i-1].x(), polyline[i-1].y(),
+ polyline[i].x(), polyline[i].y());
+ }
+}
+
+int main() {
+ // Preparing Input Geometries.
+ std::vector<Point> points;
+ points.push_back(Point(0, 0));
+ points.push_back(Point(1, 6));
+ std::vector<Segment> segments;
+ segments.push_back(Segment(-4, 5, 5, -1));
+ segments.push_back(Segment(3, -11, 13, -1));
+
+ // Construction of the Voronoi Diagram.
+ voronoi_diagram<double> vd;
+ construct_voronoi(points, segments, &vd);
+
+ // Traversing Voronoi Graph.
+ {
+ printf("Traversing Voronoi graph.\n");
+ printf("Number of visited primary edges using edge iterator: %d\n", iterate_primary_edges1(vd));
+ printf("Number of visited primary edges using cell iterator: %d\n", iterate_primary_edges2(vd));
+ printf("Number of visited primary edges using vertex iterator: %d\n", iterate_primary_edges3(vd));
+ printf("\n");
+ }
+
+ // Associating User Data with Voronoi Primitives.
+ std::vector<int> counts;
+ {
+ // This is required as reallocation of underlying vector will invalidate all the pointers.
+ counts.reserve(vd.num_cells());
+ for (voronoi_diagram<double>::const_cell_iterator it = vd.cells().begin();
+ it != vd.cells().end(); ++it) {
+ const voronoi_diagram<double>::cell_type &cell = *it;
+ const voronoi_diagram<double>::edge_type *edge = cell.incident_edge();
+ int count = 0;
+ do {
+ ++count;
+ edge = edge->next();
+ } while (edge != cell.incident_edge());
+ counts.push_back(count);
+ cell.data(&counts.back());
+ }
+
+ // Count the average number of edges.
+ double total = 0;
+ for (voronoi_diagram<double>::const_cell_iterator it = vd.cells().begin();
+ it != vd.cells().end(); ++it) {
+ total += *static_cast<int*>(it->data());
+ }
+ total /= vd.cells().size();
+ printf("The average number of edges per Voronoi cell is equal to: %3.1f\n", total);
+ printf("\n");
+ }
+
+ // Rendering Voronoi diagram.
+ {
+ // Construct clipping bounding rectangle.
+ bounding_rectangle<double> bbox;
+ for (std::vector<Point>::iterator it = points.begin(); it != points.end(); ++it)
+ bbox.update(it->x(), it->y());
+ for (std::vector<Segment>::iterator it = segments.begin(); it != segments.end(); ++it) {
+ bbox.update(it->low().x(), it->low().y());
+ bbox.update(it->high().x(), it->high().y());
+ }
+ // Add 10% offset to the bounding rectangle.
+ bbox = voronoi_utils<double>::scale(bbox, 1.1);
+ // Redner Voronoi diagram.
+ render_diagram(vd, bbox);
+ }
+
+ return 0;
+}
Modified: sandbox/gtl/libs/polygon/voronoi_example/voronoi_visualizer.cpp
==============================================================================
--- sandbox/gtl/libs/polygon/voronoi_example/voronoi_visualizer.cpp (original)
+++ sandbox/gtl/libs/polygon/voronoi_example/voronoi_visualizer.cpp 2012-03-27 15:06:28 EDT (Tue, 27 Mar 2012)
@@ -5,7 +5,7 @@
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
-// See http://www.boost.org for updates, documentation, and revision history.
+// See http://www.boost.org for updates, documentation, and revision history.
#include <iostream>
#include <vector>