Boost-Commit :

Date view	Thread view	Subject view	Author view

Subject: [Boost-commit] svn:boost r80481 - trunk/libs/polygon/doc
From: sydorchuk.andriy_at_[hidden]
Date: 2012-09-10 14:42:17

Author: asydorchuk
Date: 2012-09-10 14:42:14 EDT (Mon, 10 Sep 2012)
New Revision: 80481
URL: http://svn.boost.org/trac/boost/changeset/80481

Log:
Polygon: Updating documentation before the release. Removed voronoi_utils documentation page.

Removed:
   trunk/libs/polygon/doc/voronoi_utils.htm
Text files modified:
   trunk/libs/polygon/doc/analysis.htm | 7 +
   trunk/libs/polygon/doc/gtl_connectivity_extraction.htm | 5
   trunk/libs/polygon/doc/gtl_connectivity_extraction_45.htm | 5
   trunk/libs/polygon/doc/gtl_connectivity_extraction_90.htm | 5
   trunk/libs/polygon/doc/gtl_coordinate_concept.htm | 7 +
   trunk/libs/polygon/doc/gtl_design_overview.htm | 5
   trunk/libs/polygon/doc/gtl_interval_concept.htm | 5
   trunk/libs/polygon/doc/gtl_isotropy.htm | 5
   trunk/libs/polygon/doc/gtl_point_concept.htm | 5
   trunk/libs/polygon/doc/gtl_polygon_45_concept.htm | 5
   trunk/libs/polygon/doc/gtl_polygon_45_set_concept.htm | 5
   trunk/libs/polygon/doc/gtl_polygon_45_with_holes_concept.htm | 5
   trunk/libs/polygon/doc/gtl_polygon_90_concept.htm | 5
   trunk/libs/polygon/doc/gtl_polygon_90_set_concept.htm | 5
   trunk/libs/polygon/doc/gtl_polygon_90_with_holes_concept.htm | 5
   trunk/libs/polygon/doc/gtl_polygon_concept.htm | 5
   trunk/libs/polygon/doc/gtl_polygon_set_concept.htm | 5
   trunk/libs/polygon/doc/gtl_polygon_with_holes_concept.htm | 5
   trunk/libs/polygon/doc/gtl_property_merge.htm | 5
   trunk/libs/polygon/doc/gtl_property_merge_45.htm | 5
   trunk/libs/polygon/doc/gtl_property_merge_90.htm | 5
   trunk/libs/polygon/doc/gtl_rectangle_concept.htm | 8 +
   trunk/libs/polygon/doc/gtl_segment_concept.htm | 77 ++++++++++++-----------
   trunk/libs/polygon/doc/index.htm | 6
   trunk/libs/polygon/doc/voronoi_advanced_tutorial.htm | 59 ++++++------------
   trunk/libs/polygon/doc/voronoi_basic_tutorial.htm | 124 +++++++++++----------------------------
   trunk/libs/polygon/doc/voronoi_benchmark.htm | 15 ++-
   trunk/libs/polygon/doc/voronoi_builder.htm | 30 ++++-----
   trunk/libs/polygon/doc/voronoi_diagram.htm | 4
   trunk/libs/polygon/doc/voronoi_main.htm | 38 +++++------
   trunk/libs/polygon/doc/voronoi_predicates.htm | 13 ++-
   trunk/libs/polygon/doc/voronoi_robust_fpt.htm | 9 +-
   32 files changed, 223 insertions(+), 269 deletions(-)

Modified: trunk/libs/polygon/doc/analysis.htm
==============================================================================
--- trunk/libs/polygon/doc/analysis.htm (original)
+++ trunk/libs/polygon/doc/analysis.htm 2012-09-10 14:42:14 EDT (Mon, 10 Sep 2012)
@@ -1,10 +1,11 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en"><head>
-<title>Boost Polygon Library: Performance Analysis</title>

+
+
     <meta http-equiv="content-type" content="text/html;charset=ISO-8859-1" /></head><body><table style="margin: 0pt; padding: 0pt; width: 100%;" border="0" cellpadding="0" cellspacing="0"><tbody><tr>
<td style="background-color: rgb(238, 238, 238);" nowrap="1" valign="top">
     <div style="padding: 5px;" align="center">
@@ -54,7 +55,7 @@
         <li>Voronoi Predicates</li>
         <li>Voronoi Robust FPT<br />
         </li>
- <li>Voronoi Utils</li>
+
</ul>
         <h3 class="navbar">Other Resources</h3>
         <ul>

Modified: trunk/libs/polygon/doc/gtl_connectivity_extraction.htm
==============================================================================
--- trunk/libs/polygon/doc/gtl_connectivity_extraction.htm (original)
+++ trunk/libs/polygon/doc/gtl_connectivity_extraction.htm 2012-09-10 14:42:14 EDT (Mon, 10 Sep 2012)
@@ -1,5 +1,6 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:(null)1="http://www.w3.org/TR/REC-html40" lang="en"><head><title>Boost Polygon Library: Connectivity Extraction 45</title>
@@ -49,7 +50,7 @@
         <li>Voronoi Predicates</li>
         <li>Voronoi Robust FPT<br />
         </li>
- <li>Voronoi Utils</li>
+

         </ul>
         <h3 class="navbar">Other Resources</h3>

Modified: trunk/libs/polygon/doc/gtl_connectivity_extraction_45.htm
==============================================================================
--- trunk/libs/polygon/doc/gtl_connectivity_extraction_45.htm (original)
+++ trunk/libs/polygon/doc/gtl_connectivity_extraction_45.htm 2012-09-10 14:42:14 EDT (Mon, 10 Sep 2012)
@@ -1,5 +1,6 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:(null)1="http://www.w3.org/TR/REC-html40" lang="en"><head><title>Boost Polygon Library: Connectivity Extraction 45</title>
@@ -49,7 +50,7 @@
         <li>Voronoi Predicates</li>
         <li>Voronoi Robust FPT<br />
         </li>
- <li>Voronoi Utils</li>
+

         </ul>
         <h3 class="navbar">Other Resources</h3>

Modified: trunk/libs/polygon/doc/gtl_connectivity_extraction_90.htm
==============================================================================
--- trunk/libs/polygon/doc/gtl_connectivity_extraction_90.htm (original)
+++ trunk/libs/polygon/doc/gtl_connectivity_extraction_90.htm 2012-09-10 14:42:14 EDT (Mon, 10 Sep 2012)
@@ -1,5 +1,6 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:(null)1="http://www.w3.org/TR/REC-html40" lang="en"><head><title>Boost Polygon Library: Connectivity Extraction 90</title>
@@ -49,7 +50,7 @@
         <li>Voronoi Predicates</li>
         <li>Voronoi Robust FPT<br />
         </li>
- <li>Voronoi Utils</li>
+

         </ul>
         <h3 class="navbar">Other Resources</h3>

Modified: trunk/libs/polygon/doc/gtl_coordinate_concept.htm
==============================================================================
--- trunk/libs/polygon/doc/gtl_coordinate_concept.htm (original)
+++ trunk/libs/polygon/doc/gtl_coordinate_concept.htm 2012-09-10 14:42:14 EDT (Mon, 10 Sep 2012)
@@ -1,12 +1,13 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:(null)1="http://www.w3.org/TR/REC-html40" lang="en"><head>
-<title>Boost Polygon Library: Coordinate Concept</title>

+
+
     <meta http-equiv="content-type" content="text/html;charset=ISO-8859-1" /></head><body><table style="margin: 0pt; padding: 0pt; width: 100%;" border="0" cellpadding="0" cellspacing="0"><tbody><tr>
<td style="background-color: rgb(238, 238, 238);" nowrap="1" valign="top">
     <div style="padding: 5px;" align="center">
@@ -50,7 +51,7 @@
         <li>Voronoi Predicates</li>
         <li>Voronoi Robust FPT<br />
         </li>
- <li>Voronoi Utils</li>
+

         </ul>
         <h3 class="navbar">Other Resources</h3>

Modified: trunk/libs/polygon/doc/gtl_design_overview.htm
==============================================================================
--- trunk/libs/polygon/doc/gtl_design_overview.htm (original)
+++ trunk/libs/polygon/doc/gtl_design_overview.htm 2012-09-10 14:42:14 EDT (Mon, 10 Sep 2012)
@@ -1,5 +1,6 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:(null)1="http://www.w3.org/TR/REC-html40" lang="en"><head><title>Boost Polygon Library: Overview</title>
@@ -50,7 +51,7 @@
         <li>Voronoi Predicates</li>
         <li>Voronoi Robust FPT<br />
         </li>
- <li>Voronoi Utils</li>
+

         </ul>
         <h3 class="navbar">Other Resources</h3>

Modified: trunk/libs/polygon/doc/gtl_interval_concept.htm
==============================================================================
--- trunk/libs/polygon/doc/gtl_interval_concept.htm (original)
+++ trunk/libs/polygon/doc/gtl_interval_concept.htm 2012-09-10 14:42:14 EDT (Mon, 10 Sep 2012)
@@ -1,5 +1,6 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:(null)1="http://www.w3.org/TR/REC-html40" lang="en"><head><title>Boost Polygon Library: Interval Concept</title>
@@ -49,7 +50,7 @@
         <li>Voronoi Predicates</li>
         <li>Voronoi Robust FPT<br />
         </li>
- <li>Voronoi Utils</li>
+

         </ul>
         <h3 class="navbar">Other Resources</h3>

Modified: trunk/libs/polygon/doc/gtl_isotropy.htm
==============================================================================
--- trunk/libs/polygon/doc/gtl_isotropy.htm (original)
+++ trunk/libs/polygon/doc/gtl_isotropy.htm 2012-09-10 14:42:14 EDT (Mon, 10 Sep 2012)
@@ -1,5 +1,6 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:(null)1="http://www.w3.org/TR/REC-html40" lang="en"><head><title>Boost Polygon Library: Isotropy</title>
@@ -49,7 +50,7 @@
         <li>Voronoi Predicates</li>
         <li>Voronoi Robust FPT<br />
         </li>
- <li>Voronoi Utils</li>
+

         </ul>
         <h3 class="navbar">Other Resources</h3>

Modified: trunk/libs/polygon/doc/gtl_point_concept.htm
==============================================================================
--- trunk/libs/polygon/doc/gtl_point_concept.htm (original)
+++ trunk/libs/polygon/doc/gtl_point_concept.htm 2012-09-10 14:42:14 EDT (Mon, 10 Sep 2012)
@@ -1,5 +1,6 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:(null)1="http://www.w3.org/TR/REC-html40" lang="en"><head><title>Boost Polygon Library: Point Concept</title>
@@ -49,7 +50,7 @@
         <li>Voronoi Predicates</li>
         <li>Voronoi Robust FPT<br />
         </li>
- <li>Voronoi Utils</li>
+

         </ul>
         <h3 class="navbar">Other Resources</h3>

