diff --git a/doc/voronoi_builder.htm b/doc/voronoi_builder.htm index 37bbf2f..042703e 100644 --- a/doc/voronoi_builder.htm +++ b/doc/voronoi_builder.htm @@ -2,6 +2,7 @@ + Voronoi Builder @@ -172,7 +173,8 @@ void construct(OUTPUT* output) algorithm over the set of inserted geometries and generates site and circle events to the OUTPUT data structure. It's the responsibility of the -output data structure to process them. Complexity: O(N * log N), where N is the total number of input points and segments.
+output data structure to process them.
+Complexity: O(N * log N), where N is the total number of input points and segments.
diff --git a/doc/voronoi_main.htm b/doc/voronoi_main.htm index 18f575d..c98134a 100644 --- a/doc/voronoi_main.htm +++ b/doc/voronoi_main.htm @@ -3,6 +3,7 @@ + Voronoi Main @@ -93,10 +94,7 @@ the second one may be resolved using the Boost.Polygon
-

Fully Functional with Segments

+

Fully Functional with Segments

There are just a few implementations of the Voronoi diagram construction algorithm that can @@ -261,8 +259,7 @@ Corresponding segment type should model the segment concept.
template <typename PointIterator, typename VD>
void construct_voronoi(PointIterator -first,
-                       +first,
                       PointIterator last,
                       VD *vd)