Deploying to gh-pages from @ dfdaa76 🚀

index.xml

@@ -135,8 +135,7 @@ Go      gogeos  Haskell      geos hgeos  Javascript      node-geos  Julia      L
       <pubDate>Tue, 13 Aug 2024 00:00:00 +0000</pubDate>
 
       <guid>https://libgeos.org/posts/2024-08-13-relateng/</guid>
-      <description>The upcoming 3.13 release of GEOS includes a complete re-write of the &amp;ldquo;boolean predicates&amp;rdquo;, called &amp;ldquo;RelateNG&amp;rdquo;. The boolean predicates are pairwise tests for geometries that return true/false answers. &amp;ldquo;Intersects&amp;rdquo;, &amp;ldquo;Contains&amp;rdquo;, &amp;ldquo;Touches&amp;rdquo; are all examples of boolean predicates.
-The old implementation in JTS and GEOS operated by building a complete topological relationship graph between the two inputs, then reading the result off the graph. However, computing the whole graph every time is computationally expensive, and the results of many predicates can be determined without a full graph &amp;ndash; the first time you hit an edge intersection, you know that geometries intersect, and you do not need to do any more calculations.</description>
+      <description>&lt;p&gt;The upcoming 3.13 release of GEOS includes a complete re-write of the &amp;ldquo;boolean predicates&amp;rdquo;, called &amp;ldquo;RelateNG&amp;rdquo;. The boolean predicates are pairwise tests for geometries that return true/false answers.  &amp;ldquo;Intersects&amp;rdquo;, &amp;ldquo;Contains&amp;rdquo;, &amp;ldquo;Touches&amp;rdquo; are all examples of boolean predicates.&lt;/p&gt;</description>
     </item>
 
     <item>

posts/2024-08-13-relateng/index.html

@@ -12,8 +12,7 @@
 <meta name="generator" content="Hugo 0.88.1" />
 
 
-  <meta name="description" content="The upcoming 3.13 release of GEOS includes a complete re-write of the &ldquo;boolean predicates&rdquo;, called &ldquo;RelateNG&rdquo;. The boolean predicates are pairwise tests for geometries that return true/false answers. &ldquo;Intersects&rdquo;, &ldquo;Contains&rdquo;, &ldquo;Touches&rdquo; are all examples of boolean predicates.
-The old implementation in JTS and GEOS operated by building a complete topological relationship graph between the two inputs, then reading the result off the graph. However, computing the whole graph every time is computationally expensive, and the results of many predicates can be determined without a full graph &ndash; the first time you hit an edge intersection, you know that geometries intersect, and you do not need to do any more calculations." />
+  <meta name="description" content="The upcoming 3.13 release of GEOS includes a complete re-write of the &ldquo;boolean predicates&rdquo;, called &ldquo;RelateNG&rdquo;. The boolean predicates are pairwise tests for geometries that return true/false answers. &ldquo;Intersects&rdquo;, &ldquo;Contains&rdquo;, &ldquo;Touches&rdquo; are all examples of boolean predicates." />
 
     <title>RelateNG | GEOS</title>
 
@@ -39,8 +38,7 @@
     content="RelateNG"
   />
   <meta property="og:site_name" content="GEOS" />
-  <meta property="og:description" content="The upcoming 3.13 release of GEOS includes a complete re-write of the “boolean predicates”, called “RelateNG”. The boolean predicates are pairwise tests for geometries that return true/false answers. “Intersects”, “Contains”, “Touches” are all examples of boolean predicates.
-The old implementation in JTS and GEOS operated by building a complete topological relationship graph between the two inputs, then reading the result off the graph. However, computing the whole graph every time is computationally expensive, and the results of many predicates can be determined without a full graph – the first time you hit an edge intersection, you know that geometries intersect, and you do not need to do any more calculations." />
+  <meta property="og:description" content="The upcoming 3.13 release of GEOS includes a complete re-write of the “boolean predicates”, called “RelateNG”. The boolean predicates are pairwise tests for geometries that return true/false answers. “Intersects”, “Contains”, “Touches” are all examples of boolean predicates." />
 <meta property="og:type" content="article" />
 <meta property="og:url" content="https://libgeos.org/posts/2024-08-13-relateng/" />
 
@@ -57,8 +55,7 @@
 
   <meta name="twitter:card" content="summary" />
 <meta name="twitter:title" content="RelateNG" />
-  <meta name="twitter:description" content="The upcoming 3.13 release of GEOS includes a complete re-write of the “boolean predicates”, called “RelateNG”. The boolean predicates are pairwise tests for geometries that return true/false answers. “Intersects”, “Contains”, “Touches” are all examples of boolean predicates.
-The old implementation in JTS and GEOS operated by building a complete topological relationship graph between the two inputs, then reading the result off the graph. However, computing the whole graph every time is computationally expensive, and the results of many predicates can be determined without a full graph – the first time you hit an edge intersection, you know that geometries intersect, and you do not need to do any more calculations." />
+  <meta name="twitter:description" content="The upcoming 3.13 release of GEOS includes a complete re-write of the “boolean predicates”, called “RelateNG”. The boolean predicates are pairwise tests for geometries that return true/false answers. “Intersects”, “Contains”, “Touches” are all examples of boolean predicates." />
 
 
   <script type="application/ld+json">
