$include_dir="/home/hyper-archives/boost-commit/include"; include("$include_dir/msg-header.inc") ?>
Subject: [Boost-commit] svn:boost r77119 - sandbox/gtl/doc
From: sydorchuk.andriy_at_[hidden]
Date: 2012-02-26 11:02:24
Author: asydorchuk
Date: 2012-02-26 11:02:23 EST (Sun, 26 Feb 2012)
New Revision: 77119
URL: http://svn.boost.org/trac/boost/changeset/77119
Log:
Updating voronoi predicates docs.
Text files modified: 
   sandbox/gtl/doc/index.htm |    55 ++++++++++++++++++++++++----------------
   1 files changed, 33 insertions(+), 22 deletions(-)
Modified: sandbox/gtl/doc/index.htm
==============================================================================
--- sandbox/gtl/doc/index.htm	(original)
+++ sandbox/gtl/doc/index.htm	2012-02-26 11:02:23 EST (Sun, 26 Feb 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><!--
+<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en"><head>
+<!--
     Copyright 2009-2010 Intel Corporation
     license banner
 --><title>Boost Polygon Library: Main Page</title>
@@ -37,9 +38,18 @@
             <li>Property Merge 90</li>
             <li>Property Merge 45</li>
             <li>Property Merge</li>
+        <li>Voronoi Main</li>
+        <li>Voronoi Benchmark<br />
+        </li>
+
             <li>Voronoi Builder</li>
-            <li>Voronoi Diagram Datastructure</li>
-            <li>Voronoi Lazy Arithmetic Concept</li>			
+            <li><a href="voronoi_diagram_datastructure.htm">Voronoi Diagram<br />
+</a></li>
+        <li>Voronoi Utils<br />
+        </li>
+
+            <li><a href="voronoi_lazy_arithmetic.htm">Voronoi Lazy Arithmetic<br />
+</a></li>			
         </ul>
         <h3 class="navbar">Other Resources</h3>
         <ul>
@@ -49,10 +59,8 @@
              <li>Performance Analysis</li>
                         <li>Layout Versus Schematic Tutorial</li>
                         <li>Minkowski Sum Tutorial</li>
-			<li><a href="voronoi_diagram_basic_tutorial.htm">Voronoi Diagram 
-			Basic Tutorial</a></li>
-			<li><a href="voronoi_diagram_advanced_tutorial.htm">Voronoi Diagram 
-			Advanced Tutorial</a></li>
+			<li>Voronoi Basic Tutorial</li>
+			<li>Voronoi Advanced Tutorial</li>
         </ul>
     </div>
         <h3 class="navbar">Polygon Sponsor</h3>
@@ -96,15 +104,16 @@
 numerical robustness aspects.
 </p>
 <p><img src="images/voronoi.png" border="0" height="300" width="900" /></p>
-<p>
-The coordinate data type is a template parameter of all data types and 
-algorithms provided by the library, and is expected to be integral. Floating point coordinate data types are not supported by the algorithms 
-implemented in the library due to the fact that the achieving floating point 
-robustness implies a different set of algorithms and generally platform specific 
-assumptions about floating point representations. 
-For additional detailed discussion of the library and its implementation 
-including benchmark comparisons with other open source alternatives please see 
-the paper and
+<p>The coordinate data type is a template parameter of all data types
+and algorithms provided by the library, and is expected to be integral.
+Floating point coordinate data types are not supported by the
+algorithms implemented in the library due to the fact that the
+achieving floating point robustness implies a different set of
+algorithms and generally platform specific assumptions about floating
+point representations. 
+For additional detailed discussion of the library and its
+implementation including benchmark comparisons with other open source
+alternatives please see the paper and
 <a href="GTL_boostcon_draft03.htm">presentation</a> from
 <a href="http://www.boostcon.com/home">boostcon</a> 2009 as well as a detailed
 <a href="analysis.htm">analysis</a> of the runtime complexity of 
@@ -202,8 +211,10 @@
                 <li>connectivity_extraction_usage.cpp 
                 Using the connectivity extraction algorithm to build a connectivity 
                 graph on polygons</li>
-		<li>property_merge_usage.cpp 
+		
+            <li>property_merge_usage.cpp 
                 Using the n-layer map-overlay algorithm on polygon data</li>
+
     </ul>
 
 </li><li>Tutorials: 
@@ -213,11 +224,11 @@
         extraction application</li>
         <li>Minkowski Sum Learn how to 
         apply Boost.Polygon capabilities to implement Minkowski sum of polygon sets</li>
-	<li>Voronoi Diagram Basic Learn how 
-	to build Voronoi diagram without digging into library details.</li>
-	<li>Voronoi Diagram Advanced 
-	Learn how to configure Voronoi diagram builder and Voronoi diagram 
-	datastructure to suit your requirements. </li>
+	<li>Voronoi Basic Learn how 
+	to construct Voronoi diagrams without digging into library details.</li>
+	<li>Voronoi Advanced 
+	Learn how to configure Voronoi builder and Voronoi diagram 
+	datastructures to suit your requirements. </li>
 </ul>
 
 </li></ul>