88msgstr ""
99"Project-Id-Version : pgRouting v3.8\n "
1010"Report-Msgid-Bugs-To : \n "
11- "POT-Creation-Date : 2025-04-19 16:35 +0000\n "
11+ "POT-Creation-Date : 2025-04-19 23:10 +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 "
@@ -5904,10 +5904,10 @@ msgid ""
59045904"additional geometries."
59055905msgstr ""
59065906
5907- msgid "Create the topology for the data in :doc:`sampledata` "
5907+ msgid "An example use without results "
59085908msgstr ""
59095909
5910- msgid "Routing from :math:`1` to :math:`2 ` gives no solution."
5910+ msgid "Routing from :math:`1` to :math:`18 ` gives no solution."
59115911msgstr ""
59125912
59135913msgid "Analyze the network for intersections."
@@ -5916,83 +5916,89 @@ msgstr ""
59165916msgid "The analysis tell us that the network has an intersection."
59175917msgstr ""
59185918
5919+ msgid "Prepare tables"
5920+ msgstr ""
5921+
59195922msgid "Additional columns to control the origin of the segments."
59205923msgstr ""
59215924
5925+ msgid "Adding new segments."
5926+ msgstr ""
5927+
59225928msgid ""
59235929"Calling :doc:`pgr_separateCrossing` and adding the new segments to the "
59245930"edges table."
59255931msgstr ""
59265932
5927- msgid "Update the cost and reverse_cost values. "
5933+ msgid "Update other values"
59285934msgstr ""
59295935
59305936msgid ""
5931- "In this example the costs are based on the length of the geometry and the"
5932- " directionality is kept using the ``sign`` function."
5937+ "In this example only ``cost`` and ``reverse_cost`` are updated, where "
5938+ "they are based on the length of the geometry and the directionality is "
5939+ "kept using the ``sign`` function."
59335940msgstr ""
59345941
59355942msgid "Update the topology"
59365943msgstr ""
59375944
5938- msgid "Insert the intersections as new vertices."
5945+ msgid "Insert the new vertices if any ."
59395946msgstr ""
59405947
59415948msgid "Update source and target information on the edges table."
59425949msgstr ""
59435950
5951+ msgid "The example has results"
5952+ msgstr ""
5953+
59445954msgid "Routing from :math:`1` to :math:`18` gives a solution."
59455955msgstr ""
59465956
5947- msgid "Disconnected graphs "
5957+ msgid "Touching edges "
59485958msgstr ""
59495959
5950- msgid "To get the graph connectivity: "
5960+ msgid "Visually the edges seem to be connected, but internally they are not. "
59515961msgstr ""
59525962
5953- #, python-brace-format
5954- msgid ""
5955- "In this example, the component :math:`2` consists of vertices "
5956- ":math:`\\ {2, 4\\ }` and both vertices are also part of the dead end result"
5957- " set."
5963+ msgid "The validity of the information is application dependent."
59585964msgstr ""
59595965
5960- msgid "This graph needs to be connected ."
5966+ msgid "Maybe there is a small barrier for vehicles but not for pedestrians ."
59615967msgstr ""
59625968
59635969msgid ""
5964- "With the original graph of this documentation, there would be 3 "
5965- "components as the crossing edge in this graph is a different component."
5970+ "Once analyzed one by one the touchings, for the ones that need a local "
5971+ "fix, the edges need to be `split "
5972+ "<https://postgis.net/docs/ST_Split.html>`__."
59665973msgstr ""
59675974
5968- msgid "Prepare storage for connection information "
5975+ msgid "Fixing a gap "
59695976msgstr ""
59705977
5971- msgid "Save the vertices connection information "
5978+ msgid "Routing from :math:`1` to :math:`2` gives no solution. "
59725979msgstr ""
59735980
5974- msgid "Save the edges connection information "
5981+ msgid "Analyze the network for gaps. "
59755982msgstr ""
59765983
5977- msgid "Get the closest vertex "
5984+ msgid "The analysis tell us that the network has a gap. "
59785985msgstr ""
59795986
59805987msgid ""
5981- "Using :doc:`pgr_findCloseEdges` the closest vertex to component :math:`1`"
5982- " is vertex :math:`4`. And the closest edge to vertex :math:`4` is edge "
5983- ":math:`14`."
5988+ "Calling :doc:`pgr_separateTouching` and adding the new segments to the "
5989+ "edges table."
59845990msgstr ""
59855991
5986- msgid ""
5987- "The ``edge`` can be used to connect the components, using the "
5988- "``fraction`` information about the edge :math:`14` to split the "
5989- "connecting edge."
5992+ msgid "Routing from :math:`1` to :math:`2` gives a solution."
59905993msgstr ""
59915994
59925995msgid "Connecting components"
59935996msgstr ""
59945997
5995- msgid "There are three basic ways to connect the components"
5998+ msgid "To get the graph connectivity:"
5999+ msgstr ""
6000+
6001+ msgid "There are three basic ways to connect components:"
59966002msgstr ""
59976003
59986004msgid "From the vertex to the starting point of the edge"
@@ -6007,15 +6013,31 @@ msgstr ""
60076013msgid "This solution requires the edge to be split."
60086014msgstr ""
60096015
6010- msgid "The following query shows the three ways to connect the components:"
6016+ msgid ""
6017+ "In this example :doc:`pgr_separateCrossing` and "
6018+ ":doc:`pgr_separateTouching` will be used."
60116019msgstr ""
60126020
6013- msgid "Checking components "
6021+ msgid "Get the connectivity "
60146022msgstr ""
60156023
60166024msgid ""
6017- "Ignoring the edge that requires further work. The graph is now fully "
6018- "connected as there is only one component."
6025+ "In this example: the edges table will need an additional column and the "
6026+ "vertex table will be rebuilt completely."
6027+ msgstr ""
6028+
6029+ msgid "Insert new edges"
6030+ msgstr ""
6031+
6032+ msgid ""
6033+ "Using :doc:`pgr_separateCrossing` and :doc:`pgr_separateTouching` insert "
6034+ "the results into the edges table."
6035+ msgstr ""
6036+
6037+ msgid "Create the vertices table"
6038+ msgstr ""
6039+
6040+ msgid "Using :doc:`pgr_extractVertices` create the table."
60196041msgstr ""
60206042
60216043msgid "Contraction of a graph"
@@ -11326,9 +11348,6 @@ msgstr ""
1132611348msgid "Clean up the columns of the routing topology to be created"
1132711349msgstr ""
1132811350
11329- msgid "Create the vertices table"
11330- msgstr ""
11331-
1133211351msgid ""
1133311352"When the ``LINESTRING`` has a SRID then use ``geom::geometry(POINT, "
1133411353"<SRID>)``"
@@ -12810,6 +12829,15 @@ msgid ""
1281012829"the \" noded\" edges into a new table."
1281112830msgstr ""
1281212831
12832+ msgid "Not checking and not creating indexes."
12833+ msgstr ""
12834+
12835+ msgid "Using ``pgr_separateTouching`` and ``pgr_separateCrossing``."
12836+ msgstr ""
12837+
12838+ msgid "Created table with ``BIGINT``."
12839+ msgstr ""
12840+
1281312841msgid ""
1281412842"A common problem associated with bringing GIS data into pgRouting is the "
1281512843"fact that the data is often not \" noded\" correctly. This will create "
@@ -12887,13 +12915,13 @@ msgstr ""
1288712915msgid "source"
1288812916msgstr ""
1288912917
12890- msgid "``integer `` Empty source column"
12918+ msgid "``bigint `` Empty source column"
1289112919msgstr ""
1289212920
1289312921msgid "target"
1289412922msgstr ""
1289512923
12896- msgid "``integer `` Empty target column"
12924+ msgid "``bigint `` Empty target column"
1289712925msgstr ""
1289812926
1289912927msgid "the geom"
@@ -12905,7 +12933,7 @@ msgstr ""
1290512933msgid "Examples"
1290612934msgstr ""
1290712935
12908- msgid "Analyze the network for gaps. "
12936+ msgid "Create the topology for the data in :doc:`sampledata` "
1290912937msgstr ""
1291012938
1291112939msgid "The analysis tell us that the network has a gap and an intersection."
@@ -12934,9 +12962,6 @@ msgstr ""
1293412962msgid "Update the vertex topology"
1293512963msgstr ""
1293612964
12937- msgid "Fixing a gap"
12938- msgstr ""
12939-
1294012965msgid "Store the deadends"
1294112966msgstr ""
1294212967
@@ -13295,6 +13320,23 @@ msgid ""
1329513320"obtained On a PostgreSQL ``NOTICE`` using the ``dryrun`` flag."
1329613321msgstr ""
1329713322
13323+ msgid "``pgr_separateTouching``"
13324+ msgstr ""
13325+
13326+ msgid ""
13327+ "``pgr_separateTouching`` - From touching geometries generates geometries "
13328+ "that are properly connected at endpoints"
13329+ msgstr ""
13330+
13331+ msgid ""
13332+ "This is an auxiliary function for processing geometries that touch but "
13333+ "don't share exact endpoints, splitting them at their intersection points "
13334+ "to improve network connectivity."
13335+ msgstr ""
13336+
13337+ msgid "pgr_separateTouching(`Edges SQL`_, [``tolerance``, ``dryrun``])"
13338+ msgstr ""
13339+
1329813340msgid "``pgr_sequentialVertexColoring`` - Proposed"
1329913341msgstr ""
1330013342
@@ -14907,6 +14949,11 @@ msgstr ""
1490714949msgid ":doc:`pgr_separateCrossing` - Breaks geometries that cross each other."
1490814950msgstr ""
1490914951
14952+ msgid ""
14953+ ":doc:`pgr_separateTouching` - Breaks geometries that (almost) touch each "
14954+ "other."
14955+ msgstr ""
14956+
1491014957msgid ":doc:`withPoints-family` - Functions based on Dijkstra algorithm."
1491114958msgstr ""
1491214959
@@ -15015,6 +15062,14 @@ msgid ""
1501515062"factorization on pgr_contraction family"
1501615063msgstr ""
1501715064
15065+ msgid "SQL code enhancements"
15066+ msgstr ""
15067+
15068+ msgid ""
15069+ "`#2850 <https://github.com/pgRouting/pgrouting/issues/2850>`__: Rewrite "
15070+ "pgr_nodeNetwork"
15071+ msgstr ""
15072+
1501815073msgid "New proposed functions"
1501915074msgstr ""
1502015075
@@ -15036,6 +15091,11 @@ msgid ""
1503615091"pgr_separateCrossing"
1503715092msgstr ""
1503815093
15094+ msgid ""
15095+ "`#2849 <https://github.com/pgRouting/pgrouting/issues/2849>`__: "
15096+ "pgr_separateTouching"
15097+ msgstr ""
15098+
1503915099msgid "pgRouting 3.7"
1504015100msgstr ""
1504115101
0 commit comments