Modified: trunk/libs/polygon/doc/gtl_polygon_45_concept.htm
==============================================================================
--- trunk/libs/polygon/doc/gtl_polygon_45_concept.htm (original)
+++ trunk/libs/polygon/doc/gtl_polygon_45_concept.htm 2012-09-10 14:42:14 EDT (Mon, 10 Sep 2012)
@@ -1,5 +1,6 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:(null)1="http://www.w3.org/TR/REC-html40" lang="en"><head><title>Boost Polygon Library: Polygon 45 Concept</title>
@@ -49,7 +50,7 @@
         <li>Voronoi Predicates</li>
         <li>Voronoi Robust FPT<br />
         </li>
- <li>Voronoi Utils</li>
+

         </ul>
         <h3 class="navbar">Other Resources</h3>

Modified: trunk/libs/polygon/doc/gtl_polygon_45_set_concept.htm
==============================================================================
--- trunk/libs/polygon/doc/gtl_polygon_45_set_concept.htm (original)
+++ trunk/libs/polygon/doc/gtl_polygon_45_set_concept.htm 2012-09-10 14:42:14 EDT (Mon, 10 Sep 2012)
@@ -1,5 +1,6 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:(null)1="http://www.w3.org/TR/REC-html40" lang="en"><head><title>Boost Polygon Library: Polygon 45 Set Concept</title>
@@ -49,7 +50,7 @@
         <li>Voronoi Predicates</li>
         <li>Voronoi Robust FPT<br />
         </li>
- <li>Voronoi Utils</li>
+

         </ul>
         <h3 class="navbar">Other Resources</h3>

Modified: trunk/libs/polygon/doc/gtl_polygon_45_with_holes_concept.htm
==============================================================================
--- trunk/libs/polygon/doc/gtl_polygon_45_with_holes_concept.htm (original)
+++ trunk/libs/polygon/doc/gtl_polygon_45_with_holes_concept.htm 2012-09-10 14:42:14 EDT (Mon, 10 Sep 2012)
@@ -1,5 +1,6 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:(null)1="http://www.w3.org/TR/REC-html40" lang="en"><head><title>Boost Polygon Library: Polygon 45 With Holes Concept</title>
@@ -49,7 +50,7 @@
         <li>Voronoi Predicates</li>
         <li>Voronoi Robust FPT<br />
         </li>
- <li>Voronoi Utils</li>
+

         </ul>
         <h3 class="navbar">Other Resources</h3>

Modified: trunk/libs/polygon/doc/gtl_polygon_90_concept.htm
==============================================================================
--- trunk/libs/polygon/doc/gtl_polygon_90_concept.htm (original)
+++ trunk/libs/polygon/doc/gtl_polygon_90_concept.htm 2012-09-10 14:42:14 EDT (Mon, 10 Sep 2012)
@@ -1,5 +1,6 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:(null)1="http://www.w3.org/TR/REC-html40" lang="en"><head><title>Boost Polygon Library: Polygon 90 Concept</title>
@@ -49,7 +50,7 @@
         <li>Voronoi Predicates</li>
         <li>Voronoi Robust FPT<br />
         </li>
- <li>Voronoi Utils</li>
+

         </ul>
         <h3 class="navbar">Other Resources</h3>

Modified: trunk/libs/polygon/doc/gtl_polygon_90_set_concept.htm
==============================================================================
--- trunk/libs/polygon/doc/gtl_polygon_90_set_concept.htm (original)
+++ trunk/libs/polygon/doc/gtl_polygon_90_set_concept.htm 2012-09-10 14:42:14 EDT (Mon, 10 Sep 2012)
@@ -1,5 +1,6 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:(null)1="http://www.w3.org/TR/REC-html40" lang="en"><head><title>Boost Polygon Library: Polygon 90 Set Concept</title>
@@ -49,7 +50,7 @@
         <li>Voronoi Predicates</li>
         <li>Voronoi Robust FPT<br />
         </li>
- <li>Voronoi Utils</li>
+

         </ul>
         <h3 class="navbar">Other Resources</h3>

Modified: trunk/libs/polygon/doc/gtl_polygon_90_with_holes_concept.htm
==============================================================================
--- trunk/libs/polygon/doc/gtl_polygon_90_with_holes_concept.htm (original)
+++ trunk/libs/polygon/doc/gtl_polygon_90_with_holes_concept.htm 2012-09-10 14:42:14 EDT (Mon, 10 Sep 2012)
@@ -1,5 +1,6 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:(null)1="http://www.w3.org/TR/REC-html40" lang="en"><head><title>Boost Polygon Library: Polygon 90 With Holes Concept</title>
@@ -49,7 +50,7 @@
         <li>Voronoi Predicates</li>
         <li>Voronoi Robust FPT<br />
         </li>
- <li>Voronoi Utils</li>
+

         </ul>
         <h3 class="navbar">Other Resources</h3>

Modified: trunk/libs/polygon/doc/gtl_polygon_concept.htm
==============================================================================
--- trunk/libs/polygon/doc/gtl_polygon_concept.htm (original)
+++ trunk/libs/polygon/doc/gtl_polygon_concept.htm 2012-09-10 14:42:14 EDT (Mon, 10 Sep 2012)
@@ -1,5 +1,6 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:(null)1="http://www.w3.org/TR/REC-html40" lang="en"><head><title>Boost Polygon Library: Polygon Concept</title>
@@ -49,7 +50,7 @@
         <li>Voronoi Predicates</li>
         <li>Voronoi Robust FPT<br />
         </li>
- <li>Voronoi Utils</li>
+

         </ul>
         <h3 class="navbar">Other Resources</h3>

Modified: trunk/libs/polygon/doc/gtl_polygon_set_concept.htm
==============================================================================
--- trunk/libs/polygon/doc/gtl_polygon_set_concept.htm (original)
+++ trunk/libs/polygon/doc/gtl_polygon_set_concept.htm 2012-09-10 14:42:14 EDT (Mon, 10 Sep 2012)
@@ -1,5 +1,6 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:(null)1="http://www.w3.org/TR/REC-html40" lang="en"><head><title>Boost Polygon Library: Polygon Set Concept</title>
@@ -49,7 +50,7 @@
         <li>Voronoi Predicates</li>
         <li>Voronoi Robust FPT<br />
         </li>
- <li>Voronoi Utils</li>
+

         </ul>
         <h3 class="navbar">Other Resources</h3>

Modified: trunk/libs/polygon/doc/gtl_polygon_with_holes_concept.htm
==============================================================================
--- trunk/libs/polygon/doc/gtl_polygon_with_holes_concept.htm (original)
+++ trunk/libs/polygon/doc/gtl_polygon_with_holes_concept.htm 2012-09-10 14:42:14 EDT (Mon, 10 Sep 2012)
@@ -1,5 +1,6 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:(null)1="http://www.w3.org/TR/REC-html40" lang="en"><head><title>Boost Polygon Library: Polygon With Holes Concept</title>
@@ -49,7 +50,7 @@
         <li>Voronoi Predicates</li>
         <li>Voronoi Robust FPT<br />
         </li>
- <li>Voronoi Utils</li>
+

         </ul>
         <h3 class="navbar">Other Resources</h3>

Modified: trunk/libs/polygon/doc/gtl_property_merge.htm
==============================================================================
--- trunk/libs/polygon/doc/gtl_property_merge.htm (original)
+++ trunk/libs/polygon/doc/gtl_property_merge.htm 2012-09-10 14:42:14 EDT (Mon, 10 Sep 2012)
@@ -1,5 +1,6 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:(null)1="http://www.w3.org/TR/REC-html40" lang="en"><head><title>Boost Polygon Library: Property Merge</title>
@@ -49,7 +50,7 @@
         <li>Voronoi Predicates</li>
         <li>Voronoi Robust FPT<br />
         </li>
- <li>Voronoi Utils</li>
+

         </ul>
         <h3 class="navbar">Other Resources</h3>

Modified: trunk/libs/polygon/doc/gtl_property_merge_45.htm
==============================================================================
--- trunk/libs/polygon/doc/gtl_property_merge_45.htm (original)
+++ trunk/libs/polygon/doc/gtl_property_merge_45.htm 2012-09-10 14:42:14 EDT (Mon, 10 Sep 2012)
@@ -1,5 +1,6 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:(null)1="http://www.w3.org/TR/REC-html40" lang="en"><head><title>Boost Polygon Library: Property Merge 90</title>
@@ -49,7 +50,7 @@
         <li>Voronoi Predicates</li>
         <li>Voronoi Robust FPT<br />
         </li>
- <li>Voronoi Utils</li>
+

         </ul>
         <h3 class="navbar">Other Resources</h3>

Modified: trunk/libs/polygon/doc/gtl_property_merge_90.htm
==============================================================================
--- trunk/libs/polygon/doc/gtl_property_merge_90.htm (original)
+++ trunk/libs/polygon/doc/gtl_property_merge_90.htm 2012-09-10 14:42:14 EDT (Mon, 10 Sep 2012)
@@ -1,5 +1,6 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:(null)1="http://www.w3.org/TR/REC-html40" lang="en"><head><title>Boost Polygon Library: Property Merge 90</title>
@@ -49,7 +50,7 @@
         <li>Voronoi Predicates</li>
         <li>Voronoi Robust FPT<br />
         </li>
- <li>Voronoi Utils</li>
+

         </ul>
         <h3 class="navbar">Other Resources</h3>

Modified: trunk/libs/polygon/doc/gtl_rectangle_concept.htm
==============================================================================
--- trunk/libs/polygon/doc/gtl_rectangle_concept.htm (original)
+++ trunk/libs/polygon/doc/gtl_rectangle_concept.htm 2012-09-10 14:42:14 EDT (Mon, 10 Sep 2012)
@@ -1,5 +1,6 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:(null)1="http://www.w3.org/TR/REC-html40" lang="en"><head><title>Boost Polygon Library: Rectangle Concept</title>
@@ -49,7 +50,7 @@
         <li>Voronoi Predicates</li>
         <li>Voronoi Robust FPT<br />
         </li>
- <li>Voronoi Utils</li>
+

         </ul>
         <h3 class="navbar">Other Resources</h3>
@@ -770,4 +771,5 @@
       </tr>
</tbody></table>

-</td></tr></tbody></table></body></html>
+</td></tr></tbody></table>
+</body></html>
\ No newline at end of file

Modified: trunk/libs/polygon/doc/gtl_segment_concept.htm
==============================================================================
--- trunk/libs/polygon/doc/gtl_segment_concept.htm (original)
+++ trunk/libs/polygon/doc/gtl_segment_concept.htm 2012-09-10 14:42:14 EDT (Mon, 10 Sep 2012)
@@ -14,6 +14,8 @@

+
+



@@ -23,7 +25,7 @@

   <tbody>
     <tr>
- <td style="background-color: rgb(238, 238, 238);" valign="top" nowrap="1">
+ <td style="background-color: rgb(238, 238, 238);" nowrap="1" valign="top">
       <div style="padding: 5px;" align="center"> <img src="images/boost.png" border="0" height="86" width="277" /><a title="www.boost.org home page" href="http://www.boost.org/" tabindex="2" style="border: medium none ;"> </a> </div>
       <div style="margin: 5px;">
       <h3 class="navbar">Contents</h3>
@@ -70,7 +72,7 @@
         <li>Voronoi Predicates</li>
         <li>Voronoi Robust FPT<br />
         </li>
