88msgstr ""
99"Project-Id-Version : pgRouting v3.8\n "
1010"Report-Msgid-Bugs-To : \n "
11- "POT-Creation-Date : 2025-04-17 15:30 +0000\n "
11+ "POT-Creation-Date : 2025-04-17 01:18 +0000\n "
1212"PO-Revision-Date : YEAR-MO-DA HO:MI+ZONE\n "
1313"Last-Translator : FULL NAME <EMAIL@ADDRESS>\n "
1414"Language-Team : LANGUAGE <LL@li.org>\n "
@@ -3868,18 +3868,18 @@ msgstr ""
38683868msgid ":doc:`pgr_nodeNetwork` - to create nodes to a not noded edge table."
38693869msgstr ""
38703870
3871- msgid ""
3872- ":doc:`pgr_extractVertices` - Extracts vertex information based on the "
3873- "edge table information."
3871+ msgid ":doc:`pgr_trsp` - Turn Restriction Shortest Path (TRSP)"
38743872msgstr ""
38753873
3876- msgid ":doc:`pgr_trsp` - Turn Restriction Shortest Path (TRSP) "
3874+ msgid "Utilities "
38773875msgstr ""
38783876
3879- msgid "Utilities family"
3877+ msgid ""
3878+ ":doc:`pgr_extractVertices` - Extracts vertex information based on the "
3879+ "edge table information."
38803880msgstr ""
38813881
3882- msgid ":doc:`pgr_findCloseEdges`"
3882+ msgid ":doc:`pgr_findCloseEdges` - Finds close edges of points on the fly "
38833883msgstr ""
38843884
38853885msgid "Functions by categories"
@@ -4032,6 +4032,11 @@ msgid ""
40324032"pgr_contractionLinear"
40334033msgstr ""
40344034
4035+ msgid ""
4036+ "`#2848 <https://github.com/pgRouting/pgrouting/issues/2848>`__: "
4037+ "pgr_separateCrossing"
4038+ msgstr ""
4039+
40354040msgid "All releases"
40364041msgstr ""
40374042
@@ -5809,67 +5814,52 @@ msgid ""
58095814"removed and the routing topology needs to be updated."
58105815msgstr ""
58115816
5812- msgid "Adding split edges "
5817+ msgid "Fixing an intersection "
58135818msgstr ""
58145819
58155820msgid ""
5816- "For each pair of crossing edges a process similar to this one must be "
5817- "performed ."
5821+ "In this example the original edge table will be used to store the "
5822+ "additional geometries ."
58185823msgstr ""
58195824
5820- msgid ""
5821- "The columns inserted and the way are calculated are based on the "
5822- "application. For example, if the edges have a trait **name**, then that "
5823- "column is to be copied."
5825+ msgid "Create the topology for the data in :doc:`sampledata`"
58245826msgstr ""
58255827
5826- msgid "For pgRouting calculations "
5828+ msgid "Routing from :math:`1` to :math:`2` gives no solution. "
58275829msgstr ""
58285830
5829- msgid ""
5830- "**factor** based on the position of the intersection of the edges can be "
5831- "used to adjust the ``cost`` and ``reverse_cost`` columns."
5831+ msgid "Analyze the network for intersections."
58325832msgstr ""
58335833
5834- msgid ""
5835- "Capacity information, used in the :doc:`flow-family` functions does not "
5836- "need to change when splitting edges."
5834+ msgid "The analysis tell us that the network has an intersection."
58375835msgstr ""
58385836
5839- msgid "Adding new vertices "
5837+ msgid "Additional columns to control the origin of the segments. "
58405838msgstr ""
58415839
58425840msgid ""
5843- "After adding all the split edges required by the application, the newly "
5844- "created vertices need to be added to the vertices table."
5841+ "Calling :doc:`pgr_separateCrossing` and adding the new segments to the "
5842+ "edges table."
58455843msgstr ""
58465844
5847- msgid "Updating edges topology"
5848- msgstr ""
5849-
5850- msgid "Removing the surplus edges"
5845+ msgid "Update the cost and reverse_cost values."
58515846msgstr ""
58525847
58535848msgid ""
5854- "Once all significant information needed by the application has been "
5855- "transported to the new edges, then the crossing edges can be deleted ."
5849+ "In this example the costs are based on the length of the geometry and the "
5850+ " directionality is kept using the ``sign`` function ."
58565851msgstr ""
58575852
5858- msgid ""
5859- "There are other options to do this task, like creating a view, or a "
5860- "materialized view."
5861- msgstr ""
5862-
5863- msgid "Updating vertices topology"
5853+ msgid "Update the topology"
58645854msgstr ""
58655855
5866- msgid "To keep the graph consistent, the vertices topology needs to be updated "
5856+ msgid "Insert the intersections as new vertices. "
58675857msgstr ""
58685858
5869- msgid "Checking for crossing edges"
5859+ msgid "Update source and target information on the edges table. "
58705860msgstr ""
58715861
5872- msgid "There are no crossing edges on the graph ."
5862+ msgid "Routing from :math:`1` to :math:`18` gives a solution ."
58735863msgstr ""
58745864
58755865msgid "Disconnected graphs"
@@ -13436,21 +13426,12 @@ msgstr ""
1343613426msgid "Examples"
1343713427msgstr ""
1343813428
13439- msgid "Create the topology for the data in :doc:`sampledata`"
13440- msgstr ""
13441-
13442- msgid "Analyze the network for intersections."
13443- msgstr ""
13444-
1344513429msgid "Analyze the network for gaps."
1344613430msgstr ""
1344713431
1344813432msgid "The analysis tell us that the network has a gap and an intersection."
1344913433msgstr ""
1345013434
13451- msgid "Fixing an intersection"
13452- msgstr ""
13453-
1345413435msgid "Storing the intersections."
1345513436msgstr ""
1345613437
@@ -13462,18 +13443,12 @@ msgid ""
1346213443" segmented."
1346313444msgstr ""
1346413445
13465- msgid "Update the topology"
13466- msgstr ""
13467-
1346813446msgid "Add new segments to the edges table."
1346913447msgstr ""
1347013448
1347113449msgid "Insert the intersection as new vertices."
1347213450msgstr ""
1347313451
13474- msgid "Update source and target information on the edges table."
13475- msgstr ""
13476-
1347713452msgid "Delete original edge."
1347813453msgstr ""
1347913454
@@ -13801,6 +13776,44 @@ msgstr ""
1380113776msgid "pgr_pushRelabel(`Edges SQL`_, `Combinations SQL`_)"
1380213777msgstr ""
1380313778
13779+ msgid "``pgr_separateCrossing``"
13780+ msgstr ""
13781+
13782+ msgid ""
13783+ "``pgr_separateCrossing`` - From crossing geometries generates geometries "
13784+ "that do not cross."
13785+ msgstr ""
13786+
13787+ msgid "This is an auxiliary function for separating crossing edges."
13788+ msgstr ""
13789+
13790+ msgid "pgr_separateCrossing(`Edges SQL`_, [``tolerance``, ``dryrun``])"
13791+ msgstr ""
13792+
13793+ msgid "RETURNS |result-separate|"
13794+ msgstr ""
13795+
13796+ msgid "Get the segments of the crossing geometries"
13797+ msgstr ""
13798+
13799+ msgid "``tolerance``"
13800+ msgstr ""
13801+
13802+ msgid "0.01"
13803+ msgstr ""
13804+
13805+ msgid "Used in ST_Snap before ST_Split"
13806+ msgstr ""
13807+
13808+ msgid "Get the code for further refinement."
13809+ msgstr ""
13810+
13811+ msgid ""
13812+ "When there are special details that need to be taken care of because of "
13813+ "the final application or the quality of the data, the code can be "
13814+ "obtained On a PostgreSQL ``NOTICE`` using the ``dryrun`` flag."
13815+ msgstr ""
13816+
1380413817msgid "``pgr_sequentialVertexColoring`` - Proposed"
1380513818msgstr ""
1380613819
@@ -15404,6 +15417,9 @@ msgid ""
1540415417"Graph."
1540515418msgstr ""
1540615419
15420+ msgid ":doc:`pgr_separateCrossing` - Breaks geometries that cross each other."
15421+ msgstr ""
15422+
1540715423msgid ":doc:`withPoints-family` - Functions based on Dijkstra algorithm."
1540815424msgstr ""
1540915425
@@ -15969,9 +15985,6 @@ msgstr ""
1596915985msgid "Topology"
1597015986msgstr ""
1597115987
15972- msgid "Utilities"
15973- msgstr ""
15974-
1597515988msgid "pgr_findCloseEdges(One point)"
1597615989msgstr ""
1597715990
@@ -18270,15 +18283,7 @@ msgid ""
1827018283" created."
1827118284msgstr ""
1827218285
18273- msgid ""
18274- "pgRouting supplies some functions to create a routing topology and to "
18275- "analyze the topology."
18276- msgstr ""
18277-
18278- msgid "Additional functions to create a graph:"
18279- msgstr ""
18280-
18281- msgid "Additional functions to analyze a graph:"
18286+ msgid "Utility functions"
1828218287msgstr ""
1828318288
1828418289msgid "Transformation - Family of functions"
0 commit comments