deploy: 6d48352

Author: MaelRL

2025/12/31/Frechet_distance/index.html

@@ -147,11 +147,11 @@ <h3>New in CGAL: Computation of Frechet Distance in Any Dimension</h3>
 
 <h3><a href="https://www-sop.inria.fr/members/Andre.Nusser/">André Nusser</a>&deg;,
 <a href="https://act.iti.kit.edu/people/marvinkuennemann">Marvin Künnemann</a>&dagger;, and
-<a href="https://people.mpi-inf.mpg.de/~kbringma/"> Karl Bringmann</a>&deg;;
+<a href="https://people.mpi-inf.mpg.de/~kbringma/"> Karl Bringmann</a>&#42;
 </h3>
-<h4>&deg;<a href="https://www.inria.fr/en/inria-centre-universite-cote-azur">CNRS / Inria Center at Université Côte d’Azur</a>,
-    &dagger;<a href="https://www.kit.edu/english/">Karlsruhe Institute of Technology</a>,
-    &#42;<a href="https://www.mpi-inf.mpg.de/home">Max Planck Institute for Informatics</a></h4>
+<h4>&deg; <a href="https://www.inria.fr/en/inria-centre-universite-cote-azur">CNRS / Inria Center at Université Côte d’Azur</a>,<br />
+    &dagger; <a href="https://www.kit.edu/english/">Karlsruhe Institute of Technology</a>,<br />
+    &#42; <a href="https://www.mpi-inf.mpg.de/home">Max Planck Institute for Informatics</a></h4>
 
 <p><br /></p>
 <p>The Fréchet distance is a classical dissimilarity measure between polylines.
@@ -179,12 +179,13 @@ <h4>&deg;<a href="https://www.inria.fr/en/inria-centre-universite-cote-azur">CNR
 <p><br /></p>
 <h3>New Package: dD Fréchet Distance</h3>
 
-<p>This new package provides the means to compute a bounded approximation of the Fréchet distance between
-two polylines, as well as a near neighbor data structure for polylines under the Fréchet distance,
-both in d-dimensional Euclidean space.</p>
+<p>This new package provides the means to compute an approximation of the Fréchet distance between
+two polylines that is guaranteed to be within an arbitrarily small, user-provided bound.
+In addition, a near neighbor data structure for polylines under the Fréchet distance is offered.
+These functionalities are provided for polylines in any dimension.</p>
 
 <p>The following code snippet demonstrates how to compute the Fréchet distance between
-two polylines, with a maximal error of 0.000001 to the exact distance:</p>
+two polylines, with a maximal additive error of 0.000001 to the exact distance:</p>
 
 <div class="language-cpp highlighter-rouge"><div class="highlight"><pre class="highlight"><code>  <span class="n">std</span><span class="o">::</span><span class="n">vector</span><span class="o">&lt;</span><span class="n">Point</span><span class="o">&gt;</span> <span class="n">pA</span><span class="p">,</span> <span class="n">pB</span><span class="p">;</span>
   <span class="n">CGAL</span><span class="o">::</span><span class="n">IO</span><span class="o">::</span><span class="n">read_linestring_WKT</span><span class="p">(</span><span class="s">"wkt/moebius.wkt"</span><span class="p">,</span> <span class="n">pA</span><span class="p">);</span>
@@ -206,10 +207,10 @@ <h3>Fast and Correct</h3>
 this package guarantees the correctness of the result, provided functions are called using a kernel offering
 filtered predicates or exact predicates, such as provided by the kernel <code>CGAL::Exact_predicates_and_inexact_constructions_kernel</code>.</p>
 
-<p>The implementation is based on a series of state-of-the-art papers by Bringmann et al. [2, 3],
-which significantly improved on previous state of the art. Furthermore,
-the algorithm is not concerned by the curse of dimensionality.
-We refer to the papers themselves for a very detailed practical analysis.</p>
+<p>The implementation is based on state-of-the-art papers by Bringmann et al. [2, 3],
+which significantly improved on previous research. Furthermore, the algorithm is not
+affected by the curse of dimensionality; we refer to the papers themselves
+for a very detailed practical analysis.</p>
 
 <h3>Status</h3>
 

atom.xml

@@ -4,7 +4,7 @@
  <title>CGAL</title>
  <link href="http://www.cgal.org/" rel="self"/>
  <link href="http://www.cgal.org"/>
- <updated>2026-01-30T14:29:18+00:00</updated>
+ <updated>2026-02-05T14:42:21+00:00</updated>
  <id>http://www.cgal.org</id>
  <author>
    <name>CGAL Editorial Board</name>