@@ -69,7 +66,7 @@
       "name": "RelateNG",
       "url" : "https://libgeos.org/posts/2024-08-13-relateng/",
       "headline": "RelateNG",
-      "description": "The upcoming 3.13 release of GEOS includes a complete re-write of the “boolean predicates”, called “RelateNG”. The boolean predicates are pairwise tests for geometries that return true\/false answers. “Intersects”, “Contains”, “Touches” are all examples of boolean predicates.\nThe old implementation in JTS and GEOS operated by building a complete topological relationship graph between the two inputs, then reading the result off the graph. However, computing the whole graph every time is computationally expensive, and the results of many predicates can be determined without a full graph – the first time you hit an edge intersection, you know that geometries intersect, and you do not need to do any more calculations.",
+      "description": "The upcoming 3.13 release of GEOS includes a complete re-write of the “boolean predicates”, called “RelateNG”. The boolean predicates are pairwise tests for geometries that return true\/false answers. “Intersects”, “Contains”, “Touches” are all examples of boolean predicates.",
       "wordCount" : "442",
       "inLanguage": "en",
       "isFamilyFriendly": "true",
@@ -1458,7 +1455,6 @@ <h1 class="gdoc-post__title">RelateNG</h1>
   class="gdoc-markdown__link"
   href="https://lin-ear-th-inking.blogspot.com/2024/05/relateng-performance.html"
 >implementation is faster</a> and just as correct. The existing prepared geometry implementation is still faster, for the cases it supports, but for all the unsupported cases RelateNG now provides faster default implentations.</p>
-
     </section>
   </article>
 

posts/index.html

@@ -1362,8 +1362,7 @@ <h1 class="gdoc-post__title">
         </h1>
       </header>
       <section>
-        The upcoming 3.13 release of GEOS includes a complete re-write of the &ldquo;boolean predicates&rdquo;, called &ldquo;RelateNG&rdquo;. The boolean predicates are pairwise tests for geometries that return true/false answers. &ldquo;Intersects&rdquo;, &ldquo;Contains&rdquo;, &ldquo;Touches&rdquo; are all examples of boolean predicates.
-The old implementation in JTS and GEOS operated by building a complete topological relationship graph between the two inputs, then reading the result off the graph. However, computing the whole graph every time is computationally expensive, and the results of many predicates can be determined without a full graph &ndash; the first time you hit an edge intersection, you know that geometries intersect, and you do not need to do any more calculations.
+        <p>The upcoming 3.13 release of GEOS includes a complete re-write of the &ldquo;boolean predicates&rdquo;, called &ldquo;RelateNG&rdquo;. The boolean predicates are pairwise tests for geometries that return true/false answers.  &ldquo;Intersects&rdquo;, &ldquo;Contains&rdquo;, &ldquo;Touches&rdquo; are all examples of boolean predicates.</p>
       </section>
       <div class="gdoc-post__readmore">
 

posts/index.xml

@@ -13,8 +13,7 @@
       <pubDate>Tue, 13 Aug 2024 00:00:00 +0000</pubDate>
 
       <guid>https://libgeos.org/posts/2024-08-13-relateng/</guid>
-      <description>The upcoming 3.13 release of GEOS includes a complete re-write of the &amp;ldquo;boolean predicates&amp;rdquo;, called &amp;ldquo;RelateNG&amp;rdquo;. The boolean predicates are pairwise tests for geometries that return true/false answers. &amp;ldquo;Intersects&amp;rdquo;, &amp;ldquo;Contains&amp;rdquo;, &amp;ldquo;Touches&amp;rdquo; are all examples of boolean predicates.
-The old implementation in JTS and GEOS operated by building a complete topological relationship graph between the two inputs, then reading the result off the graph. However, computing the whole graph every time is computationally expensive, and the results of many predicates can be determined without a full graph &amp;ndash; the first time you hit an edge intersection, you know that geometries intersect, and you do not need to do any more calculations.</description>
+      <description>&lt;p&gt;The upcoming 3.13 release of GEOS includes a complete re-write of the &amp;ldquo;boolean predicates&amp;rdquo;, called &amp;ldquo;RelateNG&amp;rdquo;. The boolean predicates are pairwise tests for geometries that return true/false answers.  &amp;ldquo;Intersects&amp;rdquo;, &amp;ldquo;Contains&amp;rdquo;, &amp;ldquo;Touches&amp;rdquo; are all examples of boolean predicates.&lt;/p&gt;</description>
     </item>
 
     <item>