- <li>Voronoi Utils</li>
+
       </ul>
       <h3 class="navbar">Other Resources</h3>
       <ul>
@@ -141,7 +143,7 @@
           <tr>
             <td width="586"><font face="Courier New">template
<typename Segment><br />point_type <b>get</b>(const Segment& segment, direction_1d dir)</font></td>
- <td>Returns the low or high endpoint of an object that models a segment, depending on
+ <td>Returns the low or high endpoint of an object that models segment, depending on
the direction_1d value.<font face="Courier New"> </font></td>
           </tr>
           <tr>
@@ -149,8 +151,9 @@
<typename </font><font face="Courier New">Segment</font><font face="Courier New">, typename Point><br />
void <b>set</b>(</font><font face="Courier New">Segment</font><font face="Courier New">& segment, direction_1d dir,<br />
         const Point& </font><span style="font-family: Courier New;">point</span><font face="Courier New">)</font></td>
- <td>Sets the low or high endpoint of an object that models a segment to an object that models a
-point, depending on the direction_1d value.</td>
+ <td>Sets
+the low or high endpoint of an object that models segment to an object
+that models point, depending on the direction_1d value.</td>
           </tr>
           <tr>
             <td width="586"><font face="Courier New">template <typename Segment, typename Point1, typename Point2><br />
@@ -159,22 +162,22 @@
           </tr>
           <tr>
             <td><font face="Courier New">template <typename Segment1, typename </font><font face="Courier New">Segment2</font><font face="Courier New">><br /></font><font face="Courier New">Segment1</font><font face="Courier New"> <span style="font-weight: bold;">copy_construct</span>(const </font><font face="Courier New">Segment2</font><font face="Courier New">& segment)</font></td>
- <td style="text-align: left;">Copy constructs an object that is a model of segment given another segment.</td>
+ <td style="text-align: left;">Copy constructs an object that models segment given another segment.</td>
           </tr>
<tr>
             <td width="586"><font face="Courier New">template
<typename </font><font face="Courier New">Segment1</font><font face="Courier New">, typename </font><font face="Courier New">Segment2></font><br />
             <font face="Courier New">Segment1</font><font face="Courier New">& <b>assign</b>(</font><font face="Courier New">Segment1</font><font face="Courier New">& segment1,<br />
                 const </font><font face="Courier New">Segment2</font><font face="Courier New">& segment2)</font></td>
- <td>Copies data from the second object that models a segment into
-the first object that models a segment.</td>
+ <td>Copies data from the second object that models segment into
+the first object that models segment.</td>
           </tr>
           <tr>
             <td width="586"><font face="Courier New">template
<typename </font><font face="Courier New">Segment1</font><font face="Courier New">, typename </font><font face="Courier New">Segment1</font><font face="Courier New">><br />
bool <b>equivalence</b>(const </font><font face="Courier New">Segment1</font><font face="Courier New">& segment1,<br />
                 const </font><font face="Courier New">Segment1</font><font face="Courier New">& segment2)</font></td>
- <td>Given two objects that model a segment, compares and
+ <td>Given two objects that model segment, compares and
returns true if their low and high values are respectively equal.</td>
           </tr>
           <tr>
@@ -183,7 +186,7 @@
             <span style="font-family: Courier New,Courier,monospace;">                const Point& point)</span><br />
             </td>
             <td>Implements
-a robust orientation test for two objects that model segment and point.
+a robust orientation test of two objects that model segment and point.
Returns 0, if the point is collinear to the segment.<br />
Returns 1, if the point lies to the left of the segment.<br />
Returns -1, if the point lies to the right of the segment.<br />
@@ -196,10 +199,10 @@
             <span style="font-family: Courier New,Courier,monospace;">int orientation</span><span style="font-family: Courier New,Courier,monospace;">(const </span><span style="font-family: Courier New,Courier,monospace;">Segment1</span><span style="font-family: Courier New,Courier,monospace;">& segment1,</span><br style="font-family: Courier New,Courier,monospace;" />

             <span style="font-family: Courier New,Courier,monospace;">                const Segment2& segment2)</span></td>
- <td>Implements a robust orientation test for two objects
-that are models of segment. Note: the segments are treated as math.
+ <td>Implements a robust orientation test of two objects
+that model segment. Note: segments are treated as math.
vectors.<br />
-Returns 0, if the segments are collinear.<br />
+Returns 0, if segments are collinear.<br />
Returns 1, if the second segment is CCW oriented to the first segment.<br />
Returns -1, if the second segment is CW oriented to the first segment.<br />
             </td>
@@ -209,7 +212,7 @@
             <span style="font-family: Courier New,Courier,monospace;">bool </span><span style="font-weight: bold; font-family: Courier New,Courier,monospace;">contains</span><span style="font-family: Courier New,Courier,monospace;">(const </span><font face="Courier New">Segment</font><span style="font-family: Courier New,Courier,monospace;">& segment,</span><br style="font-family: Courier New,Courier,monospace;" />
             <span style="font-family: Courier New,Courier,monospace;">    const Point& value,</span><span style="font-family: Courier New,Courier,monospace;"> bool consider_touch)</span><br />
             </td>
- <td>Returns true if an object that is a model of segment contains an object that is a model of point, else false.<br />
+ <td>Returns true if an object that models segment contains an object that models point, else false.<br />
             </td>
           </tr>
           <tr>
@@ -218,44 +221,44 @@
             <span style="font-family: Courier New,Courier,monospace;">bool </span><span style="font-weight: bold; font-family: Courier New,Courier,monospace;">contains</span><span style="font-family: Courier New,Courier,monospace;">(const </span><span style="font-family: Courier New,Courier,monospace;">Segment1</span><span style="font-family: Courier New,Courier,monospace;">& segment1,</span><br style="font-family: Courier New,Courier,monospace;" />

             <span style="font-family: Courier New,Courier,monospace;">    const </span><span style="font-family: Courier New,Courier,monospace;">Segment</span><span style="font-family: Courier New,Courier,monospace;">2& segment2,</span> <span style="font-family: Courier New,Courier,monospace;">bool consider_touch)</span></td>
- <td>Returns true if the first object contains the second one, else false. Both objects model a segment.<br />
+ <td>Returns true if the first object contains the second one, else false. Both objects model segment.<br />
             </td>
           </tr>
           <tr>
             <td style="font-family: Courier New,Courier,monospace;">template <typename <span style="font-family: Courier New,Courier,monospace;">Segment</span>><br />
point_type <span style="font-weight: bold;">low</span>(const <span style="font-family: Courier New,Courier,monospace;">Segment</span>& segment)<br />
             </td>
- <td>Returns the low endpoint of an object that is a model of segment.<br />
+ <td>Returns the low endpoint of an object that models segment.<br />
             </td>
           </tr>
           <tr>
             <td style="font-family: Courier New,Courier,monospace;">template <typename <span style="font-family: Courier New,Courier,monospace;">Segment</span>><br />
point_type <span style="font-weight: bold;">high</span>(const <span style="font-family: Courier New,Courier,monospace;">Segment</span>& segment)</td>
- <td>Returns the high endpoint of an object that is a model of segment.<br />
+ <td>Returns the high endpoint of an object that models segment.<br />
             </td>
           </tr>
           <tr>
             <td style="font-family: Courier New,Courier,monospace;">template <typename <span style="font-family: Courier New,Courier,monospace;">Segment</span>><br />
point_type <span style="font-weight: bold;">center</span>(const <span style="font-family: Courier New,Courier,monospace;">Segment</span>& segment)</td>
- <td>Returns the central point of an object that is a model of segment.<br />
+ <td>Returns the central point of an object that models segment.<br />
             </td>
           </tr>
           <tr>
             <td style="font-family: Courier New,Courier,monospace;">template <typename <span style="font-family: Courier New,Courier,monospace;">Segment</span>, typename Point><br />void <span style="font-weight: bold;">low</span>(<span style="font-family: Courier New,Courier,monospace;">Segment</span>& segment, const Point& point)</td>
- <td>Sets the low endpoint of an object that is a model of segment.<br />
+ <td>Sets the low endpoint of an object that models segment.<br />
             </td>
           </tr>
           <tr>
             <td style="font-family: Courier New,Courier,monospace;">template <typename <span style="font-family: Courier New,Courier,monospace;">Segment, typename Point</span>><br />
void <span style="font-weight: bold;">high</span>(<span style="font-family: Courier New,Courier,monospace;">Segment</span>& segment, const Point& point)</td>
- <td>Sets the high endpoint of an object that is a model of segment.<br />
+ <td>Sets the high endpoint of an object that models of segment.<br />
             </td>
           </tr>
           <tr>
             <td><span style="font-family: Courier New,Courier,monospace;">template <typename </span><span style="font-family: Courier New,Courier,monospace;">Segment</span><span style="font-family: Courier New,Courier,monospace;">></span><br style="font-family: Courier New,Courier,monospace;" />
             <span style="font-family: Courier New,Courier,monospace;">distance_type <span style="font-weight: bold;">length</span>(const </span><span style="font-family: Courier New,Courier,monospace;">Segment</span><span style="font-family: Courier New,Courier,monospace;">& segment)</span><br />
             </td>
- <td>Returns length of an object that is a model of segment.<br />
+ <td>Returns length of an object that models segment.<br />
             </td>
           </tr>

@@ -265,14 +268,14 @@
           <tr>
             <td width="586"><font face="Courier New">template
<typename </font><span style="font-family: Courier New,Courier,monospace;">Segment</span><font face="Courier New">><br /></font><span style="font-family: Courier New,Courier,monospace;">Segment</span><font face="Courier New">& <b>scale_up</b>(</font><span style="font-family: Courier New,Courier,monospace;">Segment</span><font face="Courier New">& </font><font face="Courier New">segment</font><font face="Courier New">, <br />    unsigned_area_type factor)</font></td>
- <td>Multiplies x and y coordinates of both endpoints of an object that is a model of segment by unsigned factor.</td>
+ <td>Multiplies x and y coordinates of both endpoints of an object that models segment by unsigned factor.</td>
           </tr>
           <tr>
             <td width="586"><font face="Courier New">template
<typename </font><span style="font-family: Courier New,Courier,monospace;">Segment</span><font face="Courier New">><br />
             </font><span style="font-family: Courier New,Courier,monospace;">Segment</span><font face="Courier New">& <b>scale_down</b>(</font><span style="font-family: Courier New,Courier,monospace;">Segment</span><font face="Courier New">& </font><font face="Courier New">segment</font><font face="Courier New">, <br />
    unsigned_area_type factor)</font></td>
- <td>Divides x and y coordinates of both endpoints of an object that is a model of segment by unsigned factor.</td>
+ <td>Divides x and y coordinates of both endpoints of an object that models segment by unsigned factor.</td>
           </tr>
           <tr>
             <td width="586"><font face="Courier New">template
@@ -280,14 +283,14 @@
             </font><span style="font-family: Courier New,Courier,monospace;">Segment</span><font face="Courier New">& <b>scale</b>(</font><span style="font-family: Courier New,Courier,monospace;">Segment</span><font face="Courier New">& </font><font face="Courier New">segment</font><font face="Courier New">, const Scale& sc) </font></td>
             <td>Calls