@@ -246,11 +246,11 @@ symmetric hyperbolic surface of genus 2&lt;/p&gt;
    <content type="html">
 &lt;h3&gt;&lt;a href=&quot;https://www-sop.inria.fr/members/Andre.Nusser/&quot;&gt;André Nusser&lt;/a&gt;&amp;deg;,
 &lt;a href=&quot;https://act.iti.kit.edu/people/marvinkuennemann&quot;&gt;Marvin Künnemann&lt;/a&gt;&amp;dagger;, and
-&lt;a href=&quot;https://people.mpi-inf.mpg.de/~kbringma/&quot;&gt; Karl Bringmann&lt;/a&gt;&amp;deg;;
+&lt;a href=&quot;https://people.mpi-inf.mpg.de/~kbringma/&quot;&gt; Karl Bringmann&lt;/a&gt;&amp;#42;
 &lt;/h3&gt;
-&lt;h4&gt;&amp;deg;&lt;a href=&quot;https://www.inria.fr/en/inria-centre-universite-cote-azur&quot;&gt;CNRS / Inria Center at Université Côte d’Azur&lt;/a&gt;,
-    &amp;dagger;&lt;a href=&quot;https://www.kit.edu/english/&quot;&gt;Karlsruhe Institute of Technology&lt;/a&gt;,
-    &amp;#42;&lt;a href=&quot;https://www.mpi-inf.mpg.de/home&quot;&gt;Max Planck Institute for Informatics&lt;/a&gt;&lt;/h4&gt;
+&lt;h4&gt;&amp;deg; &lt;a href=&quot;https://www.inria.fr/en/inria-centre-universite-cote-azur&quot;&gt;CNRS / Inria Center at Université Côte d’Azur&lt;/a&gt;,&lt;br /&gt;
+    &amp;dagger; &lt;a href=&quot;https://www.kit.edu/english/&quot;&gt;Karlsruhe Institute of Technology&lt;/a&gt;,&lt;br /&gt;
+    &amp;#42; &lt;a href=&quot;https://www.mpi-inf.mpg.de/home&quot;&gt;Max Planck Institute for Informatics&lt;/a&gt;&lt;/h4&gt;
 
 &lt;p&gt;&lt;br /&gt;&lt;/p&gt;
 &lt;p&gt;The Fréchet distance is a classical dissimilarity measure between polylines.
@@ -278,12 +278,13 @@ considers the polylines as continuous objects and takes into account the orderin
 &lt;p&gt;&lt;br /&gt;&lt;/p&gt;
 &lt;h3&gt;New Package: dD Fréchet Distance&lt;/h3&gt;
 
-&lt;p&gt;This new package provides the means to compute a bounded approximation of the Fréchet distance between
-two polylines, as well as a near neighbor data structure for polylines under the Fréchet distance,
-both in d-dimensional Euclidean space.&lt;/p&gt;
+&lt;p&gt;This new package provides the means to compute an approximation of the Fréchet distance between
+two polylines that is guaranteed to be within an arbitrarily small, user-provided bound.
+In addition, a near neighbor data structure for polylines under the Fréchet distance is offered.
+These functionalities are provided for polylines in any dimension.&lt;/p&gt;
 
 &lt;p&gt;The following code snippet demonstrates how to compute the Fréchet distance between
-two polylines, with a maximal error of 0.000001 to the exact distance:&lt;/p&gt;
+two polylines, with a maximal additive error of 0.000001 to the exact distance:&lt;/p&gt;
 
 &lt;div class=&quot;language-cpp highlighter-rouge&quot;&gt;&lt;div class=&quot;highlight&quot;&gt;&lt;pre class=&quot;highlight&quot;&gt;&lt;code&gt;  &lt;span class=&quot;n&quot;&gt;std&lt;/span&gt;&lt;span class=&quot;o&quot;&gt;::&lt;/span&gt;&lt;span class=&quot;n&quot;&gt;vector&lt;/span&gt;&lt;span class=&quot;o&quot;&gt;&amp;lt;&lt;/span&gt;&lt;span class=&quot;n&quot;&gt;Point&lt;/span&gt;&lt;span class=&quot;o&quot;&gt;&amp;gt;&lt;/span&gt; &lt;span class=&quot;n&quot;&gt;pA&lt;/span&gt;&lt;span class=&quot;p&quot;&gt;,&lt;/span&gt; &lt;span class=&quot;n&quot;&gt;pB&lt;/span&gt;&lt;span class=&quot;p&quot;&gt;;&lt;/span&gt;
   &lt;span class=&quot;n&quot;&gt;CGAL&lt;/span&gt;&lt;span class=&quot;o&quot;&gt;::&lt;/span&gt;&lt;span class=&quot;n&quot;&gt;IO&lt;/span&gt;&lt;span class=&quot;o&quot;&gt;::&lt;/span&gt;&lt;span class=&quot;n&quot;&gt;read_linestring_WKT&lt;/span&gt;&lt;span class=&quot;p&quot;&gt;(&lt;/span&gt;&lt;span class=&quot;s&quot;&gt;&quot;wkt/moebius.wkt&quot;&lt;/span&gt;&lt;span class=&quot;p&quot;&gt;,&lt;/span&gt; &lt;span class=&quot;n&quot;&gt;pA&lt;/span&gt;&lt;span class=&quot;p&quot;&gt;);&lt;/span&gt;
@@ -305,10 +306,10 @@ two polylines, with a maximal error of 0.000001 to the exact distance:&lt;/p&gt;
 this package guarantees the correctness of the result, provided functions are called using a kernel offering
 filtered predicates or exact predicates, such as provided by the kernel &lt;code&gt;CGAL::Exact_predicates_and_inexact_constructions_kernel&lt;/code&gt;.&lt;/p&gt;
 
-&lt;p&gt;The implementation is based on a series of state-of-the-art papers by Bringmann et al. [2, 3],
-which significantly improved on previous state of the art. Furthermore,
-the algorithm is not concerned by the curse of dimensionality.
-We refer to the papers themselves for a very detailed practical analysis.&lt;/p&gt;
+&lt;p&gt;The implementation is based on state-of-the-art papers by Bringmann et al. [2, 3],
+which significantly improved on previous research. Furthermore, the algorithm is not
+affected by the curse of dimensionality; we refer to the papers themselves
+for a very detailed practical analysis.&lt;/p&gt;
 
 &lt;h3&gt;Status&lt;/h3&gt;
 

rss.xml

@@ -5,8 +5,8 @@
         <description>CGAL - CGAL Editorial Board</description>
         <link>http://www.cgal.org</link>
         <link>http://www.cgal.org</link>
-        <lastBuildDate>2026-01-30T14:29:18+00:00</lastBuildDate>
-        <pubDate>2026-01-30T14:29:18+00:00</pubDate>
+        <lastBuildDate>2026-02-05T14:42:21+00:00</lastBuildDate>
+        <pubDate>2026-02-05T14:42:21+00:00</pubDate>
         <ttl>1800</ttl>
 
 
@@ -241,11 +241,11 @@ symmetric hyperbolic surface of genus 2&lt;/p&gt;
                 <description>
 &lt;h3&gt;&lt;a href=&quot;https://www-sop.inria.fr/members/Andre.Nusser/&quot;&gt;André Nusser&lt;/a&gt;&amp;deg;,
 &lt;a href=&quot;https://act.iti.kit.edu/people/marvinkuennemann&quot;&gt;Marvin Künnemann&lt;/a&gt;&amp;dagger;, and
-&lt;a href=&quot;https://people.mpi-inf.mpg.de/~kbringma/&quot;&gt; Karl Bringmann&lt;/a&gt;&amp;deg;;
+&lt;a href=&quot;https://people.mpi-inf.mpg.de/~kbringma/&quot;&gt; Karl Bringmann&lt;/a&gt;&amp;#42;
 &lt;/h3&gt;
-&lt;h4&gt;&amp;deg;&lt;a href=&quot;https://www.inria.fr/en/inria-centre-universite-cote-azur&quot;&gt;CNRS / Inria Center at Université Côte d’Azur&lt;/a&gt;,
-    &amp;dagger;&lt;a href=&quot;https://www.kit.edu/english/&quot;&gt;Karlsruhe Institute of Technology&lt;/a&gt;,
-    &amp;#42;&lt;a href=&quot;https://www.mpi-inf.mpg.de/home&quot;&gt;Max Planck Institute for Informatics&lt;/a&gt;&lt;/h4&gt;
+&lt;h4&gt;&amp;deg; &lt;a href=&quot;https://www.inria.fr/en/inria-centre-universite-cote-azur&quot;&gt;CNRS / Inria Center at Université Côte d’Azur&lt;/a&gt;,&lt;br /&gt;
+    &amp;dagger; &lt;a href=&quot;https://www.kit.edu/english/&quot;&gt;Karlsruhe Institute of Technology&lt;/a&gt;,&lt;br /&gt;
+    &amp;#42; &lt;a href=&quot;https://www.mpi-inf.mpg.de/home&quot;&gt;Max Planck Institute for Informatics&lt;/a&gt;&lt;/h4&gt;
 
 &lt;p&gt;&lt;br /&gt;&lt;/p&gt;
 &lt;p&gt;The Fréchet distance is a classical dissimilarity measure between polylines.
@@ -273,12 +273,13 @@ considers the polylines as continuous objects and takes into account the orderin
 &lt;p&gt;&lt;br /&gt;&lt;/p&gt;
 &lt;h3&gt;New Package: dD Fréchet Distance&lt;/h3&gt;
 
-&lt;p&gt;This new package provides the means to compute a bounded approximation of the Fréchet distance between
-two polylines, as well as a near neighbor data structure for polylines under the Fréchet distance,
-both in d-dimensional Euclidean space.&lt;/p&gt;
+&lt;p&gt;This new package provides the means to compute an approximation of the Fréchet distance between
+two polylines that is guaranteed to be within an arbitrarily small, user-provided bound.
+In addition, a near neighbor data structure for polylines under the Fréchet distance is offered.
+These functionalities are provided for polylines in any dimension.&lt;/p&gt;
 
 &lt;p&gt;The following code snippet demonstrates how to compute the Fréchet distance between
-two polylines, with a maximal error of 0.000001 to the exact distance:&lt;/p&gt;
+two polylines, with a maximal additive error of 0.000001 to the exact distance:&lt;/p&gt;
 
 &lt;div class=&quot;language-cpp highlighter-rouge&quot;&gt;&lt;div class=&quot;highlight&quot;&gt;&lt;pre class=&quot;highlight&quot;&gt;&lt;code&gt;  &lt;span class=&quot;n&quot;&gt;std&lt;/span&gt;&lt;span class=&quot;o&quot;&gt;::&lt;/span&gt;&lt;span class=&quot;n&quot;&gt;vector&lt;/span&gt;&lt;span class=&quot;o&quot;&gt;&amp;lt;&lt;/span&gt;&lt;span class=&quot;n&quot;&gt;Point&lt;/span&gt;&lt;span class=&quot;o&quot;&gt;&amp;gt;&lt;/span&gt; &lt;span class=&quot;n&quot;&gt;pA&lt;/span&gt;&lt;span class=&quot;p&quot;&gt;,&lt;/span&gt; &lt;span class=&quot;n&quot;&gt;pB&lt;/span&gt;&lt;span class=&quot;p&quot;&gt;;&lt;/span&gt;
   &lt;span class=&quot;n&quot;&gt;CGAL&lt;/span&gt;&lt;span class=&quot;o&quot;&gt;::&lt;/span&gt;&lt;span class=&quot;n&quot;&gt;IO&lt;/span&gt;&lt;span class=&quot;o&quot;&gt;::&lt;/span&gt;&lt;span class=&quot;n&quot;&gt;read_linestring_WKT&lt;/span&gt;&lt;span class=&quot;p&quot;&gt;(&lt;/span&gt;&lt;span class=&quot;s&quot;&gt;&quot;wkt/moebius.wkt&quot;&lt;/span&gt;&lt;span class=&quot;p&quot;&gt;,&lt;/span&gt; &lt;span class=&quot;n&quot;&gt;pA&lt;/span&gt;&lt;span class=&quot;p&quot;&gt;);&lt;/span&gt;
@@ -300,10 +301,10 @@ two polylines, with a maximal error of 0.000001 to the exact distance:&lt;/p&gt;
 this package guarantees the correctness of the result, provided functions are called using a kernel offering
 filtered predicates or exact predicates, such as provided by the kernel &lt;code&gt;CGAL::Exact_predicates_and_inexact_constructions_kernel&lt;/code&gt;.&lt;/p&gt;
 
-&lt;p&gt;The implementation is based on a series of state-of-the-art papers by Bringmann et al. [2, 3],
-which significantly improved on previous state of the art. Furthermore,
-the algorithm is not concerned by the curse of dimensionality.
-We refer to the papers themselves for a very detailed practical analysis.&lt;/p&gt;
+&lt;p&gt;The implementation is based on state-of-the-art papers by Bringmann et al. [2, 3],
+which significantly improved on previous research. Furthermore, the algorithm is not
+affected by the curse of dimensionality; we refer to the papers themselves
+for a very detailed practical analysis.&lt;/p&gt;
 
 &lt;h3&gt;Status&lt;/h3&gt;