boost/polygon
2
0
Fork 0
mirror of https://github.com/boostorg/polygon.git synced 2026-01-27 07:02:13 +00:00
Code Issues Projects Releases Wiki Activity

Polygon: correcting glitches in the documentation.

Browse Source 
[SVN r86190]
This commit is contained in:
Andrii Sydorchuk
2013-10-07 00:24:26 +00:00
parent ef93224144
commit 4419b92cc3
2 changed files with 6 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
doc/voronoi_builder.htm
View File

@@ -2,6 +2,7 @@
<html><head>
<meta http-equiv="Content-Language" content="en-us">
<meta http-equiv="Content-Type" content="text/html; charset=windows-1252"><title>Voronoi Builder</title></head><body>
<table style="margin: 0pt; padding: 0pt; width: 100%;" border="0" cellpadding="0" cellspacing="0">
@@ -172,7 +173,8 @@ void <span style="font-weight: bold;">construct</span>(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.<br>
output data structure to process them.<br>
Complexity: O(N * log N), where N is the total number of input points and segments.<br>
</td>
</tr>
<tr>

9
doc/voronoi_main.htm
View File

@@ -3,6 +3,7 @@
<meta http-equiv="Content-Language" content="en-us">
<meta http-equiv="Content-Type" content="text/html; charset=windows-1252"><title>Voronoi Main</title>
@@ -93,10 +94,7 @@ the second one may be resolved using the Boost.Polygon <a href="gtl_segment_conc
The strong sides of the
library and main benefits comparing to the other implementations are
discussed in the following paragraphs.<br>
<br>
Voronoi diagram construction complexity: O(N * logN), memory usage
O(N), where N is the total number of input points and segments.<span style="font-weight: bold;"></span><br>
<h2>Fully Functional with Segments</h2>
<h2>Fully Functional with Segments</h2>
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. </td>
<td style="font-family: Courier New,Courier,monospace;">template
&lt;typename PointIterator, typename VD&gt;<br>
void <span style="font-weight: bold;">construct_voronoi</span>(PointIterator
first,<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;
first,<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;
PointIterator last,<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;
VD *vd) </td>