the scale member function of the scaling type on the low and high endpoint of
-an object that is a model of segment and updates the segment with the
+an object that models segment and updates the segment with the
scaled endpoints.</td>
           </tr>
           <tr>
             <td width="586"><font face="Courier New">template
<typename </font><span style="font-family: Courier New,Courier,monospace;">Segment</span><font face="Courier New">, typename Transform><br /></font><span style="font-family: Courier New,Courier,monospace;">Segment</span><font face="Courier New">& <b>transform</b>(</font><span style="font-family: Courier New,Courier,monospace;">Segment</span><font face="Courier New">& segment, const </font><font face="Courier New">Transform</font><font face="Courier New">& tr) </font></td>
             <td>Calls the transform member function of transform type
-on the low and high endpoints of an object that is a model of segment and updates the segment with the transformed endpoints.</td>
+on the low and high endpoints of an object that models segment and updates the segment with the transformed endpoints.</td>
           </tr>
           <tr>
             <td width="586"><font face="Courier New">template
@@ -295,20 +298,20 @@
             </font><span style="font-family: Courier New,Courier,monospace;">Segment</span><font face="Courier New">& <b>move</b>(</font><span style="font-family: Courier New,Courier,monospace;">Segment</span><font face="Courier New">& segment, orientation_2d<br />
    coordinate_difference displacement)</font></td>
             <td>Adds displacement value to the x or y coordinates of both endpoints of an object
-that is a model of segment indicated by the orientation_2d.</td>
+that models segment indicated by the orientation_2d.</td>
           </tr>
           <tr>
             <td width="586"><font face="Courier New">template
<</font><span style="font-family: Courier New,Courier,monospace;">Segment, Point</span><font face="Courier New">><br />
             </font><span style="font-family: Courier New,Courier,monospace;">Segment</span><font face="Courier New">& <b>convolve</b>(</font><span style="font-family: Courier New,Courier,monospace;">Segment</span><font face="Courier New">& segment, const Point& point)</font></td>
- <td>Convolves both endpoints of an object that models a segment with an object that models a point.<br />
+ <td>Convolves both endpoints of an object that models segment with an object that models a point.<br />
</td>
           </tr>
           <tr>
             <td width="586"><font face="Courier New">template
<</font><span style="font-family: Courier New,Courier,monospace;">Segment, Point</span><font face="Courier New">><br />
             </font><span style="font-family: Courier New,Courier,monospace;">Segment</span><font face="Courier New">& <b>deconvolve</b>(</font><span style="font-family: Courier New,Courier,monospace;">Segment</span><font face="Courier New">& segment, const Point& point)</font></td>
- <td>Deconvolves both endpoints of an object that models a segment with an object that models a point. </td>
+ <td>Deconvolves both endpoints of an object that models segment with an object that models a point. </td>
           </tr>
           <tr>
             <td style="font-family: Courier New,Courier,monospace;">template <typename Segment1, typename Segment2><br />
@@ -318,7 +321,7 @@

    const Segment2& segment2, direction_1d dir)</td>
- <td>Returns true if two objects that model a segment abut, depending on the direction_1d value.</td>
+ <td>Returns true if two objects that model segment abut, depending on the direction_1d value.</td>
           </tr>
           <tr>
             <td style="font-family: Courier New,Courier,monospace;">template <typename Segment1, typename Segment2><br />
@@ -326,7 +329,7 @@
bool <span style="font-weight: bold;">abuts</span>(const Segment1& segment1,<br />

           const Segment2& segment2)</td>
- <td>Returns true if two objects that model a segment abut: either the first one to the second one or vice versa.</td>
+ <td>Returns true if two objects that model segment abut: either the first one to the second one or vice versa.</td>
           </tr>


@@ -336,7 +339,7 @@
             <span style="font-family: Courier New,Courier,monospace;">                const Segment2& segment2,<br />
                bool consider_touch)</span><br />
             </td>
- <td>Returns true if two objects that model a segment intersect, else false.<br />
+ <td>Returns true if two objects that model segment intersect, else false.<br />
             </td>
           </tr>

@@ -346,8 +349,8 @@
<typename </font><span style="font-family: Courier New,Courier,monospace;">Segment, typename Point</span><font face="Courier New">><br />distance_type <b>euclidean_distance</b>(<br />
    const </font><span style="font-family: Courier New,Courier,monospace;">Segment</span><font face="Courier New">& segment, const Point& point)</font>
             </td>
- <td>Returns distance from an object that is a model of segment
-to an object that is a model of point.
+ <td>Returns distance from an object that models segment
+to an object that models point.
             </td>
           </tr>
           <tr>
@@ -355,7 +358,7 @@
<typename Segment1, typename </font><font face="Courier New">Segment2</font><font face="Courier New">><br />distance_type <b>euclidean_distance</b>(<br />
    const </font><font face="Courier New">Segment1</font><font face="Courier New">& segment1, const </font><font face="Courier New">Segment2</font><font face="Courier New">& segment2)</font>
             </td>
- <td>Returns distance between two objects that are models of segment.
+ <td>Returns distance between two objects that model segment.
             </td>
           </tr>

@@ -366,10 +369,10 @@
       </table>
       <h1>Segment Data</h1>
       <p> </p>
- <p>The library provides a model of the segment concept declared <font face="Courier New">template<typename T> segment_data </font>where
+ <p>The library provides a model of the segment concept declared <font face="Courier New">template<typename T> segment_data</font>, where
T is the coordinate type.</p>
       <p>This data type is used internally when a segment is needed and
-is available to the library user who finds it convenient to use a
+is available to the library user, who finds it convenient to use a
library segment data type instead of providing their own.  The data
type is implemented to be convenient to use with the library traits.</p><h2>Members</h2>
       <table style="width: 100%;" id="table2" border="1">
@@ -468,7 +471,7 @@
       </td>
     </tr>
     <tr>
- <td style="background-color: rgb(238, 238, 238);" valign="top" nowrap="1">  </td>
+ <td style="background-color: rgb(238, 238, 238);" nowrap="1" valign="top">  </td>
       <td style="padding-left: 10px; padding-right: 10px; padding-bottom: 10px;" valign="top" width="100%">
       <table class="docinfo" id="table3" frame="void" rules="none">
         <colgroup> <col class="docinfo-name" /><col class="docinfo-content" /> </colgroup> <tbody valign="top">

Modified: trunk/libs/polygon/doc/index.htm
==============================================================================
--- trunk/libs/polygon/doc/index.htm (original)
+++ trunk/libs/polygon/doc/index.htm 2012-09-10 14:42:14 EDT (Mon, 10 Sep 2012)
@@ -1,5 +1,6 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en"><head><title>Boost Polygon Library: Main Page</title>
@@ -62,8 +63,7 @@
         <li>Voronoi Predicates</li>
         <li>Voronoi Robust FPT<br />
         </li>
- <li>Voronoi Utils<br />
- </li>
+

Modified: trunk/libs/polygon/doc/voronoi_advanced_tutorial.htm
==============================================================================
--- trunk/libs/polygon/doc/voronoi_advanced_tutorial.htm (original)
+++ trunk/libs/polygon/doc/voronoi_advanced_tutorial.htm 2012-09-10 14:42:14 EDT (Mon, 10 Sep 2012)
@@ -1,6 +1,7 @@
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head>

+

   <meta http-equiv="Content-Type" content="text/html; charset=windows-1252"><title>Voronoi Advanced Tutorial</title></head><body>
<h1>Voronoi Advanced Tutorial<br>
@@ -24,10 +25,8 @@

<img style="width: 665px; height: 369px;" alt="" src="images/rover.jpg"><br>

