|
|
Boost-Commit : |
Subject: [Boost-commit] svn:boost r86190 - trunk/libs/polygon/doc
From: sydorchuk.andriy_at_[hidden]
Date: 2013-10-06 20:24:26
Author: asydorchuk
Date: 2013-10-06 20:24:26 EDT (Sun, 06 Oct 2013)
New Revision: 86190
URL: http://svn.boost.org/trac/boost/changeset/86190
Log:
Polygon: correcting glitches in the documentation.
Text files modified:
trunk/libs/polygon/doc/voronoi_builder.htm | 4 +++-
trunk/libs/polygon/doc/voronoi_main.htm | 9 +++------
2 files changed, 6 insertions(+), 7 deletions(-)
Modified: trunk/libs/polygon/doc/voronoi_builder.htm
==============================================================================
--- trunk/libs/polygon/doc/voronoi_builder.htm Sun Oct 6 19:59:52 2013 (r86189)
+++ trunk/libs/polygon/doc/voronoi_builder.htm 2013-10-06 20:24:26 EDT (Sun, 06 Oct 2013) (r86190)
@@ -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 @@
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>
Modified: trunk/libs/polygon/doc/voronoi_main.htm
==============================================================================
--- trunk/libs/polygon/doc/voronoi_main.htm Sun Oct 6 19:59:52 2013 (r86189)
+++ trunk/libs/polygon/doc/voronoi_main.htm 2013-10-06 20:24:26 EDT (Sun, 06 Oct 2013) (r86190)
@@ -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 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 @@
<td style="font-family: Courier New,Courier,monospace;">template
<typename PointIterator, typename VD><br>
void <span style="font-weight: bold;">construct_voronoi</span>(PointIterator
-first,<br>
-
+first,<br>
PointIterator last,<br>
VD *vd) </td>
Boost-Commit list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk