wm

commit 56c92b71d90f270b58cee50bd7a422de43d4ac49 (tree)
parent b6b97852bb913f02928abc7a1c4b470eaa5faecc
Author: Motiejus Jakštys <motiejus@jakstys.lt>
Date:   Wed, 19 May 2021 22:57:47 +0300

remove redundant commentary

Diffstat:
M
wm.sql
 | 
10
----------

1 file changed, 0 insertions(+), 10 deletions(-)
diff --git a/wm.sql b/wm.sql
@@ -261,11 +261,6 @@ begin
     -- self-crossing. now try to find another bend in this line that
     -- crosses an imaginary line of end-vertices
 
-    -- To understand the block below, I suggest you take a pencil and paper,
-    -- draw a self-crossing bend (fig6 from the article works well), and
-    -- figure out what happens here, by hand. I know it's hard to follow.
-    -- Apologies.
-
     -- go through each bend in the given line, and see if has a potential to
     -- cross bends[i].
     for j in 1..i-1 loop
@@ -291,14 +286,9 @@ begin
       continue when multi is null;
       mutated = true;
 
-      -- To understand the block below, I suggest you take a pencil and paper,
-      -- draw a self-crossing bend (fig6 from the article works well), and
-      -- figure out what happens here, by hand. I know it's hard to follow.
-      -- Apologies.
       -- remove last vertex of the previous bend, because the last
       -- segment is duplicated with the i'th bend.
       bends[i-1] = st_removepoint(bends[i-1], st_npoints(bends[i-1])-1);
-      -- continue debugging the selfcrossing-1 here.
       bends[i] = st_makeline(
         st_pointn(bends[i], 1),
         st_removepoint(st_geometryn(multi, st_numgeometries(multi)), 0)