-<br>
-
-Yes, we are going to talk about Mars. So lets imagine that NASA is
-planning to send a new robot to Mars. Each day center situated on Earth
+<br>Lets imagine that NASA is
+planning to send a new robot to Mars. Each day the center situated on Earth
will send a destination point coordinates the robot needs to reach by
the end of the day. Of course we'd like to save as much energy as
possible thus choosing the shortest possible path. This would be a
@@ -96,7 +95,7 @@
integrated circuit manufactured, designers often spend large amounts of
time analyzing their layouts to avoid costly mistakes. One of the
common static analysis checks is minimum distance requirement between
-the components of an integrated circuit (distance should be not less
+the components of an integrated circuit (distance should be greater
than
specified value).<br>

@@ -137,8 +136,8 @@

The above two examples show usage of the default Voronoi coordinate
types
-in the macro and micro world. The main point of those was to give user
-understanding of a scale the default coordinate types provides. There
+in the macro and micro world. The main point of those was to give the user
+understanding of a scale that the default coordinate types provide. There
are
two main points we didn't mention before, but that would be relevant to
the most real world problems:<br>
@@ -162,11 +161,10 @@
devices.<br>
   </li>
</ul>
-
The second statement means that there is actually no point to provide
implementation that operates with floating-point input coordinates,
-because those always could be snapped to the integer grid. In case you
-are not satisfied with the precision that the 32-bit integer grid
+because those always could be snapped to the integer grid. In case the
+user is not satisfied with the precision that the 32-bit integer grid
provides or would like to retrieve coordinates of the output geometries
within a smaller
relative error, follow the next paragraph.<br>
@@ -293,7 +291,7 @@
template <size_t N></span><br style="font-family: Courier New,Courier,monospace;">

<span style="font-family: Courier New,Courier,monospace;">  fpt80
-operator()(const typename detail::extended_int<N> &that)
+operator()(const typename detail::extended_int<N>& that)
const {</span><br style="font-family: Courier New,Courier,monospace;">

<span style="font-family: Courier New,Courier,monospace;">   
@@ -331,28 +329,7 @@
my_voronoi_diagram_traits {</span><br style="font-family: Courier New,Courier,monospace;">

<span style="font-family: Courier New,Courier,monospace;"> 
-typedef fpt80 coordinate_type;</span><br style="font-family: Courier New,Courier,monospace;">
-
-<span style="font-family: Courier New,Courier,monospace;"> 
-typedef struct {</span><br style="font-family: Courier New,Courier,monospace;">
-
-<span style="font-family: Courier New,Courier,monospace;">   
-template <typename CT></span><br style="font-family: Courier New,Courier,monospace;">
-
-<span style="font-family: Courier New,Courier,monospace;">   
-fpt80 operator()(const CT& that) const {</span><br style="font-family: Courier New,Courier,monospace;">
-
-<span style="font-family: Courier New,Courier,monospace;">     
-return static_cast<fpt80>(that);</span><br style="font-family: Courier New,Courier,monospace;">
-
-<span style="font-family: Courier New,Courier,monospace;">   
-}</span><br style="font-family: Courier New,Courier,monospace;">
-
-<span style="font-family: Courier New,Courier,monospace;">  }
-ctype_converter_type;</span><br style="font-family: Courier New,Courier,monospace;">
-
-<span style="font-family: Courier New,Courier,monospace;"> 
-typedef detail::point_2d<coordinate_type> point_type;</span><br style="font-family: Courier New,Courier,monospace;">
+typedef fpt80 coordinate_type;</span><span style="font-family: Courier New,Courier,monospace;"></span><span style="font-family: Courier New,Courier,monospace;"></span><br style="font-family: Courier New,Courier,monospace;">

<span style="font-family: Courier New,Courier,monospace;"> 
typedef voronoi_cell<coordinate_type> cell_type;</span><br style="font-family: Courier New,Courier,monospace;">
@@ -398,7 +375,7 @@

<span style="font-family: Courier New,Courier,monospace;"></span><br>

-Above we simply declared the Voronoi primitive types, type converter
+Above we simply declared the Voronoi primitive types
and vertex
equality predicate using the new coordinate type and corresponding ulp
comparison structure. As we are done with the declaration of the
@@ -416,10 +393,13 @@
gen(std::time(0));</span><br style="font-family: Courier New,Courier,monospace;">

<span style="font-family: Courier New,Courier,monospace;">boost::random::uniform_int_distribution<boost::int64_t>
-distr(-MAX, MAX-1);</span><span style="font-family: Courier New,Courier,monospace;"><br>
+distr(-MAX, MAX-1);<br>
+<br>
+</span><span style="font-family: Courier New,Courier,monospace;">
// Declaring and configuring Voronoi builder with the new coordinate
type traits.<br>
-voronoi_builder<boost::int64_t, my_voronoi_ctype_traits> vb;</span><span style="font-family: Courier New,Courier,monospace;"></span><br style="font-family: Courier New,Courier,monospace;">
+voronoi_builder<boost::int64_t, my_voronoi_ctype_traits> vb;</span><br>
+<span style="font-family: Courier New,Courier,monospace;"></span><br style="font-family: Courier New,Courier,monospace;">

<span style="font-family: Courier New,Courier,monospace;">// Voronoi
builder initialization step.<br>
@@ -455,9 +435,9 @@
the declaration of the ulp comparison structure. The library provides
efficient well-commented cross-platform implementation for 64-bit
floating-point type (double). So the best advice would be to follow
-that implementation, but before doing that really consider if  the
+that implementation, but before doing that really consider thoughtfully if the
default
-coordinate types are not capable to solve your problem.<br>
+coordinate types are not capable to deal with your problem.<br>

<br>

@@ -478,4 +458,5 @@
   </tbody>
</table>

-</body></html>
+
+</body></html>
\ No newline at end of file

Modified: trunk/libs/polygon/doc/voronoi_basic_tutorial.htm
==============================================================================
--- trunk/libs/polygon/doc/voronoi_basic_tutorial.htm (original)
+++ trunk/libs/polygon/doc/voronoi_basic_tutorial.htm 2012-09-10 14:42:14 EDT (Mon, 10 Sep 2012)
@@ -9,6 +9,7 @@

+

   <meta http-equiv="Content-Type" content="text/html; charset=windows-1252"><title>Voronoi Basic Tutorial</title><meta http-equiv="content-type" content="text/html; charset=utf-8"></head><body>
<h1>Voronoi Basic Tutorial<br>
@@ -21,15 +22,15 @@

<ul>

- <li>preparing input geometries;<br>
+ <li>preparing input geometries<br>
   </li>
- <li>Voronoi diagram construction;</li>
+ <li>Voronoi diagram construction</li>

- <li>Voronoi graph traversal;<br>
+ <li>Voronoi graph traversal<br>
   </li>

- <li>associating the user data with the Voronoi primitives;</li>
- <li>Voronoi diagram discretization and rendering.</li>
+ <li>associating the user data with the Voronoi primitives</li>
+
</ul>

In the example that goes through this tutorial (voronoi_basic_tutorial.cpp)
@@ -40,9 +41,8 @@
graph. The primary Voronoi edges
are marked with
the black color, non-primary with green, input geometries have blue
-color. In
-case you forgot, we split each input segment onto three sites (segment
-itself and both endpoints), edges that go between those sites are
+color. We split each input segment onto three sites (segment
+itself and both endpoints), edges that go between the sites corresponding to the same segment are
considered to be non-primary.<br>

<br>
@@ -52,9 +52,11 @@
<br>

And before you proceed don't forget to:<span style="font-family: Courier New,Courier,monospace;"><br>
-<br>
-#include "boost/polygon/voronoi.hpp"<br>
-using boost::polygon;</span><br>
+</span><span style="font-family: Courier New,Courier,monospace;"></span><br>
+<span style="font-family: Courier New,Courier,monospace;">#include "boost/polygon/voronoi.hpp"<br>
+using boost::polygon::voronoi_builder;<br>
+using boost::polygon::voronoi_diagram;<br>
+</span>

<h2>Preparing Input Geometries</h2>Below is the example of how the user provided point and segment classes might look like:<br>
<br><span style="font-family: Courier New,Courier,monospace;">struct Point {<br>  int a;<br>
@@ -114,9 +116,7 @@
<span style="font-family: Courier New,Courier,monospace;"><br>
</span><span style="font-family: Courier New,Courier,monospace;">
voronoi_diagram<double> vd;<br>
-construct_voronoi(points.begin(), points.end(), segments.begin(), segments.end(), &vd);<br>
-</span><br>
-So brief, isn't that awesome!<br>
+construct_voronoi(points.begin(), points.end(), segments.begin(), segments.end(), &vd);</span><br>

<h2>Traversing Voronoi Graph</h2>

@@ -219,17 +219,22 @@

<br style="font-family: Courier New,Courier,monospace;">

-<span style="font-family: Courier New,Courier,monospace;">for (voronoi_diagram<double>::const_cell_iterator it = vd.cells().begin();</span><br style="font-family: Courier New,Courier,monospace;">
-<span style="font-family: Courier New,Courier,monospace;">     it != vd.cells().end(); ++it) {</span><br style="font-family: Courier New,Courier,monospace;">
-<span style="font-family: Courier New,Courier,monospace;">  const voronoi_diagram<double>::cell_type &cell = *it;</span><br style="font-family: Courier New,Courier,monospace;">
-<span style="font-family: Courier New,Courier,monospace;">  const voronoi_diagram<double>::edge_type *edge = cell.incident_edge();</span><br style="font-family: Courier New,Courier,monospace;">
-<span style="font-family: Courier New,Courier,monospace;">  std::size_t count = 0;</span><br style="font-family: Courier New,Courier,monospace;">
-<span style="font-family: Courier New,Courier,monospace;">  do {</span><br style="font-family: Courier New,Courier,monospace;">
-<span style="font-family: Courier New,Courier,monospace;">    ++count;</span><br style="font-family: Courier New,Courier,monospace;">
-<span style="font-family: Courier New,Courier,monospace;">    edge = edge->next();</span><br style="font-family: Courier New,Courier,monospace;">
-<span style="font-family: Courier New,Courier,monospace;">  } while (edge != cell.incident_edge());</span><br style="font-family: Courier New,Courier,monospace;">
-<span style="font-family: Courier New,Courier,monospace;">  cell.color(count);</span><br style="font-family: Courier New,Courier,monospace;">
-<span style="font-family: Courier New,Courier,monospace;">}</span><br>
+<span style="font-family: Courier New,Courier,monospace;">// Using color member of the Voronoi primitives to store the average number<br>
+// of edges around each cell (including secondary edges).<br>
+{<br>
+  printf("Number of edges (including secondary) around the Voronoi cells:\n");<br>
+  for (voronoi_diagram<double>::const_edge_iterator it = vd.edges().begin();<br>
+       it != vd.edges().end(); ++it) {<br>
+    std::size_t cnt = it->cell()->color();<br>
+    it->cell()->color(cnt + 1);<br>
+  }<br>
+  for (voronoi_diagram<double>::const_cell_iterator it = vd.cells().begin();<br>
+       it != vd.cells().end(); ++it) {<br>
+    printf("%lu ", it->color());<br>
+  }<br>
+  printf("\n");<br>
+  printf("\n");<br>
+}</span><span style="font-family: Courier New,Courier,monospace;"></span><br>

<h2>Rendering Voronoi Diagram</h2>

@@ -246,74 +251,19 @@

Note: This would be the issues not only for rendering tools.
Basically every task that requires diagram to be represented as a set
-of finite segments will fall into this category.<br>
-
-<br>
-
-All the above functionality is already implemented in the Voronoi
-utils.
-Before clipping an edge we are going to define the clipping rectangle.
-It is practical to choose it so that it wraps all the input geometries
-plus some offset.<br>
-
-<span style="font-family: Courier New,Courier,monospace;"><br>
-bounding_rectangle<double> bbox;<br>for (std::vector<Point>::iterator it = points.begin(); it != points.end(); ++it)<br>
-  bbox.update(it->a, it->b);<br>
-for (std::vector<Segment>::iterator it = segments.begin(); it != segments.end(); ++it) {<br>
-  bbox.update(it->p0.a, it->p0.b);<br>
-  bbox.update(it->p1.a, it->p1.b);<br>
-}<br>
-// Add 10% offset to the bounding rectangle.<br>
-bbox = voronoi_utils<double>::scale(bbox, 1.1);</span><span style="font-family: Courier New,Courier,monospace;"><br>
-</span><br>
-
-Now lets consider that we have the 3rd party library function that
-draws segments using the following prototype:<span style="font-family: Courier New,Courier,monospace;"><br>
-<br>
-void draw_segment(double x1, double y1, double x2, double y2);<br>
-<br>
-</span>Then the function that renders our diagram edges will have the
-following implementation:<br>
-
-<br>
-
-<span style="font-family: Courier New,Courier,monospace;">void render_diagram(const voronoi_diagram<double> &vd,<br>
-                   
-const voronoi_utils<double>::brect_type &bbox) {<br>
-  const std::size_t VISITED = 1;<br>
-  for (voronoi_diagram<double>::const_edge_iterator it = vd.edges().begin();<br>
-       it != vd.edges().end(); ++it) {<br>
-    // We use color to mark visited edges.<br>
-    it->color(VISITED);<br>
-    // Don't render the same edge twice.<br>
-    if (it->twin()->color()) continue;<br>
-    voronoi_utils<double>::point_set_type polyline;<br>
-    if (it->is_linear())<br>
-      voronoi_utils<double>::clip(*it, bbox, polyline);<br>
-    else<br>
-      // Parabolic edges are always finite.<br>
-      voronoi_utils<double>::discretize(*it, 1E-1, polyline);<br>
-    // Note: discretized edges may also lie outside of the bbox.<br>
-    // So user might do additional clipping before rendering each such edge.  <br>
-    for (std::size_t i = 1; i < polyline.size(); ++i)<br>
-      draw_segment(polyline[i-1].x(), polyline[i-1].y(),<br>
-                  
-polyline[i].x(), polyline[i].y());<br>
-  }<br>
-}<br>
-<br>
-</span>voronoi_visualizer.cpp
+of finite segments will fall into this category. voronoi_visualizer.cpp
contains a simple fully featured implementation of the Voronoi diagram
renderer using the Qt libraries. It was used to generate all the .png
-drawings under the ./libs/polygon/example directory.<span style="text-decoration: underline;"><br>
-</span><span style="font-family: Courier New,Courier,monospace;">
-<br>
+drawings under the boost/libs/polygon/example directory.<span style="text-decoration: underline;"></span><span style="font-family: Courier New,Courier,monospace;"><br>
+</span>
+<h2>Summary<br>
+</h2>
+<span style="font-family: Courier New,Courier,monospace;">
</span>I hope the reader managed to get to this point and found the
basic tutorial to be useful (in the end it's not so basic). Worth
to notice that construction of the Voronoi diagram takes only two lines
of code, everything else is about initializing input data structures,
-traversing Voronoi graph, associating data with the diagram primitives and
-using the Voronoi utilities. In the
+traversing Voronoi graph, associating data with the diagram primitives. In the
default mode the Voronoi diagram operates with the signed int (32-bit) input
coordinate type and double (64-bit) output coordinate type. In the advanced Voronoi tutorial we
explain why this is enough for the 95% of cases and how to expand the

Modified: trunk/libs/polygon/doc/voronoi_benchmark.htm
==============================================================================
--- trunk/libs/polygon/doc/voronoi_benchmark.htm (original)
+++ trunk/libs/polygon/doc/voronoi_benchmark.htm 2012-09-10 14:42:14 EDT (Mon, 10 Sep 2012)
@@ -7,6 +7,8 @@

+
+

   <meta http-equiv="Content-Language" content="en-us">

@@ -63,7 +65,7 @@
         <li>Voronoi Predicates</li>
         <li>Voronoi Robust FPT<br>
         </li>
- <li>Voronoi Utils</li>
+
       </ul>
       <h3 class="navbar">Other Resources</h3>
       <ul>
@@ -96,14 +98,14 @@
</li>
       </ul>Below is the list of libraries included in this benchmark sorted by the number of conditions each of them satisfies:<br>
       <ul>
- <li>Boost.Polygon Voronoi - satisfies all three items above, implements sweep-line algorithm.<br>
+ <li>Boost.Polygon Voronoi - satisfies all the conditions above, implements sweep-line algorithm.<br>
         </li>
- <li>CGAL - satisfies the first two items, implements incremental algorithm. CGAL is a well-known
+ <li>CGAL - satisfies the first two conditions, implements incremental algorithm. CGAL is a well-known
library in the computational geometry area, especially for its
robustness.<br>
</li>
         <li>S-Hull
-- doesn't satisfy any of the above items. S-Hull is a non-robust
+- doesn't satisfy any of the above conditions. S-Hull is a non-robust
implementation of the sweep-hull algorithm used to construct Delaunay
triangulation of a set of points.<br>
         </li>
@@ -474,7 +476,7 @@
         </tbody>
       </table>
       <span style="font-weight: bold;"></span>
- <h2>Voronoi Benchmark Conclusions</h2>
+ <h2>Voronoi Benchmark Summary</h2>
The main conclusions for the benchmark results above are following:<br>
       <ul>
         <li>There is no input size range were CGAL would outperform
@@ -528,4 +530,5 @@
   </tbody>
</table>

-</body></html>
+
+</body></html>
\ No newline at end of file

Modified: trunk/libs/polygon/doc/voronoi_builder.htm
==============================================================================
--- trunk/libs/polygon/doc/voronoi_builder.htm (original)
+++ trunk/libs/polygon/doc/voronoi_builder.htm 2012-09-10 14:42:14 EDT (Mon, 10 Sep 2012)
@@ -9,6 +9,8 @@

+
+

   <meta http-equiv="Content-Language" content="en-us">

@@ -65,7 +67,7 @@
         <li>Voronoi Predicates</li>
         <li>Voronoi Robust FPT<br>
         </li>
- <li>Voronoi Utils</li>
+
       </ul>
       <h3 class="navbar">Other Resources</h3>
       <ul>
@@ -101,7 +103,7 @@
Boost.Polygon library. The main differences are in the following:<br>
       <ul>
         <li>The input coordinate type is not required to be integral (while it
-still should be integer type)</li>
+still should be an integer type)</li>
         <li>The output coordinate type (for
Voronoi vertices) is required to be IEEE-754 floating point type</li>
       </ul>
@@ -119,13 +121,11 @@

       <span style="font-family: Courier New,Courier,monospace;">#include <voronoi_builder.hpp></span><br style="font-family: Courier New,Courier,monospace;">

- <span style="font-family: Courier New,Courier,monospace;">#include <voronoi_diagram.hpp></span><br style="font-family: Courier New,Courier,monospace;">
-
- <span style="font-family: Courier New,Courier,monospace;">#include <voronoi_utils.hpp><br>
+ <span style="font-family: Courier New,Courier,monospace;">#include <voronoi_diagram.hpp></span><span style="font-family: Courier New,Courier,monospace;"><br>
       <br>
       </span>This
also gives a way to build Voronoi construction API on top of the
-Voronoi builder data strcture for the other Boost libraries.<br>
+Voronoi builder data structure for the other Boost libraries.<br>
       <h2>Declaration<br>
       </h2>

@@ -142,11 +142,11 @@
voronoi_builder;</span><br>
       <br>
       <span style="font-family: 'Courier New',Courier,monospace;">T</span></font>
-- specifies coordinate type of the input geometries (points and
+- specifies the coordinate type of the input geometries (points and
segments).<br>

       <font face="Courier New"> <span style="font-family: 'Courier New',Courier,monospace;">CTT</span></font>
-- defines input/output coordinate type used by VP.<br>
+- defines input/output coordinate type traits used by Voronoi predicates (VP).<br>

       <font face="Courier New"> <span style="font-family: 'Courier New',Courier,monospace;">VP</span></font>
- predicate kernel, that provides builder with robust and
@@ -159,8 +159,8 @@
coordinate type traits. Default voronoi_predicates<<font face="Courier New"><span style="font-family: 'Courier New',Courier,monospace;">CTT</span></font>>
structure provides correct and efficient predicates as soon as types defined by <font face="Courier New"> <span style="font-family: 'Courier New',Courier,monospace;">CTT</span></font>
satisfy the requirements explained at the end of this page. In case those
-requirements are not satisfied for the user provided <font face="Courier New"> <span style="font-family: 'Courier New',Courier,monospace;">CTT</span></font>,
-proper <font face="Courier New"> <span style="font-family: 'Courier New',Courier,monospace;">VP</span></font>
+requirements are not satisfied for the user provided coordinate type traits,<font face="Courier New"><span style="font-family: 'Courier New',Courier,monospace;"></span></font>
+the proper predicates kernel
implementation is required.<span style="font-family: Courier New,Courier,monospace;"></span><br>
<h2>Member Functions</h2>
       <table style="text-align: left; width: 100%;" border="1" cellpadding="2" cellspacing="2">
@@ -203,16 +203,12 @@
           <tr>
             <td style="font-family: 'Courier New',Courier,monospace;">
template <typename OUTPUT><br>
-void construct(OUTPUT *output)<br>
+void construct(OUTPUT* output)<br>
             </td>
             <td width="693">Runs sweepline
algorithm over the set of the inserted geometries, outputs site and
circle events to the OUTPUT data structure. It's responsibility of the
-output structure builder object to process them. For example both
-Voronoi diagram and Delaunay triangulation could be constructed from
-the Voronoi builder events, however internally they are different data
-structures, so it's up to them to process properly events produced by
-the builder object.<br>
+output data structure to process them.<br>
             </td>
           </tr>
           <tr>
@@ -228,7 +224,7 @@
       <h1>Voronoi Coordinate Type Traits</h1>


- <p>The library provides the default coordinate type traits for the
+ <p>The library provides the default coordinate type traits specialization for the
32-bit signed integer type:</p>

       <font style="font-family: 'Courier New',Courier,monospace;" face="Courier New">

Modified: trunk/libs/polygon/doc/voronoi_diagram.htm
==============================================================================
--- trunk/libs/polygon/doc/voronoi_diagram.htm (original)
+++ trunk/libs/polygon/doc/voronoi_diagram.htm 2012-09-10 14:42:14 EDT (Mon, 10 Sep 2012)
@@ -8,6 +8,7 @@

+

   <meta http-equiv="Content-Language" content="en-us">

@@ -71,8 +72,7 @@
         <li>Voronoi Predicates</li>
         <li>Voronoi Robust FPT<br>
         </li>
- <li>Voronoi Utils<br>
- </li>
+
       </ul>
       <h3 class="navbar">Other Resources</h3>
       <ul>

Modified: trunk/libs/polygon/doc/voronoi_main.htm
==============================================================================
--- trunk/libs/polygon/doc/voronoi_main.htm (original)
+++ trunk/libs/polygon/doc/voronoi_main.htm 2012-09-10 14:42:14 EDT (Mon, 10 Sep 2012)
@@ -14,6 +14,8 @@

+
+

   <meta http-equiv="Content-Language" content="en-us">

@@ -34,7 +36,7 @@

   <tbody>
     <tr>
- <td style="background-color: rgb(238, 238, 238);" valign="top" nowrap="1">
+ <td style="background-color: rgb(238, 238, 238);" nowrap="1" valign="top">
       <div style="padding: 5px;" align="center"> <img src="images/boost.png" border="0" height="86" width="277"><a title="www.boost.org home page" tabindex="2" style="border: medium none ;" href="http://www.boost.org/"> </a></div>
       <div style="margin: 5px;">
       <h3 class="navbar">Contents</h3>
@@ -80,8 +82,7 @@
         <li>Voronoi Predicates</li>
         <li>Voronoi Robust FPT<br>
         </li>
- <li>Voronoi Utils<br>
- </li>
+
       </ul>
       <h3 class="navbar">Other Resources</h3>
       <ul>
@@ -123,7 +124,7 @@
library and main benefits comparing to the other implementations are
discussed in the following paragraphs.<span style="font-weight: bold;"></span><br>
       <h2>Robustness and Efficiency</h2>
-Lets explain a bit those terms. The efficiency is simply measured by
+Let's explain a bit those terms. The efficiency is simply measured by
the time it takes the algorithm to execute. The robustness is a bit
more harder to explain. But those of you who had the experience with
the following situations would understand what it doesn't mean: application segfaults randomly, algorithm output contains
@@ -132,8 +133,7 @@
fail and produces expected output in 100% of cases, thus user can rely
on
it. Robustness is a weak place of the most non-commercial
-implementations of any complex geometric algorithm. The main issues of
-that could be divided onto two main categories: memory management
+implementations of any complex geometric algorithm. The main issues could be divided onto two main categories: memory management
issues, numeric stability issues. Our implementation avoids the
first type of issues using pure STL data structures, thus you won't find
any operator new in the code. The second category of problems is
@@ -191,8 +191,8 @@
for the output geometries within our Solar System will be on its boundaries
and equal to 2^-64 * 2^42 * 2^6 = 2^-18 metres. In the output we are going to
consider vertices with both coordinates that are within 2^-17 metres (8
-micrometres) distance to be equal. Come on, that distance is equal to
-the size of a bacteria. Can you even see those?<br>
+micrometres) distance to be equal. That distance is equal to
+the size of a bacteria and is relative to the Solar System size.<br>
       <h2>Fully Functional with Segments</h2>
There are not many implementations of the Voronoi diagram construction
algorithm that could
@@ -201,7 +201,7 @@
segments allows to discretize any input geometry (circle, ellipse,
parabola). Of course as the result those might have floating-point
coordinates, but that is resolved using scaling and snapping to the
-integer grid. This functionality is very handy as allows to compute
+integer grid. This functionality is very handy as it allows to compute
the medial axis transform of the arbitrary set of input geometries. So
one may start
using it for the next generation pattern recognition or computer vision
@@ -295,11 +295,8 @@
       <span style="font-family: Courier New,Courier,monospace;">voronoi_diagram<double>
vd;</span><br style="font-family: Courier New,Courier,monospace;">
       <span style="font-family: Courier New,Courier,monospace;">construct_voronoi(points.begin(), points.end(), &vd);</span><br>
- <br>
-Isn't that simple? The library also provides the clear interfaces to
- associate user data with the output geometries, efficiently traverse Voronoi graph and utilities to
- visualize output primitives (e.g.
-discretization of the parabolic edges, clipping of the linear edges).
+ <br>The library also provides the clear interfaces to
+ associate user data with the output geometries and efficiently traverse Voronoi graph.
More details on those are covered in the basic Voronoi tutorial. Advanced usage of the library with the configuration of the coordinate
types is explained in the <a href="voronoi_advanced_tutorial.htm">advanced
Voronoi tutorial</a>.
@@ -317,10 +314,9 @@
the Boost.Polygon concepts and models with a drawback of additional
dependencies. <h2>Extensible for the User Provided Coordinate Types</h2>
Our implementation is coordinate type agnostic. That means that as soon
-as user provides types satisfy the set of restrictions of the Voronoi builder coordinate type traits
-and implement methods required by the library no changes are required
-neither
-from the algorithm, nor from the implementation of the predicates. So it's
+as user provided types satisfy the set of restrictions of the Voronoi builder coordinate type traits
+and implement methods required by the library, no changes are required
+neither to the algorithm, nor to the implementation of the predicates. So it's
possible to
construct Voronoi diagram for the 256-bit integer input coordinate type
and
@@ -331,7 +327,7 @@
Below one may find the list of the main directions for the future
development of the library.<br>
High-priority tasks that already have approximate implementation plan
-are following (some of those may be proposed as future GSoC projects):<br>
+are the following (some of those may be proposed as future GSoC projects):<br>
       <ul>
         <li>Implementing Delaunay triangulation data structure.<br>
Note: only data structure needs to be implemented that properly
@@ -387,14 +383,14 @@
the Boost.Polygon Voronoi library. We provide pure implementation and
benchmarks one may run on
his PC. In case community finds it useful we will incrementally
-add more documentation on the theoretical side of our realization. The
+add more documentation on the theoretical side of our implementation. The
authors would like to acknowledge the Steven Fortune's article <span style="font-family: Arial,Helvetica,sans-serif;"><span style="font-weight: bold;"></span></span>"<a href="http://dl.acm.org/citation.cfm?id=10549">A Sweepline algorithm
for Voronoi diagrams</a>", that contains the fundamental ideas of the
current implementation.<br>
       </td>
     </tr>
     <tr>
- <td style="background-color: rgb(238, 238, 238);" valign="top" nowrap="1"> </td>
+ <td style="background-color: rgb(238, 238, 238);" nowrap="1" valign="top"> </td>
       <td style="padding-left: 10px; padding-right: 10px; padding-bottom: 10px;" valign="top" width="100%">
       <table class="docinfo" id="table2" frame="void" rules="none">
         <colgroup> <col class="docinfo-name"><col class="docinfo-content"> </colgroup> <tbody valign="top">

Modified: trunk/libs/polygon/doc/voronoi_predicates.htm
==============================================================================
--- trunk/libs/polygon/doc/voronoi_predicates.htm (original)
+++ trunk/libs/polygon/doc/voronoi_predicates.htm 2012-09-10 14:42:14 EDT (Mon, 10 Sep 2012)
@@ -4,6 +4,8 @@

+
+

   <meta http-equiv="Content-Language" content="en-us">

@@ -67,8 +69,7 @@
         <li>Voronoi Predicates</li>
         <li>Voronoi Robust FPT<br>
         </li>
- <li>Voronoi Utils<br>
- </li>
+
       </ul>
       <h3 class="navbar">Other Resources</h3>
       <ul>
@@ -97,8 +98,8 @@

Voronoi predicates contain implementation of a set of the geometric
predicates used by the Voronoi builder.
-Except of those it also provides
-functors that allow to compute coordinates of the centers of the
+Except of those they also provide
+functors that allow to compute the coordinates of the centers of the
inscribed
circles (those correspond to the Voronoi vertices) within the given
relative error precision range (64 machine epsilons). This means that
@@ -162,7 +163,7 @@
a good speed
performance it doesn't produce reliable results all the time (as in the
example above). The way to solve the issue is apart from computing
-result of the expression compute the relative error of it also. This
+result of the expression compute the relative error of it as well. This
will
give us the range of values the evaluated result belongs to and based
on that we can
@@ -185,7 +186,7 @@
       <br>

1) mathematical transformation of the predicate exists that evaluates
-exact result:<span style="font-family: Courier New,Courier,monospace;"><br>
+the exact result:<span style="font-family: Courier New,Courier,monospace;"><br>
       <br>
Predicate: A/B + C/D ?< 0;<br>
After math. transform: (A*D + B*C) / (B * D) ?< 0;<br>

Modified: trunk/libs/polygon/doc/voronoi_robust_fpt.htm
==============================================================================
--- trunk/libs/polygon/doc/voronoi_robust_fpt.htm (original)
+++ trunk/libs/polygon/doc/voronoi_robust_fpt.htm 2012-09-10 14:42:14 EDT (Mon, 10 Sep 2012)
@@ -3,6 +3,8 @@

+
+

   <meta http-equiv="Content-Language" content="en-us">

@@ -58,8 +60,7 @@
         <li>Voronoi Predicates</li>
         <li>Voronoi Robust FPT<br>
         </li>
- <li>Voronoi Utils<br>
- </li>
+
       </ul>
       <h3 class="navbar">Other Resources</h3>
       <ul>
@@ -133,7 +134,7 @@
be
extremely large in case their values are close to each other (this is
also known as the cancellation error).<br>
-To explain this a bit consider the following expression (~ - stands for
+To explain this a bit, consider the following expression (~ - stands for
almost equal, << - many times larger than):<br>
       <br>
       <span style="font-family: Courier New,Courier,monospace;">A - B +
@@ -165,7 +166,7 @@
result of
the expression that contains square roots within defined relative
error.
-As an example consider the following expression:<br>
+As an example, consider the following expression:<br>
       <br>
       <span style="font-family: Courier New,Courier,monospace;">A *
sqrt(a) - B * sqrt(b), A * B > 0, a >= 0, b >= 0;</span><br>

Deleted: trunk/libs/polygon/doc/voronoi_utils.htm
==============================================================================
--- trunk/libs/polygon/doc/voronoi_utils.htm 2012-09-10 14:42:14 EDT (Mon, 10 Sep 2012)
+++ (empty file)
@@ -1,380 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<html><head>
-
-
-
-
-
-
- <meta http-equiv="Content-Language" content="en-us">
-
-
- <meta http-equiv="Content-Type" content="text/html; charset=windows-1252"><title>Voronoi Utils</title>
-
-
-
-
- <meta http-equiv="content-type" content="text/html; charset=utf-8">
-
-
- <meta http-equiv="content-type" content="text/html; charset=utf-8"></head><body>
-<table style="margin: 0pt; padding: 0pt; width: 100%;" border="0" cellpadding="0" cellspacing="0">
-
- <tbody>
- <tr>
- <td style="background-color: rgb(238, 238, 238);" valign="top" nowrap="1">
- <div style="padding: 5px;" align="center"> <img src="images/boost.png" border="0" height="86" width="277"><a title="www.boost.org home page" tabindex="2" style="border: medium none ;" href="http://www.boost.org/"> </a></div>
- <div style="margin: 5px;">
- <h3 class="navbar">Contents</h3>
- <ul>
- <li>Boost.Polygon Main Page</li>
- <li>Design Overview</li>
- <li>Isotropy</li>
- <li>Coordinate Concept</li>
- <li>Interval Concept</li>
- <li>Point Concept</li>
- <li>Segment Concept</li>
-
- <li>Rectangle Concept</li>
- <li>Polygon 90 Concept</li>
- <li><a href="gtl_polygon_90_with_holes_concept.htm">Polygon 90
-With Holes Concept</a></li>
- <li>Polygon 45 Concept</li>
- <li><a href="gtl_polygon_45_with_holes_concept.htm">Polygon 45
-With Holes Concept</a></li>
- <li>Polygon Concept</li>
- <li><a href="gtl_polygon_with_holes_concept.htm">Polygon With
-Holes Concept</a></li>
- <li><a href="gtl_polygon_90_set_concept.htm">Polygon 90 Set
-Concept</a></li>
- <li><a href="gtl_polygon_45_set_concept.htm">Polygon 45 Set
-Concept</a></li>
- <li>Polygon Set Concept</li>
- <li><a href="gtl_connectivity_extraction_90.htm">Connectivity
-Extraction 90</a></li>
- <li><a href="gtl_connectivity_extraction_45.htm">Connectivity
-Extraction 45</a></li>
- <li><a href="gtl_connectivity_extraction.htm">Connectivity
-Extraction</a></li>
- <li>Property Merge 90</li>
- <li>Property Merge 45</li>
- <li>Property Merge</li>
- <li><a href="voronoi_main.htm">Voronoi Main Page<br>
- </a></li>
- <li>Voronoi Benchmark</li>
- <li>Voronoi Builder<br>
- </li>
- <li>Voronoi Diagram</li>
- <li>Voronoi Predicates</li>
- <li>Voronoi Robust FPT<br>
- </li>
- <li>Voronoi Utils<br>
- </li>
- </ul>
- <h3 class="navbar">Other Resources</h3>
- <ul>
- <li>GTL Boostcon 2009 Paper</li>
- <li><a href="GTL_boostcon_draft03.pdf">GTL Boostcon 2009
-Presentation</a></li>
- <li>Performance Analysis</li>
- <li>Layout Versus Schematic Tutorial</li>
- <li>Minkowski Sum Tutorial</li>
- <li>Voronoi Basic Tutorial</li>
- <li><a href="voronoi_advanced_tutorial.htm">Voronoi Advanced
-Tutorial</a></li>
- </ul>
- </div>
- <h3 class="navbar">Polygon Sponsor</h3>
- <div style="padding: 5px;" align="center"> <img src="images/intlogo.gif" border="0" height="51" width="127"><a title="www.adobe.com home page" tabindex="2" style="border: medium none ;" href="http://www.adobe.com/"> </a></div>
- </td>
- <td style="padding-left: 10px; padding-right: 10px; padding-bottom: 10px;" valign="top" width="100%"> <br>
-
- <h1>Voronoi Utils</h1>
-Voronoi
-utilities implements a set of tools that users may find useful
-especially for
-the visualization of the Voronoi diagrams or discretization of the
-parabolic
-edges. <br>
- <h2>Important<br>
- </h2>
-
-There are no warranties about precision of the
-output structures produced by the utilities class. This is mostly
-because input
-coordinate type the utilities operate with
-is supposed to be double. Any degeneracies may be reported, however those are of low
-priority to be fixed. <br>
- <h2>Declaration</h2>
-
-
- <span style="font-family: Courier New,Courier,monospace;">template
-<typename T, typename TRAITS = voronoi_utils_traits<T> ></span><br style="font-family: Courier New,Courier,monospace;">
- <span style="font-family: Courier New,Courier,monospace;">class
-voronoi_utils;<br>
- <br>
- </span><span style="font-family: Courier New,Courier,monospace;">T
-- </span>output coordinate type used by the utilities.<br>
- <span style="font-family: Courier New,Courier,monospace;">TRAITS
-- </span>output geometries type traits (see definition below).<br>
- <h2 style="color: rgb(0, 0, 0); font-family: 'Times New Roman'; font-style: normal; font-variant: normal; letter-spacing: normal; line-height: normal; orphans: 2; text-indent: 0px; text-transform: none; white-space: normal; widows: 2; word-spacing: 0px;">Member
-Functions</h2>
- <table style="text-align: left; width: 100%;" border="1" cellpadding="2" cellspacing="2">
- <tbody>
- <tr>
- <td><span style="font-family: Courier New,Courier,monospace;">template
-<typename CT></span><br style="font-family: Courier New,Courier,monospace;">
- <span style="font-family: Courier New,Courier,monospace;">static
-brect_type scale_bounding_rectangle(<br>
-  const bounding_rectangle<CT> &brect,<br>  fpt_type factor = 1.0)</span><br>
- </td>
- <td>Returns the scaled
-bounding rectangle.<br>
-The center of the transformation corresponds to the center of the input
-rectangle.<br>
- </td>
- </tr>
- <tr>
- <td><span style="font-family: Courier New,Courier,monospace;">template
-<typename CT><br>
-static void discretize_finite_edge(<br>
-  const voronoi_edge<CT> &edge,<br>  coordinate_type max_error,<br>  point_set_type &discretization)</span><span style="font-family: Courier New,Courier,monospace;"></span><span style="font-family: Courier New,Courier,monospace;"></span><br>
- </td>
- <td>Provides the point
-discretization of the input voronoi edge.<br>
-If the edge is infinite (ray, line) returns empty output set.<br>
-Max error specifies the maximum distance between approximation and original parabolic arc.<br>
- </td>
- </tr>
- <tr>
- <td><span style="font-family: Courier New,Courier,monospace;">template
-<typename CT><br>
-static void clip_linear_edge(<br>
-  const voronoi_edge<CT> &edge,<br>  const brect_type &brect,<br>  point_set_type &clipped_edge)</span><br>
- </td>
- <td>Clips the input Voronoi
-edges with the specified rectangle.<br>
-If the edge is a parabolic arc returns empty output set.<br>
- </td>
- </tr>
- <tr>
- <td><span style="font-family: Courier New,Courier,monospace;">template
-<typename PointType></span><br style="font-family: Courier New,Courier,monospace;">
- <span style="font-family: Courier New,Courier,monospace;">static
-void clip_linear_edge(<br>
-  const PointType &p1,<br>  const PointType &p2,<br>  const brect_type &brect,<br>  point_set_type &clipped_edge)</span><br>
- </td>
- <td>Clips the input linear
-edge with the specified rectangle.<br>
-The edge is defined by its endpoints.<br>
- </td>
- </tr>
- </tbody>
- </table>
-
- <h2 style="color: rgb(0, 0, 0); font-family: 'Times New Roman'; font-style: normal; font-variant: normal; letter-spacing: normal; line-height: normal; orphans: 2; text-indent: 0px; text-transform: none; white-space: normal; widows: 2; word-spacing: 0px;">Member Types</h2>
-
-
- <table style="text-align: left; width: 100%;" border="1" cellpadding="2" cellspacing="2">
- <tbody>
- <tr>
- <td>coordinate_type</td>
- <td>Coordinate type.</td>
- </tr>
- <tr>
- <td>point_type</td>
- <td>2D Point</td>
- </tr>
- <tr>
- <td>point_set_type</td>
- <td>2D Point set.</td>
- </tr>
- <tr>
- <td>brect_type</td>
- <td>Bounding rectangle.</td>
- </tr>
- </tbody>
- </table>
- <h1>Bounding Rectangle</h1>
-
-The module provides implementation of a simple bounding rectangle data structure.<br>
- <h2>Declaration</h2>
-
-
-
- <span style="font-family: Courier New,Courier,monospace;">template
-<typename T></span><br style="font-family: Courier New,Courier,monospace;">
- <span style="font-family: Courier New,Courier,monospace;">class
-bounding_rectangle;<br>
- <br>
-T - </span>coordinate type the rectangle operates with.<br>
- <h2 style="color: rgb(0, 0, 0); font-family: 'Times New Roman'; font-style: normal; font-variant: normal; letter-spacing: normal; line-height: normal; orphans: 2; text-indent: 0px; text-transform: none; white-space: normal; widows: 2; word-spacing: 0px;">Member
-Functions</h2>
- <table style="text-align: left; width: 100%;" border="1" cellpadding="2" cellspacing="2">
- <tbody>
- <tr>
- <td style="font-family: Courier New,Courier,monospace;">bounding_rectangle()<br>
- </td>
- <td>Default constructor.
-Initializes the empty bounding rectangle.<br>
- </td>
- </tr>
- <tr>
- <td style="font-family: Courier New,Courier,monospace;">bounding_rectangle(<br>
-    coordinate_type x1,<br>
-    coordinate_type y1,<br>
-    coordinate_type x2,<br>
-    coordinate_type y2)<br>
- </td>
- <td>Constructs the bounding
-rectangle with the given coordinates.<br>
- </td>
- </tr>
- <tr>
- <td style="font-family: Courier New,Courier,monospace;">void
-update(<br>
-    coordinate_type x,<br>
-    coordinate_type y)<br>
- </td>
- <td>Extends the bounding
-rectangle with the specified point defined by its coordinates.<br>
-If the rectangle is not initialized, initializes it with the specifed
-point.<br>
- </td>
- </tr>
- <tr>
- <td style="font-family: Courier New,Courier,monospace;">bool
-is_empty() const<br>
- </td>
- <td>Returns true if the
-rectangle is empty (uninitialized), else false.<br>
- </td>
- </tr>
- <tr>
- <td style="font-family: Courier New,Courier,monospace;">void
-clear()<br>
- </td>
- <td>Sets rectangle to an empty
-state.<br>
- </td>
- </tr>
- <tr>
- <td style="font-family: Courier New,Courier,monospace;">bool
-contains(<br>
-   coordinate_type x,<br>
-   coordinate_type y) const<br>
- </td>
- <td>Returns true if the
-rectangle contains the given point defined by its coordinates, else
-false.<br>
- </td>
- </tr>
- <tr>
- <td style="font-family: Courier New,Courier,monospace;">coordinate_type
-x_min() const<br>
- </td>
- <td>Returns the x coordinate
-of the bottom left corner of the rectangle.<br>
- </td>
- </tr>
- <tr>
- <td style="font-family: Courier New,Courier,monospace;">coordinate_type
-y_min() const<br>
- </td>
- <td>Returns the y coordinate
-of the bottom left corner of the rectangle.<br>
- </td>
- </tr>
- <tr>
- <td style="font-family: Courier New,Courier,monospace;">coordinate_type
-x_max() const<br>
- </td>
- <td>Returns the x coordinate
-of the top right corner of the rectangle.<br>
- </td>
- </tr>
- <tr>
- <td style="font-family: Courier New,Courier,monospace;">coordinate_type
-y_max() const<br>
- </td>
- <td>Returns the y coordinate
-of the top right corner of the rectangle.<br>
- </td>
- </tr>
- </tbody>
- </table>
-
- <h1>Voronoi Utils Traits</h1>
-Voronoi utils traits supply Voronoi utilities with appropriate input/output types and type converter structure.<br>
- <h2>Declaration</h2>
-
-
-
- <span style="font-family: Courier New,Courier,monospace;">template
-<typename fpt></span><br style="font-family: Courier New,Courier,monospace;">
- <span style="font-family: Courier New,Courier,monospace;">struct
-voronoi_utils_traits;</span><br style="font-family: Courier New,Courier,monospace;">
-
-
- <h2 style="color: rgb(0, 0, 0); font-family: 'Times New Roman'; font-style: normal; font-variant: normal; letter-spacing: normal; line-height: normal; orphans: 2; text-indent: 0px; text-transform: none; white-space: normal; widows: 2; word-spacing: 0px;">Member Types<br>
- </h2>
- <table style="text-align: left; width: 100%;" border="1" cellpadding="2" cellspacing="2">
- <tbody>
- <tr>
- <td>coordinate_type<br>
- </td>
- <td>Coordinate type.<br>
- </td>
- </tr>
- <tr>
- <td>point_type<br>
- </td>
- <td>2D Point .<br>
- </td>
- </tr>
- <tr>
- <td>point_set_type<br>
- </td>
- <td>2D Point set.<br>
- </td>
- </tr>
- <tr>
- <td>brect_type<br>
- </td>
- <td>Bounding rectangle.<br>
- </td>
- </tr>
- <tr>
- <td>ctype_converter_type<br>
- </td>
- <td>Coordinate type converter structure.<br>
- </td>
- </tr>
- </tbody>
- </table>
-
- </td>
- </tr>
- <tr>
- <td style="background-color: rgb(238, 238, 238);" valign="top" nowrap="1"> </td>
- <td style="padding-left: 10px; padding-right: 10px; padding-bottom: 10px;" valign="top" width="100%">
- <table class="docinfo" id="table2" frame="void" rules="none">
- <colgroup> <col class="docinfo-name"><col class="docinfo-content"> </colgroup> <tbody valign="top">
- <tr>
- <th class="docinfo-name">Copyright:</th>
- <td>Copyright © Andrii Sydorchuk 2010-2012.</td>
- </tr>
- <tr class="field">
- <th class="docinfo-name">License:</th>
- <td class="field-body">Distributed under the Boost Software
-License, Version 1.0. (See accompanying file <tt class="literal"><span class="pre">LICENSE_1_0.txt</span></tt> or copy at <a class="reference" target="_top" href="http://www.boost.org/LICENSE_1_0.txt">
-http://www.boost.org/LICENSE_1_0.txt>)</td>
- </tr>
- </tbody>
- </table>
- </td>
- </tr>
- </tbody>
-</table>
-
-</body></html>
\ No newline at end of file

Next message: sydorchuk.andriy_at_[hidden]: "[Boost-commit] svn:boost r80482 - in trunk: boost/polygon libs/polygon/doc libs/polygon/example libs/polygon/test"
Previous message: mimomorin_at_[hidden]: "[Boost-commit] svn:boost r80480 - in trunk/libs/config/doc: . html"

Date view	Thread view	Subject view	Author view

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