Boost-Commit :

Date view	Thread view	Subject view	Author view

Subject: [Boost-commit] svn:boost r77858 - sandbox/gtl/doc
From: sydorchuk.andriy_at_[hidden]
Date: 2012-04-09 15:10:35

Next message: sydorchuk.andriy_at_[hidden]: "[Boost-commit] svn:boost r77859 - sandbox/gtl/libs/polygon/benchmark/benchmark_results"
Previous message: vicente.botet_at_[hidden]: "[Boost-commit] svn:boost r77857 - trunk/libs/thread/test"

Author: asydorchuk
Date: 2012-04-09 15:10:32 EDT (Mon, 09 Apr 2012)
New Revision: 77858
URL: http://svn.boost.org/trac/boost/changeset/77858

Log:
Updating Boost.Polygon documentation.

Text files modified:
   sandbox/gtl/doc/gtl_connectivity_extraction.htm | 81 +++++---
   sandbox/gtl/doc/gtl_connectivity_extraction_45.htm | 81 +++++---
   sandbox/gtl/doc/gtl_connectivity_extraction_90.htm | 81 +++++---
   sandbox/gtl/doc/gtl_coordinate_concept.htm | 110 ++++++-----
   sandbox/gtl/doc/gtl_design_overview.htm | 52 +++--
   sandbox/gtl/doc/gtl_interval_concept.htm | 251 ++++++++++++++-------------
   sandbox/gtl/doc/gtl_isotropy.htm | 123 +++++++------
   sandbox/gtl/doc/gtl_point_concept.htm | 203 ++++++++++++----------
   sandbox/gtl/doc/gtl_polygon_45_concept.htm | 198 +++++++++++----------
   sandbox/gtl/doc/gtl_polygon_45_set_concept.htm | 233 +++++++++++++------------
   sandbox/gtl/doc/gtl_polygon_45_with_holes_concept.htm | 186 +++++++++++---------
   sandbox/gtl/doc/gtl_polygon_90_concept.htm | 184 ++++++++++---------
   sandbox/gtl/doc/gtl_polygon_90_set_concept.htm | 346 +++++++++++++++++++------------------
   sandbox/gtl/doc/gtl_polygon_90_with_holes_concept.htm | 190 +++++++++++---------
   sandbox/gtl/doc/gtl_polygon_concept.htm | 200 +++++++++++----------
   sandbox/gtl/doc/gtl_polygon_set_concept.htm | 219 +++++++++++++-----------
   sandbox/gtl/doc/gtl_polygon_with_holes_concept.htm | 190 +++++++++++---------
   sandbox/gtl/doc/gtl_property_merge.htm | 83 +++++---
   sandbox/gtl/doc/gtl_property_merge_45.htm | 83 +++++---
   sandbox/gtl/doc/gtl_property_merge_90.htm | 83 +++++---
   sandbox/gtl/doc/gtl_rectangle_concept.htm | 359 +++++++++++++++++++++------------------
   21 files changed, 1907 insertions(+), 1629 deletions(-)

Modified: sandbox/gtl/doc/gtl_connectivity_extraction.htm
==============================================================================
--- sandbox/gtl/doc/gtl_connectivity_extraction.htm (original)
+++ sandbox/gtl/doc/gtl_connectivity_extraction.htm 2012-04-09 15:10:32 EDT (Mon, 09 Apr 2012)
@@ -1,15 +1,14 @@
<!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" 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"><head>
-<title>Boost Polygon Library: Connectivity Extraction 45</title>
- <meta http-equiv="content-type" content="text/html;charset=ISO-8859-1">
- 
-<table style="margin: 0pt; padding: 0pt; width: 100%;" border="0" cellpadding="0" cellspacing="0"><tbody><tr>
+--><title>Boost Polygon Library: Connectivity Extraction 45</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">
- <img border="0" src="images/boost.png" width="277" height="86"><a title="www.boost.org home page" href="http://www.boost.org/" tabindex="2" style="border: medium none ;">
+ <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;">
@@ -37,20 +36,34 @@
 <li>Property Merge 90</li>
 <li>Property Merge 45</li>
 <li>Property Merge</li>
+ <li><a href="voronoi_main.htm">Voronoi Main Page 
+</a></li>
+ <li>Voronoi Benchmark 
+ </li>
+ <li>Voronoi Builder</li>
+ <li><a href="voronoi_diagram.htm">Voronoi Diagram 
+</a></li>
+ <li>Voronoi Predicates</li>
+ <li>Voronoi Robust FPT 
+ </li>
+ <li>Voronoi Utils</li>
+
 </ul>
 <h3 class="navbar">Other Resources</h3>
 <ul>
- <li>GTL Boostcon 2009 Paper</li>
- <li><a href="GTL_boostcon_draft03.htm">GTL Boostcon 2009
+ <li>GTL Boostcon 2009 Paper</li>
+ <li><a href="GTL_boostcon_draft03.htm">GTL Boostcon 2009
 Presentation</a></li>
- <li>Performance Analysis</li>
- <li>Layout Versus Schematic Tutorial</li>
- <li>Minkowski Sum Tutorial</li>
- </ul>
+ <li>Performance Analysis</li>
+ <li>Layout Versus Schematic Tutorial</li>
+ <li>Minkowski Sum Tutorial</li>
+ <li>Voronoi Basic Tutorial</li>
+ <li>Voronoi Advanced Tutorial</li>
+</ul>
 </div>
 <h3 class="navbar">Polygon Sponsor</h3>
 <div style="padding: 5px;" align="center">
- <img border="0" src="images/intlogo.gif" width="127" height="51"><a title="www.adobe.com home page" href="http://www.adobe.com/" tabindex="2" style="border: medium none ;">
+ <img src="images/intlogo.gif" border="0" height="51" width="127" /><a title="www.adobe.com home page" href="http://www.adobe.com/" tabindex="2" style="border: medium none ;">
 </a>
 </div>
</td>
@@ -58,12 +71,12 @@



- 
+ 

<h1>Connectivity Extraction</h1>


-The connectivity extraction algorithm constructs the connectivity graph where
+The connectivity extraction algorithm constructs the connectivity graph where
input polygon sets are modeled as graph nodes and assigned node ids and
overlap/touching between input polygon sets is modeled as graph edges.  One
supported graph formats is std::vector<std::set<int> > where node ids index into
@@ -73,33 +86,33 @@
the operator[] is used internally to access the graph   The other
supported graph format is std::map<int, std::set<int> > which is slightly easier to
work with, but potentially more expensive.  Improving the interface to
-support more generic graph concepts is deferred to future work.The following
-is the declaration of the connectivity extraction algorithm.
-template <typename coordinate_type> 
-class connectivity_extraction;
+support more generic graph concepts is deferred to future work.The following
+is the declaration of the connectivity extraction algorithm.
+template <typename coordinate_type> 
+class connectivity_extraction;
Example code connectivity_extraction_usage.cpp
 demonstrates using the connectivity extraction algorithm to build a
-connectivity graph on geometry.<h2>Member Functions</h2>
-<table border="1" width="100%" id="table1">
- <tr>
+connectivity graph on geometry.<h2>Member Functions</h2>
+<table id="table1" border="1" width="100%">
+ <tbody><tr>
 <td width="586">connectivity_extraction()</td>
 <td>Default constructor. </td>
 </tr>
 <tr>
