[Boost-commit] svn:boost r81544 - in sandbox-branches/geometry/index: . doc/html doc/html/geometry_index/r_tree doc/rtree

Subject: [Boost-commit] svn:boost r81544 - in sandbox-branches/geometry/index: . doc/html doc/html/geometry_index/r_tree doc/rtree
From: adam.wulkiewicz_at_[hidden]
Date: 2012-11-25 16:56:13

Author: awulkiew
Date: 2012-11-25 16:56:12 EST (Sun, 25 Nov 2012)
New Revision: 81544
URL: http://svn.boost.org/trac/boost/changeset/81544

Log:
Small change in docs.
Properties modified: 
   sandbox-branches/geometry/index/   (props changed)
Text files modified: 
   sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/introduction.html |    17 ++++++++---------                       
   sandbox-branches/geometry/index/doc/html/index.html                              |     2 +-                                      
   sandbox-branches/geometry/index/doc/rtree/introduction.qbk                       |     9 ++++-----                               
   3 files changed, 13 insertions(+), 15 deletions(-)

Modified: sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/introduction.html
==============================================================================
--- sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/introduction.html	(original)
+++ sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/introduction.html	2012-11-25 16:56:12 EST (Sun, 25 Nov 2012)
@@ -51,15 +51,14 @@
       </p>
 <p>
         The R-tree is a self-balanced data structure. The key part of balancing algorithm
-        is node splitting algorithm [2]</sup></a> [3]</sup></a>. Each algorithm would produce different splits so the internal
-        structure of a tree may be different for each one of them. In general more
-        complex algorithms analyses elements better and produces less overlapping
-        nodes. This is a "better" split because later, in the searching
-        process less nodes must be traversed in order to find desired obejcts. On
-        the other hand more complex analysis takes more time. In general faster inserting
-        will result in slower searching and vice versa. Example structures of trees
-        created by use of three different algorithms and operations time are presented
-        below.
+        is node splitting algorithm [2]</sup></a> [3]</sup></a>. Each algorithm produces different splits so the internal structure
+        of a tree may be different for each one of them. In general more complex
+        algorithms analyses elements better and produces less overlapping nodes.
+        In the searching process less nodes must be traversed in order to find desired
+        obejcts. On the other hand more complex analysis takes more time. In general
+        faster inserting will result in slower searching and vice versa. Example
+        structures of trees created by use of three different algorithms and operations
+        time are presented below.
       </p>
 <div class="informaltable"><table class="table">
 <colgroup>

Modified: sandbox-branches/geometry/index/doc/html/index.html
==============================================================================
--- sandbox-branches/geometry/index/doc/html/index.html	(original)
+++ sandbox-branches/geometry/index/doc/html/index.html	2012-11-25 16:56:12 EST (Sun, 25 Nov 2012)
@@ -56,7 +56,7 @@
 </div>
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"><p><small>Last revised: November 25, 2012 at 21:34:09 GMT</small></p></td>
+<td align="left"><p><small>Last revised: November 25, 2012 at 21:53:32 GMT</small></p></td>
 <td align="right"><div class="copyright-footer"></div></td>
 </tr></table>
 <hr>

Modified: sandbox-branches/geometry/index/doc/rtree/introduction.qbk
==============================================================================
--- sandbox-branches/geometry/index/doc/rtree/introduction.qbk	(original)
+++ sandbox-branches/geometry/index/doc/rtree/introduction.qbk	2012-11-25 16:56:12 EST (Sun, 25 Nov 2012)
@@ -28,11 +28,10 @@
 The __rtree__ is a self-balanced data structure. The key part of balancing algorithm is node splitting algorithm
 [footnote Greene, D. (1989). /An implementation and performance analysis of spatial data access methods/]
 [footnote Beckmann, N.; Kriegel, H. P.; Schneider, R.; Seeger, B. (1990). /The R*-tree: an efficient and robust access method for points and rectangles/].
-Each algorithm would produce different splits so the internal structure of a tree may be different for each one of them.
-In general more complex algorithms analyses elements better and produces less overlapping nodes. This is a "better" split because
-later, in the searching process less nodes must be traversed in order to find desired obejcts. On the other hand more complex analysis
-takes more time. In general faster inserting will result in slower searching and vice versa. Example structures of trees created by use
-of three different algorithms and operations time are presented below.
+Each algorithm produces different splits so the internal structure of a tree may be different for each one of them.
+In general more complex algorithms analyses elements better and produces less overlapping nodes. In the searching process less nodes must be traversed
+in order to find desired obejcts. On the other hand more complex analysis takes more time. In general faster inserting will result in slower searching
+and vice versa. Example structures of trees created by use of three different algorithms and operations time are presented below.
 
 [table
 [[]         [linear algorithm] [quadratic algorithm] [R*-tree]]