pgRouting · cvvergara · Apr 17, 2025 · Apr 16, 2025 · Apr 16, 2025 · Apr 16, 2025
diff --git a/NEWS.md b/NEWS.md
@@ -69,6 +69,11 @@ milestone for 3.8.0
   * [#2790](https://github.com/pgRouting/pgrouting/issues/2790): pgr_contractionDeadEnd
   * [#2791](https://github.com/pgRouting/pgrouting/issues/2791): pgr_contractionLinear
 
+* Utilities
+
+  * [#2848](https://github.com/pgRouting/pgrouting/issues/2848):
+    pgr_separateCrossing
+
 ## pgRouting 3.7
 
 ### pgRouting 3.7.3 Release Notes

diff --git a/doc/_static/page_history.js b/doc/_static/page_history.js
@@ -15,7 +15,7 @@ var titles = [
 
 
 var newpages = [
-    {v: '3.8', pages: ['pgr_contractionDeadEnd', 'pgr_contractionLinear']},
+    {v: '3.8', pages: ['pgr_contractionDeadEnd', 'pgr_contractionLinear', 'pgr_separateCrossing']},
 
     {v: '3.7', pages: ['metrics-family', 'pgr_betweennessCentrality']},
 

diff --git a/doc/conf.py.in b/doc/conf.py.in
@@ -368,6 +368,7 @@ rst_epilog="""
 .. |result-edge-color| replace:: ``(edge_id, color_id)``
 .. |result-node| replace:: ``(node)``
 .. |result-edge| replace:: ``(edge)``
+.. |result-separate| replace:: ``(seq,id,sub_id,geom)``
 .. |result-node-order| replace:: ``(seq, node)``
 .. |result-degree| replace:: ``(node, degree)``
 .. |result-extract| replace:: ``(id, in_edges, out_edges, x, y, geom)``

diff --git a/doc/src/pgRouting-concepts.rst b/doc/src/pgRouting-concepts.rst
@@ -624,8 +624,6 @@ There are lots of possible problems in a graph.
 Crossing edges
 ...............................................................................
 
-.. cross_edges_start
-
 To get the crossing edges:
 
 .. literalinclude:: concepts.queries
@@ -663,83 +661,13 @@ When it is incorrect, it needs fixing:
 Once analyzed one by one the crossings, for the ones that need a local fix,
 the edges need to be `split <https://postgis.net/docs/ST_Split.html>`__.
 
-.. literalinclude:: concepts.queries
-   :start-after: -- cross2
-   :end-before: -- cross3
-
 The new edges need to be added to the edges table, the rest of the attributes
 need to be updated in the new edges, the old edges need to be
 removed and the routing topology needs to be updated.
 
-Adding split edges
-+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
-
-For each pair of crossing edges a process similar to this one must be performed.
-
-The columns inserted and the way are calculated are based on the application.
-For example, if the edges have a trait **name**, then that column is to be
-copied.
-
-For pgRouting calculations
-
-* **factor** based on the position of the intersection of the edges can be used
-  to adjust the ``cost`` and ``reverse_cost`` columns.
-* Capacity information, used in the :doc:`flow-family` functions does not need
-  to change when splitting edges.
-
-.. literalinclude:: concepts.queries
-   :start-after: -- cross3
-   :end-before: -- cross4
-
-Adding new vertices
-+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
-
-After adding all the split edges required by the application, the newly created
-vertices need to be added to the vertices table.
-
-.. literalinclude:: concepts.queries
-   :start-after: -- cross4
-   :end-before: -- cross5
-
-Updating edges topology
-+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
-
-.. literalinclude:: concepts.queries
-   :start-after: -- cross5
-   :end-before: -- cross6
-
-Removing the surplus edges
-+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
-
-Once all significant information needed by the application has been transported
-to the new edges, then the crossing edges can be deleted.
-
-.. literalinclude:: concepts.queries
-   :start-after: -- cross6
-   :end-before: -- cross7
-
-There are other options to do this task, like creating a view, or a materialized
-view.
-
-Updating vertices topology
-+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
-
-To keep the graph consistent, the vertices topology needs to be updated
-
-.. literalinclude:: concepts.queries
-   :start-after: -- cross7
-   :end-before: -- cross8
-
-Checking for crossing edges
-+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
-
-There are no crossing edges on the graph.
-
-.. literalinclude:: concepts.queries
-   :start-after: -- cross8
-   :end-before: -- cross9
-
-.. cross_edges_end
+.. include:: pgr_separateCrossing.rst
+   :start-after: fix_intersection_start
+   :end-before: fix_intersection_end
 
 Disconnected graphs
 ...............................................................................

diff --git a/doc/src/proposed.rst b/doc/src/proposed.rst
@@ -80,6 +80,12 @@ Proposed Functions
    :start-after: official-start
    :end-before: official-end
 
+.. rubric:: Utilities
+
+.. include:: topology-functions.rst
+   :start-after: utility_proposed-start
+   :end-before: utility_proposed-end
+
 .. toctree::
    :hidden:
 

diff --git a/doc/src/release_notes.rst b/doc/src/release_notes.rst
@@ -99,6 +99,11 @@ milestone for 3.8.0
   * `#2790 <https://github.com/pgRouting/pgrouting/issues/2790>`__: pgr_contractionDeadEnd
   * `#2791 <https://github.com/pgRouting/pgrouting/issues/2791>`__: pgr_contractionLinear
 
+* Utilities
+
+  * `#2848 <https://github.com/pgRouting/pgrouting/issues/2848>`__:
+    pgr_separateCrossing
+
 pgRouting 3.7
 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
 

diff --git a/doc/src/routingFunctions.rst b/doc/src/routingFunctions.rst
@@ -103,9 +103,11 @@ Function Families
 
 :doc:`pgr_trsp` - Turn Restriction Shortest Path (TRSP)
 
-.. rubric:: Utilities family
+.. rubric:: Utilities
 
-:doc:`pgr_findCloseEdges`
+.. include:: topology-functions.rst
+   :start-after: utility_official-start
+   :end-before: utility_official-end
 
 Functions by categories
 ===============================================================================
@@ -172,7 +174,6 @@ Functions by categories
     reference
     topology-functions
     TSP-family
-    pgr_findCloseEdges
 
 .. toctree::
     :hidden:

diff --git a/doc/topology/pgr_extractVertices.rst b/doc/topology/pgr_extractVertices.rst
@@ -8,7 +8,7 @@
    ****************************************************************************
 
 .. index::
-   single: Topology Family ; pgr_extractVertices
+   single: Utilities ; pgr_extractVertices
    single: extractVertices
 
 |
@@ -49,15 +49,13 @@ of edges of a graph.
 Signatures
 -------------------------------------------------------------------------------
 
-.. rubric:: Summary
-
 .. admonition:: \ \
    :class: signatures
 
    | pgr_extractVertices(`Edges SQL`_, [``dryrun``])
 
    | RETURNS SETOF |result-extract|
-   | OR EMTPY SET
+   | OR EMPTY SET
 
 :Example: Extracting the vertex information
 
@@ -283,21 +281,6 @@ Inspect the routing topology
 
 .. create_routing_topology_end
 
-
-Crossing edges
-...............................................................................
-
-.. include:: pgRouting-concepts.rst
-   :start-after: cross_edges_start
-   :end-before: cross_edges_end
-
-Graphs without geometries
-...............................................................................
-
-.. include:: pgRouting-concepts.rst
-   :start-after: no_geometry_start
-   :end-before: no_geometry_end
-
 See Also
 -------------------------------------------------------------------------------
 

diff --git a/doc/topology/topology-functions.rst b/doc/topology/topology-functions.rst
@@ -34,23 +34,33 @@ have special permissions given by the administrators to use them.
   table.
 - :doc:`pgr_analyzeOneWay` - to analyze directionality of the edges.
 - :doc:`pgr_nodeNetwork` - to create nodes to a not noded edge table.
-- :doc:`pgr_extractVertices` - Extracts vertex information based on the edge
-  table information.
 
 .. official-end
 
-pgRouting supplies some functions to create a routing topology and to analyze the
-topology.
+.. index:: Utilities
+
+|
+
+Utility functions
+===============================================================================
+
+.. utility_official-start
+
+- :doc:`pgr_extractVertices` - Extracts vertex information based on the edge
+  table information.
+- :doc:`pgr_findCloseEdges` - Finds close edges of points on the fly
 
-Additional functions to create a graph:
+.. utility_official-end
 
-* :doc:`contraction-family`
+.. include:: proposed.rst
+   :start-after: warning-begin
+   :end-before: end-warning
 
-Additional functions to analyze a graph:
+.. utility_proposed-start
 
-* :doc:`components-family`
+- :doc:`pgr_separateCrossing` - Breaks geometries that cross each other.
 
-.. proposed-end
+.. utility_proposed-end
 
 .. toctree::
   :hidden:
@@ -61,6 +71,8 @@ Additional functions to analyze a graph:
   pgr_analyzeOneWay
   pgr_nodeNetwork
   pgr_extractVertices
+  pgr_findCloseEdges
+  pgr_separateCrossing
 
 See Also
 -------------------------------------------------------------------------------

diff --git a/doc/utilities/CMakeLists.txt b/doc/utilities/CMakeLists.txt
@@ -1,5 +1,6 @@
 SET(LOCAL_FILES
     pgr_findCloseEdges.rst
+    pgr_separateCrossing.rst
     )
 
 foreach (f ${LOCAL_FILES})