- <td width="586">connectivity_extraction(      const
+ <td width="586">connectivity_extraction(      const
 connectivity_extraction& that)</td>
 <td>Copy construct.</td>
 </tr>
 <tr>
 <td width="586">
-unsigned int insert(const polygon_set_data<coordinate_type>& ps)</td>
+unsigned int insert(const polygon_set_data<coordinate_type>& ps)</td>
 <td>Insert a polygon set graph node, the
 value returned is the id of the graph node.</td>
 </tr>
 <tr>
 <td width="586">

-template <class GeoObjT> 
+template <class GeoObjT> 
unsigned int insert(const GeoObjT& geoObj)</td>
 <td>Insert a geometry object that is a refinement of polygon set as a
 graph node, the return value is the id of the graph node.</td>
@@ -107,24 +120,24 @@
 <tr>
 <td width="586">

-template <class GraphT> 
+template <class GraphT> 
void extract(GraphT& graph)</td>
 <td>Accepts a graph object that conforms to the expectations defined
 above.  Performs connectivity extraction and populates the graph
 object.</td>
 </tr>
- </table>
- <tr>
+ </tbody></table>
+ </td></tr><tr>
<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" rules="none" frame="void" id="table2">
+<table class="docinfo" id="table2" frame="void" rules="none">
 <colgroup>
- <col class="docinfo-name"><col class="docinfo-content">
+ <col class="docinfo-name" /><col class="docinfo-content" />
 </colgroup>
- <tbody vAlign="top">
+ <tbody valign="top">
 <tr>
 <th class="docinfo-name">Copyright:</th>
 <td>Copyright © Intel Corporation 2008-2010.</td>
@@ -137,6 +150,6 @@
 <a class="reference" target="_top" href="http://www.boost.org/LICENSE_1_0.txt">
 http://www.boost.org/LICENSE_1_0.txt>)</td>
 </tr>
-</table>
+</tbody></table>

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

Modified: sandbox/gtl/doc/gtl_connectivity_extraction_45.htm
==============================================================================
--- sandbox/gtl/doc/gtl_connectivity_extraction_45.htm (original)
+++ sandbox/gtl/doc/gtl_connectivity_extraction_45.htm 2012-04-09 15:10:32 EDT (Mon, 09 Apr 2012)
@@ -1,15 +1,14 @@
<!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" 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"><head>
-<title>Boost Polygon Library: Connectivity Extraction 45</title>
- <meta http-equiv="content-type" content="text/html;charset=ISO-8859-1">
- 
-<table style="margin: 0pt; padding: 0pt; width: 100%;" border="0" cellpadding="0" cellspacing="0"><tbody><tr>
+--><title>Boost Polygon Library: Connectivity Extraction 45</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">
- <img border="0" src="images/boost.png" width="277" height="86"><a title="www.boost.org home page" href="http://www.boost.org/" tabindex="2" style="border: medium none ;">
+ <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;">
@@ -37,20 +36,34 @@
 <li>Property Merge 90</li>
 <li>Property Merge 45</li>
 <li>Property Merge</li>
+ <li><a href="voronoi_main.htm">Voronoi Main Page 
+</a></li>
+ <li>Voronoi Benchmark 
+ </li>
+ <li>Voronoi Builder</li>
+ <li><a href="voronoi_diagram.htm">Voronoi Diagram 
+</a></li>
+ <li>Voronoi Predicates</li>
+ <li>Voronoi Robust FPT 
+ </li>
+ <li>Voronoi Utils</li>
+
 </ul>
 <h3 class="navbar">Other Resources</h3>
 <ul>
- <li>GTL Boostcon 2009 Paper</li>
- <li><a href="GTL_boostcon_draft03.htm">GTL Boostcon 2009
+ <li>GTL Boostcon 2009 Paper</li>
+ <li><a href="GTL_boostcon_draft03.htm">GTL Boostcon 2009
 Presentation</a></li>
- <li>Performance Analysis</li>
- <li>Layout Versus Schematic Tutorial</li>
- <li>Minkowski Sum Tutorial</li>
- </ul>
+ <li>Performance Analysis</li>
+ <li>Layout Versus Schematic Tutorial</li>
+ <li>Minkowski Sum Tutorial</li>
+ <li>Voronoi Basic Tutorial</li>
+ <li>Voronoi Advanced Tutorial</li>
+</ul>
 </div>
 <h3 class="navbar">Polygon Sponsor</h3>
 <div style="padding: 5px;" align="center">
- <img border="0" src="images/intlogo.gif" width="127" height="51"><a title="www.adobe.com home page" href="http://www.adobe.com/" tabindex="2" style="border: medium none ;">
+ <img src="images/intlogo.gif" border="0" height="51" width="127" /><a title="www.adobe.com home page" href="http://www.adobe.com/" tabindex="2" style="border: medium none ;">
 </a>
 </div>
</td>
@@ -58,12 +71,12 @@



- 
+ 

<h1>Connectivity Extraction 45</h1>


-The connectivity extraction algorithm constructs the connectivity graph where
+The connectivity extraction algorithm constructs the connectivity graph where
input polygon sets are modeled as graph nodes and assigned node ids and
overlap/touching between input polygon sets is modeled as graph edges.  One
supported graph formats is std::vector<std::set<int> > where node ids index into
@@ -73,33 +86,33 @@
the operator[] is used internally to access the graph   The other
supported graph format is std::map<int, std::set<int> > which is slightly easier to
work with, but potentially more expensive.  Improving the interface to
-support more generic graph concepts is deferred to future work.The following
-is the declaration of the connectivity extraction algorithm.
-template <typename coordinate_type> 
-class connectivity_extraction_45;
+support more generic graph concepts is deferred to future work.The following
+is the declaration of the connectivity extraction algorithm.
+template <typename coordinate_type> 
+class connectivity_extraction_45;
Example code connectivity_extraction_usage.cpp
 demonstrates using the connectivity extraction algorithm to build a
-connectivity graph on geometry.<h2>Member Functions</h2>
-<table border="1" width="100%" id="table1">
- <tr>
+connectivity graph on geometry.<h2>Member Functions</h2>
+<table id="table1" border="1" width="100%">
+ <tbody><tr>
 <td width="586">connectivity_extraction_45()</td>
 <td>Default constructor. </td>
 </tr>
 <tr>
- <td width="586">connectivity_extraction_45(      const
+ <td width="586">connectivity_extraction_45(      const
 connectivity_extraction_45& that)</td>
 <td>Copy construct.</td>
 </tr>
 <tr>
 <td width="586">
-unsigned int insert(const polygon_45_set_data<coordinate_type>& ps)</td>
+unsigned int insert(const polygon_45_set_data<coordinate_type>& ps)</td>
 <td>Insert a polygon set graph node, the
 value returned is the id of the graph node.</td>
 </tr>
 <tr>
 <td width="586">

-template <class GeoObjT> 
+template <class GeoObjT> 
unsigned int insert(const GeoObjT& geoObj)</td>
 <td>Insert a geometry object that is a refinement of polygon 45 set as a
 graph node, the return value is the id of the graph node.</td>
@@ -107,24 +120,24 @@
 <tr>
 <td width="586">

-template <class GraphT> 
+template <class GraphT> 
void extract(GraphT& graph)</td>
 <td>Accepts a graph object that conforms to the expectations defined
 above.  Performs connectivity extraction and populates the graph
 object.</td>
 </tr>
- </table>
- <tr>
+ </tbody></table>
+ </td></tr><tr>
<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" rules="none" frame="void" id="table2">
+<table class="docinfo" id="table2" frame="void" rules="none">
 <colgroup>
- <col class="docinfo-name"><col class="docinfo-content">
+ <col class="docinfo-name" /><col class="docinfo-content" />
 </colgroup>
- <tbody vAlign="top">
+ <tbody valign="top">
 <tr>
 <th class="docinfo-name">Copyright:</th>
 <td>Copyright © Intel Corporation 2008-2010.</td>
@@ -137,6 +150,6 @@
 <a class="reference" target="_top" href="http://www.boost.org/LICENSE_1_0.txt">
 http://www.boost.org/LICENSE_1_0.txt>)</td>
 </tr>
-</table>
+</tbody></table>

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

Modified: sandbox/gtl/doc/gtl_connectivity_extraction_90.htm
==============================================================================
--- sandbox/gtl/doc/gtl_connectivity_extraction_90.htm (original)
+++ sandbox/gtl/doc/gtl_connectivity_extraction_90.htm 2012-04-09 15:10:32 EDT (Mon, 09 Apr 2012)
@@ -1,15 +1,14 @@
<!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" 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"><head>
-<title>Boost Polygon Library: Connectivity Extraction 90</title>
- <meta http-equiv="content-type" content="text/html;charset=ISO-8859-1">
- 
-<table style="margin: 0pt; padding: 0pt; width: 100%;" border="0" cellpadding="0" cellspacing="0"><tbody><tr>
+--><title>Boost Polygon Library: Connectivity Extraction 90</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">
- <img border="0" src="images/boost.png" width="277" height="86"><a title="www.boost.org home page" href="http://www.boost.org/" tabindex="2" style="border: medium none ;">
+ <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;">
@@ -37,20 +36,34 @@
 <li>Property Merge 90</li>
 <li>Property Merge 45</li>
 <li>Property Merge</li>
+ <li><a href="voronoi_main.htm">Voronoi Main Page 
+</a></li>
+ <li>Voronoi Benchmark 
+ </li>
+ <li>Voronoi Builder</li>
+ <li><a href="voronoi_diagram.htm">Voronoi Diagram 
+</a></li>
+ <li>Voronoi Predicates</li>
+ <li>Voronoi Robust FPT 
+ </li>
+ <li>Voronoi Utils</li>
+
 </ul>
 <h3 class="navbar">Other Resources</h3>
 <ul>
- <li>GTL Boostcon 2009 Paper</li>
- <li><a href="GTL_boostcon_draft03.htm">GTL Boostcon 2009
+ <li>GTL Boostcon 2009 Paper</li>
+ <li><a href="GTL_boostcon_draft03.htm">GTL Boostcon 2009
 Presentation</a></li>
- <li>Performance Analysis</li>
- <li>Layout Versus Schematic Tutorial</li>
- <li>Minkowski Sum Tutorial</li>
- </ul>
+ <li>Performance Analysis</li>
+ <li>Layout Versus Schematic Tutorial</li>
+ <li>Minkowski Sum Tutorial</li>
+ <li>Voronoi Basic Tutorial</li>
+ <li>Voronoi Advanced Tutorial</li>
+</ul>
 </div>
 <h3 class="navbar">Polygon Sponsor</h3>
 <div style="padding: 5px;" align="center">
- <img border="0" src="images/intlogo.gif" width="127" height="51"><a title="www.adobe.com home page" href="http://www.adobe.com/" tabindex="2" style="border: medium none ;">
+ <img src="images/intlogo.gif" border="0" height="51" width="127" /><a title="www.adobe.com home page" href="http://www.adobe.com/" tabindex="2" style="border: medium none ;">
 </a>
 </div>
</td>
@@ -58,12 +71,12 @@



- 
+ 

<h1>Connectivity Extraction 90</h1>


-The connectivity extraction algorithm constructs the connectivity graph where
+The connectivity extraction algorithm constructs the connectivity graph where
input polygon sets are modeled as graph nodes and assigned node ids and
overlap/touching between input polygon sets is modeled as graph edges.  One
supported graph formats is std::vector<std::set<int> > where node ids index into
@@ -73,33 +86,33 @@
the operator[] is used internally to access the graph   The other
supported graph format is std::map<int, std::set<int> > which is slightly easier to
work with, but potentially more expensive.  Improving the interface to
-support more generic graph concepts is deferred to future work.The following
-is the declaration of the connectivity extraction algorithm.
-template <typename coordinate_type> 
-class connectivity_extraction_90;
+support more generic graph concepts is deferred to future work.The following
+is the declaration of the connectivity extraction algorithm.
+template <typename coordinate_type> 
+class connectivity_extraction_90;
Example code connectivity_extraction_usage.cpp
 demonstrates using the connectivity extraction algorithm to build a
-connectivity graph on geometry.<h2>Member Functions</h2>
-<table border="1" width="100%" id="table1">
- <tr>
+connectivity graph on geometry.<h2>Member Functions</h2>
+<table id="table1" border="1" width="100%">
+ <tbody><tr>
 <td width="586">connectivity_extraction_90()</td>
 <td>Default constructor. </td>
 </tr>
 <tr>
- <td width="586">connectivity_extraction_90(      const
+ <td width="586">connectivity_extraction_90(      const
 connectivity_extraction_90& that)</td>
 <td>Copy construct.</td>
 </tr>
 <tr>
 <td width="586">
-unsigned int insert(const polygon_90_set_data<coordinate_type>& ps)</td>
+unsigned int insert(const polygon_90_set_data<coordinate_type>& ps)</td>
 <td>Insert a polygon set graph node, the
 value returned is the id of the graph node.</td>
 </tr>
 <tr>
 <td width="586">

-template <class GeoObjT> 
+template <class GeoObjT> 
unsigned int insert(const GeoObjT& geoObj)</td>
 <td>Insert a geometry object that is a refinement of polygon 90 set as a
 graph node, the return value is the id of the graph node.</td>
@@ -107,24 +120,24 @@
 <tr>
 <td width="586">

-template <class GraphT> 
+template <class GraphT> 
void extract(GraphT& graph)</td>
 <td>Accepts a graph object that conforms to the expectations defined
 above.  Performs connectivity extraction and populates the graph
 object.</td>
 </tr>
- </table>
- <tr>
+ </tbody></table>
+ </td></tr><tr>
<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" rules="none" frame="void" id="table2">
+<table class="docinfo" id="table2" frame="void" rules="none">
 <colgroup>
- <col class="docinfo-name"><col class="docinfo-content">
+ <col class="docinfo-name" /><col class="docinfo-content" />
 </colgroup>
- <tbody vAlign="top">
+ <tbody valign="top">
 <tr>
 <th class="docinfo-name">Copyright:</th>
 <td>Copyright © Intel Corporation 2008-2010.</td>
@@ -137,6 +150,6 @@
 <a class="reference" target="_top" href="http://www.boost.org/LICENSE_1_0.txt">
 http://www.boost.org/LICENSE_1_0.txt>)</td>
 </tr>
-</table>
+</tbody></table>

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

Modified: sandbox/gtl/doc/gtl_coordinate_concept.htm
==============================================================================
--- sandbox/gtl/doc/gtl_coordinate_concept.htm (original)
+++ sandbox/gtl/doc/gtl_coordinate_concept.htm 2012-04-09 15:10:32 EDT (Mon, 09 Apr 2012)
@@ -1,15 +1,15 @@
<!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" 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"><head>
-<title>Boost Polygon Library: Coordinate Concept</title>
- <meta http-equiv="content-type" content="text/html;charset=ISO-8859-1">
- 
-<table style="margin: 0pt; padding: 0pt; width: 100%;" border="0" cellpadding="0" cellspacing="0"><tbody><tr>
+--><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">
- <img border="0" src="images/boost.png" width="277" height="86"><a title="www.boost.org home page" href="http://www.boost.org/" tabindex="2" style="border: medium none ;">
+ <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;">
@@ -37,20 +37,34 @@
 <li>Property Merge 90</li>
 <li>Property Merge 45</li>
 <li>Property Merge</li>
+ <li><a href="voronoi_main.htm">Voronoi Main Page 
+</a></li>
+ <li>Voronoi Benchmark 
+ </li>
+ <li>Voronoi Builder</li>
+ <li><a href="voronoi_diagram.htm">Voronoi Diagram 
+</a></li>
+ <li>Voronoi Predicates</li>
+ <li>Voronoi Robust FPT 
+ </li>
+ <li>Voronoi Utils</li>
+
 </ul>
 <h3 class="navbar">Other Resources</h3>
 <ul>
- <li>GTL Boostcon 2009 Paper</li>
- <li><a href="GTL_boostcon_draft03.htm">GTL Boostcon 2009
+ <li>GTL Boostcon 2009 Paper</li>
+ <li><a href="GTL_boostcon_draft03.htm">GTL Boostcon 2009
 Presentation</a></li>
- <li>Performance Analysis</li>
- <li>Layout Versus Schematic Tutorial</li>
- <li>Minkowski Sum Tutorial</li>
- </ul>
+ <li>Performance Analysis</li>
+ <li>Layout Versus Schematic Tutorial</li>
+ <li>Minkowski Sum Tutorial</li>
+ <li>Voronoi Basic Tutorial</li>
+ <li>Voronoi Advanced Tutorial</li>
+</ul>
 </div>
 <h3 class="navbar">Polygon Sponsor</h3>
 <div style="padding: 5px;" align="center">
- <img border="0" src="images/intlogo.gif" width="127" height="51"><a title="www.adobe.com home page" href="http://www.adobe.com/" tabindex="2" style="border: medium none ;">
+ <img src="images/intlogo.gif" border="0" height="51" width="127" /><a title="www.adobe.com home page" href="http://www.adobe.com/" tabindex="2" style="border: medium none ;">
 </a>
 </div>
</td>
@@ -58,36 +72,36 @@



- 
+ 

<h1>Coordinate Concept</h1>


The coordinate concept tag is 
-coordinate_concept
+coordinate_concept
To register a user defined type as a model of coordinate concept, specialize the
geometry concept meta-function for that type.  In the example below
-CCoordinate is registered as a model of coordinate concept.
-template <> 
-struct geometry_concept<CCoordinate> { typedef coordinate_concept type; };
+CCoordinate is registered as a model of coordinate concept.
+template <> 
+struct geometry_concept<CCoordinate> { typedef coordinate_concept type; };
The coordinate type is expected to be integral and built-in numerical data types
such as float and int already have concept type traits specializations in the
library.  In the coordinate traits are type definitions for related types
are provided to allow the library to choose the best type to cast to under
various circumstances.  The definition of coordinate_traits and its
-specialization for int are shown below.
-template <typename T> 
-struct coordinate_traits {}; 
- 
-template <> 
-struct coordinate_traits<int> { 
-     typedef int coordinate_type; 
-     typedef long double area_type; 
-     typedef long long manhattan_area_type; 
-     typedef unsigned long long unsigned_area_type; 
-     typedef long long coordinate_difference; 
-     typedef long double coordinate_distance; 
-};
+specialization for int are shown below.
+template <typename T> 
+struct coordinate_traits {}; 
+ 
+template <> 
+struct coordinate_traits<int> { 
+     typedef int coordinate_type; 
+     typedef long double area_type; 
+     typedef long long manhattan_area_type; 
+     typedef unsigned long long unsigned_area_type; 
+     typedef long long coordinate_difference; 
+     typedef long double coordinate_distance; 
+};
By making use of the coordinate traits of int the library is able to avoid
overflow and handle the normal issues encountered when programming integer
geometry.  For the out of the ordinary issues there is a special
@@ -96,37 +110,37 @@
available in most compilers, long double, but can be overridden by specializing
for a particular coordinate type.  Use of gmp multi-precision rational or
similar data type is recommended for numerically robust calculations in the
-general polygon algorithms.
-template <typename T> 
-struct high_precision_type { 
-     typedef long double type; 
-};
-There is only one generic function on coordinate concepts, Euclidean distance.
+general polygon algorithms.
+template <typename T> 
+struct high_precision_type { 
+     typedef long double type; 
+};
+There is only one generic function on coordinate concepts, Euclidean distance.
template <typename coordinate_type_1, typename
-coordinate_type_2> 
-coordinate_difference euclidean_distance(coordinate_type_1, coordinate_type_2)
+coordinate_type_2> 
+coordinate_difference euclidean_distance(coordinate_type_1, coordinate_type_2)
This function returns the absolution value of the difference between the two
-coordinates.
+coordinates.
Note: older versions of the stl define a fully generic distance(T, T) function
for computing the difference between two iterators.  We were forced to name
-our distance function euclidean_distance to avoid name collision.
+our distance function euclidean_distance to avoid name collision.
The
<a href="http://www.mentor.com/products/esl/high_level_synthesis/ac_datatypes">
Algorithmic C</a> ac_int<128> is an example of a user defined coordinate data
type that satisfies the coordinate concept.  In general a data type should
define std::numeric_limits and be integer-like.  Floating point coordinate
types are not supported by all the algorithms and generally not suitable for use
-with the library at present.<tr>
+with the library at present.</td></tr><tr>
<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" rules="none" frame="void" id="table1">
+<table class="docinfo" id="table1" frame="void" rules="none">
 <colgroup>
- <col class="docinfo-name"><col class="docinfo-content">
+ <col class="docinfo-name" /><col class="docinfo-content" />
 </colgroup>
- <tbody vAlign="top">
+ <tbody valign="top">
 <tr>
 <th class="docinfo-name">Copyright:</th>
 <td>Copyright © Intel Corporation 2008-2010.</td>
@@ -139,6 +153,6 @@
 <a class="reference" target="_top" href="http://www.boost.org/LICENSE_1_0.txt">
 http://www.boost.org/LICENSE_1_0.txt>)</td>
 </tr>
-</table>
+</tbody></table>

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

Modified: sandbox/gtl/doc/gtl_design_overview.htm
==============================================================================
--- sandbox/gtl/doc/gtl_design_overview.htm (original)
+++ sandbox/gtl/doc/gtl_design_overview.htm 2012-04-09 15:10:32 EDT (Mon, 09 Apr 2012)
@@ -1,15 +1,14 @@
<!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" 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"><head>
-<title>Boost Polygon Library: Overview</title>
- <meta http-equiv="content-type" content="text/html;charset=ISO-8859-1">
- 
-<table style="margin: 0pt; padding: 0pt; width: 100%;" border="0" cellpadding="0" cellspacing="0"><tbody><tr>
+--><title>Boost Polygon Library: Overview</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">
- <img border="0" src="images/boost.png" width="277" height="86"><a title="www.boost.org home page" href="http://www.boost.org/" tabindex="2" style="border: medium none ;">
+ <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;">
@@ -38,6 +37,18 @@
 <li>Property Merge 90</li>
 <li>Property Merge 45</li>
 <li>Property Merge</li>
+ <li><a href="voronoi_main.htm">Voronoi Main Page 
+</a></li>
+ <li>Voronoi Benchmark 
+ </li>
+ <li>Voronoi Builder</li>
+ <li><a href="voronoi_diagram.htm">Voronoi Diagram 
+</a></li>
+ <li>Voronoi Predicates</li>
+ <li>Voronoi Robust FPT 
+ </li>
+ <li>Voronoi Utils</li>
+
 </ul>
 <h3 class="navbar">Other Resources</h3>
 <ul>
@@ -47,11 +58,14 @@
 <li>Performance Analysis</li>
 <li>Layout Versus Schematic Tutorial</li>
 <li>Minkowski Sum Tutorial</li>
+ <li>Voronoi Basic Tutorial</li>
+ <li>Voronoi Advanced Tutorial</li>
+
 </ul>
 </div>
 <h3 class="navbar">Polygon Sponsor</h3>
 <div style="padding: 5px;" align="center">
- <img border="0" src="images/intlogo.gif" width="127" height="51"><a title="www.adobe.com home page" href="http://www.adobe.com/" tabindex="2" style="border: medium none ;">
+ <img src="images/intlogo.gif" border="0" height="51" width="127" /><a title="www.adobe.com home page" href="http://www.adobe.com/" tabindex="2" style="border: medium none ;">
 </a>
 </div>
</td>
@@ -59,12 +73,12 @@



- 
+ 

<h1>Polygon Library Design Overview</h1>


-The Polygon library uses C++-Concepts inspired template programming to
+The Polygon library uses C++-Concepts inspired template programming to
provide generic library functions overloaded on concept type.  There are
currently thirteen concepts in the Polygon library type system.  A concept
object in the Polygon library is just an empty struct similar to a tag that
@@ -72,7 +86,7 @@
refinement diagram below.

-</body><img border="0" src="images/refinements.png" width="466" height="369">
+<img src="images/refinements.png" border="0" height="369" width="466" />
The arrows between diagram bubbles show concept refinement relationships.  This is
similar, but not identical to, inheritance relationships between normal classes. 
A refinement of a concept narrows down the definition of a more general concept. 
@@ -125,7 +139,7 @@
as that conceptual type with the library by
specializing the geometry_concept meta-function.  Once mapped and
registered, a user data type can be used interchangeably with library data types
-in the generic free functions that are overloaded on concept.Traits for
+in the generic free functions that are overloaded on concept.Traits for
mapping a data type to a concept are broken down into mutable and read only
traits.  Read only traits are specialized internally to work with any types
that are refinements of a concept.  The mutable traits are defined only for
@@ -137,7 +151,7 @@
traits defined for that triangle type.  This would allow the triangle type
to be passed into any API that expects a const reference to an object that models
polygon. 
-An object that is a model of a given concept can usually be viewed as a model of any of its
+An object that is a model of a given concept can usually be viewed as a model of any of its
refinements if it is determined at runtime to conform to the restrictions of
those concepts.  This concept casting is accomplished through the
view_as<>() function.  For example if
@@ -148,17 +162,17 @@
passed into any interface that expects an object of the conceptual type
specified in its template parameter.  The exception to this ability to
concept cast geometric objects is that polygon set objects cannot be viewed as
-individual polygons or rectangles. <tr>
+individual polygons or rectangles. </td></tr><tr>
<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" rules="none" frame="void" id="table1">
+<table class="docinfo" id="table1" frame="void" rules="none">
 <colgroup>
- <col class="docinfo-name"><col class="docinfo-content">
+ <col class="docinfo-name" /><col class="docinfo-content" />
 </colgroup>
- <tbody vAlign="top">
+ <tbody valign="top">
 <tr>
 <th class="docinfo-name">Copyright:</th>
 <td>Copyright © Intel Corporation 2008-2010.</td>
@@ -171,6 +185,6 @@
 <a class="reference" target="_top" href="http://www.boost.org/LICENSE_1_0.txt">
 http://www.boost.org/LICENSE_1_0.txt>)</td>
 </tr>
-</table>
+</tbody></table>

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

Modified: sandbox/gtl/doc/gtl_interval_concept.htm
==============================================================================
--- sandbox/gtl/doc/gtl_interval_concept.htm (original)
+++ sandbox/gtl/doc/gtl_interval_concept.htm 2012-04-09 15:10:32 EDT (Mon, 09 Apr 2012)
@@ -1,15 +1,14 @@
<!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" 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"><head>
-<title>Boost Polygon Library: Interval Concept</title>
- <meta http-equiv="content-type" content="text/html;charset=ISO-8859-1">
- 
-<table style="margin: 0pt; padding: 0pt; width: 100%;" border="0" cellpadding="0" cellspacing="0"><tbody><tr>
+--><title>Boost Polygon Library: Interval 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">
- <img border="0" src="images/boost.png" width="277" height="86"><a title="www.boost.org home page" href="http://www.boost.org/" tabindex="2" style="border: medium none ;">
+ <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;">
@@ -37,6 +36,18 @@
 <li>Property Merge 90</li>
 <li>Property Merge 45</li>
 <li>Property Merge</li>
+ <li><a href="voronoi_main.htm">Voronoi Main Page 
+</a></li>
+ <li>Voronoi Benchmark 
+ </li>
+ <li>Voronoi Builder</li>
+ <li><a href="voronoi_diagram.htm">Voronoi Diagram 
+</a></li>
+ <li>Voronoi Predicates</li>
+ <li>Voronoi Robust FPT 
+ </li>
+ <li>Voronoi Utils</li>
+
 </ul>
 <h3 class="navbar">Other Resources</h3>
 <ul>
@@ -46,11 +57,14 @@
 <li>Performance Analysis</li>
 <li>Layout Versus Schematic Tutorial</li>
 <li>Minkowski Sum Tutorial</li>
+ <li>Voronoi Basic Tutorial</li>
+ <li>Voronoi Advanced Tutorial</li>
+
 </ul>
 </div>
 <h3 class="navbar">Polygon Sponsor</h3>
 <div style="padding: 5px;" align="center">
- <img border="0" src="images/intlogo.gif" width="127" height="51"><a title="www.adobe.com home page" href="http://www.adobe.com/" tabindex="2" style="border: medium none ;">
+ <img src="images/intlogo.gif" border="0" height="51" width="127" /><a title="www.adobe.com home page" href="http://www.adobe.com/" tabindex="2" style="border: medium none ;">
 </a>
 </div>
</td>
@@ -58,19 +72,19 @@



- 
+ 

<h1>Interval Concept</h1>


-The interval concept tag is 
+The interval concept tag is 
interval_concept

To register a user defined type as a model of interval concept, specialize the
geometry concept meta-function for that type.  In the example below
-CInterval is registered as a model of interval  concept.
-template <> 
-struct geometry_concept<CInterval> { typedef interval_concept type; };
+CInterval is registered as a model of interval  concept.
+template <> 
+struct geometry_concept<CInterval> { typedef interval_concept type; };
The semantic of an interval is that it has a low
and high coordinate and there is an invariant that low is less than or equal to
high.  This invariant is enforced by the generic library functions that
@@ -78,50 +92,51 @@
mapping of that data type to the interval concept through its traits.  In
this way a std::pair<int, int>, boost::tuple<int, int> or boost::array<int, 2>
could all be made models of interval by simply providing indirect access to their
-elements through traits.
+elements through traits.
Below is shown the default interval traits. 
Specialization of these traits is required for types that don't conform to the
-default behavior.
-template <typename T> 
-struct interval_traits { 
-  typedef typename T::coordinate_type coordinate_type; 
- 
-  static inline coordinate_type get(const T& interval, direction_1d dir) { 
-    return interval.get(dir); 
-  } 
-}; 
- 
-template <typename T> 
-struct interval_mutable_traits { 
+default behavior.
+template <typename T> 
+struct interval_traits { 
+  typedef typename T::coordinate_type coordinate_type; 
+ 
+  static inline coordinate_type get(const T& interval, direction_1d dir) { 
+    return interval.get(dir); 
+  } 
+}; 
+ 
+template <typename T> 
+struct interval_mutable_traits { 
  static inline void set(T& interval, direction_1d dir, 
- 
-                         typename interval_traits<T>::coordinate_type value) { 
+ 
+                        
+typename interval_traits<T>::coordinate_type value) { 
   
-interval.set(dir, value); 
+interval.set(dir, value); 
 
-} 
+} 
 
static inline T construct(typename interval_traits<T>::coordinate_type low_value,
- 
+ 
                           
-typename interval_traits<T>::coordinate_type high_value) { 
+typename interval_traits<T>::coordinate_type high_value) { 
   
-return T(low_value, high_value); 
+return T(low_value, high_value); 
 
-} 
-};<h2>Functions</h2>
-<table border="1" width="100%" id="table1">
- <tr>
- <td width="586">template <typename T> 
+} 
+};<h2>Functions</h2>
+<table id="table1" border="1" width="100%">
+ <tbody><tr>
+ <td width="586">template <typename T> 
 coordinate_type get(const T& interval, direction_1d)</td>
 <td>Expects a model of interval. 
 Returns the low or high coordinate of the interval, depending on the
- direction_1d value. 
+ direction_1d value. 
 </td>
 </tr>
 <tr>
 <td width="586">template <typename T, typename
- coordinate_type> 
+ coordinate_type> 
 void set(T& interval, direction_1d, coordinate_type)</td>
 <td>Expects a model of interval.  
 Sets the low or high coordinate of the interval to the coordinate,
@@ -129,28 +144,28 @@
 high after this change then both are set to the input coordinate value.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 T construct(coordinate_type low, coordinate_type high)</td>
 <td>Construct an object that is a model of interval given low and high
 coordinate values.</td>
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& assign(T1& left, const T2& right)</td>
 <td>Copies data from right object that models interval into left object
 that models interval.</td>
 </tr>
 <tr>
 <td width="586">template <typename T, typename
- T2> 
+ T2> 
 bool equivalence(const T& interval1, const T2& interval2)</td>
 <td>Given two objects that model interval, compares and returns true if
 their low and high values are respectively equal to each other.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
- bool contains(const T&, coordinate_type, 
+ <td width="586">template <typename T> 
+ bool contains(const T&, coordinate_type, 
             
 bool consider_touch=true)</td>
 <td>Given an object that models interval and a coordinate, returns true
@@ -160,8 +175,8 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
- bool contains(const T1& a, const T2& b, 
+ T2> 
+ bool contains(const T1& a, const T2& b, 
             
 bool consider_touch = true) </td>
 <td>Returns true if model of interval a contains both ends of model of
@@ -170,25 +185,25 @@
 </tr>
 <tr>
 <td width="586">template <typename
- interval_type> 
+ interval_type> 
 coordinate_type low(const interval_type& interval)</td>
 <td>Returns the low end of an object that models interval.</td>
 </tr>
 <tr>
 <td width="586">template <typename
- interval_type> 
+ interval_type> 
 coordinate_type high(const interval_type& interval)</td>
 <td>Returns the high end of an object that models interval.</td>
 </tr>
 <tr>
- <td width="586">// get the center coordinate 
- template <typename interval_type> 
+ <td width="586">// get the center coordinate 
+ template <typename interval_type> 
 coordinate_type center(const interval_type& interval)</td>
 <td>Returns the center coordinate of an object that models interval.</td>
 </tr>
 <tr>
 <td width="586">template <typename
- interval_type> 
+ interval_type> 
 void low(interval_type& interval, coordinate_type )</td>
 <td>Sets the low end of the object that models interval to the
 coordinate value.  If the low end would be set to larger than high
@@ -196,7 +211,7 @@
 </tr>
 <tr>
 <td width="586">template <typename
- interval_type> 
+ interval_type> 
 void high(interval_type& interval, coordinate_type )</td>
 <td>Sets the high end of the object that models interval to the
 coordinate value.  If the high end would be set to less than low
@@ -204,15 +219,15 @@
 </tr>
 <tr>
 <td width="586">template <typename
- interval_type> 
+ interval_type> 
 coordinate_difference delta(const interval_type& interval)</td>
 <td>Returns the distance from low to high end of an object that models
 interval.</td>
 </tr>
 <tr>
 <td width="586">template <typename
- interval_type> 
- interval_type& flip(interval_type& interval, 
+ interval_type> 
+ interval_type& flip(interval_type& interval, 
                   
 coordinate_type axis = 0)</td>
 <td>Flips an object that models interval about the axis coordinate. 
@@ -220,26 +235,26 @@
 </tr>
 <tr>
 <td width="586">template <typename
- interval_type> 
- interval_type& scale_up(interval_type& interval, 
-                       
- unsigned_area_type factor)</td>
+ interval_type> 
+ interval_type& scale_up(interval_type& interval, 
+                       
+unsigned_area_type factor)</td>
 <td>Multiplies low and high ends of an object that models interval by
 unsigned factor.</td>
 </tr>
 <tr>
 <td width="586">template <typename
- interval_type> 
- interval_type& scale_down(interval_type& interval, 
-                         
- unsigned_area_type factor)</td>
+ interval_type> 
+ interval_type& scale_down(interval_type& interval, 
+                         
+unsigned_area_type factor)</td>
 <td>Divides low and high ends of an object that models interval by
 unsigned factor.</td>
 </tr>
 <tr>
 <td width="586">template <typename
- interval_type> 
- interval_type& scale(interval_type& interval, 
+ interval_type> 
+ interval_type& scale(interval_type& interval, 
                    
 double factor) </td>
 <td>Multiplies low and high ends of an object that models interval by
@@ -247,8 +262,8 @@
 </tr>
 <tr>
 <td width="586">template <typename
- interval_type> 
- interval_type& move(interval_type& interval, 
+ interval_type> 
+ interval_type& move(interval_type& interval, 
                   
 coordinate_difference displacement)</td>
 <td>Adds displacement value to low and high ends of an object that
@@ -256,53 +271,53 @@
 </tr>
 <tr>
 <td width="586">template <typename
- interval_type> 
- interval_type& convolve(interval_type& interval, 
-                       
- coordinate_type b)</td>
+ interval_type> 
+ interval_type& convolve(interval_type& interval, 
+                       
+coordinate_type b)</td>
 <td>Adds coordinate value to low and high ends of an object that models
 interval.</td>
 </tr>
 <tr>
 <td width="586">template <typename
- interval_type> 
- interval_type& deconvolve(interval_type& interval, 
-                         
- coordinate_type b)</td>
+ interval_type> 
+ interval_type& deconvolve(interval_type& interval, 
+                         
+coordinate_type b)</td>
 <td>Subtracts coordinate value from low and high ends of an object that
 models interval.</td>
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& convolve(T1& a, const T2& b)</td>
 <td>Adds low end of b to low end of a and adds high end of b to high end
 of a.</td>
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& deconvolve(T1& a, const T2& b)</td>
 <td>Subtracts low end of b from low end of a and subtracts high end of b
 from high end of a. </td>
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& reflected_convolve(T1& a, const T2& b)</td>
 <td>Adds high end of b to low end of a and adds low end of b to high end
 of a.</td>
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& reflected_deconvolve(T1& a, const T2& b)</td>
 <td>Subtracts high end of b from low end of a and subtracts low end of b
 from high end of a.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
- coordinate_difference euclidean_distance(const T&, 
+ <td width="586">template <typename T> 
+ coordinate_difference euclidean_distance(const T&, 
                     
 coordinate_type)</td>
 <td>Returns the distance from an object that models interval to a
@@ -311,8 +326,8 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
- bool intersects(const T1& interval, const T2& b, 
+ T2> 
+ bool intersects(const T1& interval, const T2& b, 
               
 bool consider_touch = true)</td>
 <td>Returns true if two objects that model interval overlap.  If
@@ -321,10 +336,10 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
- bool boundaries_intersect(const T1& interval, const T2& b, 
-                         
- bool consider_touch = true)</td>
+ T2> 
+ bool boundaries_intersect(const T1& interval, const T2& b, 
+                         
+bool consider_touch = true)</td>
 <td>Returns true is two objects that model interval partially overlap
 such that one end point of each is contained within the other.  If
 the consider_touch flag is true a coordinate is considered contained
@@ -332,8 +347,8 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
- bool abuts(const T1& a, const T2& b, 
+ T2> 
+ bool abuts(const T1& a, const T2& b, 
           direction_1d dir)
 </td>
 <td>Returns true if interval b abuts but down not overlap interval a on
@@ -341,14 +356,14 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 bool abuts(const T1& a, const T2& b)</td>
 <td>Returns true if interval b abuts but down not overlap interval a.</td>
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
- bool intersect(T1& a, const T2& b, 
+ T2> 
+ bool intersect(T1& a, const T2& b, 
              
 bool consider_touch = true) </td>
 <td>Sets interval a to the intersection of interval a and interval b and
@@ -358,55 +373,55 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T& generalized_intersect(T1& a, const T2& b)</td>
 <td>Same as intersect, but if they do not intersect set a to the
 interval between a and b.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 T& bloat(T& interval, coordinate_type)</td>
 <td>Adds the coordinate value to high end of interval and subtracts it
 from low end of interval.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 T& bloat(T& interval, direction_1d, coordinate_type)</td>
 <td>Adds the coordinate value to high end of interval or subtracts it
 from low end of interval depending on the direction_1d.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 T& shrink(T& interval, coordinate_type)</td>
 <td>Subtracts the coordinate value from high end of interval and adds it
 to low end of interval.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 T& shrink(T& interval, direction_1d, coordinate_type)</td>
 <td>Subtracts the coordinate value from high end of interval or adds it
 to low end of interval depending on the direction_1d.</td>
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 bool encompass(T1& a, const T2& b)</td>
 <td>Sets low of a to min of low of a and low of b and sets high of a to
 max of high of a and high of b.  Returns true if b was not
 contained within a to begin with.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 bool encompass(T& a, coordinate_type)</td>
 <td>Sets low of a to min of low of a and coordinate value and sets high
 of a to max of high of a and coordinate value.  Returns true if
 coordinate value was not contained within a to begin with.</td>
 </tr>
-</table>
+</tbody></table>
 <h1>Interval Data</h1>


-The library provides a model of interval concept declared
+The library provides a model of interval concept declared

template<typename T> interval_data where T is the coordinate type.
This data type is used internally when an interval is needed and is available
@@ -414,8 +429,8 @@
instead of providing their own.  The data type is implemented to be
convenient to use with the library traits.
<h2>Members</h2>
-<table border="1" width="100%" id="table2">
- <tr>
+<table id="table2" border="1" width="100%">
+ <tbody><tr>
 <td width="586">geometry_type</td>
 <td>interval_concept</td>
 </tr>
@@ -446,42 +461,42 @@
 </tr>
 <tr>
 <td width="586">template <typename T2> 
- interval_data& operator=(const T2& that) const</td>
+ interval_data& operator=(const T2& that) const</td>
 <td>Assign from an object that is a model of interval.</td>
 </tr>
 <tr>
 <td width="586">template <typename T2>
- bool
+ bool
 operator==(const T2& that) const</td>
 <td>Compare equality to an object that is a model of interval.</td>
 </tr>
 <tr>
 <td width="586">template <typename T2>
- bool
+ bool
 operator!=(const T2& that) const</td>
 <td>Compare inequality to an object that is a model of interval.</td>
 </tr>
 <tr>
 <td width="586">template <typename T2>
- bool
+ bool
 operator<(const T2& that) const</td>
 <td>Compares low coordinates then high coordinates to break ties.</td>
 </tr>
 <tr>
 <td width="586">template <typename T2>
- bool
+ bool
 operator<=(const T2& that) const</td>
 <td>Compares low coordinates then high coordinates to break ties.</td>
 </tr>
 <tr>
 <td width="586">template <typename T2>
- bool
+ bool
 operator>(const T2& that) const</td>
 <td>Compares low coordinates then high coordinates to break ties.</td>
 </tr>
 <tr>
 <td width="586">template <typename T2>
- bool
+ bool
 operator>=(const T2& that) const</td>
 <td>Compares low coordinates then high coordinates to break ties.</td>
 </tr>
@@ -495,18 +510,18 @@
 dir, T value)</td>
 <td>Sets the coordinate in the given direction to the value.</td>
 </tr>
- </table>
- <tr>
+ </tbody></table>
+ </td></tr><tr>
<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" rules="none" frame="void" id="table3">
+<table class="docinfo" id="table3" frame="void" rules="none">
 <colgroup>
- <col class="docinfo-name"><col class="docinfo-content">
+ <col class="docinfo-name" /><col class="docinfo-content" />
 </colgroup>
- <tbody vAlign="top">
+ <tbody valign="top">
 <tr>
 <th class="docinfo-name">Copyright:</th>
 <td>Copyright © Intel Corporation 2008-2010.</td>
@@ -519,6 +534,6 @@
 <a class="reference" target="_top" href="http://www.boost.org/LICENSE_1_0.txt">
 http://www.boost.org/LICENSE_1_0.txt>)</td>
 </tr>
-</table>
+</tbody></table>

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

Modified: sandbox/gtl/doc/gtl_isotropy.htm
==============================================================================
--- sandbox/gtl/doc/gtl_isotropy.htm (original)
+++ sandbox/gtl/doc/gtl_isotropy.htm 2012-04-09 15:10:32 EDT (Mon, 09 Apr 2012)
@@ -1,15 +1,14 @@
<!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" 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"><head>
-<title>Boost Polygon Library: Isotropy</title>
- <meta http-equiv="content-type" content="text/html;charset=ISO-8859-1">
- 
-<table style="margin: 0pt; padding: 0pt; width: 100%;" border="0" cellpadding="0" cellspacing="0"><tbody><tr>
+--><title>Boost Polygon Library: Isotropy</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">
- <img border="0" src="images/boost.png" width="277" height="86"><a title="www.boost.org home page" href="http://www.boost.org/" tabindex="2" style="border: medium none ;">
+ <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;">
@@ -37,6 +36,18 @@
 <li>Property Merge 90</li>
 <li>Property Merge 45</li>
 <li>Property Merge</li>
+ <li><a href="voronoi_main.htm">Voronoi Main Page 
+</a></li>
+ <li>Voronoi Benchmark 
+ </li>
+ <li>Voronoi Builder</li>
+ <li><a href="voronoi_diagram.htm">Voronoi Diagram 
+</a></li>
+ <li>Voronoi Predicates</li>
+ <li>Voronoi Robust FPT 
+ </li>
+ <li>Voronoi Utils</li>
+
 </ul>
 <h3 class="navbar">Other Resources</h3>
 <ul>
@@ -46,11 +57,13 @@
 <li>Performance Analysis</li>
 <li>Layout Versus Schematic Tutorial</li>
 <li>Minkowski Sum Tutorial</li>
- </ul>
+ <li>Voronoi Basic Tutorial</li>
+ <li>Voronoi Advanced Tutorial</li>
+</ul>
 </div>
 <h3 class="navbar">Polygon Sponsor</h3>
 <div style="padding: 5px;" align="center">
- <img border="0" src="images/intlogo.gif" width="127" height="51"><a title="www.adobe.com home page" href="http://www.adobe.com/" tabindex="2" style="border: medium none ;">
+ <img src="images/intlogo.gif" border="0" height="51" width="127" /><a title="www.adobe.com home page" href="http://www.adobe.com/" tabindex="2" style="border: medium none ;">
 </a>
 </div>
</td>
@@ -58,21 +71,20 @@



- 
+ 

<h1>Isotropy</h1>


-What is isotropy?
-<P:COLORSCHEME
-colors="#ffffff,#000000,#808080,#000000,#bbe0e3,#333399,#009999,#99cc00" />
-<div class="O" style="TEXT-ALIGN: center; mso-line-spacing: '90 0 0'; mso-margin-left-alt: 216; mso-char-wrap: 1; mso-kinsoku-overflow: 1" v:shape="_x0000_s1026">
- 
- Isotropy - Function: adjective Etymology: International
- Scientific Vocabulary 
+What is isotropy?
+<p:colorscheme colors="#ffffff,#000000,#808080,#000000,#bbe0e3,#333399,#009999,#99cc00">
+</p:colorscheme><div class="O" style="text-align: center;" v:shape="_x0000_s1026">
+ 
+ Isotropy - Function: adjective Etymology: International
+ Scientific Vocabulary 
 : exhibiting properties (as velocity of light transmission) with the
 same values when measured along axes in all directions <an isotropic
- crystal></div>
+ crystal></div>
In computational geometry things are often symmetric and
invariant to direction and orientation.  This invariance to direction is
called isotropy.  In such situations it is convenient to parameterize
@@ -97,8 +109,8 @@
describing isotropic situations programmatically.  For instance, to get the
positive direction_2d from an orientation_2d you would call a member function of
orientation_2d and pass a direction_1d:
-orientation_2d orient = HORIZONTAL; 
-direction_2d dir = orient.get_direction(direction_1d(HIGH)); 
+orientation_2d orient = HORIZONTAL; 
+direction_2d dir = orient.get_direction(direction_1d(HIGH)); 
assert(dir == EAST);
The motivation for providing isotropic data types is to
encourage programming at a higher level of abstraction where program behavior is
@@ -116,7 +128,7 @@
<h2>direction_1d</h2>


-The direction_1d data type has two possible states.  These
+The direction_1d data type has two possible states.  These
are the positive and negative directions on a continuum such as the number line.  
These states can be described by one of several direction_1d_enum values: 
We make clockwise and counterclockwise winding orientation of polygons a
@@ -124,24 +136,23 @@
type.  This is because winding orientation can be thought of as positive
and negative directions in a 1d (although cyclic) space.  We assign
counterclockwise to be the positive direction of travel in the 1d cyclic space
-to conform with the mathematical convention frequently described as the "right
-hand rule" which assigns positive normal value to counterclockwise and negative
+to conform with the mathematical convention frequently described as the "right
+hand rule" which assigns positive normal value to counterclockwise and negative
normal value to clockwise as well as the common convention that counterclockwise
polygon winding corresponds to positive polygonal regions where as clockwise
polygon winding corresponds to hole (negative) polygonal regions.
enum direction_1d_enum {LOW = 0, HIGH =
-1, 
-                       
-LEFT = 0, RIGHT = 1, 
-                       
-CLOCKWISE = 0, COUNTERCLOCKWISE = 1, 
-                       
-REVERSE = 0, FORWARD = 1, 
-                       
+1,                        
+LEFT = 0, RIGHT = 1, 
+                       
+CLOCKWISE = 0, COUNTERCLOCKWISE = 1, 
+                       
+REVERSE = 0, FORWARD = 1, 
+                       
NEGATIVE = 0, POSITIVE = 1 };
<h2>Member Functions</h2>
-<table border="1" width="100%" id="table1">
- <tr>
+<table id="table1" border="1" width="100%">
+ <tbody><tr>
 <td width="586">direction_1d(direction_1d_enum
 val = LOW)</td>
 <td>Constructor defaults to LOW. </td>
@@ -195,18 +206,18 @@
 <td>Returns positive 1 if positive direction and negative one if
 negative direction.</td>
 </tr>
- </table>
+ </tbody></table>
<h2>orientation_2d</h2>


-The orientation_2d data type has two possible states. 
+The orientation_2d data type has two possible states. 
These are the horizontal and vertical axis of a 2d Cartesian coordinate system.  
These states can be described by one of the two orientation_2d_enum values:
enum orientation_2d_enum { HORIZONTAL =
0, VERTICAL = 1 };
<h2>Member Functions</h2>
-<table border="1" width="100%" id="table2">
- <tr>
+<table id="table2" border="1" width="100%">
+ <tbody><tr>
 <td width="586">orientation_2d(orientation_2d_enum
 val = HORIZONTAL)</td>
 <td>Constructor defaults to HORIZONTAL. </td>
@@ -263,18 +274,18 @@
 <td>Returns the positive or negative direction_2d depending on the value
 of dir</td>
 </tr>
- </table>
+ </tbody></table>
<h2>direction_2d</h2>


-The direction_2d data type has four possible states.  These
+The direction_2d data type has four possible states.  These
are the cardinal directions of the 2D Cartesian coordinate system.  
These states can be described by one of several direction_2d_enum values:
enum direction_2d_enum { WEST = 0, EAST
= 1, SOUTH = 2, NORTH = 3 };
<h2>Member Functions</h2>
-<table border="1" width="100%" id="table3">
- <tr>
+<table id="table3" border="1" width="100%">
+ <tbody><tr>
 <td width="586">direction_2d(direction_2d_enum
 val = WEST)</td>
 <td>Constructor defaults to WEST. </td>
@@ -344,19 +355,19 @@
 <td>Returns positive 1 if positive direction and negative one if
 negative direction.</td>
 </tr>
- </table>
+ </tbody></table>
<h2>orientation_3d</h2>


-The orientation_3d data type has three possible states. 
+The orientation_3d data type has three possible states. 
These are the horizontal, vertical and proximal (x, y, z) axis of a 3d Cartesian
coordinate system.   These states can be described by one of the
orientation_2d_enum values or by the orientation_3d_enum value:
enum orientation_3d_enum { PROXIMAL = 2
};
<h2>Member Functions</h2>
-<table border="1" width="100%" id="table6">
- <tr>
+<table id="table6" border="1" width="100%">
+ <tbody><tr>
 <td width="586">orientation_3d(orientation_2d_enum
 val = HORIZONTAL)</td>
 <td>Constructor defaults to HORIZONTAL. </td>
@@ -418,19 +429,19 @@
 <td>Returns the positive or negative direction_2d depending on the value
 of dir</td>
 </tr>
- </table>
+ </tbody></table>
<h2>direction_3d</h2>


-The direction_3d data type has six possible states.  These
+The direction_3d data type has six possible states.  These
are the cardinal directions of the 3D Cartesian coordinate system.  
These states can be described by one of the direction_2d_enum values or the
direction_3d_enum values:
enum direction_3d_enum { DOWN = 4, UP =
5 };
<h2>Member Functions</h2>
-<table border="1" width="100%" id="table5">
- <tr>
+<table id="table5" border="1" width="100%">
+ <tbody><tr>
 <td width="586">direction_3d(direction_2d_enum
 val = WEST)</td>
 <td>Constructor defaults to LOW. </td>
@@ -492,18 +503,18 @@
 <td>Returns positive 1 if positive direction and negative one if
 negative direction.</td>
 </tr>
- </table>
- <tr>
+ </tbody></table>
+ </td></tr><tr>
<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" rules="none" frame="void" id="table7">
+<table class="docinfo" id="table7" frame="void" rules="none">
 <colgroup>
- <col class="docinfo-name"><col class="docinfo-content">
+ <col class="docinfo-name" /><col class="docinfo-content" />
 </colgroup>
- <tbody vAlign="top">
+ <tbody valign="top">
 <tr>
 <th class="docinfo-name">Copyright:</th>
 <td>Copyright © Intel Corporation 2008-2010.</td>
@@ -516,6 +527,6 @@
 <a class="reference" target="_top" href="http://www.boost.org/LICENSE_1_0.txt">
 http://www.boost.org/LICENSE_1_0.txt>)</td>
 </tr>
-</table>
+</tbody></table>

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

Modified: sandbox/gtl/doc/gtl_point_concept.htm
==============================================================================
--- sandbox/gtl/doc/gtl_point_concept.htm (original)
+++ sandbox/gtl/doc/gtl_point_concept.htm 2012-04-09 15:10:32 EDT (Mon, 09 Apr 2012)
@@ -1,15 +1,14 @@
<!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" 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"><head>
-<title>Boost Polygon Library: Point Concept</title>
- <meta http-equiv="content-type" content="text/html;charset=ISO-8859-1">
- 
-<table style="margin: 0pt; padding: 0pt; width: 100%;" border="0" cellpadding="0" cellspacing="0"><tbody><tr>
+--><title>Boost Polygon Library: Point 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">
- <img border="0" src="images/boost.png" width="277" height="86"><a title="www.boost.org home page" href="http://www.boost.org/" tabindex="2" style="border: medium none ;">
+ <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;">
@@ -37,6 +36,18 @@
 <li>Property Merge 90</li>
 <li>Property Merge 45</li>
 <li>Property Merge</li>
+ <li><a href="voronoi_main.htm">Voronoi Main Page 
+</a></li>
+ <li>Voronoi Benchmark 
+ </li>
+ <li>Voronoi Builder</li>
+ <li><a href="voronoi_diagram.htm">Voronoi Diagram 
+</a></li>
+ <li>Voronoi Predicates</li>
+ <li>Voronoi Robust FPT 
+ </li>
+ <li>Voronoi Utils</li>
+
 </ul>
 <h3 class="navbar">Other Resources</h3>
 <ul>
@@ -46,11 +57,14 @@
 <li>Performance Analysis</li>
 <li>Layout Versus Schematic Tutorial</li>
 <li>Minkowski Sum Tutorial</li>
+ <li>Voronoi Basic Tutorial</li>
+ <li>Voronoi Advanced Tutorial</li>
+
 </ul>
 </div>
 <h3 class="navbar">Polygon Sponsor</h3>
 <div style="padding: 5px;" align="center">
- <img border="0" src="images/intlogo.gif" width="127" height="51"><a title="www.adobe.com home page" href="http://www.adobe.com/" tabindex="2" style="border: medium none ;">
+ <img src="images/intlogo.gif" border="0" height="51" width="127" /><a title="www.adobe.com home page" href="http://www.adobe.com/" tabindex="2" style="border: medium none ;">
 </a>
 </div>
</td>
@@ -58,19 +72,19 @@



- 
+ 

<h1>Point Concept</h1>


-
+
The point concept tag is 
-point_concept
+point_concept
To register a user defined type as a model of point concept, specialize the
geometry concept meta-function for that type.  In the example below CPoint is registered as a model of
-point  concept.
-template <> 
-struct geometry_concept<CPoint> { typedef point_concept type; };
+point  concept.
+template <> 
+struct geometry_concept<CPoint> { typedef point_concept type; };
The semantic of a point is that it has an x and y
coordinate.  A std::pair<int, int>, boost::tuple<int, int> or boost::array<int, 2>
could all be made models of point by simply providing indirect access to their
@@ -78,116 +92,115 @@
point and interval in the same compilation unit, for obvious reason that
duplicate specialization of the geometry_concept struct is illegal, but also
because it would make overloading generic function by concept ambiguous if a
-type modeled more than one concept.
+type modeled more than one concept.
Below is shown the default point traits. 
Specialization of these traits is required for types that don't conform to the
-default behavior.
-template <typename T> 
-struct point_traits { 
-     typedef typename T::coordinate_type coordinate_type; 
- 
+default behavior.
+template <typename T> 
+struct point_traits { 
+     typedef typename T::coordinate_type coordinate_type; 
+ 
     static inline coordinate_type get(const T& point,
-orientation_2d orient) { 
+orientation_2d orient) { 
          return point.get(orient);
- 
-     } 
-}; 
- 
-template <typename T> 
-struct point_mutable_traits { 
+ 
+     } 
+}; 
+ 
+template <typename T> 
+struct point_mutable_traits { 
     static inline void set(T& point, orientation_2d orient,
-typename point_traits<T>::coordinate_type value) { 
+typename point_traits<T>::coordinate_type value) { 
          point.set(orient, value);
- 
-     } 
+ 
+     } 
     static inline T construct(typename point_traits<T>::coordinate_type
-x_value, typename point_traits<T>::coordinate_type y_value) { 
+x_value, typename point_traits<T>::coordinate_type y_value) { 
          return T(x_value, y_value);
- 
-     } 
-};
+ 
+     } 
+};
Example code custom_point.cpp demonstrates
how to map a
- user defined point class to the library point_concept<h2>Functions</h2>
-<table border="1" width="100%" id="table1">
- <tr>
- <td width="586">template <typename T> 
+ user defined point class to the library point_concept<h2>Functions</h2>
+<table id="table1" border="1" width="100%">
+ <tbody><tr>
+ <td width="586">template <typename T> 
 coordinate_type get(const T& point, orientation_2d)</td>
 <td>Expects a model of point.  Returns
 the x or y coordinate of the point, depending on the orientation_2d
- value. 
+ value. 
 </td>
 </tr>
 <tr>
 <td width="586">template <typename T, typename
- coordinate_type> 
+ coordinate_type> 
 void set(T& point, orientation_2d, coordinate_type)</td>
 <td>Expects a model of point.  
 Sets the x or y coordinate of the point to the coordinate, depending on
 the orientation_2d  value. </td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 T construct(coordinate_type x, coordinate_type y)</td>
 <td>Construct an object that is a model of point given x and y
 coordinate values.</td>
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& assign(T1& left, const T2& right)</td>
 <td>Copies data from right object that models point into left object
 that models point.</td>
 </tr>
 <tr>
 <td width="586">template <typename T, typename
- T2> 
+ T2> 
 bool equivalence(const T& point1, const T2& point2)</td>
 <td>Given two objects that model point, compares and returns true if
 their x and y values are respectively equal to each other.</td>
 </tr>
 <tr>
- <td width="586">template <typename point_type> 
+ <td width="586">template <typename point_type> 
 coordinate_type x(const point_type& point)</td>
 <td>Returns the x coordinate of an object that models point.</td>
 </tr>
 <tr>
- <td width="586">template <typename point_type> 
+ <td width="586">template <typename point_type> 
 coordinate_type y(const point_type& point)</td>
 <td>Returns the y coordinate of an object that models point.</td>
 </tr>
 <tr>
- <td width="586">template <typename point_type> 
+ <td width="586">template <typename point_type> 
 void x(point_type& point, coordinate_type )</td>
 <td>Sets the x coordinate of the object that models point to the
 coordinate value.  </td>
 </tr>
 <tr>
- <td width="586">template <typename point_type> 
+ <td width="586">template <typename point_type> 
 void y(point_type& point, coordinate_type )</td>
 <td>Sets the y coordinate of the object that models point to the
 coordinate value.  </td>
 </tr>
 <tr>
- <td width="586">template <typename point_type> 
- point_type& scale_up(point_type& point, 
-                       
- unsigned_area_type factor)</td>
+ <td width="586">template <typename point_type> 
+ point_type& scale_up(point_type& point,                        
+unsigned_area_type factor)</td>
 <td>Multiplies x and y coordinate of an object that models point by
 unsigned factor.</td>
 </tr>
 <tr>
- <td width="586">template <typename point_type> 
- point_type& scale_down(point_type& point, 
-                         
- unsigned_area_type factor)</td>
+ <td width="586">template <typename point_type> 
+ point_type& scale_down(point_type& point, 
+                         
+unsigned_area_type factor)</td>
 <td>Divides x and y coordinate of an object that models point by
 unsigned factor.</td>
 </tr>
 <tr>
 <td width="586">template <typename point_type,
- typename scaling_type> 
- point_type& scale(point_type& point, 
+ typename scaling_type> 
+ point_type& scale(point_type& point, 
                 
 const scaling_type& factor) </td>
 <td>Calls the scale member function of scaling type on the x and y value
@@ -195,8 +208,8 @@
 </tr>
 <tr>
 <td width="586">template <typename point_type,
- typename transform_type> 
- point_type& transform(point_type& point, 
+ typename transform_type> 
+ point_type& transform(point_type& point, 
                     
 const transform_type& transform) </td>
 <td>Calls the transform member function of transform type on the x and y
@@ -204,8 +217,8 @@
 transformed values.</td>
 </tr>
 <tr>
- <td width="586">template <typename point_type> 
- point_type& move(point_type& point, orientation_2d 
+ <td width="586">template <typename point_type> 
+ point_type& move(point_type& point, orientation_2d 
                
 coordinate_difference displacement)</td>
 <td>Adds displacement value to the coordinate of an object that models
@@ -213,30 +226,30 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& convolve(T1& a, const T2& b)</td>
 <td>Adds x coordinate of b to x coordinate of a and adds y coordinate of
 b to y coordinate of a.</td>
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& deconvolve(T1& a, const T2& b)</td>
 <td>Subtracts x coordinate of b from x coordinate of a and subtracts y
 coordinate of b from y coordinate of a. </td>
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
- coordinate_distance euclidean_distance(const T1&, 
-                                      
- const T2&)</td>
+ T2> 
+ coordinate_distance euclidean_distance(const T1&, 
+                                      
+const T2&)</td>
 <td>Returns the distance from an object that models point to a second
 object that models point.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
- coordinate_difference euclidean_distance(const T&, 
+ <td width="586">template <typename T> 
+ coordinate_difference euclidean_distance(const T&, 
           orientation_2d,
 coordinate_type)</td>
 <td>Returns the distance from an object that models point to a
@@ -244,28 +257,28 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
- coordinate_difference manhattan_distance(const T1&, 
-                                      
- const T2&)</td>
+ T2> 
+ coordinate_difference manhattan_distance(const T1&, 
+                                      
+const T2&)</td>
 <td>Returns the distance in x plus the distance in y from an object that
 models point to a second object that models point.</td>
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
- coordinate_difference distance_squared(const T1&, 
-                                      
- const T2&)</td>
+ T2> 
+ coordinate_difference distance_squared(const T1&, 
+                                      
+const T2&)</td>
 <td>Returns the square of the distance in x plus the square of the
 distance in y from an object that models point to a second object that
 models point.</td>
 </tr>
-</table>
+</tbody></table>
<h1>Point Data</h1>


-The library provides a model of point concept declared
+The library provides a model of point concept declared

template<typename T> point_data where T is the coordinate type.
This data type is used internally when a point is needed and is available to
@@ -275,8 +288,8 @@
Example code point_usage.cpp demonstrates using the
 library provided point data type and functions
<h2>Members</h2>
-<table border="1" width="100%" id="table2">
- <tr>
+<table id="table2" border="1" width="100%">
+ <tbody><tr>
 <td width="586">geometry_type</td>
 <td>point_concept</td>
 </tr>
@@ -306,42 +319,42 @@
 </tr>
 <tr>
 <td width="586">template <typename T2> 
- point_data& operator=(const T2& that) const</td>
+ point_data& operator=(const T2& that) const</td>
 <td>Assign from an object that is a model of point.</td>
 </tr>
 <tr>
 <td width="586">template <typename T2>
- bool
+ bool
 operator==(const T2& that) const</td>
 <td>Compare equality to an object that is a model of point.</td>
 </tr>
 <tr>
 <td width="586">template <typename T2>
- bool
+ bool
 operator!=(const T2& that) const</td>
 <td>Compare inequality to an object that is a model of point.</td>
 </tr>
 <tr>
 <td width="586">template <typename T2>
- bool
+ bool
 operator<(const T2& that) const</td>
 <td>Compares y coordinates then x coordinates to break ties.</td>
 </tr>
 <tr>
 <td width="586">template <typename T2>
- bool
+ bool
 operator<=(const T2& that) const</td>
 <td>Compares y coordinates then x coordinates to break ties.</td>
 </tr>
 <tr>
 <td width="586">template <typename T2>
- bool
+ bool
 operator>(const T2& that) const</td>
 <td>Compares low coordinates then high coordinates to break ties.</td>
 </tr>
 <tr>
 <td width="586">template <typename T2>
- bool
+ bool
 operator>=(const T2& that) const</td>
 <td>Compares low coordinates then high coordinates to break ties.</td>
 </tr>
@@ -371,18 +384,18 @@
 <td width="586">void y(T value)</td>
 <td>Sets the coordinate in the vertical orientation to the value.</td>
 </tr>
- </table>
- <tr>
+ </tbody></table>
+ </td></tr><tr>
<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" rules="none" frame="void" id="table3">
+<table class="docinfo" id="table3" frame="void" rules="none">
 <colgroup>
- <col class="docinfo-name"><col class="docinfo-content">
+ <col class="docinfo-name" /><col class="docinfo-content" />
 </colgroup>
- <tbody vAlign="top">
+ <tbody valign="top">
 <tr>
 <th class="docinfo-name">Copyright:</th>
 <td>Copyright © Intel Corporation 2008-2010.</td>
@@ -395,6 +408,6 @@
 <a class="reference" target="_top" href="http://www.boost.org/LICENSE_1_0.txt">
 http://www.boost.org/LICENSE_1_0.txt>)</td>
 </tr>
-</table>
+</tbody></table>

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

Modified: sandbox/gtl/doc/gtl_polygon_45_concept.htm
==============================================================================
--- sandbox/gtl/doc/gtl_polygon_45_concept.htm (original)
+++ sandbox/gtl/doc/gtl_polygon_45_concept.htm 2012-04-09 15:10:32 EDT (Mon, 09 Apr 2012)
@@ -1,15 +1,14 @@
<!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" 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"><head>
-<title>Boost Polygon Library: Polygon 45 Concept</title>
- <meta http-equiv="content-type" content="text/html;charset=ISO-8859-1">
- 
-<table style="margin: 0pt; padding: 0pt; width: 100%;" border="0" cellpadding="0" cellspacing="0"><tbody><tr>
+--><title>Boost Polygon Library: Polygon 45 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">
- <img border="0" src="images/boost.png" width="277" height="86"><a title="www.boost.org home page" href="http://www.boost.org/" tabindex="2" style="border: medium none ;">
+ <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;">
@@ -37,20 +36,34 @@
 <li>Property Merge 90</li>
 <li>Property Merge 45</li>
 <li>Property Merge</li>
+ <li><a href="voronoi_main.htm">Voronoi Main Page 
+</a></li>
+ <li>Voronoi Benchmark 
+ </li>
+ <li>Voronoi Builder</li>
+ <li><a href="voronoi_diagram.htm">Voronoi Diagram 
+</a></li>
+ <li>Voronoi Predicates</li>
+ <li>Voronoi Robust FPT 
+ </li>
+ <li>Voronoi Utils</li>
+
 </ul>
 <h3 class="navbar">Other Resources</h3>
 <ul>
- <li>GTL Boostcon 2009 Paper</li>
- <li><a href="GTL_boostcon_draft03.htm">GTL Boostcon 2009
+ <li>GTL Boostcon 2009 Paper</li>
+ <li><a href="GTL_boostcon_draft03.htm">GTL Boostcon 2009
 Presentation</a></li>
- <li>Performance Analysis</li>
- <li>Layout Versus Schematic Tutorial</li>
- <li>Minkowski Sum Tutorial</li>
- </ul>
+ <li>Performance Analysis</li>
+ <li>Layout Versus Schematic Tutorial</li>
+ <li>Minkowski Sum Tutorial</li>
+ <li>Voronoi Basic Tutorial</li>
+ <li>Voronoi Advanced Tutorial</li>
+</ul>
 </div>
 <h3 class="navbar">Polygon Sponsor</h3>
 <div style="padding: 5px;" align="center">
- <img border="0" src="images/intlogo.gif" width="127" height="51"><a title="www.adobe.com home page" href="http://www.adobe.com/" tabindex="2" style="border: medium none ;">
+ <img src="images/intlogo.gif" border="0" height="51" width="127" /><a title="www.adobe.com home page" href="http://www.adobe.com/" tabindex="2" style="border: medium none ;">
 </a>
 </div>
</td>
@@ -58,20 +71,20 @@



- 
+ 

<h1>Polygon 45 Concept</h1>


-The polygon_45 concept tag is 
+The polygon_45 concept tag is 
polygon_45_concept

To register a user defined type as a model of
polygon_45 concept, specialize the
geometry concept meta-function for that type.  In the example below CPolygon45 is registered as a model of
-polygon_45  concept.
-template <> 
-struct geometry_concept<CPolygon45> { typedef polygon_45_concept type; };
+polygon_45  concept.
+template <> 
+struct geometry_concept<CPolygon45> { typedef polygon_45_concept type; };
The semantic of a polygon_45 is that it can provide
iterators over the points that represent its vertices, angles formed as these
vertices must be multiple of 45-degree relative to the coordinate axis.  It
@@ -82,75 +95,75 @@
or std::list<point_data<int> >
could be made models of polygon_45_concept by simply providing access to their
iterators through traits.  Library functions that create polygon objects
-require that those objects provide a default constructor.
+require that those objects provide a default constructor.
Below is shown the default polygon traits. 
Specialization of these traits is required for types that don't conform to the
default behavior.  Note that these traits are also used by several other
polygon concepts through SFINAE enable template parameter.  The SFINAE enable
parameter also allows the library to provide default specialization that work
-for any object that models the 90 degree polygon concepts.
-template <typename T, typename enable = gtl_yes> 
-struct polygon_traits {}; 
- 
-template <typename T> 
-struct polygon_traits<T, 
-  typename gtl_or_4< 
+for any object that models the 90 degree polygon concepts.
+template <typename T, typename enable = gtl_yes> 
+struct polygon_traits {}; 
+ 
+template <typename T> 
+struct polygon_traits<T, 
+  typename gtl_or_4< 
    typename gtl_same_type<typename geometry_concept<T>::type,
-polygon_concept>::type, 
+polygon_concept>::type, 
    typename gtl_same_type<typename geometry_concept<T>::type,
-polygon_45_concept>::type, 
+polygon_45_concept>::type, 
    typename gtl_same_type<typename geometry_concept<T>::type,
-polygon_with_holes_concept>::type, 
+polygon_with_holes_concept>::type, 
    typename gtl_same_type<typename geometry_concept<T>::type,
-polygon_45_with_holes_concept>::type 
-  >::type> { 
-     typedef typename T::coordinate_type coordinate_type; 
-     typedef typename T::iterator_type iterator_type; 
-     typedef typename T::point_type point_type; 
-     static inline iterator_type begin_points(const T& t) { 
-          return t.begin(); 
-     } 
-     static inline iterator_type end_points(const T& t) { 
-          return t.end(); 
-     } 
-     static inline unsigned int size(const T& t) { 
-          return t.size(); 
-     } 
-     static inline winding_direction winding(const T& t) { 
-          return unknown_winding; 
-     } 
+polygon_45_with_holes_concept>::type 
+  >::type> { 
+     typedef typename T::coordinate_type coordinate_type; 
+     typedef typename T::iterator_type iterator_type; 
+     typedef typename T::point_type point_type; 
+     static inline iterator_type begin_points(const T& t) { 
+          return t.begin(); 
+     } 
+     static inline iterator_type end_points(const T& t) { 
+          return t.end(); 
+     } 
+     static inline unsigned int size(const T& t) { 
+          return t.size(); 
+     } 
+     static inline winding_direction winding(const T& t) { 
+          return unknown_winding; 
+     } 
};
-template <typename T, typename enable = void> 
-struct polygon_mutable_traits { 
-     template <typename iT> 
+template <typename T, typename enable = void> 
+struct polygon_mutable_traits { 
+     template <typename iT> 
     static inline T& set_points(T& t, iT input_begin, iT
-input_end) { 
+input_end) { 
          t.set(input_begin,
-input_end); 
-          return t; 
-     } 
+input_end); 
+          return t; 
+     } 
};
An object that is a model of 
polygon_45_concept can be viewed as a model of any of its
refinements if it is determined at runtime to conform to the restriction of
those concepts.  This concept casting is accomplished through the
view_as<>() function.
-view_as<rectangle_concept>(polygon_45_object) 
+view_as<rectangle_concept>(polygon_45_object) 
view_as<polygon_90_concept>(polygon_45_object)
The return value of view_as<>() can be
passed into any interface that expects an object of the conceptual type
specified in its template parameter.
<h2>Functions</h2>
-<table border="1" width="100%" id="table1">
- <tr>
- <td width="586">template <typename T> 
+<table id="table1" border="1" width="100%">
+ <tbody><tr>
+ <td width="586">template <typename T> 
 point_iterator_type begin_points(const T& polygon)</td>
 <td>Expects a model of polygon_45. 
 Returns the begin iterator over the range of points that correspond to
 vertices of the polygon.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 point_iterator_type end_points(const T& polygon)</td>
 <td>Expects a model of polygon_45. 
 Returns the end iterator over the range of points that correspond to
@@ -158,7 +171,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T, typename
- iterator> 
+ iterator> 
 void set_points(T& polygon, iterator b, iterator e)</td>
 <td>Expects a model of polygon_45.  
 Sets the polygon to the point data range [b,e) that corresponds to
@@ -166,22 +179,22 @@
 points is disallowed.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 unsigned int size(const T& polygon)</td>
 <td>Returns the number of edges in the
 polygon.</td>
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& assign(T1& left, const T2& right)</td>
 <td>Copies data from right object that models polygon_45 into left object
 that models polygon_45.</td>
 </tr>
 <tr>
 <td width="586">template <typename T,
- typename point_type> 
- bool contains(const T&, const point_type& point, 
+ typename point_type> 
+ bool contains(const T&, const point_type& point, 
             
 bool consider_touch=true)</td>
 <td>Given an object that models polygon_45 and an object that models
@@ -191,85 +204,84 @@
 the polygon.  Linear wrt. vertices.</td>
 </tr>
 <tr>
- <td width="586">// get the center coordinate 
- template <typename T, typename point_type> 
+ <td width="586">// get the center coordinate 
+ template <typename T, typename point_type> 
 void center(point_type& p, const T& polygon)</td>
 <td>Sets object that models point to the center point of the bounding
 box of an object that models polygon_45.  Linear wrt. vertices.</td>
 </tr>
 <tr>
 <td width="586">template <typename T,
- typename rectangle_type> 
+ typename rectangle_type> 
 bool extents(rectangle_type& bbox, const T& polygon)</td>
 <td>Sets object that models rectangle to the bounding box of an object
 that models polygon_45 and returns true.  Returns false and leaves
 bbox unchanged if polygon is empty.  Linear wrt. vertices.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 area_type area(const T& polygon)</td>
 <td>Returns the area of an object
 that models polygon_45.  Linear wrt. vertices.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 direction_1d winding(const T& polygon)</td>
 <td>Returns the winding direction of an object
 that models polygon_45, LOW == CLOCKWISE, HIGH = COUNTERCLOCKWISE. 
 Complexity depends upon winding trait.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 coordinate_distance perimeter(const T& polygon)</td>
 <td>Returns the perimeter length of an object
 that models polygon_45.  Linear wrt. vertices.</td>
 </tr>
 <tr>
 <td width="586">template <typename T,
- typename transform_type> 
+ typename transform_type> 
 T& transform(T& polygon, const transform_type&)</td>
 <td>Applies transform() on the vertices of polygon and sets the polygon to that described by the result of
 transforming its vertices.  Linear wrt. vertices.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 T& scale_up(T& polygon, unsigned_area_type factor)</td>
 <td>Scales up coordinate of an object that models
 polygon_45 by unsigned factor.  Linear wrt. vertices.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 T& scale_down(T& polygon, unsigned_area_type factor)</td>
 <td>Scales down coordinates of an object that models
 polygon_45 by unsigned factor.  Linear wrt. vertices.</td>
 </tr>
 <tr>
- <td width="586">template <typename T, scaling_type> 
+ <td width="586">template <typename T, scaling_type> 
 T& scale(T& rectangle, double scaling) </td>
 <td>Scales coordinates of an object that models polygon_45 by floating
 point factor.  Linear wrt. vertices.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
- T& move(T& polygon, orientation_2d, 
+ <td width="586">template <typename T> 
+ T& move(T& polygon, orientation_2d, 
        coordinate_difference displacement)</td>
 <td>Adds displacement value to coordinate indicated by orientation_2d of
 vertices of an object that models polygon_45.  Linear wrt.
 vertices.</td>
 </tr>
 <tr>
- <td width="586">template <typename polygon_type, typename point_type> 
- polygon_type& convolve(polygon_type& polygon, 
-                      
- const point_type& point)</td>
+ <td width="586">template <typename polygon_type, typename point_type> 
+ polygon_type& convolve(polygon_type& polygon,                       
+const point_type& point)</td>
 <td>Convolves coordinate values of point with vertices of an
 object that models polygon_45.  Linear wrt. vertices.</td>
 </tr>
- </table>
+ </tbody></table>
 <h1>Polygon 45 Data</h1>


-The library provides a model of polygon 45 concept declared
+The library provides a model of polygon 45 concept declared

template<typename T> polygon_45_data where T is the coordinate type.
This data type is used internally when a 45-degree polygon is needed and is
@@ -277,8 +289,8 @@
data type instead of providing their own.  The data type is implemented to
be convenient to use with the library traits.
<h2>Members</h2>
-<table border="1" width="100%" id="table2">
- <tr>
+<table id="table2" border="1" width="100%">
+ <tbody><tr>
 <td width="586">geometry_type</td>
 <td>polygon_45_concept</td>
 </tr>
@@ -306,7 +318,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T2> 
- polygon_45_data& operator=(const T2& that) const</td>
+ polygon_45_data& operator=(const T2& that) const</td>
 <td>Assign from an object that is a model of polygon 45.</td>
 </tr>
 <tr>
@@ -326,23 +338,23 @@
 </tr>
 <tr>
 <td width="586">template <typename iT> 
- void set(iT begin_points, iT end_points)</td>
+ void set(iT begin_points, iT end_points)</td>
 <td>Sets the polygon to the iterator range of points.  No check is
 performed to ensure the points describe corners that are multiples of 45
 degrees relative to the coordinate axis.</td>
 </tr>
-</table>
- <tr>
+</tbody></table>
+ </td></tr><tr>
<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" rules="none" frame="void" id="table3">
+<table class="docinfo" id="table3" frame="void" rules="none">
 <colgroup>
- <col class="docinfo-name"><col class="docinfo-content">
+ <col class="docinfo-name" /><col class="docinfo-content" />
 </colgroup>
- <tbody vAlign="top">
+ <tbody valign="top">
 <tr>
 <th class="docinfo-name">Copyright:</th>
 <td>Copyright © Intel Corporation 2008-2010.</td>
@@ -355,6 +367,6 @@
 <a class="reference" target="_top" href="http://www.boost.org/LICENSE_1_0.txt">
 http://www.boost.org/LICENSE_1_0.txt>)</td>
 </tr>
-</table>
+</tbody></table>

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

Modified: sandbox/gtl/doc/gtl_polygon_45_set_concept.htm
==============================================================================
--- sandbox/gtl/doc/gtl_polygon_45_set_concept.htm (original)
+++ sandbox/gtl/doc/gtl_polygon_45_set_concept.htm 2012-04-09 15:10:32 EDT (Mon, 09 Apr 2012)
@@ -1,15 +1,14 @@
<!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" 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"><head>
-<title>Boost Polygon Library: Polygon 45 Set Concept</title>
- <meta http-equiv="content-type" content="text/html;charset=ISO-8859-1">
- 
-<table style="margin: 0pt; padding: 0pt; width: 100%;" border="0" cellpadding="0" cellspacing="0"><tbody><tr>
+--><title>Boost Polygon Library: Polygon 45 Set 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">
- <img border="0" src="images/boost.png" width="277" height="86"><a title="www.boost.org home page" href="http://www.boost.org/" tabindex="2" style="border: medium none ;">
+ <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;">
@@ -37,20 +36,34 @@
 <li>Property Merge 90</li>
 <li>Property Merge 45</li>
 <li>Property Merge</li>
+ <li><a href="voronoi_main.htm">Voronoi Main Page 
+</a></li>
+ <li>Voronoi Benchmark 
+ </li>
+ <li>Voronoi Builder</li>
+ <li><a href="voronoi_diagram.htm">Voronoi Diagram 
+</a></li>
+ <li>Voronoi Predicates</li>
+ <li>Voronoi Robust FPT 
+ </li>
+ <li>Voronoi Utils</li>
+
 </ul>
 <h3 class="navbar">Other Resources</h3>
 <ul>
- <li>GTL Boostcon 2009 Paper</li>
- <li><a href="GTL_boostcon_draft03.htm">GTL Boostcon 2009
+ <li>GTL Boostcon 2009 Paper</li>
+ <li><a href="GTL_boostcon_draft03.htm">GTL Boostcon 2009
 Presentation</a></li>
- <li>Performance Analysis</li>
- <li>Layout Versus Schematic Tutorial</li>
- <li>Minkowski Sum Tutorial</li>
- </ul>
+ <li>Performance Analysis</li>
+ <li>Layout Versus Schematic Tutorial</li>
+ <li>Minkowski Sum Tutorial</li>
+ <li>Voronoi Basic Tutorial</li>
+ <li>Voronoi Advanced Tutorial</li>
+</ul>
 </div>
 <h3 class="navbar">Polygon Sponsor</h3>
 <div style="padding: 5px;" align="center">
- <img border="0" src="images/intlogo.gif" width="127" height="51"><a title="www.adobe.com home page" href="http://www.adobe.com/" tabindex="2" style="border: medium none ;">
+ <img src="images/intlogo.gif" border="0" height="51" width="127" /><a title="www.adobe.com home page" href="http://www.adobe.com/" tabindex="2" style="border: medium none ;">
 </a>
 </div>
</td>
@@ -58,12 +71,12 @@



- 
+ 

<h1>Polygon 45 Set Concept</h1>


-The polygon_45_set concept tag is 
+The polygon_45_set concept tag is 
polygon_45_set_concept

The semantic of a polygon_45_set is zero or more
@@ -77,7 +90,7 @@
intersection point.  In the case that data represented contains no
45-degree angles and is Manhattan a runtime check will default to the Manhattan
algorithm.  The results of which are identical to what the 45-degree
-algorithm would do, but obtained more efficiently.
+algorithm would do, but obtained more efficiently.
The motivation for providing the polygon_45_set is
to extend the special case of Manhattan geometry capability of the library to
encompass the slightly less common, but still important special case of geometry
@@ -86,7 +99,7 @@
and affords many opportunities for optimization.  45-degree algorithms can
be 50X faster than arbitrary angle algorithms and are required to provide a
complete feature set that meets the performance requirements of application
-domains in which Manhattan and 45-degree geometry are a common special case.Users are recommended to use std::vector and std::list of user defined polygons
+domains in which Manhattan and 45-degree geometry are a common special case.Users are recommended to use std::vector and std::list of user defined polygons
or library provided polygon_45_set_data<coordinate_type> objects.  Lists
and vectors of models of polygon_45_concept or polygon_45_with_holes_concept are automatically models of polygon_45_set_concept.
An object that is a model of 
@@ -108,10 +121,10 @@
eliminate temp copies of intermediate results when Boolean operators are chained
together.
Operators are declared inside the namespace boost::polygon::operators.
-<table border="1" width="100%" id="table5">
- <tr>
+<table id="table5" border="1" width="100%">
+ <tbody><tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 polygon_45_set_view operator|(const T1& l, const T2& r)</td>
 <td>Boolean OR operation (polygon set union).  Accepts two objects
 that model polygon_45_set or one of its refinements.  Returns an
@@ -121,7 +134,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 polygon_45_set_view operator+(const T1& l, const T2& r)</td>
 <td>Same as operator|.  The plus sign is also used for OR
 operations in Boolean logic expressions.  O( n log n) runtime
@@ -129,7 +142,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 polygon_45_set_view operator&(const T1& l, const T2& r)</td>
 <td>Boolean AND operation (polygon set intersection).  Accepts two
 objects that model polygon_45_set or one of its refinements.  O( n
@@ -137,7 +150,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 polygon_45_set_view operator*(const T1& l, const T2& r)</td>
 <td>Same as operator&.  The multiplication symbol is also used for
 AND operations in Boolean logic expressions.  O( n log n) runtime
@@ -145,7 +158,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 polygon_45_set_view operator^(const T1& l, const T2& r)</td>
 <td>Boolean XOR operation (polygon set disjoint-union).  Accepts
 two objects that model polygon_45_set or one of its refinements. 
@@ -154,7 +167,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 polygon_45_set_view operator-(const T1& l, const T2& r)</td>
 <td>Boolean SUBTRACT operation (polygon set difference).  Accepts
 two objects that model polygon_45_set or one of its refinements. 
@@ -163,7 +176,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& operator|=(const T1& l, const T2& r)</td>
 <td>Same as operator|, but with self assignment, left operand must model
 polygon_45_set and not one of it's refinements.  O( n log n)
@@ -171,7 +184,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& operator+=(T1& l, const T2& r)</td>
 <td>Same as operator+, but with self assignment, left operand must model
 polygon_45_set and not one of it's refinements.  O( n log n)
@@ -179,7 +192,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& operator&=(const T1& l, const T2& r)</td>
 <td>Same as operator&, but with self assignment, left operand must model
 polygon_45_set and not one of it's refinements.  O( n log n)
@@ -187,7 +200,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& operator*=(T1& l, const T2& r)</td>
 <td>Same as operator*, but with self assignment, left operand must model
 polygon_45_set and not one of it's refinements.  O( n log n)
@@ -195,7 +208,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& operator^=(const T1& l, const T2& r)</td>
 <td>Same as operator^, but with self assignment, left operand must model
 polygon_45_set and not one of it's refinements.  O( n log n)
@@ -203,14 +216,14 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& operator-=(T1& l, const T2& r)</td>
 <td>Same as operator-, but with self assignment, left operand must model
 polygon_45_set and not one of it's refinements.  O( n log n)
 runtime complexity and O(n) memory wrt vertices + intersections.</td>
 </tr>
 <tr>
- <td width="586">template <typename T1> 
+ <td width="586">template <typename T1> 
 T1 operator+(const T1&, coordinate_type bloating)</td>
 <td>Performs resize operation, inflating by bloating ammount.  If
 negative the result is a shrink instead of bloat.  Note: returns
@@ -219,7 +232,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1 operator-(const T1&, coordinate_type shrinking)</td>
 <td>Performs resize operation, deflating by bloating ammount.  If
 negative the result is a bloat instead of shrink.  Note: returns
@@ -228,7 +241,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& operator+=(const T1&, coordinate_type bloating)</td>
 <td>Performs resize operation, inflating by bloating ammount.  If
 negative the result is a shrink instead of bloat.  Returns
@@ -237,19 +250,19 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& operator-=(const T1&, coordinate_type shrinking)</td>
 <td>Performs resize operation, deflating by bloating ammount.  If
 negative the result is a bloat instead of shrink.  Returns
 reference to modified argument.  O( n log n) runtime complexity and
 O(n) memory wrt vertices + intersections.</td>
 </tr>
- </table>
+ </tbody></table>
<h2>Functions</h2>
-<table border="1" width="100%" id="table3">
- <tr>
+<table id="table3" border="1" width="100%">
+ <tbody><tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& assign(T1& lvalue, const T2& rvalue)</td>
 <td>Eliminates overlaps in geometry and copies from an object that
 models polygon_45_set or any of its refinements into an object that
@@ -258,7 +271,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 bool equivalence(const T1& lvalue, const T2& rvalue) </td>
 <td>Returns true if an object that models polygon_45_set or one of its
 refinements covers the exact same geometric regions as another object
@@ -268,8 +281,8 @@
 </tr>
 <tr>
 <td width="586">template <typename
- output_container_type, typename T> 
- void get_trapezoids(output_container_type& output, 
+ output_container_type, typename T> 
+ void get_trapezoids(output_container_type& output, 
                   
 const T& polygon_set)</td>
 <td>Output container is expected to be a standard container. 
@@ -282,10 +295,12 @@
 </tr>
 <tr>
 <td width="586">template <typename
- output_container_type, typename T> 
- void get_trapezoids(output_container_type& output, 
+ output_container_type, typename T> 
+ void get_trapezoids(output_container_type& output, 
                   
- const T& polygon_set,                     orientation_2d orient)</td>
+ const T& polygon_set, 
+                   
+orientation_2d orient)</td>
 <td>Output container is expected to be a standard container. 
 Slices geometry of an object that models polygon_45_set or one of its
 refinements into non overlapping trapezoids along a the specified slicing
@@ -296,13 +311,13 @@
 </tr>
 <tr>
 <td width="586">template <typename
- polygon_set_type> 
+ polygon_set_type> 
 void clear(polygon_set_type& polygon_set)</td>
 <td>Makes the object empty of geometry.</td>
 </tr>
 <tr>
 <td width="586">template <typename
- polygon_set_type> 
+ polygon_set_type> 
 bool empty(const polygon_set_type& polygon_set)</td>
 <td>Checks whether the object is empty of geometry.  Polygons that
 are completely covered by holes will result in empty returning true.  
@@ -310,8 +325,8 @@
 </tr>
 <tr>
 <td width="586">template <typename T, typename
- rectangle_type> 
- bool extents(rectangle_type& extents_rectangle, 
+ rectangle_type> 
+ bool extents(rectangle_type& extents_rectangle, 
             const
 T& polygon_set)</td>
 <td>Computes bounding box of an object that models polygon_45_set and
@@ -321,7 +336,7 @@
 log n) runtime complexity and O(n) memory wrt vertices.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 area_type area(const T& polygon_set)</td>
 <td>Computes the area covered by geometry in an object that models
 polygon_45_set.   O( n log n) runtime complexity and O(n)
@@ -329,7 +344,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& interact(T1& a, const T2& b)</td>
 <td>Given an object that models polygon_45_set and an object that models
 polygon_45_set or one of its refinements, modifies a to retain only
@@ -337,7 +352,7 @@
 runtime complexity and O(n) memory wrt vertices plus intersections.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 T& self_intersect(T& polygon_set)</td>
 <td>Given an object that models polygon_45_set that has self overlapping
 regions, modifies the argument to contain only the regions of overlap. 
@@ -345,7 +360,7 @@
 intersections.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 T& self_xor(T& polygon_set)</td>
 <td>Given an object that models polygon_45_set that has self overlapping
 regions, modifies the argument to contain only the regions that do not
@@ -353,14 +368,14 @@
 vertices + intersections.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 T& bloat(T& polygon_set, unsigned_area_type bloating)</td>
 <td>Same as getting all the polygons, bloating them and putting them
 back.  O( n log n) runtime complexity and O(n) memory wrt vertices
 + intersections.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 T& shrink(T& polygon_set, unsigned_area_type shrinking)</td>
 <td>Same as getting all the polygons, shrinking them and overwriting
 the polygon set with the resulting regions.  O( n log n) runtime
@@ -368,10 +383,10 @@
 </tr>
 <tr>
 <td width="586">template <typename T, typename
- coord_type> 
- T& resize(T& polygon_set, coord_type resizing, 
+ coord_type> 
+ T& resize(T& polygon_set, coord_type resizing, 
          
- RoundingOption rounding = CLOSEST,           CornerOption corner = INTERSECTION)</td>
+ RoundingOption rounding = CLOSEST,           CornerOption corner = INTERSECTION)</td>
 <td>Same as bloat if resizing is positive, same as shrink if resizing is
 negative.  RoundingOption is an enum that controls snapping of
 non-integer results of resizing 45 degree edges.  CornerOption is
@@ -380,7 +395,7 @@
 complexity and O(n) memory wrt vertices + intersections.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
T& grow_and(T& polygon_set, unsigned_area_type bloating)</td>
 <td>Same as bloating non-overlapping regions and then applying self
 intersect to retain only the overlaps introduced by the bloat.  O(
@@ -388,13 +403,13 @@
 intersections.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
T& scale_up(T& polygon_set, unsigned_area_type factor)</td>
 <td>Scales geometry up by unsigned factor.  O( n log n) runtime
 complexity and O(n) memory wrt vertices.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
T& scale_down(T& polygon_set, unsigned_area_type factor)</td>
 <td>Scales geometry down by unsigned factor.  Snaps 45 degree edges
 back to 45 degrees after division truncation leads to small changes in
@@ -402,7 +417,7 @@
 vertices.</td>
 </tr>
 <tr>
- <td width="586">template <typename T, typename scaling_type> 
+ <td width="586">template <typename T, typename scaling_type> 
T& scale(polygon_set_type& polygon_set, double scaling)</td>
 <td>Scales geometry by multiplying by floating point factor.  
 Snaps 45 degree edges back to 45 degrees after truncation of fractional
@@ -410,32 +425,32 @@
 runtime complexity and O(n) memory wrt vertices.</td>
 </tr>
 <tr>
- <td width="586">template <typename T, typename transformation_type> 
-T& transform(T& polygon_set, 
+ <td width="586">template <typename T, typename transformation_type> 
+T& transform(T& polygon_set, 
             const
transformation_type& transformation)</td>
 <td>Applies transformation.transform() on all vertices.  O( n log
 n) runtime complexity and O(n) memory wrt vertices.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
-T& keep(T& polygon_set, 
-        unsigned_area_type min_area, 
-        unsigned_area_type max_area, 
-        unsigned_area_type min_width, 
-        unsigned_area_type max_width, 
-        unsigned_area_type min_height, 
+ <td width="586">template <typename T> 
+T& keep(T& polygon_set, 
+        unsigned_area_type min_area, 
+        unsigned_area_type max_area, 
+        unsigned_area_type min_width, 
+        unsigned_area_type max_width, 
+        unsigned_area_type min_height, 
        unsigned_area_type max_height)</td>
 <td>Retains only regions that satisfy the min/max criteria in the
 argument list.  Note: useful for visualization to cull too small
 polygons.  O( n log n) runtime complexity and O(n) memory wrt
 vertices.</td>
 </tr>
- </table>
+ </tbody></table>
 <h1>Polygon 45 Set Data Object</h1>


-The polygon 45 set data type encapsulates the internal data format that
+The polygon 45 set data type encapsulates the internal data format that
serves as the input to the sweep-line algorithm that implements polygon-clipping
Boolean operations.  It also internally keeps track of whether that data
has been sorted or scanned and maintains the invariant that when its flags
@@ -446,20 +461,20 @@
maintain the data is sorted form rather than going all the way out to polygons
then resorting those vertices for a subsequent operation.
The declaration of Polygon 45 Set Data is the following:
-template <typename T> 
+template <typename T> 
class polygon_45_set_data;
The class is parameterized on the coordinate data type.  Algorithms that
benefit from knowledge of the invariants enforced by the class are implemented
as member functions to provide them access to information about those
invariants.  
<h2>Member Functions</h2>
-<table border="1" width="100%" id="table4">
- <tr>
+<table id="table4" border="1" width="100%">
+ <tbody><tr>
 <td width="586">polygon_45_set_data()</td>
 <td>Default constructor. </td>
 </tr>
 <tr>
- <td width="586">template <typename iT> 
+ <td width="586">template <typename iT> 
 polygon_45_set_data(iT input_begin, iT
 input_end)</td>
 <td>Construct from an iterator range of
@@ -472,34 +487,34 @@
 </tr>
 <tr>
 <td width="586">
-template <typename l, typename r, typename op> 
+template <typename l, typename r, typename op> 
polygon_45_set_data(const polygon_45_set_view<l,r,op>&
t)</td>
 <td>Copy construct from a Boolean operator template.</td>
 </tr>
 <tr>
 <td width="586">
-polygon_45_set_data& operator=(const polygon_45_set_data& that)</td>
+polygon_45_set_data& operator=(const polygon_45_set_data& that)</td>
 <td>Assignment from another polygon set, may change scanning
 orientation.</td>
 </tr>
 <tr>
 <td width="586">
-template <typename l, typename r, typename op> 
-polygon_45_set_data& operator=(const polygon_45_set_view<l, r,
+template <typename l, typename r, typename op> 
+polygon_45_set_data& operator=(const polygon_45_set_view<l, r,
op>& that)</td>
 <td>Assignment from a Boolean operator template.</td>
 </tr>
 <tr>
- <td width="586">template <typename geometry_object> 
+ <td width="586">template <typename geometry_object> 
polygon_45_set_data& operator=(const geometry_object& geo)</td>
 <td>Assignment from an insertable object.</td>
 </tr>
 <tr>
 <td width="586">

-template <typename iT> 
-void insert(iT input_begin, iT input_end,             bool is_hole = false)</td>
+template <typename iT> 
+void insert(iT input_begin, iT input_end,             bool is_hole = false)</td>
 <td>Insert objects of an iterator range.  If is_hole is true
 inserts subtractive regions.  Linear wrt the number of vertices
 added.</td>
@@ -507,15 +522,15 @@
 <tr>
 <td width="586">

-void insert(const polygon_45_set_data& polygon_set,             bool is_hole
+void insert(const polygon_45_set_data& polygon_set,             bool is_hole
= false)</td>
 <td>Insert a polygon set.  Linear wrt the number of vertices added.</td>
 </tr>
 <tr>
 <td width="586">

-template <typename geometry_type> 
-void insert(const geometry_type& geometry_object,             bool is_hole
+template <typename geometry_type> 
+void insert(const geometry_type& geometry_object,             bool is_hole
= false)</td>
 <td>Insert a geometry object, if is_hole is true then the inserted
 region is subtractive rather than additive.  Linear wrt the number
@@ -523,7 +538,7 @@
 </tr>
 <tr>
 <td width="586">
-template <typename output_container> 
+template <typename output_container> 
void get(output_container& output) const</td>
 <td>Expects a standard container of geometry objects.  Will scan
 and eliminate overlaps.  Converts polygon set geometry to objects
@@ -536,7 +551,7 @@
 </tr>
 <tr>
 <td width="586">
-template <typename output_container> 
+template <typename output_container> 
void get_polygons(output_container& output) const</td>
 <td>Expects a standard container of polygon objects.  Will scan and
 eliminate overlaps.  Converts polygon set geometry to polygons and
@@ -546,7 +561,7 @@
 </tr>
 <tr>
 <td width="586">
-template <typename output_container> 
+template <typename output_container> 
void get_polygons_with_holes(output_container& o) const</td>
 <td>Expects a standard container of polygon with holes objects.  Will scan and
 eliminate overlaps.  Converts polygon set geometry to polygons and
@@ -555,7 +570,7 @@
 </tr>
 <tr>
 <td width="586">
-template <typename output_container> 
+template <typename output_container> 
void get_trapezoids(output_container& output) const</td>
 <td>Expects a standard container of polygon objects.  Will scan
 and eliminate overlaps.  Slices polygon set geometry to trapezoids
@@ -565,8 +580,8 @@
 <tr>
 <td width="586">

-template <typename output_container> 
-void get_trapezoids(output_container& output,   orientation_2d
+template <typename output_container> 
+void get_trapezoids(output_container& output,   orientation_2d
slicing_orientation) const 
 </td>
 <td>Expects a standard container of polygon objects.  Will scan
@@ -620,15 +635,15 @@
 </tr>
 <tr>
 <td width="586">
-template <typename input_iterator_type> 
-void set(input_iterator_type input_begin,          input_iterator_type input_end) 
+template <typename input_iterator_type> 
+void set(input_iterator_type input_begin,          input_iterator_type input_end) 
 </td>
 <td>Overwrite geometry in polygon set with insertable objects in the
 iterator range.  </td>
 </tr>
 <tr>
 <td width="586">
-template <typename rectangle_type> 
+template <typename rectangle_type> 
bool extents(rectangle_type& extents_rectangle) const</td>
 <td>Given an object that models rectangle, scans and eliminates overlaps
 in the polygon set because subtractive regions may alter its extents
@@ -638,9 +653,9 @@
 </tr>
 <tr>
 <td width="586">
-polygon_45_set_data& 
-resize(coord_type resizing, 
-        RoundingOption rounding = CLOSEST,        CornerOption
+polygon_45_set_data& 
+resize(coord_type resizing, 
+        RoundingOption rounding = CLOSEST,        CornerOption
 corner = INTERSECTION)</td>
 <td>Same as bloat if resizing is positive, same as shrink if resizing is
 negative.  RoundingOption is an enum that controls snapping of
@@ -651,8 +666,8 @@
 </tr>
 <tr>
 <td width="586">
-template <typename transformation_type> 
-polygon_45_set_data& transform(const transformation_type& transformation) 
+template <typename transformation_type> 
+polygon_45_set_data& transform(const transformation_type& transformation) 
 </td>
 <td>Applies transformation.transform() on vertices stored within the
 polygon set.  O(n log n) runtime and O(n) memory wrt. vertices +
@@ -710,18 +725,18 @@
 <td>Retain only overlapping regions of geometry within a polygon set. 
 O(n log n) runtime and O(n) memory wrt. vertices + intersections.</td>
 </tr>
- </table>
- <tr>
+ </tbody></table>
+ </td></tr><tr>
<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" rules="none" frame="void" id="table6">
+<table class="docinfo" id="table6" frame="void" rules="none">
 <colgroup>
- <col class="docinfo-name"><col class="docinfo-content">
+ <col class="docinfo-name" /><col class="docinfo-content" />
 </colgroup>
- <tbody vAlign="top">
+ <tbody valign="top">
 <tr>
 <th class="docinfo-name">Copyright:</th>
 <td>Copyright © Intel Corporation 2008-2010.</td>
@@ -734,6 +749,6 @@
 <a class="reference" target="_top" href="http://www.boost.org/LICENSE_1_0.txt">
 http://www.boost.org/LICENSE_1_0.txt>)</td>
 </tr>
-</table>
+</tbody></table>

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

Modified: sandbox/gtl/doc/gtl_polygon_45_with_holes_concept.htm
==============================================================================
--- sandbox/gtl/doc/gtl_polygon_45_with_holes_concept.htm (original)
+++ sandbox/gtl/doc/gtl_polygon_45_with_holes_concept.htm 2012-04-09 15:10:32 EDT (Mon, 09 Apr 2012)
@@ -1,15 +1,14 @@
<!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" 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"><head>
-<title>Boost Polygon Library: Polygon 45 With Holes Concept</title>
- <meta http-equiv="content-type" content="text/html;charset=ISO-8859-1">
- 
-<table style="margin: 0pt; padding: 0pt; width: 100%;" border="0" cellpadding="0" cellspacing="0"><tbody><tr>
+--><title>Boost Polygon Library: Polygon 45 With Holes 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">
- <img border="0" src="images/boost.png" width="277" height="86"><a title="www.boost.org home page" href="http://www.boost.org/" tabindex="2" style="border: medium none ;">
+ <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;">
@@ -37,20 +36,34 @@
 <li>Property Merge 90</li>
 <li>Property Merge 45</li>
 <li>Property Merge</li>
+ <li><a href="voronoi_main.htm">Voronoi Main Page 
+</a></li>
+ <li>Voronoi Benchmark 
+ </li>
+ <li>Voronoi Builder</li>
+ <li><a href="voronoi_diagram.htm">Voronoi Diagram 
+</a></li>
+ <li>Voronoi Predicates</li>
+ <li>Voronoi Robust FPT 
+ </li>
+ <li>Voronoi Utils</li>
+
 </ul>
 <h3 class="navbar">Other Resources</h3>
 <ul>
- <li>GTL Boostcon 2009 Paper</li>
- <li><a href="GTL_boostcon_draft03.htm">GTL Boostcon 2009
+ <li>GTL Boostcon 2009 Paper</li>
+ <li><a href="GTL_boostcon_draft03.htm">GTL Boostcon 2009
 Presentation</a></li>
- <li>Performance Analysis</li>
- <li>Layout Versus Schematic Tutorial</li>
- <li>Minkowski Sum Tutorial</li>
- </ul>
+ <li>Performance Analysis</li>
+ <li>Layout Versus Schematic Tutorial</li>
+ <li>Minkowski Sum Tutorial</li>
+ <li>Voronoi Basic Tutorial</li>
+ <li>Voronoi Advanced Tutorial</li>
+</ul>
 </div>
 <h3 class="navbar">Polygon Sponsor</h3>
 <div style="padding: 5px;" align="center">
- <img border="0" src="images/intlogo.gif" width="127" height="51"><a title="www.adobe.com home page" href="http://www.adobe.com/" tabindex="2" style="border: medium none ;">
+ <img src="images/intlogo.gif" border="0" height="51" width="127" /><a title="www.adobe.com home page" href="http://www.adobe.com/" tabindex="2" style="border: medium none ;">
 </a>
 </div>
</td>
@@ -58,71 +71,71 @@



- 
+ 

<h1>Polygon 45 With Holes Concept</h1>


-The polygon_45_with_holes concept tag is 
+The polygon_45_with_holes concept tag is 
polygon_45_with_holes_concept

To register a user defined type as a model of
polygon_45_with_holes concept, specialize
the geometry concept meta-function for that type.  In the example below
-CPolygon45WithHoles is registered as a model of polygon_45_with_holes  concept.
-template <> 
-struct geometry_concept<CPolygon45WithHoles> { typedef polygon_45_with_holes_concept type; };
+CPolygon45WithHoles is registered as a model of polygon_45_with_holes  concept.
+template <> 
+struct geometry_concept<CPolygon45WithHoles> { typedef polygon_45_with_holes_concept type; };
The semantic of a polygon_45_with_holes is a
polygon_45 that it can provide iterators over holes that are also polygon_45. 
A mutable polygon_45_with_holes must also be able to set its geometry based on
an interator range over polygon_45 holes.  There is no convention of
-winding of holes enforced within the library. 
+winding of holes enforced within the library. 
Below is shown the default polygon with holes
traits.  Specialization of these traits is required for types that don't
-conform to the default behavior.template <typename
-T, typename enable = void> 
-struct polygon_with_holes_traits { 
+conform to the default behavior.template <typename
+T, typename enable = void> 
+struct polygon_with_holes_traits { 
     typedef typename T::iterator_holes_type
-iterator_holes_type; 
-     typedef typename T::hole_type hole_type; 
+iterator_holes_type; 
+     typedef typename T::hole_type hole_type; 
     static inline iterator_holes_type begin_holes(const T&
-t) { 
-          return t.begin_holes(); 
-     } 
+t) { 
+          return t.begin_holes(); 
+     } 
     static inline iterator_holes_type end_holes(const T& t)
-{ 
-          return t.end_holes(); 
-     } 
-     static inline unsigned int size_holes(const T& t) { 
-          return t.size_holes(); 
-     } 
+{ 
+          return t.end_holes(); 
+     } 
+     static inline unsigned int size_holes(const T& t) { 
+          return t.size_holes(); 
+     } 
};
-template <typename T, typename enable = void> 
-struct polygon_with_holes_mutable_traits { 
-     template <typename iT> 
+template <typename T, typename enable = void> 
+struct polygon_with_holes_mutable_traits { 
+     template <typename iT> 
     static inline T& set_holes(T& t, iT inputBegin, iT
-inputEnd) { 
+inputEnd) { 
          t.set_holes(inputBegin,
-inputEnd); 
-          return t; 
-     } 
+inputEnd); 
+          return t; 
+     } 
};
An object that is a model of 
polygon_45_with_holes_concept can be viewed as a model of any of its
refinements if it is determined at runtime to conform to the restriction of
those concepts.  This concept casting is accomplished through the
view_as<>() function.
-view_as<rectangle_concept>(polygon_45_with_holes_object) 
-view_as<polygon_90_concept>(polygon_45_with_holes_object) 
-view_as<polygon_90_with_holes_concept>(polygon_45_with_holes_object) 
+view_as<rectangle_concept>(polygon_45_with_holes_object) 
+view_as<polygon_90_concept>(polygon_45_with_holes_object) 
+view_as<polygon_90_with_holes_concept>(polygon_45_with_holes_object) 
view_as<polygon_45_concept>(polygon_45_with_holes_object)
The return value of view_as<>() can be
passed into any interface that expects an object of the conceptual type
specified in its template parameter. 
<h2>Functions</h2>
-<table border="1" width="100%" id="table1">
- <tr>
- <td width="586">template <typename T> 
+<table id="table1" border="1" width="100%">
+ <tbody><tr>
+ <td width="586">template <typename T> 
 point_iterator_type begin_points(const T& polygon)</td>
 <td>Expects a model of
 polygon_45_with_holes. 
@@ -130,7 +143,7 @@
 vertices of the polygon.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 point_iterator_type end_points(const T& polygon)</td>
 <td>Expects a model of
 polygon_45_with_holes. 
@@ -138,7 +151,7 @@
 vertices of the polygon.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 hole_iterator_type begin_holes(const T& polygon)</td>
 <td>Expects a model of
 polygon_45_with_holes. 
@@ -146,7 +159,7 @@
 to horizontal and vertical edges.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 hole_iterator_type end_holes(const T& polygon)</td>
 <td>Expects a model of
 polygon_45_with_holes. 
@@ -155,7 +168,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T, typename
- iterator> 
+ iterator> 
 void set_points(T& polygon, iterator b, iterator e)</td>
 <td>Expects a model of
 polygon_45_with_holes.  
@@ -164,14 +177,14 @@
 </tr>
 <tr>
 <td width="586">template <typename T, typename
- iterator> 
+ iterator> 
 void set_holes(T& polygon, iterator b, iterator e)</td>
 <td>Expects a model of
 polygon_45_with_holes.  
 Sets the polygon holes to the hole data range [b,e)</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 unsigned int size(const T& polygon)</td>
 <td>Returns the number of edges in the
 outer shell of the polygon_45_with_holes.  Does not include sizes
@@ -179,7 +192,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& assign(T1& left, const T2& right)</td>
 <td>Copies data from right object that models polygon_45_with_holes or
 one of its refinements into left object
@@ -187,8 +200,8 @@
 </tr>
 <tr>
 <td width="586">template <typename T,
- typename point_type> 
- bool contains(const T&, const point_type& point, 
+ typename point_type> 
+ bool contains(const T&, const point_type& point, 
             
 bool consider_touch=true)</td>
 <td>Given an object that models polygon_45_with_holes and an object that models
@@ -199,86 +212,85 @@
 the polygon or one of its holes.</td>
 </tr>
 <tr>
- <td width="586">// get the center coordinate 
- template <typename T, typename point_type> 
+ <td width="586">// get the center coordinate 
+ template <typename T, typename point_type> 
 void center(point_type& p, const T& polygon)</td>
 <td>Sets object that models point to the center point of the bounding
 box of an object that models polygon_45_with_holes.</td>
 </tr>
 <tr>
 <td width="586">template <typename T,
- typename rectangle_type> 
+ typename rectangle_type> 
 bool extents(rectangle_type& bbox, const T& polygon)</td>
 <td>Sets object that models rectangle to the bounding box of an object
 that models polygon_45_with_holes and returns true.  Returns false
 and leaves bbox unchanged if polygon is empty.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 manhattan_area_type area(const T& polygon)</td>
 <td>Returns the area of an object
 that models polygon_45_with_holes including subtracting the area of its
 holes from the area of the outer shell polygon.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 direction_1d winding(const T& polygon)</td>
 <td>Returns the winding direction of an object
 that models polygon_45_with_holes, LOW == CLOCKWISE, HIGH =
 COUNTERCLOCKWISE.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 coordinate_difference perimeter(const T& polygon)</td>
 <td>Returns the perimeter length of an object
 that models polygon_45, including the perimeters of the holes.</td>
 </tr>
 <tr>
 <td width="586">template <typename T,
- typename transform_type> 
+ typename transform_type> 
 T& transform(T& polygon, const transform_type&)</td>
 <td>Applies transform() on the vertices of polygon and sets the polygon to that described by the result of
 transforming its vertices.  Also applies transform() on the holes
 of the polygon.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 T& scale_up(T& polygon, unsigned_area_type factor)</td>
 <td>Scales up outer shell and holes of an object that models
 polygon_45 by unsigned factor.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 T& scale_down(T& polygon, unsigned_area_type factor)</td>
 <td>Scales down outer shell and holes of an object that models
 polygon_45 by unsigned factor.</td>
 </tr>
 <tr>
- <td width="586">template <typename T, scaling_type> 
+ <td width="586">template <typename T, scaling_type> 
 T& scale(T& rectangle, double scaling) </td>
 <td>Scales outer shell and holes of an object that models polygon_45 by
 floating point factor.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
- T& move(T& polygon, orientation_2d, 
+ <td width="586">template <typename T> 
+ T& move(T& polygon, orientation_2d, 
        coordinate_difference displacement)</td>
 <td>Adds displacement value to coordinate indicated by orientation_2d of
 vertices of an object that models polygon_45 .</td>
 </tr>
 <tr>
- <td width="586">template <typename polygon_type, typename point_type> 
- polygon_type& convolve(polygon_type& polygon, 
-                      
- const point_type& point)</td>
+ <td width="586">template <typename polygon_type, typename point_type> 
+ polygon_type& convolve(polygon_type& polygon,                       
+const point_type& point)</td>
 <td>Convolves coordinate values of point with the outer shell and holes of an
 object that models polygon_45_with_holes.</td>
 </tr>
- </table>
+ </tbody></table>
 <h1>Polygon 45 With Holes Data</h1>


-The library provides a model of polygon 45 with holes concept declared
+The library provides a model of polygon 45 with holes concept declared

template<typename T> polygon_45_with_holes_data where T is the
coordinate type.
@@ -287,8 +299,8 @@
library polygon data type instead of providing their own.  The data type is
implemented to be convenient to use with the library traits.
<h2>Members</h2>
-<table border="1" width="100%" id="table2">
- <tr>
+<table id="table2" border="1" width="100%">
+ <tbody><tr>
 <td width="586">geometry_type</td>
 <td>polygon_45_with_holes_concept</td>
 </tr>
@@ -316,13 +328,13 @@
 </tr>
 <tr>
 <td width="586">polygon_45_with_holes_data& 
- operator=(const polygon_45_with_holes_data& that)</td>
+ operator=(const polygon_45_with_holes_data& that)</td>
 <td>Assignment operator.</td>
 </tr>
 <tr>
 <td width="586">template <typename T2> 
 polygon_45_with_holes_data& 
- operator=(const T2& that) const</td>
+ operator=(const T2& that) const</td>
 <td>Assign from an object that is a model of polygon 45 with holes.</td>
 </tr>
 <tr>
@@ -358,30 +370,30 @@
 </tr>
 <tr>
 <td width="586">template <typename iT> 
- void set(iT begin_points, iT end_points)</td>
+ void set(iT begin_points, iT end_points)</td>
 <td>Sets the polygon to the iterator range of points.  No check is
 performed to ensure the points describe a 45 degree figure.</td>
 </tr>
 <tr>
 <td width="586">template <typename iT> 
- void set_holes(iT begin_holes, iT end_choless)</td>
+ void set_holes(iT begin_holes, iT end_choless)</td>
 <td>Sets the polygon holes the iterator range of hole polygons.  These
 polygons in the input range may be either polygon_45_data or
 polygon_45_with_holes_data or any type that provides begin and end
 member functions to iterate over point_data<T>.</td>
 </tr>
-</table>
- <tr>
+</tbody></table>
+ </td></tr><tr>
<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" rules="none" frame="void" id="table3">
+<table class="docinfo" id="table3" frame="void" rules="none">
 <colgroup>
- <col class="docinfo-name"><col class="docinfo-content">
+ <col class="docinfo-name" /><col class="docinfo-content" />
 </colgroup>
- <tbody vAlign="top">
+ <tbody valign="top">
 <tr>
 <th class="docinfo-name">Copyright:</th>
 <td>Copyright © Intel Corporation 2008-2010.</td>
@@ -394,6 +406,6 @@
 <a class="reference" target="_top" href="http://www.boost.org/LICENSE_1_0.txt">
 http://www.boost.org/LICENSE_1_0.txt>)</td>
 </tr>
-</table>
+</tbody></table>

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

Modified: sandbox/gtl/doc/gtl_polygon_90_concept.htm
==============================================================================
--- sandbox/gtl/doc/gtl_polygon_90_concept.htm (original)
+++ sandbox/gtl/doc/gtl_polygon_90_concept.htm 2012-04-09 15:10:32 EDT (Mon, 09 Apr 2012)
@@ -1,15 +1,14 @@
<!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" 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"><head>
-<title>Boost Polygon Library: Polygon 90 Concept</title>
- <meta http-equiv="content-type" content="text/html;charset=ISO-8859-1">
- 
-<table style="margin: 0pt; padding: 0pt; width: 100%;" border="0" cellpadding="0" cellspacing="0"><tbody><tr>
+--><title>Boost Polygon Library: Polygon 90 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">
- <img border="0" src="images/boost.png" width="277" height="86"><a title="www.boost.org home page" href="http://www.boost.org/" tabindex="2" style="border: medium none ;">
+ <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;">
@@ -37,20 +36,34 @@
 <li>Property Merge 90</li>
 <li>Property Merge 45</li>
 <li>Property Merge</li>
+ <li><a href="voronoi_main.htm">Voronoi Main Page 
+</a></li>
+ <li>Voronoi Benchmark 
+ </li>
+ <li>Voronoi Builder</li>
+ <li><a href="voronoi_diagram.htm">Voronoi Diagram 
+</a></li>
+ <li>Voronoi Predicates</li>
+ <li>Voronoi Robust FPT 
+ </li>
+ <li>Voronoi Utils</li>
+
 </ul>
 <h3 class="navbar">Other Resources</h3>
 <ul>
- <li>GTL Boostcon 2009 Paper</li>
- <li><a href="GTL_boostcon_draft03.htm">GTL Boostcon 2009
+ <li>GTL Boostcon 2009 Paper</li>
+ <li><a href="GTL_boostcon_draft03.htm">GTL Boostcon 2009
 Presentation</a></li>
- <li>Performance Analysis</li>
- <li>Layout Versus Schematic Tutorial</li>
- <li>Minkowski Sum Tutorial</li>
- </ul>
+ <li>Performance Analysis</li>
+ <li>Layout Versus Schematic Tutorial</li>
+ <li>Minkowski Sum Tutorial</li>
+ <li>Voronoi Basic Tutorial</li>
+ <li>Voronoi Advanced Tutorial</li>
+</ul>
 </div>
 <h3 class="navbar">Polygon Sponsor</h3>
 <div style="padding: 5px;" align="center">
- <img border="0" src="images/intlogo.gif" width="127" height="51"><a title="www.adobe.com home page" href="http://www.adobe.com/" tabindex="2" style="border: medium none ;">
+ <img src="images/intlogo.gif" border="0" height="51" width="127" /><a title="www.adobe.com home page" href="http://www.adobe.com/" tabindex="2" style="border: medium none ;">
 </a>
 </div>
</td>
@@ -58,20 +71,20 @@



- 
+ 

<h1>Polygon 90 Concept</h1>


-The polygon_90 concept tag is 
+The polygon_90 concept tag is 
polygon_90_concept

To register a user defined type as a model of
polygon_90 concept, specialize the
geometry concept meta-function for that type.  In the example below CPolygon90 is registered as a model of
-polygon_90  concept.
-template <> 
-struct geometry_concept<CPolygon90> { typedef polygon_90_concept type; };
+polygon_90  concept.
+template <> 
+struct geometry_concept<CPolygon90> { typedef polygon_90_concept type; };
The semantic of a polygon_90 is that it can provide
iterators over the x and y coordinates that correspond to its horizontal and
vertical sides, starting with an x coordinate.  A mutable polygon_90 must
@@ -82,40 +95,40 @@
specialization of polygon_90_traits.  A std::vector<int> or std::list<int>
could be made models of polygon_90_concept by simply providing access to their
iterators through traits.  Library functions that create polygon objects
-require that those objects provide a default constructor.
+require that those objects provide a default constructor.
Below is shown the default polygon traits. 
Specialization of these traits is required for types that don't conform to the
default behavior.  Note that these traits are also used by the
-polygon_90_with_holes concept.template <typename
-T> 
-struct polygon_90_traits { 
-     typedef typename T::coordinate_type coordinate_type; 
+polygon_90_with_holes concept.template <typename
+T> 
+struct polygon_90_traits { 
+     typedef typename T::coordinate_type coordinate_type; 
     typedef typename T::compact_iterator_type
-compact_iterator_type; 
+compact_iterator_type; 
     static inline compact_iterator_type begin_compact(const
-T& t) { 
-          return t.begin_compact(); 
-     } 
+T& t) { 
+          return t.begin_compact(); 
+     } 
     static inline compact_iterator_type end_compact(const
-T& t) { 
-          return t.end_compact(); 
-     } 
-     static inline unsigned int size(const T& t) { 
-          return t.size(); 
-     } 
-     static inline winding_direction winding(const T& t) { 
-          return unknown_winding; 
-     } 
+T& t) { 
+          return t.end_compact(); 
+     } 
+     static inline unsigned int size(const T& t) { 
+          return t.size(); 
+     } 
+     static inline winding_direction winding(const T& t) { 
+          return unknown_winding; 
+     } 
};
-template <typename T> 
-struct polygon_90_mutable_traits { 
-     template <typename iT> 
+template <typename T> 
+struct polygon_90_mutable_traits { 
+     template <typename iT> 
     static inline T& set_compact(T& t, iT input_begin, iT
-input_end) { 
+input_end) { 
          t.set_compact(input_begin,
-input_end); 
-          return t; 
-     } 
+input_end); 
+          return t; 
+     } 
};
An object that is a model of 
polygon_90_concept can be viewed as a model of any of its
@@ -127,30 +140,30 @@
passed into any interface that expects an object of the conceptual type
specified in its template parameter.
<h2>Functions</h2>
-<table border="1" width="100%" id="table1">
- <tr>
- <td width="586">template <typename T> 
+<table id="table1" border="1" width="100%">
+ <tbody><tr>
+ <td width="586">template <typename T> 
 compact_iterator_type begin_compact(const T& polygon)</td>
 <td>Expects a model of polygon_90. 
 Returns the begin iterator over the range of coordinates that correspond
 to horizontal and vertical edges.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 compact_iterator_type end_compact(const T& polygon)</td>
 <td>Expects a model of polygon_90. 
 Returns the end iterator over the range of coordinates that correspond
 to horizontal and vertical edges.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 point_iterator_type begin_points(const T& polygon)</td>
 <td>Expects a model of polygon_90. 
 Returns the begin iterator over the range of points that correspond to
 vertices of the polygon.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 point_iterator_type end_points(const T& polygon)</td>
 <td>Expects a model of polygon_90. 
 Returns the end iterator over the range of points that correspond to
@@ -158,7 +171,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T, typename
- iterator> 
+ iterator> 
 void set_compact(T& polygon, iterator b, iterator e)</td>
 <td>Expects a model of polygon_90.  
 Sets the polygon to the coordinate data range [b,e) that corresponds to
@@ -166,7 +179,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T, typename
- iterator> 
+ iterator> 
 void set_points(T& polygon, iterator b, iterator e)</td>
 <td>Expects a model of polygon_90.  
 Sets the polygon to the point data range [b,e) that corresponds to
@@ -174,22 +187,22 @@
 successive input points results in undefined behavior.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 unsigned int size(const T& polygon)</td>
 <td>Returns the number of edges in the
 polygon.</td>
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& assign(T1& left, const T2& right)</td>
 <td>Copies data from right object that models polygon_90 into left object
 that models polygon_90.</td>
 </tr>
 <tr>
 <td width="586">template <typename T,
- typename point_type> 
- bool contains(const T&, const point_type& point, 
+ typename point_type> 
+ bool contains(const T&, const point_type& point, 
             
 bool consider_touch=true)</td>
 <td>Given an object that models polygon_90 and an object that models
@@ -199,85 +212,84 @@
 the polygon.  Linear wrt. vertices.</td>
 </tr>
 <tr>
- <td width="586">// get the center coordinate 
- template <typename T, typename point_type> 
+ <td width="586">// get the center coordinate 
+ template <typename T, typename point_type> 
 void center(point_type& p, const T& polygon)</td>
 <td>Sets object that models point to the center point of the bounding
 box of an object that models polygon_90.  Linear wrt. vertices.</td>
 </tr>
 <tr>
 <td width="586">template <typename T,
- typename rectangle_type> 
+ typename rectangle_type> 
 bool extents(rectangle_type& bbox, const T& polygon)</td>
 <td>Sets object that models rectangle to the bounding box of an object
 that models polygon_90 and returns true.  Returns false and leaves
 bbox unchanged if polygon is empty.  Linear wrt. vertices.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 manhattan_area_type area(const T& polygon)</td>
 <td>Returns the area of an object
 that models polygon_90.  Linear wrt. vertices.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 direction_1d winding(const T& polygon)</td>
 <td>Returns the winding direction of an object
 that models polygon_90, LOW == CLOCKWISE, HIGH = COUNTERCLOCKWISE. 
 Complexity depends upon winding trait.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 coordinate_difference perimeter(const T& polygon)</td>
 <td>Returns the perimeter length of an object
 that models polygon_90.  Linear wrt. vertices.</td>
 </tr>
 <tr>
 <td width="586">template <typename T,
- typename transform_type> 
+ typename transform_type> 
 T& transform(T& polygon, const transform_type&)</td>
 <td>Applies transform() on the vertices of polygon and sets the polygon to that described by the result of
 transforming its vertices.  Linear wrt. vertices.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 T& scale_up(T& polygon, unsigned_area_type factor)</td>
 <td>Scales up coordinate of an object that models
 polygon_90 by unsigned factor.  Linear wrt. vertices.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 T& scale_down(T& polygon, unsigned_area_type factor)</td>
 <td>Scales down coordinates of an object that models
 polygon_90 by unsigned factor.  Linear wrt. vertices.</td>
 </tr>
 <tr>
- <td width="586">template <typename T, scaling_type> 
+ <td width="586">template <typename T, scaling_type> 
 T& scale(T& rectangle, double scaling) </td>
 <td>Scales coordinates of an object that models polygon_90 by floating
 point factor.  Linear wrt. vertices.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
- T& move(T& polygon, orientation_2d, 
+ <td width="586">template <typename T> 
+ T& move(T& polygon, orientation_2d, 
        coordinate_difference displacement)</td>
 <td>Adds displacement value to coordinate indicated by orientation_2d of
 vertices of an object that models polygon_90 .  Linear wrt.
 vertices.</td>
 </tr>
 <tr>
- <td width="586">template <typename polygon_type, typename point_type> 
- polygon_type& convolve(polygon_type& polygon, 
-                      
- const point_type& point)</td>
+ <td width="586">template <typename polygon_type, typename point_type> 
+ polygon_type& convolve(polygon_type& polygon,                       
+const point_type& point)</td>
 <td>Convolves coordinate values of point with vertices of an
 object that models polygon_90.  Linear wrt. vertices.</td>
 </tr>
- </table>
+ </tbody></table>
 <h1>Polygon 90 Data</h1>


-The library provides a model of polygon 90 concept declared
+The library provides a model of polygon 90 concept declared

template<typename T> polygon_90_data where T is the coordinate type.
This data type is used internally when a Manhattan polygon is needed and is
@@ -285,8 +297,8 @@
data type instead of providing their own.  The data type is implemented to
be convenient to use with the library traits.
<h2>Members</h2>
-<table border="1" width="100%" id="table2">
- <tr>
+<table id="table2" border="1" width="100%">
+ <tbody><tr>
 <td width="586">geometry_type</td>
 <td>polygon_90_concept</td>
 </tr>
@@ -321,7 +333,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T2> 
- polygon_90_data& operator=(const T2& that) const</td>
+ polygon_90_data& operator=(const T2& that) const</td>
 <td>Assign from an object that is a model of polygon 90.</td>
 </tr>
 <tr>
@@ -353,31 +365,31 @@
 </tr>
 <tr>
 <td width="586">template <typename iT> 
- void set(iT begin_points, iT end_points)</td>
+ void set(iT begin_points, iT end_points)</td>
 <td>Sets the polygon to the iterator range of points.  No check is
 performed to ensure the points describe a Manhattan figure, every other
 x and y value of the points is used to initialize the polygon.</td>
 </tr>
 <tr>
 <td width="586">template <typename iT> 
- void set_compact(iT begin_coords, iT end_coords)</td>
+ void set_compact(iT begin_coords, iT end_coords)</td>
 <td>Sets the polygon to the iterator range of coordinates.  These
 coordinates correspond to the x values of vertical edges and y values of
 horizontal edges.  It is expected that the sequence start with an x
 value and proceed x then y then x then y.</td>
 </tr>
-</table>
- <tr>
+</tbody></table>
+ </td></tr><tr>
<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" rules="none" frame="void" id="table3">
+<table class="docinfo" id="table3" frame="void" rules="none">
 <colgroup>
- <col class="docinfo-name"><col class="docinfo-content">
+ <col class="docinfo-name" /><col class="docinfo-content" />
 </colgroup>
- <tbody vAlign="top">
+ <tbody valign="top">
 <tr>
 <th class="docinfo-name">Copyright:</th>
 <td>Copyright © Intel Corporation 2008-2010.</td>
@@ -390,6 +402,6 @@
 <a class="reference" target="_top" href="http://www.boost.org/LICENSE_1_0.txt">
 http://www.boost.org/LICENSE_1_0.txt>)</td>
 </tr>
-</table>
+</tbody></table>

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

Modified: sandbox/gtl/doc/gtl_polygon_90_set_concept.htm
==============================================================================
--- sandbox/gtl/doc/gtl_polygon_90_set_concept.htm (original)
+++ sandbox/gtl/doc/gtl_polygon_90_set_concept.htm 2012-04-09 15:10:32 EDT (Mon, 09 Apr 2012)
@@ -1,15 +1,14 @@
<!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" 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"><head>
-<title>Boost Polygon Library: Polygon 90 Set Concept</title>
- <meta http-equiv="content-type" content="text/html;charset=ISO-8859-1">
- 
-<table style="margin: 0pt; padding: 0pt; width: 100%;" border="0" cellpadding="0" cellspacing="0"><tbody><tr>
+--><title>Boost Polygon Library: Polygon 90 Set 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">
- <img border="0" src="images/boost.png" width="277" height="86"><a title="www.boost.org home page" href="http://www.boost.org/" tabindex="2" style="border: medium none ;">
+ <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;">
@@ -37,20 +36,34 @@
 <li>Property Merge 90</li>
 <li>Property Merge 45</li>
 <li>Property Merge</li>
+ <li><a href="voronoi_main.htm">Voronoi Main Page 
+</a></li>
+ <li>Voronoi Benchmark 
+ </li>
+ <li>Voronoi Builder</li>
+ <li><a href="voronoi_diagram.htm">Voronoi Diagram 
+</a></li>
+ <li>Voronoi Predicates</li>
+ <li>Voronoi Robust FPT 
+ </li>
+ <li>Voronoi Utils</li>
+
 </ul>
 <h3 class="navbar">Other Resources</h3>
 <ul>
- <li>GTL Boostcon 2009 Paper</li>
- <li><a href="GTL_boostcon_draft03.htm">GTL Boostcon 2009
+ <li>GTL Boostcon 2009 Paper</li>
+ <li><a href="GTL_boostcon_draft03.htm">GTL Boostcon 2009
 Presentation</a></li>
- <li>Performance Analysis</li>
- <li>Layout Versus Schematic Tutorial</li>
- <li>Minkowski Sum Tutorial</li>
- </ul>
+ <li>Performance Analysis</li>
+ <li>Layout Versus Schematic Tutorial</li>
+ <li>Minkowski Sum Tutorial</li>
+ <li>Voronoi Basic Tutorial</li>
+ <li>Voronoi Advanced Tutorial</li>
+</ul>
 </div>
 <h3 class="navbar">Polygon Sponsor</h3>
 <div style="padding: 5px;" align="center">
- <img border="0" src="images/intlogo.gif" width="127" height="51"><a title="www.adobe.com home page" href="http://www.adobe.com/" tabindex="2" style="border: medium none ;">
+ <img src="images/intlogo.gif" border="0" height="51" width="127" /><a title="www.adobe.com home page" href="http://www.adobe.com/" tabindex="2" style="border: medium none ;">
 </a>
 </div>
</td>
@@ -58,16 +71,16 @@



- 
+ 

<h1>Polygon 90 Set Concept</h1>


-The polygon_90_set concept tag is 
+The polygon_90_set concept tag is 
polygon_90_set_concept

The semantic of a polygon_90_set is zero or more
-Manhattan geometry regions.
+Manhattan geometry regions.
The motivation for providing the
polygon_90_set_concept is that it is a very common special case of planar
geometry which afford the implementation of a variety of optimizations on the
@@ -75,7 +88,7 @@
polygon_90_set_concept can be 100X faster than arbitrary angle polygon
manipulation.  Because the performance benefits are so large and the
special case is important enough, the library provides these performance
-benefits for those application domains that require them.Users are recommended to use std::vector and std::list of user defined polygons
+benefits for those application domains that require them.Users are recommended to use std::vector and std::list of user defined polygons
or library provided polygon_90_set_data<coordinate_type> objects.  Lists
and vectors of models of polygon_90_concept or polygon_90_with_holes_concept or
rectangle_concept are automatically models of polygon_90_set_concept.
@@ -87,10 +100,10 @@
eliminate temp copies of intermediate results when Boolean operators are chained
together.
Operators are declared inside the namespace boost::polygon::operators.
-<table border="1" width="100%" id="table3">
- <tr>
+<table id="table3" border="1" width="100%">
+ <tbody><tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 polygon_90_set_view operator|(const T1& l, const T2& r)</td>
 <td>Boolean OR operation (polygon set union).  Accepts two objects
 that model polygon_90_set or one of its refinements.  Returns an
@@ -100,7 +113,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 polygon_90_set_view operator+(const T1& l, const T2& r)</td>
 <td>Same as operator|.  The plus sign is also used for OR
 operations in Boolean logic expressions.  O( n log n) runtime
@@ -108,7 +121,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 polygon_90_set_view operator&(const T1& l, const T2& r)</td>
 <td>Boolean AND operation (polygon set intersection).  Accepts two
 objects that model polygon_90_set or one of its refinements.  O( n
@@ -116,7 +129,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 polygon_90_set_view operator*(const T1& l, const T2& r)</td>
 <td>Same as operator&.  The multiplication symbol is also used for
 AND operations in Boolean logic expressions.  O( n log n) runtime
@@ -124,7 +137,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 polygon_90_set_view operator^(const T1& l, const T2& r)</td>
 <td>Boolean XOR operation (polygon set disjoint-union).  Accepts
 two objects that model polygon_90_set or one of its refinements. 
@@ -134,7 +147,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 polygon_90_set_view operator-(const T1& l, const T2& r)</td>
 <td>Boolean SUBTRACT operation (polygon set difference).  Accepts
 two objects that model polygon_90_set or one of its refinements. 
@@ -143,7 +156,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& operator|=(const T1& l, const T2& r)</td>
 <td>Same as operator|, but with self assignment, left operand must model
 polygon_90_set and not one of it's refinements.  O( n log n)
@@ -151,7 +164,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& operator+=(T1& l, const T2& r)</td>
 <td>Same as operator+, but with self assignment, left operand must model
 polygon_90_set and not one of it's refinements.  O( n log n)
@@ -159,7 +172,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& operator&=(const T1& l, const T2& r)</td>
 <td>Same as operator&, but with self assignment, left operand must model
 polygon_90_set and not one of it's refinements.  O( n log n)
@@ -167,7 +180,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& operator*=(T1& l, const T2& r)</td>
 <td>Same as operator*, but with self assignment, left operand must model
 polygon_90_set and not one of it's refinements.  O( n log n)
@@ -175,7 +188,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& operator^=(const T1& l, const T2& r)</td>
 <td>Same as operator^, but with self assignment, left operand must model
 polygon_90_set and not one of it's refinements.  O( n log n)
@@ -183,14 +196,14 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& operator-=(T1& l, const T2& r)</td>
 <td>Same as operator-, but with self assignment, left operand must model
 polygon_90_set and not one of it's refinements.  O( n log n)
 runtime complexity and O(n) memory wrt vertices + intersections.</td>
 </tr>
 <tr>
- <td width="586">template <typename T1> 
+ <td width="586">template <typename T1> 
 T1 operator+(const T1&, coordinate_type bloating)</td>
 <td>Performs resize operation, inflating by bloating ammount.  If
 negative the result is a shrink instead of bloat.  Note: returns
@@ -199,7 +212,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1 operator-(const T1&, coordinate_type shrinking)</td>
 <td>Performs resize operation, deflating by bloating ammount.  If
 negative the result is a bloat instead of shrink.  Note: returns
@@ -208,7 +221,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& operator+=(const T1&, coordinate_type bloating)</td>
 <td>Performs resize operation, inflating by bloating ammount.  If
 negative the result is a shrink instead of bloat.  Returns
@@ -217,19 +230,19 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& operator-=(const T1&, coordinate_type shrinking)</td>
 <td>Performs resize operation, deflating by bloating ammount.  If
 negative the result is a bloat instead of shrink.  Returns
 reference to modified argument.  O( n log n) runtime complexity and
 O(n) memory wrt vertices + intersections.</td>
 </tr>
- </table>
+ </tbody></table>
<h2>Functions</h2>
-<table border="1" width="100%" id="table1">
- <tr>
+<table id="table1" border="1" width="100%">
+ <tbody><tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& assign(T1& lvalue, const T2& rvalue)</td>
 <td>Eliminates overlaps in geometry and copies from an object that
 models polygon_90_set or any of its refinements into an object that
@@ -238,7 +251,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 bool equivalence(const T1& lvalue, const T2& rvalue) </td>
 <td>Returns true if an object that models polygon_90_set or one of its
 refinements covers the exact same geometric regions as another object
@@ -248,8 +261,8 @@
 </tr>
 <tr>
 <td width="586">template <typename
- output_container_type, typename T> 
- void get_rectangles(output_container_type& output, 
+ output_container_type, typename T> 
+ void get_rectangles(output_container_type& output, 
                   
 const T& polygon_set)</td>
 <td>Output container is expected to be a standard container. 
@@ -260,10 +273,9 @@
 </tr>
 <tr>
 <td width="586">template <typename
- output_container_type, typename T> 
- void get_max_rectangles(output_container_type& output, 
-                       
- const T& polygon_set)</td>
+ output_container_type, typename T> 
+ void get_max_rectangles(output_container_type& output,                        
+const T& polygon_set)</td>
 <td>Output container is expected to be a standard container.  Given
 an object that models polygon_90_set or one of its refinements finds all
 overlapping rectangles that are maximal in area and appends them to the
@@ -271,13 +283,13 @@
 </tr>
 <tr>
 <td width="586">template <typename
- polygon_set_type> 
+ polygon_set_type> 
 void clear(polygon_set_type& polygon_set)</td>
 <td>Makes the object empty of geometry.</td>
 </tr>
 <tr>
 <td width="586">template <typename
- polygon_set_type> 
+ polygon_set_type> 
 bool empty(const polygon_set_type& polygon_set)</td>
 <td>Checks whether the object is empty of geometry.  Polygons that
 are completely covered by holes will result in empty returning true. 
@@ -286,8 +298,8 @@
 </tr>
 <tr>
 <td width="586">template <typename T, typename
- rectangle_type> 
- bool extents(rectangle_type& extents_rectangle, 
+ rectangle_type> 
+ bool extents(rectangle_type& extents_rectangle, 
             const
 T& polygon_set)</td>
 <td>Computes bounding box of an object that models polygon_90_set and
@@ -297,7 +309,7 @@
 runtime complexity and O(n) memory wrt vertices + intersections. </td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 manhattan_area_type area(const T& polygon_set)</td>
 <td>Computes the area covered by geometry in an object that models
 polygon_90_set.  O( n log n) runtime complexity and O(n) memory wrt
@@ -305,7 +317,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& interact(T1& a, const T2& b)</td>
 <td>Given an object that models polygon_90_set and an object that models
 polygon_90_set or one of its refinements, modifies a to retain only
@@ -313,7 +325,7 @@
 complexity and O(n) memory wrt vertices + intersections. </td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 T& self_intersect(T& polygon_set)</td>
 <td>Given an object that models polygon_90_set that has self overlapping
 regions, modifies the argument to contain only the regions of overlap. 
@@ -321,7 +333,7 @@
 intersections. </td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 T& self_xor(T& polygon_set)</td>
 <td>Given an object that models polygon_90_set that has self overlapping
 regions, modifies the argument to contain only the regions that do not
@@ -329,24 +341,24 @@
 vertices + intersections. </td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 T& bloat(T& polygon_set, unsigned_area_type bloating)</td>
 <td>Same as getting all the rectangles, bloating them and putting them
 back.  O( n log n) runtime complexity and O(n) memory wrt vertices
 + intersections. </td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
- T& bloat(T& polygon_set, orientation_2d orient, 
+ <td width="586">template <typename T> 
+ T& bloat(T& polygon_set, orientation_2d orient, 
         unsigned_area_type bloating)</td>
 <td>Same as getting all the rectangles, bloating them and putting them
 back.  O( n log n) runtime complexity and O(n) memory wrt vertices
 + intersections. </td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
- T& bloat(T& polygon_set, orientation_2d orient, 
-         unsigned_area_type low_bloating, 
+ <td width="586">template <typename T> 
+ T& bloat(T& polygon_set, orientation_2d orient, 
+         unsigned_area_type low_bloating, 
         unsigned_area_type
 high_bloating)</td>
 <td>Same as getting all the rectangles, bloating them and putting them
@@ -354,22 +366,22 @@
 + intersections. </td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
- T& bloat(T& polygon_set, direction_2d dir, 
+ <td width="586">template <typename T> 
+ T& bloat(T& polygon_set, direction_2d dir, 
         unsigned_area_type bloating)</td>
 <td>Same as getting all the rectangles, bloating them and putting them
 back.  O( n log n) runtime complexity and O(n) memory wrt vertices
 + intersections. </td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
- T& bloat(T& polygon_set, 
+ <td width="586">template <typename T> 
+ T& bloat(T& polygon_set, 
         unsigned_area_type
- west_bloating, 
+ west_bloating, 
         unsigned_area_type
- east_bloating, 
+ east_bloating, 
         unsigned_area_type
- south_bloating, 
+ south_bloating, 
         unsigned_area_type
 north_bloating)</td>
 <td>Same as getting all the rectangles, bloating them and putting them
@@ -377,15 +389,15 @@
 + intersections. </td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 T& shrink(T& polygon_set, unsigned_area_type shrinking)</td>
 <td>Same as getting all the rectangles of the inverse, bloating them and overwriting
 the polygon set with the resulting regions then negating.  O( n log
 n) runtime complexity and O(n) memory wrt vertices + intersections. </td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
- T& shrink(T& polygon_set, orientation_2d orient, 
+ <td width="586">template <typename T> 
+ T& shrink(T& polygon_set, orientation_2d orient, 
          unsigned_area_type
 shrinking)</td>
 <td>Same as getting all the rectangles of the inverse, bloating them and overwriting
@@ -393,10 +405,10 @@
 n) runtime complexity and O(n) memory wrt vertices + intersections. </td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
- T& shrink(T& polygon_set, orientation_2d orient, 
+ <td width="586">template <typename T> 
+ T& shrink(T& polygon_set, orientation_2d orient, 
          unsigned_area_type
- low_shrinking, 
+ low_shrinking, 
          unsigned_area_type
 high_shrinking)</td>
 <td>Same as getting all the rectangles of the inverse, bloating them and overwriting
@@ -404,8 +416,8 @@
 n) runtime complexity and O(n) memory wrt vertices + intersections. </td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
- T& shrink(T& polygon_set, direction_2d dir, 
+ <td width="586">template <typename T> 
+ T& shrink(T& polygon_set, direction_2d dir, 
          unsigned_area_type
 shrinking)</td>
 <td>Same as getting all the rectangles of the inverse, bloating them and overwriting
@@ -413,14 +425,14 @@
 n) runtime complexity and O(n) memory wrt vertices + intersections. </td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
- T& shrink(T& polygon_set, 
+ <td width="586">template <typename T> 
+ T& shrink(T& polygon_set, 
          unsigned_area_type
- west_shrinking, 
+ west_shrinking, 
          unsigned_area_type
- east_shrinking, 
+ east_shrinking, 
          unsigned_area_type
- south_shrinking, 
+ south_shrinking, 
          unsigned_area_type
 north_shrinking)</td>
 <td>Same as getting all the rectangles of the inverse, bloating them and overwriting
@@ -429,23 +441,23 @@
 </tr>
 <tr>
 <td width="586">template <typename T, typename
- coord_type> 
+ coord_type> 
 T& resize(T& polygon_set, coord_type resizing)</td>
 <td>Same as bloat if resizing is positive, same as shrink if resizing is
 negative.</td>
 </tr>
 <tr>
 <td width="586">template <typename T, typename
- coord_type> 
- T& resize(polygon_set_type& polygon_set, 
+ coord_type> 
+ T& resize(polygon_set_type& polygon_set, 
          coord_type west, coord_type east,
-           coord_type south, coord_type north)</td>
+           coord_type south, coord_type north)</td>
 <td>Same as bloat if resizing is positive, same as shrink if resizing is
 negative.  O( n log n) runtime complexity and O(n) memory wrt
 vertices + intersections. </td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
T& grow_and(T& polygon_set, unsigned_area_type bloating)</td>
 <td>Same as bloating non-overlapping regions and then applying self
 intersect to retain only the overlaps introduced by the bloat.  O(
@@ -453,8 +465,8 @@
 intersections. </td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
-T& grow_and(T& polygon_set, orientation_2d orient, 
+ <td width="586">template <typename T> 
+T& grow_and(T& polygon_set, orientation_2d orient, 
           
unsigned_area_type bloating)</td>
 <td>Same as bloating non-overlapping regions and then applying self
@@ -463,10 +475,10 @@
 intersections. </td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
-T& grow_and(T& polygon_set, orientation_2d orient, 
+ <td width="586">template <typename T> 
+T& grow_and(T& polygon_set, orientation_2d orient, 
           
-unsigned_area_type low_bloating, 
+unsigned_area_type low_bloating, 
           
unsigned_area_type high_bloating)</td>
 <td>Same as bloating non-overlapping regions and then applying self
@@ -475,8 +487,8 @@
 intersections. </td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
-T& grow_and(T& polygon_set, direction_2d dir, 
+ <td width="586">template <typename T> 
+T& grow_and(T& polygon_set, direction_2d dir, 
           
unsigned_area_type bloating)</td>
 <td>Same as bloating non-overlapping regions and then applying self
@@ -485,14 +497,14 @@
 intersections. </td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
-T& grow_and(T& polygon_set, 
+ <td width="586">template <typename T> 
+T& grow_and(T& polygon_set, 
           
-unsigned_area_type west_bloating, 
+unsigned_area_type west_bloating, 
           
-unsigned_area_type east_bloating, 
+unsigned_area_type east_bloating, 
           
-unsigned_area_type south_bloating, 
+unsigned_area_type south_bloating, 
           
unsigned_area_type north_bloating)</td>
 <td>Same as bloating non-overlapping regions and then applying self
@@ -501,28 +513,28 @@
 intersections. </td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
T& scale_up(T& polygon_set, unsigned_area_type factor)</td>
 <td>Scales geometry up by unsigned factor.  O( n log n) runtime
 complexity and O(n) memory wrt vertices + intersections. </td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
T& scale_down(T& polygon_set, unsigned_area_type factor)</td>
 <td>Scales geometry down by unsigned factor.  O( n log n) runtime
 complexity and O(n) memory wrt vertices + intersections. </td>
 </tr>
 <tr>
- <td width="586">template <typename T, typename scaling_type> 
-T& scale(polygon_set_type& polygon_set, 
+ <td width="586">template <typename T, typename scaling_type> 
+T& scale(polygon_set_type& polygon_set, 
         const scaling_type& scaling)</td>
 <td>Scales geometry by applying scaling.scale() on all vertices. 
 O( n log n) runtime complexity and O(n) memory wrt vertices +
 intersections. </td>
 </tr>
 <tr>
- <td width="586">template <typename T, typename coord_type> 
-T& move(T& polygon_set, 
+ <td width="586">template <typename T, typename coord_type> 
+T& move(T& polygon_set, 
        orientation_2d orient, coord_type
displacement)</td>
 <td>Moves geometry by displacement amount in the orientation.   
@@ -530,40 +542,40 @@
 intersections. </td>
 </tr>
 <tr>
- <td width="586">template <typename T, typename coord_type> 
-T& move(T& polygon_set, coord_type x_displacement, 
+ <td width="586">template <typename T, typename coord_type> 
+T& move(T& polygon_set, coord_type x_displacement, 
        coord_type y_displacement)</td>
 <td>Moves the geometry by x_dispacement in x and y_displacement in y. 
 Note: for consistency should be convolve(polygon_set, point).  O( n
 log n) runtime complexity and O(n) memory wrt vertices + intersections. </td>
 </tr>
 <tr>
- <td width="586">template <typename T, typename transformation_type> 
-T& transform(T& polygon_set, 
+ <td width="586">template <typename T, typename transformation_type> 
+T& transform(T& polygon_set, 
             const
transformation_type& transformation)</td>
 <td>Applies transformation.transform() on all vertices.  O( n log
 n) runtime complexity and O(n) memory wrt vertices + intersections. </td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
-T& keep(T& polygon_set, 
-        unsigned_area_type min_area, 
-        unsigned_area_type max_area, 
-        unsigned_area_type min_width, 
-        unsigned_area_type max_width, 
-        unsigned_area_type min_height, 
+ <td width="586">template <typename T> 
+T& keep(T& polygon_set, 
+        unsigned_area_type min_area, 
+        unsigned_area_type max_area, 
+        unsigned_area_type min_width, 
+        unsigned_area_type max_width, 
+        unsigned_area_type min_height, 
        unsigned_area_type max_height)</td>
 <td>Retains only regions that satisfy the min/max criteria in the
 argument list.  Note: useful for visualization to cull too small
 polygons.  O( n log n) runtime complexity and O(n) memory wrt
 vertices + intersections. </td>
 </tr>
- </table>
+ </tbody></table>
 <h1>Polygon 90 Set Data Object</h1>


-The polygon 90 set data type encapsulates the internal data format that
+The polygon 90 set data type encapsulates the internal data format that
serves as the input to the sweep-line algorithm that implements polygon-clipping
boolean operations.  It also internally keeps track of whether that data
has been sorted or scanned and maintains the invariant that when its flags
@@ -574,15 +586,15 @@
maintain the data is sorted form rather than going all the way out to polygons
then resorting those vertices for a subsequent operation.
The declaration of Polygon 90 Set Data is the following:
-template <typename T> 
+template <typename T> 
class polygon_90_set_data;
The class is parameterized on the coordinate data type.  Algorithms that
benefit from knowledge of the invariants enforced by the class are implemented
as member functions to provide them access to information about those
invariants.  
<h2>Member Functions</h2>
-<table border="1" width="100%" id="table2">
- <tr>
+<table id="table2" border="1" width="100%">
+ <tbody><tr>
 <td width="586">polygon_90_set_data()</td>
 <td>Default constructor.  Scanning orientation defaults to
 HORIZONTAL</td>
@@ -593,9 +605,9 @@
 <td>Construct with scanning orientation.</td>
 </tr>
 <tr>
- <td width="586">template <typename iT> 
- polygon_90_set_data(orientation_2d orient,                     iT input_begin, iT
- input_end)</td>
+ <td width="586">template <typename iT> 
+ polygon_90_set_data(orientation_2d orient,                    
+iT input_begin, iT input_end)</td>
 <td>Construct with scanning orientation from an iterator range of
 insertable objects.</td>
 </tr>
@@ -606,7 +618,7 @@
 </tr>
 <tr>
 <td width="586">
-template <typename l, typename r, typename op> 
+template <typename l, typename r, typename op> 
polygon_90_set_data(const polygon_90_set_view<l,r,op>&
t)</td>
 <td>Copy construct from a Boolean operator template.</td>
@@ -614,33 +626,33 @@
 <tr>
 <td width="586">

-polygon_90_set_data(orientation_2d orient,                     const polygon_90_set_data&
-that)</td>
+polygon_90_set_data(orientation_2d orient,                    
+const polygon_90_set_data& that)</td>
 <td>Construct with scanning orientation and copy from another polygon
 set.</td>
 </tr>
 <tr>
 <td width="586">
-polygon_90_set_data& operator=(const polygon_90_set_data& that)</td>
+polygon_90_set_data& operator=(const polygon_90_set_data& that)</td>
 <td>Assignment from another polygon set, may change scanning
 orientation.</td>
 </tr>
 <tr>
 <td width="586">
-template <typename l, typename r, typename op> 
-polygon_90_set_data& operator=(const polygon_90_set_view<l, r,
+template <typename l, typename r, typename op> 
+polygon_90_set_data& operator=(const polygon_90_set_view<l, r,
op>& that)</td>
 <td>Assignment from a Boolean operator template.</td>
 </tr>
 <tr>
- <td width="586">template <typename geometry_object> 
+ <td width="586">template <typename geometry_object> 
polygon_90_set_data& operator=(const geometry_object& geo)</td>
 <td>Assignment from an insertable object.</td>
 </tr>
 <tr>
 <td width="586">

-template <typename iT> 
+template <typename iT> 
void insert(iT input_begin, iT input_end)</td>
 <td>Insert objects of an iterator range.  Linear wrt. inserted
 vertices.</td>
@@ -654,8 +666,8 @@
 <tr>
 <td width="586">

-template <typename geometry_type> 
-void insert(const geometry_type& geometry_object,             bool is_hole
+template <typename geometry_type> 
+void insert(const geometry_type& geometry_object,             bool is_hole
= false)</td>
 <td>Insert a geometry object, if is_hole is true then the inserted
 region is subtractive rather than additive.  Linear wrt. inserted
@@ -663,7 +675,7 @@
 </tr>
 <tr>
 <td width="586">
-template <typename output_container> 
+template <typename output_container> 
void get(output_container& output) const</td>
 <td>Expects a standard container of geometry objects.  Will scan
 and eliminate overlaps.  Converts polygon set geometry to objects
@@ -676,7 +688,7 @@
 </tr>
 <tr>
 <td width="586">
-template <typename output_container> 
+template <typename output_container> 
void get_polygons(output_container& output) const</td>
 <td>Expects a standard container of polygon objects.  Will scan and
 eliminate overlaps.  Converts polygon set geometry to polygons and
@@ -687,7 +699,7 @@
 </tr>
 <tr>
 <td width="586">
-template <typename output_container> 
+template <typename output_container> 
void get_rectangles(output_container& output) const</td>
 <td>Expects a standard container of rectangle objects.  Will scan
 and eliminate overlaps.  Slices polygon set geometry to rectangles
@@ -698,8 +710,8 @@
 <tr>
 <td width="586">

-template <typename output_container> 
-void get_rectangles(output_container& output,   orientation_2d
+template <typename output_container> 
+void get_rectangles(output_container& output,   orientation_2d
slicing_orientation) const 
 </td>
 <td>Expects a standard container of rectangle objects.  Will scan
@@ -752,9 +764,9 @@
 </tr>
 <tr>
 <td width="586">
-template <typename input_iterator_type> 
-void set(input_iterator_type input_begin,          input_iterator_type input_end,
-          orientation_2d orient) 
+template <typename input_iterator_type> 
+void set(input_iterator_type input_begin,          input_iterator_type input_end,
+          orientation_2d orient) 
 </td>
 <td>Overwrite geometry in polygon set with insertable objects in the
 iterator range.  Also sets the scanning orientation to that
@@ -762,7 +774,7 @@
 </tr>
 <tr>
 <td width="586">
-template <typename rectangle_type> 
+template <typename rectangle_type> 
bool extents(rectangle_type& extents_rectangle) const</td>
 <td>Given an object that models rectangle, scans and eliminates overlaps
 in the polygon set because subtractive regions may alter its extents
@@ -772,12 +784,12 @@
 </tr>
 <tr>
 <td width="586">
-polygon_90_set_data& 
-bloat(unsigned_area_type west_bloating, 
+polygon_90_set_data& 
+bloat(unsigned_area_type west_bloating, 
     
-unsigned_area_type east_bloating, 
+unsigned_area_type east_bloating, 
     
-unsigned_area_type south_bloating, 
+unsigned_area_type south_bloating, 
     
unsigned_area_type north_bloating) </td>
 <td>Scans to eliminate overlaps and subtractive regions.  Inserts
@@ -788,12 +800,12 @@
 </tr>
 <tr>
 <td width="586">
-polygon_90_set_data& 
-shrink(unsigned_area_type west_shrinking, 
+polygon_90_set_data& 
+shrink(unsigned_area_type west_shrinking, 
      
-unsigned_area_type east_shrinking, 
+unsigned_area_type east_shrinking, 
      
-unsigned_area_type south_shrinking, 
+unsigned_area_type south_shrinking, 
      
unsigned_area_type north_shrinking)</td>
 <td>Scans to eliminate overlaps and subtractive regions.  Inserts
@@ -806,24 +818,24 @@
 </tr>
 <tr>
 <td width="586">
-polygon_90_set_data& 
-resize(coordinate_type west, coordinate_type east,        coordinate_type south, coordinate_type north)</td>
+polygon_90_set_data& 
+resize(coordinate_type west, coordinate_type east,        coordinate_type south, coordinate_type north)</td>
 <td>Call bloat or shrink or shrink then bloat depending on whether the
 resizing values are positive or negative.  O( n log n) runtime
 complexity and O(n) memory wrt vertices + intersections.</td>
 </tr>
 <tr>
 <td width="586">
-polygon_90_set_data& move(coordinate_type x_delta,                           coordinate_type
-y_delta) 
+polygon_90_set_data& move(coordinate_type x_delta,                          
+coordinate_type y_delta) 
 </td>
 <td>Add x_delta to x values and y_delta to y values of vertices stored
 within the polygon set.  Linear wrt. vertices.</td>
 </tr>
 <tr>
 <td width="586">
-template <typename transformation_type> 
-polygon_90_set_data& transform(const transformation_type& transformation) 
+template <typename transformation_type> 
+polygon_90_set_data& transform(const transformation_type& transformation) 
 </td>
 <td>Applies transformation.transform() on vertices stored within the
 polygon set.  Linear wrt. vertices.</td>
@@ -837,14 +849,14 @@
 <tr>
 <td width="586">
polygon_90_set_data& scale_down(unsigned_area_type
-factor) </td>
+factor) </td>
 <td>Scales vertices stored within the polygon set down by factor. 
 Linear wrt. vertices.</td>
 </tr>
 <tr>
 <td width="586">
-template <typename scaling_type> 
-polygon_90_set_data& scale(const anisotropic_scale_factor<scaling_type>&
+template <typename scaling_type> 
+polygon_90_set_data& scale(const anisotropic_scale_factor<scaling_type>&
 f)</td>
 <td>Scales vertices stored within the polygon set by applying f.scale(). 
 Linear wrt. vertices.</td>
@@ -867,23 +879,23 @@
 intersections.</td>
 </tr>
 <tr>
- <td width="586">polygon_90_set_data& interact(const polygon_90_set_data& that)</td>
+ <td width="586">polygon_90_set_data& interact(const polygon_90_set_data& that)</td>
 <td>Retain only regions that touch or overlap regions in argument. 
 O( n log n) runtime complexity and O(n) memory wrt vertices +
 intersections.</td>
 </tr>
- </table>
- <tr>
+ </tbody></table>
+ </td></tr><tr>
<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" rules="none" frame="void" id="table4">
+<table class="docinfo" id="table4" frame="void" rules="none">
 <colgroup>
- <col class="docinfo-name"><col class="docinfo-content">
+ <col class="docinfo-name" /><col class="docinfo-content" />
 </colgroup>
- <tbody vAlign="top">
+ <tbody valign="top">
 <tr>
 <th class="docinfo-name">Copyright:</th>
 <td>Copyright © Intel Corporation 2008-2010.</td>
@@ -896,6 +908,6 @@
 <a class="reference" target="_top" href="http://www.boost.org/LICENSE_1_0.txt">
 http://www.boost.org/LICENSE_1_0.txt>)</td>
 </tr>
-</table>
+</tbody></table>

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

Modified: sandbox/gtl/doc/gtl_polygon_90_with_holes_concept.htm
==============================================================================
--- sandbox/gtl/doc/gtl_polygon_90_with_holes_concept.htm (original)
+++ sandbox/gtl/doc/gtl_polygon_90_with_holes_concept.htm 2012-04-09 15:10:32 EDT (Mon, 09 Apr 2012)
@@ -1,15 +1,14 @@
<!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" 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"><head>
-<title>Boost Polygon Library: Polygon 90 With Holes Concept</title>
- <meta http-equiv="content-type" content="text/html;charset=ISO-8859-1">
- 
-<table style="margin: 0pt; padding: 0pt; width: 100%;" border="0" cellpadding="0" cellspacing="0"><tbody><tr>
+--><title>Boost Polygon Library: Polygon 90 With Holes 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">
- <img border="0" src="images/boost.png" width="277" height="86"><a title="www.boost.org home page" href="http://www.boost.org/" tabindex="2" style="border: medium none ;">
+ <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;">
@@ -37,20 +36,34 @@
 <li>Property Merge 90</li>
 <li>Property Merge 45</li>
 <li>Property Merge</li>
+ <li><a href="voronoi_main.htm">Voronoi Main Page 
+</a></li>
+ <li>Voronoi Benchmark 
+ </li>
+ <li>Voronoi Builder</li>
+ <li><a href="voronoi_diagram.htm">Voronoi Diagram 
+</a></li>
+ <li>Voronoi Predicates</li>
+ <li>Voronoi Robust FPT 
+ </li>
+ <li>Voronoi Utils</li>
+
 </ul>
 <h3 class="navbar">Other Resources</h3>
 <ul>
- <li>GTL Boostcon 2009 Paper</li>
- <li><a href="GTL_boostcon_draft03.htm">GTL Boostcon 2009
+ <li>GTL Boostcon 2009 Paper</li>
+ <li><a href="GTL_boostcon_draft03.htm">GTL Boostcon 2009
 Presentation</a></li>
- <li>Performance Analysis</li>
- <li>Layout Versus Schematic Tutorial</li>
- <li>Minkowski Sum Tutorial</li>
- </ul>
+ <li>Performance Analysis</li>
+ <li>Layout Versus Schematic Tutorial</li>
+ <li>Minkowski Sum Tutorial</li>
+ <li>Voronoi Basic Tutorial</li>
+ <li>Voronoi Advanced Tutorial</li>
+</ul>
 </div>
 <h3 class="navbar">Polygon Sponsor</h3>
 <div style="padding: 5px;" align="center">
- <img border="0" src="images/intlogo.gif" width="127" height="51"><a title="www.adobe.com home page" href="http://www.adobe.com/" tabindex="2" style="border: medium none ;">
+ <img src="images/intlogo.gif" border="0" height="51" width="127" /><a title="www.adobe.com home page" href="http://www.adobe.com/" tabindex="2" style="border: medium none ;">
 </a>
 </div>
</td>
@@ -58,83 +71,83 @@



- 
+ 

<h1>Polygon 90 With Holes Concept</h1>


-The polygon_90_with_holes concept tag is 
+The polygon_90_with_holes concept tag is 
polygon_90_with_holes_concept

To register a user defined type as a model of
polygon_90_with_holes concept, specialize the
geometry concept meta-function for that type.  In the example below CPolygon90WithHoles is registered as a model of
-polygon_90_with_holes  concept.
-template <> 
-struct geometry_concept<CPolygon90WithHoles> { typedef polygon_90_with_holes_concept type; };
+polygon_90_with_holes  concept.
+template <> 
+struct geometry_concept<CPolygon90WithHoles> { typedef polygon_90_with_holes_concept type; };
The semantic of a polygon_90_with_holes is a
polygon_90 that it can provide iterators over holes that are also polygon_90. 
A mutable polygon_90_with_holes must also be able to set its geometry based on
an interator range over polygon_90 holes.  There is no convention of
-winding of holes enforced within the library. 
+winding of holes enforced within the library. 
Below is shown the default polygon with holes
traits.  Specialization of these traits is required for types that don't
-conform to the default behavior.template <typename
-T, typename enable = void> 
-struct polygon_with_holes_traits { 
+conform to the default behavior.template <typename
+T, typename enable = void> 
+struct polygon_with_holes_traits { 
     typedef typename T::iterator_holes_type
-iterator_holes_type; 
-     typedef typename T::hole_type hole_type; 
+iterator_holes_type; 
+     typedef typename T::hole_type hole_type; 
     static inline iterator_holes_type begin_holes(const T&
-t) { 
-          return t.begin_holes(); 
-     } 
+t) { 
+          return t.begin_holes(); 
+     } 
     static inline iterator_holes_type end_holes(const T& t)
-{ 
-          return t.end_holes(); 
-     } 
-     static inline unsigned int size_holes(const T& t) { 
-          return t.size_holes(); 
-     } 
+{ 
+          return t.end_holes(); 
+     } 
+     static inline unsigned int size_holes(const T& t) { 
+          return t.size_holes(); 
+     } 
};
-template <typename T, typename enable = void> 
-struct polygon_with_holes_mutable_traits { 
-     template <typename iT> 
+template <typename T, typename enable = void> 
+struct polygon_with_holes_mutable_traits { 
+     template <typename iT> 
     static inline T& set_holes(T& t, iT inputBegin, iT
-inputEnd) { 
+inputEnd) { 
          t.set_holes(inputBegin,
-inputEnd); 
-          return t; 
-     } 
+inputEnd); 
+          return t; 
+     } 
};
An object that is a model of 
polygon_90_with_holes_concept can be viewed as a model of any of its
refinements if it is determined at runtime to conform to the restriction of
those concepts.  This concept casting is accomplished through the
view_as<>() function.
-view_as<rectangle_concept>(polygon_90_with_holes_object) 
+view_as<rectangle_concept>(polygon_90_with_holes_object) 
view_as<polygon_90_concept>(polygon_90_with_holes_object)
The return value of view_as<>() can be
passed into any interface that expects an object of the conceptual type
specified in its template parameter.
<h2>Functions</h2>
-<table border="1" width="100%" id="table1">
- <tr>
- <td width="586">template <typename T> 
+<table id="table1" border="1" width="100%">
+ <tbody><tr>
+ <td width="586">template <typename T> 
 compact_iterator_type begin_compact(const T& polygon)</td>
 <td>Expects a model of polygon_90. 
 Returns the begin iterator over the range of coordinates that correspond
 to horizontal and vertical edges.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 compact_iterator_type end_compact(const T& polygon)</td>
 <td>Expects a model of polygon_90. 
 Returns the end iterator over the range of coordinates that correspond
 to horizontal and vertical edges.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 point_iterator_type begin_points(const T& polygon)</td>
 <td>Expects a model of
 polygon_90_with_holes. 
@@ -142,7 +155,7 @@
 vertices of the polygon.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 point_iterator_type end_points(const T& polygon)</td>
 <td>Expects a model of
 polygon_90_with_holes. 
@@ -150,7 +163,7 @@
 vertices of the polygon.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 hole_iterator_type begin_holes(const T& polygon)</td>
 <td>Expects a model of
 polygon_90_with_holes. 
@@ -158,7 +171,7 @@
 to horizontal and vertical edges.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 hole_iterator_type end_holes(const T& polygon)</td>
 <td>Expects a model of
 polygon_90_with_holes. 
@@ -167,7 +180,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T, typename
- iterator> 
+ iterator> 
 void set_compact(T& polygon, iterator b, iterator e)</td>
 <td>Expects a model of
 polygon_90_with_holes.  
@@ -176,7 +189,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T, typename
- iterator> 
+ iterator> 
 void set_points(T& polygon, iterator b, iterator e)</td>
 <td>Expects a model of
 polygon_90_with_holes.  
@@ -186,14 +199,14 @@
 </tr>
 <tr>
 <td width="586">template <typename T, typename
- iterator> 
+ iterator> 
 void set_holes(T& polygon, iterator b, iterator e)</td>
 <td>Expects a model of
 polygon_90_with_holes.  
 Sets the polygon holes to the hole data range [b,e)</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 unsigned int size(const T& polygon)</td>
 <td>Returns the number of edges in the
 outer shell of the polygon_90_with_holes.  Does not include sizes
@@ -201,7 +214,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& assign(T1& left, const T2& right)</td>
 <td>Copies data from right object that models polygon_90_with_holes or
 one of its refinements into left object
@@ -209,8 +222,8 @@
 </tr>
 <tr>
 <td width="586">template <typename T,
- typename point_type> 
- bool contains(const T&, const point_type& point, 
+ typename point_type> 
+ bool contains(const T&, const point_type& point, 
             
 bool consider_touch=true)</td>
 <td>Given an object that models polygon_90_with_holes and an object that models
@@ -221,86 +234,85 @@
 the polygon or one of its holes.</td>
 </tr>
 <tr>
- <td width="586">// get the center coordinate 
- template <typename T, typename point_type> 
+ <td width="586">// get the center coordinate 
+ template <typename T, typename point_type> 
 void center(point_type& p, const T& polygon)</td>
 <td>Sets object that models point to the center point of the bounding
 box of an object that models polygon_90_with_holes.</td>
 </tr>
 <tr>
 <td width="586">template <typename T,
- typename rectangle_type> 
+ typename rectangle_type> 
 bool extents(rectangle_type& bbox, const T& polygon)</td>
 <td>Sets object that models rectangle to the bounding box of an object
 that models polygon_90_with_holes and returns true.  Returns false
 and leaves bbox unchanged if polygon is empty.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 manhattan_area_type area(const T& polygon)</td>
 <td>Returns the area of an object
 that models polygon_90_with_holes including subtracting the area of its
 holes from the area of the outer shell polygon.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 direction_1d winding(const T& polygon)</td>
 <td>Returns the winding direction of an object
 that models polygon_90_with_holes, LOW == CLOCKWISE, HIGH =
 COUNTERCLOCKWISE.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 coordinate_difference perimeter(const T& polygon)</td>
 <td>Returns the perimeter length of an object
 that models polygon_90, including the perimeters of the holes.</td>
 </tr>
 <tr>
 <td width="586">template <typename T,
- typename transform_type> 
+ typename transform_type> 
 T& transform(T& polygon, const transform_type&)</td>
 <td>Applies transform() on the vertices of polygon and sets the polygon to that described by the result of
 transforming its vertices.  Also applies transform() on the holes
 of the polygon.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 T& scale_up(T& polygon, unsigned_area_type factor)</td>
 <td>Scales up outer shell and holes of an object that models
 polygon_90 by unsigned factor.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 T& scale_down(T& polygon, unsigned_area_type factor)</td>
 <td>Scales down outer shell and holes of an object that models
 polygon_90 by unsigned factor.</td>
 </tr>
 <tr>
- <td width="586">template <typename T, scaling_type> 
+ <td width="586">template <typename T, scaling_type> 
 T& scale(T& rectangle, double scaling) </td>
 <td>Scales outer shell and holes of an object that models polygon_90 by
 floating point factor.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
- T& move(T& polygon, orientation_2d, 
+ <td width="586">template <typename T> 
+ T& move(T& polygon, orientation_2d, 
        coordinate_difference displacement)</td>
 <td>Adds displacement value to coordinate indicated by orientation_2d of
 vertices of an object that models polygon_90 .</td>
 </tr>
 <tr>
- <td width="586">template <typename polygon_type, typename point_type> 
- polygon_type& convolve(polygon_type& polygon, 
-                      
- const point_type& point)</td>
+ <td width="586">template <typename polygon_type, typename point_type> 
+ polygon_type& convolve(polygon_type& polygon,                       
+const point_type& point)</td>
 <td>Convolves coordinate values of point with the outer shell and holes of an
 object that models polygon_90_with_holes.</td>
 </tr>
- </table>
+ </tbody></table>
 <h1>Polygon 90 With Holes Data</h1>


-The library provides a model of polygon 90 with holes concept declared
+The library provides a model of polygon 90 with holes concept declared

template<typename T> polygon_90_with_holes_data where T is the
coordinate type.
@@ -309,8 +321,8 @@
library polygon data type instead of providing their own.  The data type is
implemented to be convenient to use with the library traits.
<h2>Members</h2>
-<table border="1" width="100%" id="table2">
- <tr>
+<table id="table2" border="1" width="100%">
+ <tbody><tr>
 <td width="586">geometry_type</td>
 <td>polygon_90_with_holes_concept</td>
 </tr>
@@ -345,12 +357,12 @@
 </tr>
 <tr>
 <td width="586">polygon_90_with_holes_data& 
- operator=(const polygon_90_with_holes_data& that)</td>
+ operator=(const polygon_90_with_holes_data& that)</td>
 <td>Assignment operator.</td>
 </tr>
 <tr>
 <td width="586">template <typename T2> polygon_90_with_holes_data& 
- operator=(const T2& that) const</td>
+ operator=(const T2& that) const</td>
 <td>Assign from an object that is a model of polygon 90 with holes.</td>
 </tr>
 <tr>
@@ -398,14 +410,14 @@
 </tr>
 <tr>
 <td width="586">template <typename iT> 
- void set(iT begin_points, iT end_points)</td>
+ void set(iT begin_points, iT end_points)</td>
 <td>Sets the polygon to the iterator range of points.  No check is
 performed to ensure the points describe a Manhattan figure, every other
 x and y value of the points is used to initialize the polygon.</td>
 </tr>
 <tr>
 <td width="586">template <typename iT> 
- void set_compact(iT begin_coords, iT end_coords)</td>
+ void set_compact(iT begin_coords, iT end_coords)</td>
 <td>Sets the polygon to the iterator range of coordinates.  These
 coordinates correspond to the x values of vertical edges and y values of
 horizontal edges.  It is expected that the sequence start with an x
@@ -413,24 +425,24 @@
 </tr>
 <tr>
 <td width="586">template <typename iT> 
- void set_holes(iT begin_holes, iT end_choless)</td>
+ void set_holes(iT begin_holes, iT end_choless)</td>
 <td>Sets the polygon holes the iterator range of hole polygons.  These
 polygons in the input range may be either polygon_90_data or
 polygon_90_with_holes_data or any type that provides begin_compact and
 end_compact member functions.</td>
 </tr>
-</table>
- <tr>
+</tbody></table>
+ </td></tr><tr>
<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" rules="none" frame="void" id="table3">
+<table class="docinfo" id="table3" frame="void" rules="none">
 <colgroup>
- <col class="docinfo-name"><col class="docinfo-content">
+ <col class="docinfo-name" /><col class="docinfo-content" />
 </colgroup>
- <tbody vAlign="top">
+ <tbody valign="top">
 <tr>
 <th class="docinfo-name">Copyright:</th>
 <td>Copyright © Intel Corporation 2008-2010.</td>
@@ -443,6 +455,6 @@
 <a class="reference" target="_top" href="http://www.boost.org/LICENSE_1_0.txt">
 http://www.boost.org/LICENSE_1_0.txt>)</td>
 </tr>
-</table>
+</tbody></table>

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

Modified: sandbox/gtl/doc/gtl_polygon_concept.htm
==============================================================================
--- sandbox/gtl/doc/gtl_polygon_concept.htm (original)
+++ sandbox/gtl/doc/gtl_polygon_concept.htm 2012-04-09 15:10:32 EDT (Mon, 09 Apr 2012)
@@ -1,15 +1,14 @@
<!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" 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"><head>
-<title>Boost Polygon Library: Polygon Concept</title>
- <meta http-equiv="content-type" content="text/html;charset=ISO-8859-1">
- 
-<table style="margin: 0pt; padding: 0pt; width: 100%;" border="0" cellpadding="0" cellspacing="0"><tbody><tr>
+--><title>Boost Polygon Library: Polygon 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">
- <img border="0" src="images/boost.png" width="277" height="86"><a title="www.boost.org home page" href="http://www.boost.org/" tabindex="2" style="border: medium none ;">
+ <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;">
@@ -37,20 +36,34 @@
 <li>Property Merge 90</li>
 <li>Property Merge 45</li>
 <li>Property Merge</li>
+ <li><a href="voronoi_main.htm">Voronoi Main Page 
+</a></li>
+ <li>Voronoi Benchmark 
+ </li>
+ <li>Voronoi Builder</li>
+ <li><a href="voronoi_diagram.htm">Voronoi Diagram 
+</a></li>
+ <li>Voronoi Predicates</li>
+ <li>Voronoi Robust FPT 
+ </li>
+ <li>Voronoi Utils</li>
+
 </ul>
 <h3 class="navbar">Other Resources</h3>
 <ul>
- <li>GTL Boostcon 2009 Paper</li>
- <li><a href="GTL_boostcon_draft03.htm">GTL Boostcon 2009
+ <li>GTL Boostcon 2009 Paper</li>
+ <li><a href="GTL_boostcon_draft03.htm">GTL Boostcon 2009
 Presentation</a></li>
- <li>Performance Analysis</li>
- <li>Layout Versus Schematic Tutorial</li>
- <li>Minkowski Sum Tutorial</li>
- </ul>
+ <li>Performance Analysis</li>
+ <li>Layout Versus Schematic Tutorial</li>
+ <li>Minkowski Sum Tutorial</li>
+ <li>Voronoi Basic Tutorial</li>
+ <li>Voronoi Advanced Tutorial</li>
+</ul>
 </div>
 <h3 class="navbar">Polygon Sponsor</h3>
 <div style="padding: 5px;" align="center">
- <img border="0" src="images/intlogo.gif" width="127" height="51"><a title="www.adobe.com home page" href="http://www.adobe.com/" tabindex="2" style="border: medium none ;">
+ <img src="images/intlogo.gif" border="0" height="51" width="127" /><a title="www.adobe.com home page" href="http://www.adobe.com/" tabindex="2" style="border: medium none ;">
 </a>
 </div>
</td>
@@ -58,20 +71,20 @@



- 
+ 

<h1>Polygon Concept</h1>


-The polygon concept tag is 
+The polygon concept tag is 
polygon_concept

To register a user defined type as a model of
polygon concept, specialize the
geometry concept meta-function for that type.  In the example below CPolygon is registered as a model of
-polygon  concept.
-template <> 
-struct geometry_concept<CPolygon> { typedef polygon_concept type; };
+polygon  concept.
+template <> 
+struct geometry_concept<CPolygon> { typedef polygon_concept type; };
The semantic of a polygon is that it can provide
iterators over the points that represent its vertices.  It is acceptable to
have the last edge explict with the first and last point equal to each other or
@@ -81,53 +94,53 @@
>
could be made models of polygon_concept by simply providing access to their
iterators through traits.  Library functions that create polygon objects
-require that those objects provide a default constructor.
+require that those objects provide a default constructor.
Below is shown the default polygon traits. 
Specialization of these traits is required for types that don't conform to the
default behavior.  Note that these same traits are also used by several
other polygon concepts through SFINE enable template parameter.  The SFINE
enable parameter also allows the library to provide default specialization that
-work for any object that models the 90 degree polygon concepts.
-template <typename T, typename enable = gtl_yes> 
-struct polygon_traits {}; 
- 
-template <typename T> 
-struct polygon_traits<T, 
-  typename gtl_or_4< 
+work for any object that models the 90 degree polygon concepts.
+template <typename T, typename enable = gtl_yes> 
+struct polygon_traits {}; 
+ 
+template <typename T> 
+struct polygon_traits<T, 
+  typename gtl_or_4< 
    typename gtl_same_type<typename geometry_concept<T>::type,
-polygon_concept>::type, 
+polygon_concept>::type, 
    typename gtl_same_type<typename geometry_concept<T>::type,
-polygon_concept>::type, 
+polygon_concept>::type, 
    typename gtl_same_type<typename geometry_concept<T>::type,
-polygon_with_holes_concept>::type, 
+polygon_with_holes_concept>::type, 
    typename gtl_same_type<typename geometry_concept<T>::type,
-polygon_with_holes_concept>::type 
-  >::type> { 
-     typedef typename T::coordinate_type coordinate_type; 
-     typedef typename T::iterator_type iterator_type; 
-     typedef typename T::point_type point_type; 
-     static inline iterator_type begin_points(const T& t) { 
-          return t.begin(); 
-     } 
-     static inline iterator_type end_points(const T& t) { 
-          return t.end(); 
-     } 
-     static inline unsigned int size(const T& t) { 
-          return t.size(); 
-     } 
-     static inline winding_direction winding(const T& t) { 
-          return unknown_winding; 
-     } 
+polygon_with_holes_concept>::type 
+  >::type> { 
+     typedef typename T::coordinate_type coordinate_type; 
+     typedef typename T::iterator_type iterator_type; 
+     typedef typename T::point_type point_type; 
+     static inline iterator_type begin_points(const T& t) { 
+          return t.begin(); 
+     } 
+     static inline iterator_type end_points(const T& t) { 
+          return t.end(); 
+     } 
+     static inline unsigned int size(const T& t) { 
+          return t.size(); 
+     } 
+     static inline winding_direction winding(const T& t) { 
+          return unknown_winding; 
+     } 
};
-template <typename T, typename enable = void> 
-struct polygon_mutable_traits { 
-     template <typename iT> 
+template <typename T, typename enable = void> 
+struct polygon_mutable_traits { 
+     template <typename iT> 
     static inline T& set_points(T& t, iT input_begin, iT
-input_end) { 
+input_end) { 
          t.set(input_begin,
-input_end); 
-          return t; 
-     } 
+input_end); 
+          return t; 
+     } 
};
Example code custom_polygon.cpp
demonstrates mapping a
@@ -137,23 +150,23 @@
refinements if it is determined at runtime to conform to the restriction of
those concepts.  This concept casting is accomplished through the
view_as<>() function.
-view_as<rectangle_concept>(polygon_object) 
-view_as<polygon_90_concept>(polygon_object) 
+view_as<rectangle_concept>(polygon_object) 
+view_as<polygon_90_concept>(polygon_object) 
view_as<polygon_45_concept>(polygon_object)
The return value of view_as<>() can be
passed into any interface that expects an object of the conceptual type
specified in its template parameter. 
<h2>Functions</h2>
-<table border="1" width="100%" id="table1">
- <tr>
- <td width="586">template <typename T> 
+<table id="table1" border="1" width="100%">
+ <tbody><tr>
+ <td width="586">template <typename T> 
 point_iterator_type begin_points(const T& polygon)</td>
 <td>Expects a model of polygon. 
 Returns the begin iterator over the range of points that correspond to
 vertices of the polygon.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 point_iterator_type end_points(const T& polygon)</td>
 <td>Expects a model of polygon. 
 Returns the end iterator over the range of points that correspond to
@@ -161,29 +174,29 @@
 </tr>
 <tr>
 <td width="586">template <typename T, typename
- iterator> 
+ iterator> 
 void set_points(T& polygon, iterator b, iterator e)</td>
 <td>Expects a model of polygon.  
 Sets the polygon to the point data range [b,e) that corresponds to
 vertices of a manhattan polygon.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 unsigned int size(const T& polygon)</td>
 <td>Returns the number of edges in the
 polygon.</td>
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& assign(T1& left, const T2& right)</td>
 <td>Copies data from right object that models polygon into left object
 that models polygon.</td>
 </tr>
 <tr>
 <td width="586">template <typename T,
- typename point_type> 
- bool contains(const T&, const point_type& point, 
+ typename point_type> 
+ bool contains(const T&, const point_type& point, 
             
 bool consider_touch=true)</td>
 <td>Given an object that models polygon and an object that models
@@ -193,84 +206,83 @@
 the polygon.  Linear wrt. vertices.</td>
 </tr>
 <tr>
- <td width="586">// get the center coordinate 
- template <typename T, typename point_type> 
+ <td width="586">// get the center coordinate 
+ template <typename T, typename point_type> 
 void center(point_type& p, const T& polygon)</td>
 <td>Sets object that models point to the center point of the bounding
 box of an object that models polygon.  Linear wrt. vertices.</td>
 </tr>
 <tr>
 <td width="586">template <typename T,
- typename rectangle_type> 
+ typename rectangle_type> 
 bool extents(rectangle_type& bbox, const T& polygon)</td>
 <td>Sets object that models rectangle to the bounding box of an object
 that models polygon and returns true.  Returns false and leaves
 bbox unchanged if polygon is empty.  Linear wrt. vertices.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 area_type area(const T& polygon)</td>
 <td>Returns the area of an object
 that models polygon.  Linear wrt. vertices.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 direction_1d winding(const T& polygon)</td>
 <td>Returns the winding direction of an object
 that models polygon, LOW == CLOCKWISE, HIGH = COUNTERCLOCKWISE. 
 Complexity depends upon winding trait.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 coordinate_distance perimeter(const T& polygon)</td>
 <td>Returns the perimeter length of an object
 that models polygon.  Linear wrt. vertices.</td>
 </tr>
 <tr>
 <td width="586">template <typename T,
- typename transform_type> 
+ typename transform_type> 
 T& transform(T& polygon, const transform_type&)</td>
 <td>Applies transform() on the vertices of polygon and sets the polygon to that described by the result of
 transforming its vertices.  Linear wrt. vertices.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 T& scale_up(T& polygon, unsigned_area_type factor)</td>
 <td>Scales up coordinate of an object that models
 polygon by unsigned factor.  Linear wrt. vertices.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 T& scale_down(T& polygon, unsigned_area_type factor)</td>
 <td>Scales down coordinates of an object that models
 polygon by unsigned factor.  Linear wrt. vertices.</td>
 </tr>
 <tr>
- <td width="586">template <typename T, scaling_type> 
+ <td width="586">template <typename T, scaling_type> 
 T& scale(T& rectangle, double scaling) </td>
 <td>Scales coordinates of an object that models polygon by floating
 point factor.  Linear wrt. vertices.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
- T& move(T& polygon, orientation_2d, 
+ <td width="586">template <typename T> 
+ T& move(T& polygon, orientation_2d, 
        coordinate_difference displacement)</td>
 <td>Adds displacement value to coordinate indicated by orientation_2d of
 vertices of an object that models polygon .  Linear wrt. vertices.</td>
 </tr>
 <tr>
- <td width="586">template <typename polygon_type, typename point_type> 
- polygon_type& convolve(polygon_type& polygon, 
-                      
- const point_type& point)</td>
+ <td width="586">template <typename polygon_type, typename point_type> 
+ polygon_type& convolve(polygon_type& polygon,                       
+const point_type& point)</td>
 <td>Convolves coordinate values of point with vertices of an
 object that models polygon.  Linear wrt. vertices.</td>
 </tr>
- </table>
+ </tbody></table>
 <h1>Polygon Data</h1>


-The library provides a model of polygon concept declared
+The library provides a model of polygon concept declared

template<typename T> polygon_data where T is the coordinate type.
This data type is used internally when a polygon is needed and is available
@@ -281,8 +293,8 @@
demonstrates using
 the library provided polygon data types and functions
<h2>Members</h2>
-<table border="1" width="100%" id="table2">
- <tr>
+<table id="table2" border="1" width="100%">
+ <tbody><tr>
 <td width="586">geometry_type</td>
 <td>polygon_concept</td>
 </tr>
@@ -310,7 +322,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T2> 
- polygon_data& operator=(const T2& that) const</td>
+ polygon_data& operator=(const T2& that) const</td>
 <td>Assign from an object that is a model of polygon.</td>
 </tr>
 <tr>
@@ -330,21 +342,21 @@
 </tr>
 <tr>
 <td width="586">template <typename iT> 
- void set(iT begin_points, iT end_points)</td>
+ void set(iT begin_points, iT end_points)</td>
 <td>Sets the polygon to the iterator range of points.  </td>
 </tr>
-</table>
- <tr>
+</tbody></table>
+ </td></tr><tr>
<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" rules="none" frame="void" id="table3">
+<table class="docinfo" id="table3" frame="void" rules="none">
 <colgroup>
- <col class="docinfo-name"><col class="docinfo-content">
+ <col class="docinfo-name" /><col class="docinfo-content" />
 </colgroup>
- <tbody vAlign="top">
+ <tbody valign="top">
 <tr>
 <th class="docinfo-name">Copyright:</th>
 <td>Copyright © Intel Corporation 2008-2010.</td>
@@ -357,6 +369,6 @@
 <a class="reference" target="_top" href="http://www.boost.org/LICENSE_1_0.txt">
 http://www.boost.org/LICENSE_1_0.txt>)</td>
 </tr>
-</table>
+</tbody></table>

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

Modified: sandbox/gtl/doc/gtl_polygon_set_concept.htm
==============================================================================
--- sandbox/gtl/doc/gtl_polygon_set_concept.htm (original)
+++ sandbox/gtl/doc/gtl_polygon_set_concept.htm 2012-04-09 15:10:32 EDT (Mon, 09 Apr 2012)
@@ -1,15 +1,14 @@
<!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" 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"><head>
-<title>Boost Polygon Library: Polygon Set Concept</title>
- <meta http-equiv="content-type" content="text/html;charset=ISO-8859-1">
- 
-<table style="margin: 0pt; padding: 0pt; width: 100%;" border="0" cellpadding="0" cellspacing="0"><tbody><tr>
+--><title>Boost Polygon Library: Polygon Set 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">
- <img border="0" src="images/boost.png" width="277" height="86"><a title="www.boost.org home page" href="http://www.boost.org/" tabindex="2" style="border: medium none ;">
+ <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;">
@@ -37,20 +36,34 @@
 <li>Property Merge 90</li>
 <li>Property Merge 45</li>
 <li>Property Merge</li>
+ <li><a href="voronoi_main.htm">Voronoi Main Page 
+</a></li>
+ <li>Voronoi Benchmark 
+ </li>
+ <li>Voronoi Builder</li>
+ <li><a href="voronoi_diagram.htm">Voronoi Diagram 
+</a></li>
+ <li>Voronoi Predicates</li>
+ <li>Voronoi Robust FPT 
+ </li>
+ <li>Voronoi Utils</li>
+
 </ul>
 <h3 class="navbar">Other Resources</h3>
 <ul>
- <li>GTL Boostcon 2009 Paper</li>
- <li><a href="GTL_boostcon_draft03.htm">GTL Boostcon 2009
+ <li>GTL Boostcon 2009 Paper</li>
+ <li><a href="GTL_boostcon_draft03.htm">GTL Boostcon 2009
 Presentation</a></li>
- <li>Performance Analysis</li>
- <li>Layout Versus Schematic Tutorial</li>
- <li>Minkowski Sum Tutorial</li>
- </ul>
+ <li>Performance Analysis</li>
+ <li>Layout Versus Schematic Tutorial</li>
+ <li>Minkowski Sum Tutorial</li>
+ <li>Voronoi Basic Tutorial</li>
+ <li>Voronoi Advanced Tutorial</li>
+</ul>
 </div>
 <h3 class="navbar">Polygon Sponsor</h3>
 <div style="padding: 5px;" align="center">
- <img border="0" src="images/intlogo.gif" width="127" height="51"><a title="www.adobe.com home page" href="http://www.adobe.com/" tabindex="2" style="border: medium none ;">
+ <img src="images/intlogo.gif" border="0" height="51" width="127" /><a title="www.adobe.com home page" href="http://www.adobe.com/" tabindex="2" style="border: medium none ;">
 </a>
 </div>
</td>
@@ -58,12 +71,12 @@



- 
+ 

<h1>Polygon Set Concept</h1>


-The polygon_set concept tag is 
+The polygon_set concept tag is 
polygon_set_concept

The semantic of a polygon_set is zero or more
@@ -78,7 +91,7 @@
case that the data represented contains only Manhattan and 45-degree geometry a
runtime check will default to the faster 45-degree algorithm.  The results
of which may differ slight from what the general algorithm would do because
-non-integer intersections will be handled differently.Users are recommended to use std::vector and std::list of user defined polygons
+non-integer intersections will be handled differently.Users are recommended to use std::vector and std::list of user defined polygons
or library provided polygon_set_data<coordinate_type> objects.  Lists
and vectors of models of polygon_concept or polygon_with_holes_concept are automatically models of polygon_set_concept.
Example code custom_polygon_set.cpp
@@ -89,7 +102,7 @@
polygon_45_set_concept if it is determined at runtime to conform to the
restrictions of those concepts.  This concept casting is accomplished
through the view_as<>() function.
-view_as<polygon_90_set_concept>(polygon_set_object) 
+view_as<polygon_90_set_concept>(polygon_set_object) 
view_as<polygon_45_set_concept>(polygon_set_object)
The return value of view_as<>() can be passed
into any interface that expects an object of the conceptual type specified in
@@ -104,10 +117,10 @@
eliminate temp copies of intermediate results when Boolean operators are chained
together.
Operators are declared inside the namespace boost::polygon::operators.
-<table border="1" width="100%" id="table5">
- <tr>
+<table id="table5" border="1" width="100%">
+ <tbody><tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 polygon_set_view operator|(const T1& l, const T2& r)</td>
 <td>Boolean OR operation (polygon set union).  Accepts two objects
 that model polygon_set or one of its refinements.  Returns an
@@ -118,7 +131,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 polygon_set_view operator+(const T1& l, const T2& r)</td>
 <td>Same as operator|.  The plus sign is also used for OR
 operations in Boolean logic expressions.  Expected n log n runtime,
@@ -126,7 +139,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 polygon_set_view operator&(const T1& l, const T2& r)</td>
 <td>Boolean AND operation (polygon set intersection).  Accepts two
 objects that model polygon_set or one of its refinements.  Expected
@@ -135,7 +148,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 polygon_set_view operator*(const T1& l, const T2& r)</td>
 <td>Same as operator&.  The multiplication symbol is also used for
 AND operations in Boolean logic expressions.  Expected n log n
@@ -143,7 +156,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 polygon_set_view operator^(const T1& l, const T2& r)</td>
 <td>Boolean XOR operation (polygon set disjoint-union).  Accepts
 two objects that model polygon_set or one of its refinements. 
@@ -152,7 +165,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 polygon_set_view operator-(const T1& l, const T2& r)</td>
 <td>Boolean SUBTRACT operation (polygon set difference).  Accepts
 two objects that model polygon_set or one of its refinements. 
@@ -161,7 +174,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& operator|=(const T1& l, const T2& r)</td>
 <td>Same as operator|, but with self assignment, left operand must model
 polygon_set and not one of it's refinements.  Expected n log n
@@ -169,7 +182,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& operator+=(T1& l, const T2& r)</td>
 <td>Same as operator+, but with self assignment, left operand must model
 polygon_set and not one of it's refinements.  Expected n log n
@@ -177,7 +190,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& operator&=(const T1& l, const T2& r)</td>
 <td>Same as operator&, but with self assignment, left operand must model
 polygon_set and not one of it's refinements.  Expected n log n
@@ -185,7 +198,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& operator*=(T1& l, const T2& r)</td>
 <td>Same as operator*, but with self assignment, left operand must model
 polygon_set and not one of it's refinements.  Expected n log n
@@ -193,7 +206,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& operator^=(const T1& l, const T2& r)</td>
 <td>Same as operator^, but with self assignment, left operand must model
 polygon_set and not one of it's refinements.  Expected n log n
@@ -201,14 +214,14 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& operator-=(T1& l, const T2& r)</td>
 <td>Same as operator-, but with self assignment, left operand must model
 polygon_set and not one of it's refinements.  Expected n log n
 runtime, worst case quadratic runtime wrt. vertices + intersections.</td>
 </tr>
 <tr>
- <td width="586">template <typename T1> 
+ <td width="586">template <typename T1> 
 T1 operator+(const T1&, coordinate_type bloating)</td>
 <td>Performs resize operation, inflating by bloating ammount.  If
 negative the result is a shrink instead of bloat.  Note: returns
@@ -217,7 +230,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1 operator-(const T1&, coordinate_type shrinking)</td>
 <td>Performs resize operation, deflating by bloating ammount.  If
 negative the result is a bloat instead of shrink.  Note: returns
@@ -226,7 +239,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& operator+=(const T1&, coordinate_type bloating)</td>
 <td>Performs resize operation, inflating by bloating ammount.  If
 negative the result is a shrink instead of bloat.  Returns
@@ -235,19 +248,19 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& operator-=(const T1&, coordinate_type shrinking)</td>
 <td>Performs resize operation, deflating by bloating ammount.  If
 negative the result is a bloat instead of shrink.  Returns
 reference to modified argument.  Expected n log n runtime, worst
 case quadratic runtime wrt. vertices + intersections.</td>
 </tr>
- </table>
+ </tbody></table>
<h2>Functions</h2>
-<table border="1" width="100%" id="table6">
- <tr>
+<table id="table6" border="1" width="100%">
+ <tbody><tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& assign(T1& lvalue, const T2& rvalue)</td>
 <td>Eliminates overlaps in geometry and copies from an object that
 models polygon_set or any of its refinements into an object that
@@ -256,7 +269,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 bool equivalence(const T1& lvalue, const T2& rvalue) </td>
 <td>Returns true if an object that models polygon_set or one of its
 refinements covers the exact same geometric regions as another object
@@ -266,8 +279,8 @@
 </tr>
 <tr>
 <td width="586">template <typename
- output_container_type, typename T> 
- void get_trapezoids(output_container_type& output, 
+ output_container_type, typename T> 
+ void get_trapezoids(output_container_type& output, 
                   
 const T& polygon_set)</td>
 <td>Output container is expected to be a standard container. 
@@ -280,10 +293,12 @@
 </tr>
 <tr>
 <td width="586">template <typename
- output_container_type, typename T> 
- void get_trapezoids(output_container_type& output, 
+ output_container_type, typename T> 
+ void get_trapezoids(output_container_type& output, 
                   
- const T& polygon_set,                     orientation_2d orient)</td>
+ const T& polygon_set, 
+                   
+orientation_2d orient)</td>
 <td>Output container is expected to be a standard container. 
 Slices geometry of an object that models polygon_set or one of its
 refinements into non overlapping trapezoids along a the specified slicing
@@ -294,13 +309,13 @@
 </tr>
 <tr>
 <td width="586">template <typename
- polygon_set_type> 
+ polygon_set_type> 
 void clear(polygon_set_type& polygon_set)</td>
 <td>Makes the object empty of geometry.</td>
 </tr>
 <tr>
 <td width="586">template <typename
- polygon_set_type> 
+ polygon_set_type> 
 bool empty(const polygon_set_type& polygon_set)</td>
 <td>Checks whether the object is empty of geometry.  Polygons that
 are completely covered by holes will result in empty returning true. 
@@ -309,8 +324,8 @@
 </tr>
 <tr>
 <td width="586">template <typename T, typename
- rectangle_type> 
- bool extents(rectangle_type& extents_rectangle, 
+ rectangle_type> 
+ bool extents(rectangle_type& extents_rectangle, 
             const
 T& polygon_set)</td>
 <td>Computes bounding box of an object that models polygon_set and
@@ -321,21 +336,21 @@
 intersections.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 area_type area(const T& polygon_set)</td>
 <td>Computes the area covered by geometry in an object that models
 polygon_set.  Expected n log n runtime, worst case quadratic
 runtime wrt. vertices + intersections.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 T& bloat(T& polygon_set, unsigned_area_type bloating)</td>
 <td>Same as getting all the polygons, bloating them and putting them
 back.  Expected n log n runtime, worst case quadratic runtime wrt.
 vertices + intersections.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 T& shrink(T& polygon_set, unsigned_area_type shrinking)</td>
 <td>Same as getting all the polygons, shrinking them and overwriting
 the polygon set with the resulting regions.  Expected n log n
@@ -343,10 +358,10 @@
 </tr>
 <tr>
 <td width="586">template <typename T, typename
- coord_type> 
- T& resize(T& polygon_set, coord_type resizing, 
+ coord_type> 
+ T& resize(T& polygon_set, coord_type resizing, 
          
- bool corner_fill_arc = false,          
+ bool corner_fill_arc = false,          
 unsigned int num_circle_segments = 0)</td>
 <td>Same as bloat if resizing is positive, same as shrink if resizing is
 negative.  Original topology at acute angle vertices is preserved
@@ -357,20 +372,20 @@
 runtime wrt. vertices + intersections.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
T& scale_up(T& polygon_set, unsigned_area_type factor)</td>
 <td>Scales geometry up by unsigned factor.  Expected n log n
 runtime, worst case quadratic runtime wrt. vertices + intersections.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
T& scale_down(T& polygon_set, unsigned_area_type factor)</td>
 <td>Scales geometry down by unsigned factor.  Expected n log n
 runtime, worst case quadratic runtime wrt. vertices + intersections.</td>
 </tr>
 <tr>
- <td width="586">template <typename T, typename transformation_type> 
-T& transform(T& polygon_set, 
+ <td width="586">template <typename T, typename transformation_type> 
+T& transform(T& polygon_set, 
             const
transformation_type& transformation)</td>
 <td>Applies transformation.transform() on all vertices.  Expected n
@@ -378,24 +393,24 @@
 intersections.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
-T& keep(T& polygon_set, 
-        unsigned_area_type min_area, 
-        unsigned_area_type max_area, 
-        unsigned_area_type min_width, 
-        unsigned_area_type max_width, 
-        unsigned_area_type min_height, 
+ <td width="586">template <typename T> 
+T& keep(T& polygon_set, 
+        unsigned_area_type min_area, 
+        unsigned_area_type max_area, 
+        unsigned_area_type min_width, 
+        unsigned_area_type max_width, 
+        unsigned_area_type min_height, 
        unsigned_area_type max_height)</td>
 <td>Retains only regions that satisfy the min/max criteria in the
 argument list.  Note: useful for visualization to cull too small
 polygons.  Expected n log n runtime, worst case quadratic runtime
 wrt. vertices + intersections.</td>
 </tr>
- </table>
+ </tbody></table>
 <h1>Polygon Set Data Object</h1>


-The polygon set data type encapsulates the internal data format that
+The polygon set data type encapsulates the internal data format that
serves as the input to the sweep-line algorithm that implements polygon-clipping
Boolean operations.  It also internally keeps track of whether that data
has been sorted or scanned and maintains the invariant that when its flags
@@ -406,7 +421,7 @@
maintain the data is sorted form rather than going all the way out to polygons
then resorting those vertices for a subsequent operation.
The declaration of Polygon Set Data is the following:
-template <typename T> 
+template <typename T> 
class polygon_set_data;
The class is parameterized on the coordinate data type.  Algorithms that
benefit from knowledge of the invariants enforced by the class are implemented
@@ -416,13 +431,13 @@
demonstrates using
 the library provided polygon set data types and functions
<h2>Member Functions</h2>
-<table border="1" width="100%" id="table7">
- <tr>
+<table id="table7" border="1" width="100%">
+ <tbody><tr>
 <td width="586">polygon_set_data()</td>
 <td>Default constructor. </td>
 </tr>
 <tr>
- <td width="586">template <typename iT> 
+ <td width="586">template <typename iT> 
 polygon_set_data(iT input_begin, iT
 input_end)</td>
 <td>Construct with scanning orientation from an iterator range of
@@ -435,33 +450,33 @@
 </tr>
 <tr>
 <td width="586">
-template <typename l, typename r, typename op> 
+template <typename l, typename r, typename op> 
polygon_set_data(const polygon_set_view<l,r,op>&
t)</td>
 <td>Copy construct from a Boolean operator template.</td>
 </tr>
 <tr>
 <td width="586">
-polygon_set_data& operator=(const polygon_set_data& that)</td>
+polygon_set_data& operator=(const polygon_set_data& that)</td>
 <td>Assignment from another polygon set, may change scanning
 orientation.</td>
 </tr>
 <tr>
 <td width="586">
-template <typename l, typename r, typename op> 
-polygon_set_data& operator=(const polygon_set_view<l, r,
+template <typename l, typename r, typename op> 
+polygon_set_data& operator=(const polygon_set_view<l, r,
op>& that)</td>
 <td>Assignment from a Boolean operator template.</td>
 </tr>
 <tr>
- <td width="586">template <typename geometry_object> 
+ <td width="586">template <typename geometry_object> 
polygon_set_data& operator=(const geometry_object& geo)</td>
 <td>Assignment from an insertable object.</td>
 </tr>
 <tr>
 <td width="586">

-template <typename iT> 
+template <typename iT> 
void insert(iT input_begin, iT input_end)</td>
 <td>Insert objects of an iterator range.  Linear wrt vertices
 inserted.</td>
@@ -475,8 +490,8 @@
 <tr>
 <td width="586">

-template <typename geometry_type> 
-void insert(const geometry_type& geometry_object,             bool is_hole
+template <typename geometry_type> 
+void insert(const geometry_type& geometry_object,             bool is_hole
= false)</td>
 <td>Insert a geometry object, if is_hole is true then the inserted
 region is subtractive rather than additive.  Linear wrt vertices
@@ -484,7 +499,7 @@
 </tr>
 <tr>
 <td width="586">
-template <typename output_container> 
+template <typename output_container> 
void get(output_container& output) const</td>
 <td>Expects a standard container of polygons objects.  Will scan
 and eliminate overlaps.  Converts polygon set geometry to objects
@@ -501,7 +516,7 @@
 </tr>
 <tr>
 <td width="586">
-template <typename output_container> 
+template <typename output_container> 
void get_trapezoids(output_container& output) const</td>
 <td>Expects a standard container of polygon objects.  Will scan
 and eliminate overlaps.  Slices polygon set geometry to trapezoids
@@ -511,8 +526,8 @@
 <tr>
 <td width="586">

-template <typename output_container> 
-void get_trapezoids(output_container& output,   orientation_2d
+template <typename output_container> 
+void get_trapezoids(output_container& output,   orientation_2d
slicing_orientation) const 
 </td>
 <td>Expects a standard container of polygon objects.  Will scan
@@ -559,15 +574,15 @@
 </tr>
 <tr>
 <td width="586">
-template <typename input_iterator_type> 
-void set(input_iterator_type input_begin,          input_iterator_type input_end) 
+template <typename input_iterator_type> 
+void set(input_iterator_type input_begin,          input_iterator_type input_end) 
 </td>
 <td>Overwrite geometry in polygon set with insertable objects in the
 iterator range. </td>
 </tr>
 <tr>
 <td width="586">
-template <typename rectangle_type> 
+template <typename rectangle_type> 
bool extents(rectangle_type& extents_rectangle) const</td>
 <td>Given an object that models rectangle, scans and eliminates overlaps
 in the polygon set because subtractive regions may alter its extents
@@ -577,9 +592,9 @@
 </tr>
 <tr>
 <td width="586">
-polygon_set_data& 
-resize(coord_type resizing, 
-        bool corner_fill_arc = false,       
+polygon_set_data& 
+resize(coord_type resizing, 
+        bool corner_fill_arc = false,       
 unsigned int num_circle_segments = 0)</td>
 <td>Inflates if resizing is positive, deflates if resizing is
 negative.  Original topology at acute angle vertices is preserved
@@ -593,8 +608,8 @@
 </tr>
 <tr>
 <td width="586">
-template <typename transformation_type> 
-polygon_set_data& transform(const transformation_type& transformation) 
+template <typename transformation_type> 
+polygon_set_data& transform(const transformation_type& transformation) 
 </td>
 <td>Applies transformation.transform() on vertices stored within the
 polygon set.  Expected n log n runtime, worst case quadratic
@@ -617,25 +632,25 @@
 </tr>
 <tr>
 <td width="586">
-template <typename scaling_type> 
-polygon_set_data& scale(const scaling_type&
+template <typename scaling_type> 
+polygon_set_data& scale(const scaling_type&
 f)</td>
 <td>Scales vertices stored within the polygon set by applying f.scale(). 
 Expected n log n runtime, worst case quadratic runtime wrt. vertices +
 intersections.</td>
 </tr>
- </table>
- <tr>
+ </tbody></table>
+ </td></tr><tr>
<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" rules="none" frame="void" id="table8">
+<table class="docinfo" id="table8" frame="void" rules="none">
 <colgroup>
- <col class="docinfo-name"><col class="docinfo-content">
+ <col class="docinfo-name" /><col class="docinfo-content" />
 </colgroup>
- <tbody vAlign="top">
+ <tbody valign="top">
 <tr>
 <th class="docinfo-name">Copyright:</th>
 <td>Copyright © Intel Corporation 2008-2010.</td>
@@ -648,6 +663,6 @@
 <a class="reference" target="_top" href="http://www.boost.org/LICENSE_1_0.txt">
 http://www.boost.org/LICENSE_1_0.txt>)</td>
 </tr>
-</table>
+</tbody></table>

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

Modified: sandbox/gtl/doc/gtl_polygon_with_holes_concept.htm
==============================================================================
--- sandbox/gtl/doc/gtl_polygon_with_holes_concept.htm (original)
+++ sandbox/gtl/doc/gtl_polygon_with_holes_concept.htm 2012-04-09 15:10:32 EDT (Mon, 09 Apr 2012)
@@ -1,15 +1,14 @@
<!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" 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"><head>
-<title>Boost Polygon Library: Polygon With Holes Concept</title>
- <meta http-equiv="content-type" content="text/html;charset=ISO-8859-1">
- 
-<table style="margin: 0pt; padding: 0pt; width: 100%;" border="0" cellpadding="0" cellspacing="0"><tbody><tr>
+--><title>Boost Polygon Library: Polygon With Holes 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">
- <img border="0" src="images/boost.png" width="277" height="86"><a title="www.boost.org home page" href="http://www.boost.org/" tabindex="2" style="border: medium none ;">
+ <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;">
@@ -37,20 +36,34 @@
 <li>Property Merge 90</li>
 <li>Property Merge 45</li>
 <li>Property Merge</li>
+ <li><a href="voronoi_main.htm">Voronoi Main Page 
+</a></li>
+ <li>Voronoi Benchmark 
+ </li>
+ <li>Voronoi Builder</li>
+ <li><a href="voronoi_diagram.htm">Voronoi Diagram 
+</a></li>
+ <li>Voronoi Predicates</li>
+ <li>Voronoi Robust FPT 
+ </li>
+ <li>Voronoi Utils</li>
+
 </ul>
 <h3 class="navbar">Other Resources</h3>
 <ul>
- <li>GTL Boostcon 2009 Paper</li>
- <li><a href="GTL_boostcon_draft03.htm">GTL Boostcon 2009
+ <li>GTL Boostcon 2009 Paper</li>
+ <li><a href="GTL_boostcon_draft03.htm">GTL Boostcon 2009
 Presentation</a></li>
- <li>Performance Analysis</li>
- <li>Layout Versus Schematic Tutorial</li>
- <li>Minkowski Sum Tutorial</li>
- </ul>
+ <li>Performance Analysis</li>
+ <li>Layout Versus Schematic Tutorial</li>
+ <li>Minkowski Sum Tutorial</li>
+ <li>Voronoi Basic Tutorial</li>
+ <li>Voronoi Advanced Tutorial</li>
+</ul>
 </div>
 <h3 class="navbar">Polygon Sponsor</h3>
 <div style="padding: 5px;" align="center">
- <img border="0" src="images/intlogo.gif" width="127" height="51"><a title="www.adobe.com home page" href="http://www.adobe.com/" tabindex="2" style="border: medium none ;">
+ <img src="images/intlogo.gif" border="0" height="51" width="127" /><a title="www.adobe.com home page" href="http://www.adobe.com/" tabindex="2" style="border: medium none ;">
 </a>
 </div>
</td>
@@ -58,95 +71,95 @@



- 
+ 

<h1>Polygon With Holes Concept</h1>


-The polygon_with_holes concept tag is 
+The polygon_with_holes concept tag is 
polygon_with_holes_concept

To register a user defined type as a model of
polygon_with_holes concept, specialize the
geometry concept meta-function for that type.  In the example below
-CPolygonWithHoles is registered as a model of polygon_with_holes  concept.
-template <> 
-struct geometry_concept<CPolygonWithHoles> { typedef polygon_with_holes_concept type; };
+CPolygonWithHoles is registered as a model of polygon_with_holes  concept.
+template <> 
+struct geometry_concept<CPolygonWithHoles> { typedef polygon_with_holes_concept type; };
The semantic of a polygon_with_holes is a polygon
that it can provide iterators over holes that are also polygon.  A mutable
polygon_with_holes must also be able to set its geometry based on an interator
range over polygon holes.  There is no convention of winding of holes
-enforced within the library. 
+enforced within the library. 
Below is shown the default polygon with holes
traits.  Specialization of these traits is required for types that don't
conform to the default behavior.  Note, these traits are used by all
-polygon with holes concepts.template <typename
-T, typename enable = void> 
-struct polygon_with_holes_traits { 
+polygon with holes concepts.template <typename
+T, typename enable = void> 
+struct polygon_with_holes_traits { 
     typedef typename T::iterator_holes_type
-iterator_holes_type; 
-     typedef typename T::hole_type hole_type; 
+iterator_holes_type; 
+     typedef typename T::hole_type hole_type; 
     static inline iterator_holes_type begin_holes(const T&
-t) { 
-          return t.begin_holes(); 
-     } 
+t) { 
+          return t.begin_holes(); 
+     } 
     static inline iterator_holes_type end_holes(const T& t)
-{ 
-          return t.end_holes(); 
-     } 
-     static inline unsigned int size_holes(const T& t) { 
-          return t.size_holes(); 
-     } 
+{ 
+          return t.end_holes(); 
+     } 
+     static inline unsigned int size_holes(const T& t) { 
+          return t.size_holes(); 
+     } 
};
-template <typename T, typename enable = void> 
-struct polygon_with_holes_mutable_traits { 
-     template <typename iT> 
+template <typename T, typename enable = void> 
+struct polygon_with_holes_mutable_traits { 
+     template <typename iT> 
     static inline T& set_holes(T& t, iT inputBegin, iT
-inputEnd) { 
+inputEnd) { 
          t.set_holes(inputBegin,
-inputEnd); 
-          return t; 
-     } 
+inputEnd); 
+          return t; 
+     } 
};
An object that is a model of 
polygon_with_holes_concept can be viewed as a model of any of its
refinements if it is determined at runtime to conform to the restriction of
those concepts.  This concept casting is accomplished through the
view_as<>() function.
-view_as<rectangle_concept>(polygon_with_holes_object) 
-view_as<polygon_90_concept>(polygon_with_holes_object) 
-view_as<polygon_90_with_holes_concept>(polygon_with_holes_object) 
-view_as<polygon_45_concept>(polygon_with_holes_object) 
-view_as<polygon_45_with_holes_concept>(polygon_with_holes_object) 
+view_as<rectangle_concept>(polygon_with_holes_object) 
+view_as<polygon_90_concept>(polygon_with_holes_object) 
+view_as<polygon_90_with_holes_concept>(polygon_with_holes_object) 
+view_as<polygon_45_concept>(polygon_with_holes_object) 
+view_as<polygon_45_with_holes_concept>(polygon_with_holes_object) 
view_as<polygon_concept>(polygon_with_holes_object)
The return value of view_as<>() can be
passed into any interface that expects an object of the conceptual type
specified in its template parameter. 
<h2>Functions</h2>
-<table border="1" width="100%" id="table1">
- <tr>
- <td width="586">template <typename T> 
+<table id="table1" border="1" width="100%">
+ <tbody><tr>
+ <td width="586">template <typename T> 
 point_iterator_type begin_points(const T& polygon)</td>
 <td>Expects a model of polygon_with_holes. 
 Returns the begin iterator over the range of points that correspond to
 vertices of the polygon.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 point_iterator_type end_points(const T& polygon)</td>
 <td>Expects a model of polygon_with_holes. 
 Returns the end iterator over the range of points that correspond to
 vertices of the polygon.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 hole_iterator_type begin_holes(const T& polygon)</td>
 <td>Expects a model of polygon_with_holes. 
 Returns the begin iterator over the range of coordinates that correspond
 to horizontal and vertical edges.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 hole_iterator_type end_holes(const T& polygon)</td>
 <td>Expects a model of polygon_with_holes. 
 Returns the end iterator over the range of coordinates that correspond
@@ -154,7 +167,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T, typename
- iterator> 
+ iterator> 
 void set_points(T& polygon, iterator b, iterator e)</td>
 <td>Expects a model of polygon_with_holes.  
 Sets the polygon to the point data range [b,e) that corresponds to
@@ -162,13 +175,13 @@
 </tr>
 <tr>
 <td width="586">template <typename T, typename
- iterator> 
+ iterator> 
 void set_holes(T& polygon, iterator b, iterator e)</td>
 <td>Expects a model of polygon_with_holes.  
 Sets the polygon holes to the hole data range [b,e)</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 unsigned int size(const T& polygon)</td>
 <td>Returns the number of edges in the
 outer shell of the polygon_with_holes.  Does not include sizes of
@@ -176,7 +189,7 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& assign(T1& left, const T2& right)</td>
 <td>Copies data from right object that models polygon_with_holes or one
 of its refinements into left object
@@ -184,8 +197,8 @@
 </tr>
 <tr>
 <td width="586">template <typename T,
- typename point_type> 
- bool contains(const T&, const point_type& point, 
+ typename point_type> 
+ bool contains(const T&, const point_type& point, 
             
 bool consider_touch=true)</td>
 <td>Given an object that models polygon_with_holes and an object that models
@@ -196,86 +209,85 @@
 the polygon or one of its holes.</td>
 </tr>
 <tr>
- <td width="586">// get the center coordinate 
- template <typename T, typename point_type> 
+ <td width="586">// get the center coordinate 
+ template <typename T, typename point_type> 
 void center(point_type& p, const T& polygon)</td>
 <td>Sets object that models point to the center point of the bounding
 box of an object that models polygon_with_holes.</td>
 </tr>
 <tr>
 <td width="586">template <typename T,
- typename rectangle_type> 
+ typename rectangle_type> 
 bool extents(rectangle_type& bbox, const T& polygon)</td>
 <td>Sets object that models rectangle to the bounding box of an object
 that models polygon_with_holes and returns true.  Returns false and
 leaves bbox unchanged if polygon is empty.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 manhattan_area_type area(const T& polygon)</td>
 <td>Returns the area of an object
 that models polygon_with_holes including subtracting the area of its
 holes from the area of the outer shell polygon.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 direction_1d winding(const T& polygon)</td>
 <td>Returns the winding direction of an object
 that models polygon_with_holes, LOW == CLOCKWISE, HIGH =
 COUNTERCLOCKWISE.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 coordinate_difference perimeter(const T& polygon)</td>
 <td>Returns the perimeter length of an object
 that models polygon, including the perimeters of the holes.</td>
 </tr>
 <tr>
 <td width="586">template <typename T,
- typename transform_type> 
+ typename transform_type> 
 T& transform(T& polygon, const transform_type&)</td>
 <td>Applies transform() on the vertices of polygon and sets the polygon to that described by the result of
 transforming its vertices.  Also applies transform() on the holes
 of the polygon.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 T& scale_up(T& polygon, unsigned_area_type factor)</td>
 <td>Scales up outer shell and holes of an object that models
 polygon by unsigned factor.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 T& scale_down(T& polygon, unsigned_area_type factor)</td>
 <td>Scales down outer shell and holes of an object that models
 polygon by unsigned factor.</td>
 </tr>
 <tr>
- <td width="586">template <typename T, scaling_type> 
+ <td width="586">template <typename T, scaling_type> 
 T& scale(T& rectangle, double scaling) </td>
 <td>Scales outer shell and holes of an object that models polygon by
 floating point factor.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
- T& move(T& polygon, orientation_2d, 
+ <td width="586">template <typename T> 
+ T& move(T& polygon, orientation_2d, 
        coordinate_difference displacement)</td>
 <td>Adds displacement value to coordinate indicated by orientation_2d of
 vertices of an object that models polygon .</td>
 </tr>
 <tr>
- <td width="586">template <typename polygon_type, typename point_type> 
- polygon_type& convolve(polygon_type& polygon, 
-                      
- const point_type& point)</td>
+ <td width="586">template <typename polygon_type, typename point_type> 
+ polygon_type& convolve(polygon_type& polygon,                       
+const point_type& point)</td>
 <td>Convolves coordinate values of point with the outer shell and holes of an
 object that models polygon_with_holes.</td>
 </tr>
- </table>
+ </tbody></table>
 <h1>Polygon With Holes Data</h1>


-The library provides a model of polygon with holes concept declared
+The library provides a model of polygon with holes concept declared

template<typename T> polygon_with_holes_data where T is the
coordinate type.
@@ -284,8 +296,8 @@
library polygon data type instead of providing their own.  The data type is
implemented to be convenient to use with the library traits.
<h2>Members</h2>
-<table border="1" width="100%" id="table2">
- <tr>
+<table id="table2" border="1" width="100%">
+ <tbody><tr>
 <td width="586">geometry_type</td>
 <td>polygon_with_holes_concept</td>
 </tr>
@@ -313,13 +325,13 @@
 </tr>
 <tr>
 <td width="586">polygon_with_holes_data& 
- operator=(const polygon_with_holes_data& that)</td>
+ operator=(const polygon_with_holes_data& that)</td>
 <td>Assignment operator.</td>
 </tr>
 <tr>
 <td width="586">template <typename T2> 
 polygon_with_holes_data& 
- operator=(const T2& that) const</td>
+ operator=(const T2& that) const</td>
 <td>Assign from an object that is a model of polygon with holes.</td>
 </tr>
 <tr>
@@ -355,29 +367,29 @@
 </tr>
 <tr>
 <td width="586">template <typename iT> 
- void set(iT begin_points, iT end_points)</td>
+ void set(iT begin_points, iT end_points)</td>
 <td>Sets the polygon to the iterator range of points. </td>
 </tr>
 <tr>
 <td width="586">template <typename iT> 
- void set_holes(iT begin_holes, iT end_choless)</td>
+ void set_holes(iT begin_holes, iT end_choless)</td>
 <td>Sets the polygon holes the iterator range of hole polygons.  These
 polygons in the input range may be either polygon_data or
 polygon_with_holes_data or any type that provides begin and end member
 functions to iterate over point_data<T>.</td>
 </tr>
-</table>
- <tr>
+</tbody></table>
+ </td></tr><tr>
<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" rules="none" frame="void" id="table3">
+<table class="docinfo" id="table3" frame="void" rules="none">
 <colgroup>
- <col class="docinfo-name"><col class="docinfo-content">
+ <col class="docinfo-name" /><col class="docinfo-content" />
 </colgroup>
- <tbody vAlign="top">
+ <tbody valign="top">
 <tr>
 <th class="docinfo-name">Copyright:</th>
 <td>Copyright © Intel Corporation 2008-2010.</td>
@@ -390,6 +402,6 @@
 <a class="reference" target="_top" href="http://www.boost.org/LICENSE_1_0.txt">
 http://www.boost.org/LICENSE_1_0.txt>)</td>
 </tr>
-</table>
+</tbody></table>

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

Modified: sandbox/gtl/doc/gtl_property_merge.htm
==============================================================================
--- sandbox/gtl/doc/gtl_property_merge.htm (original)
+++ sandbox/gtl/doc/gtl_property_merge.htm 2012-04-09 15:10:32 EDT (Mon, 09 Apr 2012)
@@ -1,15 +1,14 @@
<!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" 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"><head>
-<title>Boost Polygon Library: Property Merge</title>
- <meta http-equiv="content-type" content="text/html;charset=ISO-8859-1">
- 
-<table style="margin: 0pt; padding: 0pt; width: 100%;" border="0" cellpadding="0" cellspacing="0"><tbody><tr>
+--><title>Boost Polygon Library: Property Merge</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">
- <img border="0" src="images/boost.png" width="277" height="86"><a title="www.boost.org home page" href="http://www.boost.org/" tabindex="2" style="border: medium none ;">
+ <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;">
@@ -37,20 +36,34 @@
 <li>Property Merge 90</li>
 <li>Property Merge 45</li>
 <li>Property Merge</li>
+ <li><a href="voronoi_main.htm">Voronoi Main Page 
+</a></li>
+ <li>Voronoi Benchmark 
+ </li>
+ <li>Voronoi Builder</li>
+ <li><a href="voronoi_diagram.htm">Voronoi Diagram 
+</a></li>
+ <li>Voronoi Predicates</li>
+ <li>Voronoi Robust FPT 
+ </li>
+ <li>Voronoi Utils</li>
+
 </ul>
 <h3 class="navbar">Other Resources</h3>
 <ul>
- <li>GTL Boostcon 2009 Paper</li>
- <li><a href="GTL_boostcon_draft03.htm">GTL Boostcon 2009
+ <li>GTL Boostcon 2009 Paper</li>
+ <li><a href="GTL_boostcon_draft03.htm">GTL Boostcon 2009
 Presentation</a></li>
- <li>Performance Analysis</li>
- <li>Layout Versus Schematic Tutorial</li>
- <li>Minkowski Sum Tutorial</li>
- </ul>
+ <li>Performance Analysis</li>
+ <li>Layout Versus Schematic Tutorial</li>
+ <li>Minkowski Sum Tutorial</li>
+ <li>Voronoi Basic Tutorial</li>
+ <li>Voronoi Advanced Tutorial</li>
+</ul>
 </div>
 <h3 class="navbar">Polygon Sponsor</h3>
 <div style="padding: 5px;" align="center">
- <img border="0" src="images/intlogo.gif" width="127" height="51"><a title="www.adobe.com home page" href="http://www.adobe.com/" tabindex="2" style="border: medium none ;">
+ <img src="images/intlogo.gif" border="0" height="51" width="127" /><a title="www.adobe.com home page" href="http://www.adobe.com/" tabindex="2" style="border: medium none ;">
 </a>
 </div>
</td>
@@ -58,15 +71,15 @@



- 
+ 

<h1>Property Merge</h1>


-The following is the declaration of the property merge algorithm.
+The following is the declaration of the property merge algorithm.
template <typename coordinate_type, typename
-property_type> 
-class property_merge;The property algorithm computes the n-layer
+property_type> 
+class property_merge;The property algorithm computes the n-layer
map overlay of input polygon sets.  Each input geometry is inserted along
with a property value.  The property type can be anything suitable for use
as an element of a std::set.  Multiple geometry objects can be separately
@@ -74,13 +87,13 @@
operation a fairly complex container is required.  Resulting geometries are
associated with unique subsets of property values of the input geometry. 
Two suitable containers for storing the result of a property merge operation
-are:std::map<std::set<property_type>, polygon_set_data<coordinate_type>
-> 
-std::map<std::vector<property_type>, polygon_set_data<coordinate_type> >
+are:std::map<std::set<property_type>, polygon_set_data<coordinate_type>
+> 
+std::map<std::vector<property_type>, polygon_set_data<coordinate_type> >
Example code property_merge_usage.cpp
- demonstrates using the n-layer map-overlay algorithm on polygon data.<h2>Member Functions</h2>
-<table border="1" width="100%" id="table1">
- <tr>
+ demonstrates using the n-layer map-overlay algorithm on polygon data.<h2>Member Functions</h2>
+<table id="table1" border="1" width="100%">
+ <tbody><tr>
 <td width="586">property_merge()</td>
 <td>Default constructor. </td>
 </tr>
@@ -91,7 +104,7 @@
 </tr>
 <tr>
 <td width="586">
-void insert(const polygon_set_data<coordinate_type>& ps, 
+void insert(const polygon_set_data<coordinate_type>& ps, 
      
const property_type& property)</td>
 <td>Insert a polygon set with an associated
@@ -100,8 +113,8 @@
 <tr>
 <td width="586">

-template <class GeoObjT> 
-void insert(const GeoObjT& geoObj, 
+template <class GeoObjT> 
+void insert(const GeoObjT& geoObj, 
      
const property_type& property)</td>
 <td>Insert a geometry object that is a refinement of polygon set with an
@@ -110,25 +123,25 @@
 <tr>
 <td width="586">

-template <typename result_type> 
+template <typename result_type> 
void merge(result_type& result)</td>
 <td>Accepts a container object that conforms to the expectations defined
 above.  Performs property merge and populates the container
 object.  Expected n log n runtime, worst case quadratic runtime wrt.
 vertices + intersections.</td>
 </tr>
- </table>
- <tr>
+ </tbody></table>
+ </td></tr><tr>
<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" rules="none" frame="void" id="table2">
+<table class="docinfo" id="table2" frame="void" rules="none">
 <colgroup>
- <col class="docinfo-name"><col class="docinfo-content">
+ <col class="docinfo-name" /><col class="docinfo-content" />
 </colgroup>
- <tbody vAlign="top">
+ <tbody valign="top">
 <tr>
 <th class="docinfo-name">Copyright:</th>
 <td>Copyright © Intel Corporation 2008-2010.</td>
@@ -141,6 +154,6 @@
 <a class="reference" target="_top" href="http://www.boost.org/LICENSE_1_0.txt">
 http://www.boost.org/LICENSE_1_0.txt>)</td>
 </tr>
-</table>
+</tbody></table>

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

Modified: sandbox/gtl/doc/gtl_property_merge_45.htm
==============================================================================
--- sandbox/gtl/doc/gtl_property_merge_45.htm (original)
+++ sandbox/gtl/doc/gtl_property_merge_45.htm 2012-04-09 15:10:32 EDT (Mon, 09 Apr 2012)
@@ -1,15 +1,14 @@
<!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" 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"><head>
-<title>Boost Polygon Library: Property Merge 90</title>
- <meta http-equiv="content-type" content="text/html;charset=ISO-8859-1">
- 
-<table style="margin: 0pt; padding: 0pt; width: 100%;" border="0" cellpadding="0" cellspacing="0"><tbody><tr>
+--><title>Boost Polygon Library: Property Merge 90</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">
- <img border="0" src="images/boost.png" width="277" height="86"><a title="www.boost.org home page" href="http://www.boost.org/" tabindex="2" style="border: medium none ;">
+ <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;">
@@ -37,20 +36,34 @@
 <li>Property Merge 90</li>
 <li>Property Merge 45</li>
 <li>Property Merge</li>
+ <li><a href="voronoi_main.htm">Voronoi Main Page 
+</a></li>
+ <li>Voronoi Benchmark 
+ </li>
+ <li>Voronoi Builder</li>
+ <li><a href="voronoi_diagram.htm">Voronoi Diagram 
+</a></li>
+ <li>Voronoi Predicates</li>
+ <li>Voronoi Robust FPT 
+ </li>
+ <li>Voronoi Utils</li>
+
 </ul>
 <h3 class="navbar">Other Resources</h3>
 <ul>
- <li>GTL Boostcon 2009 Paper</li>
- <li><a href="GTL_boostcon_draft03.htm">GTL Boostcon 2009
+ <li>GTL Boostcon 2009 Paper</li>
+ <li><a href="GTL_boostcon_draft03.htm">GTL Boostcon 2009
 Presentation</a></li>
- <li>Performance Analysis</li>
- <li>Layout Versus Schematic Tutorial</li>
- <li>Minkowski Sum Tutorial</li>
- </ul>
+ <li>Performance Analysis</li>
+ <li>Layout Versus Schematic Tutorial</li>
+ <li>Minkowski Sum Tutorial</li>
+ <li>Voronoi Basic Tutorial</li>
+ <li>Voronoi Advanced Tutorial</li>
+</ul>
 </div>
 <h3 class="navbar">Polygon Sponsor</h3>
 <div style="padding: 5px;" align="center">
- <img border="0" src="images/intlogo.gif" width="127" height="51"><a title="www.adobe.com home page" href="http://www.adobe.com/" tabindex="2" style="border: medium none ;">
+ <img src="images/intlogo.gif" border="0" height="51" width="127" /><a title="www.adobe.com home page" href="http://www.adobe.com/" tabindex="2" style="border: medium none ;">
 </a>
 </div>
</td>
@@ -58,15 +71,15 @@



- 
+ 

<h1>Property Merge 45</h1>


-The following is the declaration of the property merge algorithm.
+The following is the declaration of the property merge algorithm.
template <typename coordinate_type, typename
-property_type> 
-class property_merge_45;The property algorithm computes the n-layer
+property_type> 
+class property_merge_45;The property algorithm computes the n-layer
map overlay of input polygon sets.  Each input geometry is inserted along
with a property value.  The property type can be anything suitable for use
as an element of a std::set.  Multiple geometry objects can be separately
@@ -74,13 +87,13 @@
operation a fairly complex container is required.  Resulting geometries are
associated with unique subsets of property values of the input geometry. 
Two suitable containers for storing the result of a property merge operation
-are:std::map<std::set<property_type>, polygon_45_set_data<coordinate_type>
-> 
-std::map<std::vector<property_type>, polygon_45_set_data<coordinate_type> >
+are:std::map<std::set<property_type>, polygon_45_set_data<coordinate_type>
+> 
+std::map<std::vector<property_type>, polygon_45_set_data<coordinate_type> >
Example code property_merge_usage.cpp
- demonstrates using the n-layer map-overlay algorithm on polygon 90 data.<h2>Member Functions</h2>
-<table border="1" width="100%" id="table1">
- <tr>
+ demonstrates using the n-layer map-overlay algorithm on polygon 90 data.<h2>Member Functions</h2>
+<table id="table1" border="1" width="100%">
+ <tbody><tr>
 <td width="586">property_merge_45()</td>
 <td>Default constructor. </td>
 </tr>
@@ -91,7 +104,7 @@
 </tr>
 <tr>
 <td width="586">
-void insert(const polygon_45_set_data<coordinate_type>& ps, 
+void insert(const polygon_45_set_data<coordinate_type>& ps, 
      
const property_type& property)</td>
 <td>Insert a polygon set with an associated
@@ -100,8 +113,8 @@
 <tr>
 <td width="586">

-template <class GeoObjT> 
-void insert(const GeoObjT& geoObj, 
+template <class GeoObjT> 
+void insert(const GeoObjT& geoObj, 
      
const property_type& property)</td>
 <td>Insert a geometry object that is a refinement of polygon 45 set with
@@ -110,24 +123,24 @@
 <tr>
 <td width="586">

-template <typename result_type> 
+template <typename result_type> 
void merge(result_type& result)</td>
 <td>Accepts a container object that conforms to the expectations defined
 above.  Performs property merge and populates the container
 object.  O(n log n) runtime wrt. vertices + intersections.</td>
 </tr>
- </table>
- <tr>
+ </tbody></table>
+ </td></tr><tr>
<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" rules="none" frame="void" id="table2">
+<table class="docinfo" id="table2" frame="void" rules="none">
 <colgroup>
- <col class="docinfo-name"><col class="docinfo-content">
+ <col class="docinfo-name" /><col class="docinfo-content" />
 </colgroup>
- <tbody vAlign="top">
+ <tbody valign="top">
 <tr>
 <th class="docinfo-name">Copyright:</th>
 <td>Copyright © Intel Corporation 2008-2010.</td>
@@ -140,6 +153,6 @@
 <a class="reference" target="_top" href="http://www.boost.org/LICENSE_1_0.txt">
 http://www.boost.org/LICENSE_1_0.txt>)</td>
 </tr>
-</table>
+</tbody></table>

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

Modified: sandbox/gtl/doc/gtl_property_merge_90.htm
==============================================================================
--- sandbox/gtl/doc/gtl_property_merge_90.htm (original)
+++ sandbox/gtl/doc/gtl_property_merge_90.htm 2012-04-09 15:10:32 EDT (Mon, 09 Apr 2012)
@@ -1,15 +1,14 @@
<!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" 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"><head>
-<title>Boost Polygon Library: Property Merge 90</title>
- <meta http-equiv="content-type" content="text/html;charset=ISO-8859-1">
- 
-<table style="margin: 0pt; padding: 0pt; width: 100%;" border="0" cellpadding="0" cellspacing="0"><tbody><tr>
+--><title>Boost Polygon Library: Property Merge 90</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">
- <img border="0" src="images/boost.png" width="277" height="86"><a title="www.boost.org home page" href="http://www.boost.org/" tabindex="2" style="border: medium none ;">
+ <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;">
@@ -37,20 +36,34 @@
 <li>Property Merge 90</li>
 <li>Property Merge 45</li>
 <li>Property Merge</li>
+ <li><a href="voronoi_main.htm">Voronoi Main Page 
+</a></li>
+ <li>Voronoi Benchmark 
+ </li>
+ <li>Voronoi Builder</li>
+ <li><a href="voronoi_diagram.htm">Voronoi Diagram 
+</a></li>
+ <li>Voronoi Predicates</li>
+ <li>Voronoi Robust FPT 
+ </li>
+ <li>Voronoi Utils</li>
+
 </ul>
 <h3 class="navbar">Other Resources</h3>
 <ul>
- <li>GTL Boostcon 2009 Paper</li>
- <li><a href="GTL_boostcon_draft03.htm">GTL Boostcon 2009
+ <li>GTL Boostcon 2009 Paper</li>
+ <li><a href="GTL_boostcon_draft03.htm">GTL Boostcon 2009
 Presentation</a></li>
- <li>Performance Analysis</li>
- <li>Layout Versus Schematic Tutorial</li>
- <li>Minkowski Sum Tutorial</li>
- </ul>
+ <li>Performance Analysis</li>
+ <li>Layout Versus Schematic Tutorial</li>
+ <li>Minkowski Sum Tutorial</li>
+ <li>Voronoi Basic Tutorial</li>
+ <li>Voronoi Advanced Tutorial</li>
+</ul>
 </div>
 <h3 class="navbar">Polygon Sponsor</h3>
 <div style="padding: 5px;" align="center">
- <img border="0" src="images/intlogo.gif" width="127" height="51"><a title="www.adobe.com home page" href="http://www.adobe.com/" tabindex="2" style="border: medium none ;">
+ <img src="images/intlogo.gif" border="0" height="51" width="127" /><a title="www.adobe.com home page" href="http://www.adobe.com/" tabindex="2" style="border: medium none ;">
 </a>
 </div>
</td>
@@ -58,15 +71,15 @@



- 
+ 

<h1>Property Merge 90</h1>


-The following is the declaration of the property merge algorithm.
+The following is the declaration of the property merge algorithm.
template <typename coordinate_type, typename
-property_type> 
-class property_merge_90;The property algorithm computes the n-layer
+property_type> 
+class property_merge_90;The property algorithm computes the n-layer
map overlay of input polygon sets.  Each input geometry is inserted along
with a property value.  The property type can be anything suitable for use
as an element of a std::set.  Multiple geometry objects can be separately
@@ -74,13 +87,13 @@
operation a fairly complex container is required.  Resulting geometries are
associated with unique subsets of property values of the input geometry. 
Two suitable containers for storing the result of a property merge operation
-are:std::map<std::set<property_type>, polygon_90_set_data<coordinate_type>
-> 
-std::map<std::vector<property_type>, polygon_90_set_data<coordinate_type> >
+are:std::map<std::set<property_type>, polygon_90_set_data<coordinate_type>
+> 
+std::map<std::vector<property_type>, polygon_90_set_data<coordinate_type> >
Example code property_merge_usage.cpp
- demonstrates using the n-layer map-overlay algorithm on polygon 90 data.<h2>Member Functions</h2>
-<table border="1" width="100%" id="table1">
- <tr>
+ demonstrates using the n-layer map-overlay algorithm on polygon 90 data.<h2>Member Functions</h2>
+<table id="table1" border="1" width="100%">
+ <tbody><tr>
 <td width="586">property_merge_90()</td>
 <td>Default constructor. </td>
 </tr>
@@ -91,7 +104,7 @@
 </tr>
 <tr>
 <td width="586">
-void insert(const polygon_90_set_data<coordinate_type>& ps, 
+void insert(const polygon_90_set_data<coordinate_type>& ps, 
      
const property_type& property)</td>
 <td>Insert a polygon set with an associated
@@ -100,8 +113,8 @@
 <tr>
 <td width="586">

-template <class GeoObjT> 
-void insert(const GeoObjT& geoObj, 
+template <class GeoObjT> 
+void insert(const GeoObjT& geoObj, 
      
const property_type& property)</td>
 <td>Insert a geometry object that is a refinement of polygon 90 set with
@@ -110,24 +123,24 @@
 <tr>
 <td width="586">

-template <typename result_type> 
+template <typename result_type> 
void merge(result_type& result)</td>
 <td>Accepts a container object that conforms to the expectations defined
 above.  Performs property merge and populates the container
 object.  O(n log n) runtime wrt. vertices + intersections.</td>
 </tr>
- </table>
- <tr>
+ </tbody></table>
+ </td></tr><tr>
<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" rules="none" frame="void" id="table2">
+<table class="docinfo" id="table2" frame="void" rules="none">
 <colgroup>
- <col class="docinfo-name"><col class="docinfo-content">
+ <col class="docinfo-name" /><col class="docinfo-content" />
 </colgroup>
- <tbody vAlign="top">
+ <tbody valign="top">
 <tr>
 <th class="docinfo-name">Copyright:</th>
 <td>Copyright © Intel Corporation 2008-2010.</td>
@@ -140,6 +153,6 @@
 <a class="reference" target="_top" href="http://www.boost.org/LICENSE_1_0.txt">
 http://www.boost.org/LICENSE_1_0.txt>)</td>
 </tr>
-</table>
+</tbody></table>

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

Modified: sandbox/gtl/doc/gtl_rectangle_concept.htm
==============================================================================
--- sandbox/gtl/doc/gtl_rectangle_concept.htm (original)
+++ sandbox/gtl/doc/gtl_rectangle_concept.htm 2012-04-09 15:10:32 EDT (Mon, 09 Apr 2012)
@@ -1,15 +1,14 @@
<!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" 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"><head>
-<title>Boost Polygon Library: Rectangle Concept</title>
- <meta http-equiv="content-type" content="text/html;charset=ISO-8859-1">
- 
-<table style="margin: 0pt; padding: 0pt; width: 100%;" border="0" cellpadding="0" cellspacing="0"><tbody><tr>
+--><title>Boost Polygon Library: Rectangle 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">
- <img border="0" src="images/boost.png" width="277" height="86"><a title="www.boost.org home page" href="http://www.boost.org/" tabindex="2" style="border: medium none ;">
+ <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;">
@@ -37,6 +36,18 @@
 <li>Property Merge 90</li>
 <li>Property Merge 45</li>
 <li>Property Merge</li>
+ <li><a href="voronoi_main.htm">Voronoi Main Page 
+</a></li>
+ <li>Voronoi Benchmark 
+ </li>
+ <li>Voronoi Builder</li>
+ <li><a href="voronoi_diagram.htm">Voronoi Diagram 
+</a></li>
+ <li>Voronoi Predicates</li>
+ <li>Voronoi Robust FPT 
+ </li>
+ <li>Voronoi Utils</li>
+
 </ul>
 <h3 class="navbar">Other Resources</h3>
 <ul>
@@ -46,11 +57,14 @@
 <li>Performance Analysis</li>
 <li>Layout Versus Schematic Tutorial</li>
 <li>Minkowski Sum Tutorial</li>
+ <li>Voronoi Basic Tutorial</li>
+ <li>Voronoi Advanced Tutorial</li>
+
 </ul>
 </div>
 <h3 class="navbar">Polygon Sponsor</h3>
 <div style="padding: 5px;" align="center">
- <img border="0" src="images/intlogo.gif" width="127" height="51"><a title="www.adobe.com home page" href="http://www.adobe.com/" tabindex="2" style="border: medium none ;">
+ <img src="images/intlogo.gif" border="0" height="51" width="127" /><a title="www.adobe.com home page" href="http://www.adobe.com/" tabindex="2" style="border: medium none ;">
 </a>
 </div>
</td>
@@ -58,20 +72,20 @@



- 
+ 

<h1>Rectangle Concept</h1>


-The rectangle concept tag is 
+The rectangle concept tag is 
rectangle_concept

To register a user defined type as a model of
rectangle concept, specialize the
geometry concept meta-function for that type.  In the example below CRectangle is registered as a model of
-rectangle  concept.
-template <> 
-struct geometry_concept<CRectangle> { typedef rectangle_concept type; };
+rectangle  concept.
+template <> 
+struct geometry_concept<CRectangle> { typedef rectangle_concept type; };
The semantic of a rectangle is that it has an x and
a y interval and these intervals conform to the semantic of an interval
including its invariant.  This invariant on the intervals of a rectangle is enforced by the generic library functions that
@@ -79,7 +93,7 @@
mapping of that data type to the rectangle concept through its traits.  In
this way a boost::tuple<int, int, int, int> or boost::array<int, 4>
could be made models of rectangle by simply providing indirect access to their
-elements through traits.
+elements through traits.
Below is shown the default rectangle traits. 
Specialization of these traits is required for types that don't conform to the
default behavior.  The interested reader will note SFINAE is used on the
@@ -88,103 +102,104 @@
necessary when refinements of concepts are used and it is undesirable to attempt
to match default traits to non-rectangle types at compile time. 
Specializing rectangle_traits can be done easily by simply providing gtl_yes as
-the enable parameter.
-template <typename T, typename enable = gtl_yes> 
-struct rectangle_traits {};
-template <typename T> 
-struct rectangle_traits<T, gtl_no> {}; 
- 
-template <typename T> 
+the enable parameter.
+template <typename T, typename enable = gtl_yes> 
+struct rectangle_traits {};
+template <typename T> 
+struct rectangle_traits<T, gtl_no> {}; 
+ 
+template <typename T> 
struct rectangle_traits<T, typename gtl_same_type<typename T::interval_type,
-typename T::interval_type>::type> { 
-     typedef typename T::coordinate_type coordinate_type; 
-     typedef typename T::interval_type interval_type; 
+typename T::interval_type>::type> { 
+     typedef typename T::coordinate_type coordinate_type; 
+     typedef typename T::interval_type interval_type; 
     static inline interval_type get(const T& rectangle,
-orientation_2d orient) { 
+orientation_2d orient) { 
          return
-rectangle.get(orient); } 
-}; 
- 
-template <typename T> 
-struct rectangle_mutable_traits { 
-     template <typename T2> 
+rectangle.get(orient); } 
+}; 
+ 
+template <typename T> 
+struct rectangle_mutable_traits { 
+     template <typename T2> 
     static inline void set(T& rectangle, orientation_2d
-orient, const T2& interval) { 
+orient, const T2& interval) { 
          rectangle.set(orient,
-interval); } 
-     template <typename T2, typename T3> 
+interval); } 
+     template <typename T2, typename T3> 
     static inline T construct(const T2& interval_horizontal,
-const T3& interval_vertical) { 
+const T3& interval_vertical) { 
          return
-T(interval_horizontal, interval_vertical); } 
-};<h2>Functions</h2>
-<table border="1" width="100%" id="table1">
- <tr>
- <td width="586">template <typename T> 
+T(interval_horizontal, interval_vertical); } 
+};<h2>Functions</h2>
+<table id="table1" border="1" width="100%">
+ <tbody><tr>
+ <td width="586">template <typename T> 
 interval_type get(const T& rectangle, orientation_2d)</td>
 <td>Expects a model of rectangle. 
 Returns the x interval or y interval of the rectangle, depending on the
- orientation_2d value. 
+ orientation_2d value. 
 </td>
 </tr>
 <tr>
 <td width="586">template <typename T, typename
- coordinate_type> 
+ coordinate_type> 
 void set(T& rectangle, orientation_2d, coordinate_type)</td>
 <td>Expects a model of rectangle.  
 Sets the x interval or y interval of the rectangle to the
 coordinate, depending on the orientation_2d value.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 interval_type get(const T& rectangle, orientation_2d,
-                   direction_1d)</td>
- <td>Expects a model of rectangle. 
- Returns the coordinate specificed by the direction_1d value of the x interval or y interval of the rectangle, depending on the
- orientation_2d value. 
+                   direction_1d)</td>
+ <td>Expects
+a model of rectangle.  Returns the coordinate specificed by the
+direction_1d value of the x interval or y interval of the rectangle,
+depending on the orientation_2d value. 
 </td>
 </tr>
 <tr>
 <td width="586">template <typename T, typename
- coordinate_type> 
- void set(T& rectangle, orientation_2d, direction_1d,          coordinate_type)</td>
+ coordinate_type> 
+ void set(T& rectangle, orientation_2d, direction_1d,          coordinate_type)</td>
 <td>Expects a model of rectangle.  
 Sets the coordinate specified by the direction_1d value of the x interval or y interval of the rectangle to the
 coordinate, depending on the orientation_2d value.</td>
 </tr>
 <tr>
 <td width="586">template <typename T, typename
- T2> 
+ T2> 
 T construct(const T2& h, const T2& v)</td>
 <td>Construct an object that is a model of rectangle given x interval
 and y intervals.</td>
 </tr>
 <tr>
 <td width="586">template <typename T, typename
- T2> 
- T construct(coordinate_type xl, coordinate_type yl,             coordinate_type
+ T2> 
+ T construct(coordinate_type xl, coordinate_type yl,             coordinate_type
 xh, coordinate_type yh)</td>
 <td>Construct an object that is a model of rectangle given four coordinate values.</td>
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& assign(T1& left, const T2& right)</td>
 <td>Copies data from right object that models rectangle into left object
 that models rectangle.</td>
 </tr>
 <tr>
 <td width="586">template <typename T, typename
- T2> 
+ T2> 
 bool equivalence(const T& rectangle1, 
-                  const T2& rectangle2)</td>
+                  const T2& rectangle2)</td>
 <td>Given two objects that model rectangle, compares and returns true if
 their x and y intervals are respectively equivalent.</td>
 </tr>
 <tr>
 <td width="586">template <typename T,
- typename point_type> 
- bool contains(const T&, const point_type& point, 
+ typename point_type> 
+ bool contains(const T&, const point_type& point, 
             
 bool consider_touch=true)</td>
 <td>Given an object that models rectangle and an object that models
@@ -195,8 +210,8 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
- bool contains(const T1& a, const T2& b, 
+ T2> 
+ bool contains(const T1& a, const T2& b, 
             
 bool consider_touch = true) </td>
 <td>Returns true if model of rectangle a contains both intervals of
@@ -204,170 +219,174 @@
 consider rectangle b contained even if it touches the boundary of a.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 interval_type horizontal(const T& rectangle)</td>
 <td>Returns the x interval of an object that models rectangle.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 interval_type vertical(const T& rectangle)</td>
 <td>Returns the y interval of an object that models rectangle.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 coordinate_type xl(const T& rectangle)</td>
 <td>Returns the west coordinate of an object that models rectangle.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 coordinate_type xh(const T& rectangle)</td>
 <td>Returns the east coordinate of an object that models rectangle.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 coordinate_type yl(const T& rectangle)</td>
 <td>Returns the south coordinate of an object that models rectangle.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 coordinate_type yh(const T& rectangle)</td>
 <td>Returns the north coordinate of an object that models rectangle.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 point_type ll(const T& rectangle)</td>
 <td>Returns the lower left corner point of an object that models rectangle.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 point_type lr(const T& rectangle)</td>
 <td>Returns the lower right corner point of an object that models rectangle.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 point_type ul(const T& rectangle)</td>
 <td>Returns the upper left corner point of an object that models rectangle.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 point_type ur(const T& rectangle)</td>
 <td>Returns the upper right corner point of an object that models rectangle.</td>
 </tr>
 <tr>
- <td width="586">// get the center coordinate 
- template <typename T, typename point_type> 
+ <td width="586">// get the center coordinate 
+ template <typename T, typename point_type> 
 void center(point_type& p, const T& rectangle)</td>
 <td>Sets object that models point to the center point of an object that models rectangle.</td>
 </tr>
 <tr>
 <td width="586">template <typename T,
- typename interval_type> 
+ typename interval_type> 
 void horizontal(T& rectangle, const interval_type& i)</td>
 <td>Sets the x interval of the object that models rectangle to be equal
 to the value of an object that models interval.</td>
 </tr>
 <tr>
 <td width="586">template <typename T,
- typename interval_type> 
+ typename interval_type> 
 void vertical(T& rectangle, const interval_type& i )</td>
 <td>Sets the y interval of the object that models rectangle to be equal
 to the value of an object that models interval.</td>
 </tr>
 <tr>
 <td width="586">template <typename
- rectangle_type> 
+ rectangle_type> 
 void xl(rectangle_type& rectangle, coordinate_type )</td>
 <td>Sets the west coordinate of the object that models rectangle to be equal
 to the coordinate value.</td>
 </tr>
 <tr>
 <td width="586">template <typename
- rectangle_type> 
+ rectangle_type> 
 void xh(rectangle_type& rectangle, coordinate_type )</td>
 <td>Sets the east coordinate of the object that models rectangle to be equal
 to the coordinate value.</td>
 </tr>
 <tr>
 <td width="586">template <typename
- rectangle_type> 
+ rectangle_type> 
 void yl(rectangle_type& rectangle, coordinate_type )</td>
 <td>Sets the south coordinate of the object that models rectangle to be equal
 to the coordinate value.</td>
 </tr>
 <tr>
 <td width="586">template <typename
- rectangle_type> 
+ rectangle_type> 
 void yh(rectangle_type& rectangle, coordinate_type )</td>
 <td>Sets the north coordinate of the object that models rectangle to be equal
 to the coordinate value.</td>
 </tr>
 <tr>
 <td width="586">template <typename T,
- typename T1, typename T2> 
+ typename T1, typename T2> 
 T& set_points(T& rectangle, const T1& p1, const T2& p2)</td>
 <td>Sets the rectangle to the rectangle fully described by the points p1
 and p2.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 coordinate_difference delta(const T& rectangle,
-                             orientation_2d)</td>
+                            
+orientation_2d)</td>
 <td>Returns the delta of the interval specified by orientation_2d of an object
 that models rectangle.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 manhattan_area_type area(const T& rectangle)</td>
 <td>Returns the area of an object
 that models rectangle.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 coordinate_difference half_perimeter(const T& rectangle)</td>
 <td>Returns the length plus width of an object
 that models rectangle.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 coordinate_difference perimeter(const T& rectangle)</td>
 <td>Returns the perimeter length of an object
 that models rectangle.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 orientation_2d quess_orientation(const T& rectangle)</td>
 <td>Returns the orientation in which the rectangle has a longer delta. 
 Returns HORIZONTAL if the rectangle is a square.</td>
 </tr>
 <tr>
 <td width="586">template <typename
- rectangle_type> 
- rectangle_type& transform(rectangle_type& rectangle, 
-                          coordinate_type axis = 0)</td>
+ rectangle_type> 
+ rectangle_type& transform(rectangle_type& rectangle, 
+                         
+coordinate_type axis = 0)</td>
 <td>Applies transform() on the two points that fully describe the
 rectangle and sets the rectangle to that described by the result of
 transforming those points.</td>
 </tr>
 <tr>
 <td width="586">template <typename
- rectangle_type> 
- rectangle_type& scale_up(rectangle_type& rectangle, 
-                         unsigned_area_type factor)</td>
+ rectangle_type> 
+ rectangle_type& scale_up(rectangle_type& rectangle, 
+                        
+unsigned_area_type factor)</td>
 <td>Scales up x interval and y interval  of an object that models
 rectangle by unsigned factor.</td>
 </tr>
 <tr>
 <td width="586">template <typename
- rectangle_type> 
- rectangle_type& scale_down(rectangle_type& rectangle, 
-                           unsigned_area_type factor)</td>
+ rectangle_type> 
+ rectangle_type& scale_down(rectangle_type& rectangle, 
+                          
+unsigned_area_type factor)</td>
 <td>Scales down x interval and y interval  of an object that models
 rectangle by unsigned factor.</td>
 </tr>
 <tr>
 <td width="586">template <typename
- rectangle_type, scaling_type> 
- rectangle_type& scale(rectangle_type& rectangle, 
+ rectangle_type, scaling_type> 
+ rectangle_type& scale(rectangle_type& rectangle, 
                     
 const scaling_type& scaling) </td>
 <td>Applies scale() on the two points that fully describe the rectangle
@@ -375,33 +394,33 @@
 those points.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
- T& move(T& rectangle, orientation_2d, 
+ <td width="586">template <typename T> 
+ T& move(T& rectangle, orientation_2d, 
        coordinate_difference displacement)</td>
 <td>Adds displacement value to interval indicated by orientation_2d of an
 object that models rectangle.</td>
 </tr>
 <tr>
 <td width="586">template <typename
- rectangle_type, typename point_type> 
- rectangle_type& convolve(rectangle_type& rectangle, 
-                        
- const point_type& point)</td>
+ rectangle_type, typename point_type> 
+ rectangle_type& convolve(rectangle_type& rectangle, 
+                        
+const point_type& point)</td>
 <td>Convolves coordinate values of point with x interval and y interval  of an
 object that models rectangle.</td>
 </tr>
 <tr>
 <td width="586">template <typename
- rectangle_type, typename point_type> 
- rectangle_type& deconvolve(rectangle_type& rectangle, 
-                          
- const point_type& point)</td>
+ rectangle_type, typename point_type> 
+ rectangle_type& deconvolve(rectangle_type& rectangle, 
+                          
+const point_type& point)</td>
 <td>Deconvolves coordinate values of point withx interval and y interval  of
 an object that models rectangle.</td>
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& convolve(T1& a, const T2& b)</td>
 <td>Convolves x interval  of b with x interval  of a and
 convolves y
@@ -409,14 +428,14 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& deconvolve(T1& a, const T2& b)</td>
 <td>Deconvolves x interval  of b with x interval  of a and
 deconvolves y interval  of b with y interval  of a. </td>
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& reflected_convolve(T1& a, const T2& b)</td>
 <td>Reflected convolves y interval  of b with x interval  of a and
 reflected convolves x
@@ -424,15 +443,15 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T1& reflected_deconvolve(T1& a, const T2& b)</td>
 <td>Reflected deconvolves y interval  of b with x interval  of a and
 reflected deconvolves x interval  of b with y interval  of a.</td>
 </tr>
 <tr>
 <td width="586">template <typename T,
- typename point_type> 
- coordinate_difference euclidean_distance(const T&, 
+ typename point_type> 
+ coordinate_difference euclidean_distance(const T&, 
        const point_type& point,
 orienation_2d)</td>
 <td>Returns the distance from an object that models rectangle to an
@@ -441,8 +460,8 @@
 </tr>
 <tr>
 <td width="586">template <typename T1,
- typename T2> 
- coordinate_difference euclidean_distance(const T1& a, 
+ typename T2> 
+ coordinate_difference euclidean_distance(const T1& a, 
        const T2& b, orienation_2d)</td>
 <td>Returns the distance from an object that models rectangle to an
 object that models rectangle along the given orientation.  Returns
@@ -450,8 +469,8 @@
 </tr>
 <tr>
 <td width="586">template <typename T,
- typename point_type> 
- coordinate_difference square_euclidean_distance(const T&, 
+ typename point_type> 
+ coordinate_difference square_euclidean_distance(const T&, 
        const point_type& point)</td>
 <td>Returns the square of the Euclidean distance between a point and a
 rectangle.  Returns zero if the point is contained within the
@@ -459,50 +478,50 @@
 </tr>
 <tr>
 <td width="586">template <typename T1,
- typename T2> 
- coordinate_difference square_euclidean_distance 
+ typename T2> 
+ coordinate_difference square_euclidean_distance 
        (const T1& a, const T2& b)</td>
 <td>Returns the square of the Euclidean distance between rectangles a
 and b.  Returns zero if the rectangles intersect.</td>
 </tr>
 <tr>
 <td width="586">template <typename T,
- typename point_type> 
- coordinate_difference manhattan_distance(const T&, 
+ typename point_type> 
+ coordinate_difference manhattan_distance(const T&, 
        const point_type& point)</td>
 <td>Returns the Manhattan distance between a point and a rectangle. 
 Returns zero if the point is contained within the rectangle.</td>
 </tr>
 <tr>
 <td width="586">template <typename T1,
- typename T2> 
- coordinate_difference manhattan_distance(const T1& a, 
-                                         
- const T2& b)</td>
+ typename T2> 
+ coordinate_difference manhattan_distance(const T1& a, 
+                                        
+const T2& b)</td>
 <td>Returns the Manhattan distance between rectangles a and b. 
 Returns zero if the rectangles intersect.</td>
 </tr>
 <tr>
 <td width="586">template <typename T,
- typename point_type> 
- coordinate_distance euclidean_distance(const T&, 
+ typename point_type> 
+ coordinate_distance euclidean_distance(const T&, 
        const point_type& point)</td>
 <td>Returns the Euclidean distance between a point and a rectangle. 
 Returns zero if the point is contained within the rectangle.</td>
 </tr>
 <tr>
 <td width="586">template <typename T1,
- typename T2> 
- coordinate_distance euclidean_distance(const T1& a, 
-                                         
- const T2& b)</td>
+ typename T2> 
+ coordinate_distance euclidean_distance(const T1& a, 
+                                        
+const T2& b)</td>
 <td>Returns the Euclidean distance between rectangles a and b. 
 Returns zero if the rectangles intersect.</td>
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
- bool intersects(const T1& a, const T2& b, 
+ T2> 
+ bool intersects(const T1& a, const T2& b, 
               
 bool consider_touch = true)</td>
 <td>Returns true if two objects that model rectangle overlap.  If
@@ -511,10 +530,10 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
- bool boundaries_intersect(const T1& a, const T2& b, 
-                         
- bool consider_touch = true)</td>
+ T2> 
+ bool boundaries_intersect(const T1& a, const T2& b, 
+                         
+bool consider_touch = true)</td>
 <td>Returns true is two objects that model rectangle partially overlap
 such that one there is an intersection between the edges of the two
 rectangles  If the consider_touch flag is true a coordinate is
@@ -523,8 +542,8 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
- bool abuts(const T1& a, const T2& b, 
+ T2> 
+ bool abuts(const T1& a, const T2& b, 
           direction_2d dir)
 </td>
 <td>Returns true if rectangle b abuts but down not overlap rectangle a
@@ -532,8 +551,8 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
- bool abuts(const T1& a, const T2& b, 
+ T2> 
+ bool abuts(const T1& a, const T2& b, 
           orientation_2d)
 </td>
 <td>Returns true if rectangle b abuts but down not overlap rectangle a
@@ -541,15 +560,15 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 bool abuts(const T1& a, const T2& b)</td>
 <td>Returns true if rectangle b abuts but down not overlap rectangle a
 on any side.</td>
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
- bool intersect(T1& a, const T2& b, orientation_2d 
+ T2> 
+ bool intersect(T1& a, const T2& b, orientation_2d 
              
 bool consider_touch = true) </td>
 <td>Sets rectangle a to the intersection of rectangle a and interval b
@@ -560,8 +579,8 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
- bool intersect(T1& a, const T2& b, 
+ T2> 
+ bool intersect(T1& a, const T2& b, 
              
 bool consider_touch = true) </td>
 <td>Sets rectangle a to the intersection of rectangle a and rectangle b
@@ -571,84 +590,84 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 T& generalized_intersect(T1& a, const T2& b)</td>
 <td>Same as intersect, but if they do not intersect set a to the
 rectangle between a and b by applying generalized_intersect() on the
 intervals of the rectangles.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 T& bloat(T& rectangle, coordinate_type)</td>
 <td>Bloats x and y intervals of rectangle by coordinate value.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 T& bloat(T& rectangle, direction_2d, coordinate_type)</td>
 <td>Bloats side of rectangle specified by direction_2d by coordinate
 value.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 T& bloat(T& rectangle, orientation_2d, coordinate_type)</td>
 <td>Bloats interval of rectangle specified by orientation_2d by
 coordinate value.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 T& shrink(T& rectangle, coordinate_type)</td>
 <td>Shrinks x and y intervals of rectangle by coordinate value.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 T& shrink(T& rectangle, direction_2d, coordinate_type)</td>
 <td>Shrinks side of rectangle specified by direction_2d by coordinate
 value.</td>
 </tr>
 <tr>
- <td width="586">template <typename T> 
+ <td width="586">template <typename T> 
 T& shrink(T& rectangle, orientation_2d, coordinate_type)</td>
 <td>Shrinks interval of rectangle specified by orientation_2d by
 coordinate value.</td>
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
+ T2> 
 bool encompass(T1& a, const T2& b)</td>
 <td>The x and y intervals of a are set to encompass the x and y
 intervals of b respectively.</td>
 </tr>
 <tr>
 <td width="586">template <typename T, typename
- point_type> 
+ point_type> 
 bool encompass(T& rectangle, const point_type& point)</td>
 <td>The x and y intervals of rectangle are set to encompass the x and y
 coordinates of point respectively.</td>
 </tr>
 <tr>
 <td width="586">template <typename T, typename
- interval_type> 
+ interval_type> 
 bool encompass(T& rectangle, const interval_type& i,
-                orientation_2d)</td>
+                orientation_2d)</td>
 <td>The interval of rectangle specified by orientation_2d is set to encompass the
 interval i.</td>
 </tr>
 <tr>
 <td width="586">template <typename T, typename
- point_type> 
+ point_type> 
 bool get_corner(point_type& point, const T& rectangle, 
-                
+                
 direction_2d, direction_1d)</td>
 <td>Sets point to the corner of the rectangle you reach if you look at
 its side specified by direction_2d from within the rectangle and turn in
 the direction_1d direction (low == left, high = right).  Always
 returns true.</td>
 </tr>
-</table>
+</tbody></table>
 <h1>Rectangle Data</h1>


-The library provides a model of rectangle concept declared
+The library provides a model of rectangle concept declared

template<typename T> rectangle_data where T is the coordinate type.
This data type is used internally when a rectangle is needed and is available
@@ -656,8 +675,8 @@
instead of providing their own.  The data type is implemented to be
convenient to use with the library traits.
<h2>Members</h2>
-<table border="1" width="100%" id="table2">
- <tr>
+<table id="table2" border="1" width="100%">
+ <tbody><tr>
 <td width="586">geometry_type</td>
 <td>rectangle_concept</td>
 </tr>
@@ -677,8 +696,8 @@
 </tr>
 <tr>
 <td width="586">template <typename T1, typename
- T2> 
- rectangle_data(const T1& horizontal_interval, 
+ T2> 
+ rectangle_data(const T1& horizontal_interval, 
              
 const T2& vertical_interval)</td>
 <td>Constructs a rectangle with two objects
@@ -696,19 +715,19 @@
 </tr>
 <tr>
 <td width="586">template <typename T2>
- rectangle_data& 
+ rectangle_data& 
 operator=(const T2& that) const</td>
 <td>Assign from an object that is a model of rectangle.</td>
 </tr>
 <tr>
 <td width="586">template <typename T2>
- bool
+ bool
 operator==(const T2& that) const</td>
 <td>Compare equality to an object that is a model of rectangle.</td>
 </tr>
 <tr>
 <td width="586">template <typename T2>
- bool
+ bool
 operator!=(const T2& that) const</td>
 <td>Compare inequality to an object that is a model of rectangle.</td>
 </tr>
@@ -718,15 +737,15 @@
 <td>Get the interval in the given orientation.</td>
 </tr>
 <tr>
- <td width="586">template <typename T2> 
+ <td width="586">template <typename T2> 
 void set(orientation_2d orient, const T2& value)</td>
 <td>Sets the interval in the given orientation to the value of an object
 that models interval.</td>
 </tr>
- </table>
- <tr>
+ </tbody></table>
+ </td></tr><tr>
<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%">

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

Next message: sydorchuk.andriy_at_[hidden]: "[Boost-commit] svn:boost r77859 - sandbox/gtl/libs/polygon/benchmark/benchmark_results"
Previous message: vicente.botet_at_[hidden]: "[Boost-commit] svn:boost r77857 - trunk/libs/thread/test"

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