Boost logo

Boost-Commit :

Subject: [Boost-commit] svn:boost r77619 - sandbox/gtl/doc
From: sydorchuk.andriy_at_[hidden]
Date: 2012-03-28 17:42:53


Author: asydorchuk
Date: 2012-03-28 17:42:53 EDT (Wed, 28 Mar 2012)
New Revision: 77619
URL: http://svn.boost.org/trac/boost/changeset/77619

Log:
Adding Voronoi advanced tutorial documentation page (not finished yet).

Added:
   sandbox/gtl/doc/voronoi_advanced_tutorial.htm (contents, props changed)
Text files modified:
   sandbox/gtl/doc/voronoi_basic_tutorial.htm | 19 +++++++++++++------
   1 files changed, 13 insertions(+), 6 deletions(-)

Added: sandbox/gtl/doc/voronoi_advanced_tutorial.htm
==============================================================================
--- (empty file)
+++ sandbox/gtl/doc/voronoi_advanced_tutorial.htm 2012-03-28 17:42:53 EDT (Wed, 28 Mar 2012)
@@ -0,0 +1,63 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
+<html><head>
+
+
+
+
+
+
+
+<meta http-equiv="Content-Type" content="text/html; charset=windows-1252"><title>Polygon Usage</title></head><body>
+
+<h1>Voronoi Advanced Tutorial<br>
+</h1>This tutorial consists of two parts. The first one provides three
+examples of a real world problems that default configuration of Voronoi
+library solves. By default configuration we mean the one that accepts
+signed 32-bit integer coordinates and outputs floating-point (64-bit
+double) coordinates. We provide those examples to convience even the
+most sceptical users that they probably don't need to configure library
+for higher-precision input or output coordinate types. However if the
+posed problem really requires those, fully featured configuration of
+both input and output coordinate types is provided in the second part
+of this tutorial.<br>
+<h2>Three Examples<br>
+</h2>
+In three chapters below we explain three different areas of application
+of Voronoi diagram. Each of the examples covers following topics:<br>
+<ul>
+ <li>Problem statement</li>
+ <li>Application of Voronoi diagram<br>
+ </li>
+ <li>Discretization of input geometries<br>
+ </li>
+ <li>Precision of output geometries</li>
+</ul>
+<h3>Red Planet</h3>
+<h3>VLSI Design</h3>
+<h3>Smart AI</h3>
+
+
+<h2>Voronoi Coordinate Types Configuration<br>
+</h2>
+
+<span style="font-family: Courier New,Courier,monospace;"></span><br>
+<table class="docinfo" id="table1" frame="void" rules="none">
+ <colgroup>
+ <col class="docinfo-name"><col class="docinfo-content">
+ </colgroup>
+ <tbody valign="top">
+ <tr>
+ <th class="docinfo-name">Copyright:</th>
+ <td>Copyright © Intel Corporation 2008-2010.</td>
+ </tr>
+ <tr class="field">
+ <th class="docinfo-name">License:</th>
+ <td class="field-body">Distributed under the Boost Software License,
+ Version 1.0. (See accompanying file <tt class="literal">
+ <span class="pre">LICENSE_1_0.txt</span></tt> or copy at
+ <a class="reference" target="_top" href="http://www.boost.org/LICENSE_1_0.txt">
+ http://www.boost.org/LICENSE_1_0.txt>)</td>
+ </tr>
+</tbody></table>
+
+</body></html>
\ No newline at end of file

Modified: sandbox/gtl/doc/voronoi_basic_tutorial.htm
==============================================================================
--- sandbox/gtl/doc/voronoi_basic_tutorial.htm (original)
+++ sandbox/gtl/doc/voronoi_basic_tutorial.htm 2012-03-28 17:42:53 EDT (Wed, 28 Mar 2012)
@@ -6,6 +6,7 @@
 
 
 
+
 <meta http-equiv="Content-Type" content="text/html; charset=windows-1252"><title>Polygon Usage</title></head><body>
 
 <h1>Voronoi Basic Tutorial<br>
@@ -40,7 +41,8 @@
 #include "boost/polygon/voronoi.hpp"<br>
 using boost::polygon;<br>
 </span>
-<h1>Preparing Input Geometries</h1>Before executing the algorithm lets see how the user provided types for
+<h2>Preparing Input Geometries</h2>
+Before executing the algorithm lets see how the user provided types for
 the input geometries might look like:<br>
 <br>
 <span style="font-family: Courier New,Courier,monospace;">class Point {<br>
@@ -81,8 +83,10 @@
 segments.push_back(Segment(-4, 5, 5, -1));<br>
 segments.push_back(Segment(3, -11, 13, -1));</span><span style="font-family: Courier New,Courier,monospace;"><br>
 </span>
-<h1>Construction of the Voronoi Diagram<br>
-</h1>
+<h2>Construction of the Voronoi Diagram<br>
+
+</h2>
+
 
 
 Now let's construct Voronoi diagram of the input set of points and segments:<br>
@@ -91,7 +95,8 @@
 construct_voronoi(points, segments, &amp;vd);<br>
 <br>
 </span>So brief, isn't that awesome!<br>
-<h1>Traversing Voronoi Graph</h1>
+<h2>Traversing Voronoi Graph</h2>
+
 At the next step we are going to traverse Voronoi graph and count the
 number of visited edges. There are three ways to do that and we are going to cover all of them:<br>
 <ul>
@@ -152,7 +157,8 @@
 be the same, it wouldn't for the third one. The reason is that in the
 last case we will iterate only once through the edges with a single
 finite endpoint and will skip all the edges with no finite endpoints.<br>
-<h1>Associating User Data with Voronoi Primitives</h1>
+<h2>Associating User Data with Voronoi Primitives</h2>
+
 A few simple cases of associating user data with Voronoi primitives are following:<br>
 <ul>
   <li>associating number of incident edges with each cell, vertex;</li>
@@ -181,7 +187,8 @@
 Note: In the example above we could not simply use count variable
 without a vector, because pointer to it will become invalid as soon as
 we leave the scope of enclosing for-loop.<br>
-<h1>Rendering Voronoi Diagram</h1>
+<h2>Rendering Voronoi Diagram</h2>
+
 There are two main issues that don't allow to strictly render resulting
 Voronoi diagram using such rendering tools as OpenGL or DirectX.
 Those are:<br>


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