seems like the terminals are identified by a layer number and range of categories. <br>
<br>
how do you get the layers associated with each feature type like arc, node, point? to input into the function?<br>
<br>
are the categories created while numbering basic elements first, and
then complex ones? meaning if you have two nodes and an arc,
would the category number for the arc be 3?<br>
<br><br><div><span class="gmail_quote">On 6/14/06, <b class="gmail_sendername">Markus Neteler</b> <<a href="mailto:neteler@itc.it">neteler@itc.it</a>> wrote:</span><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
On Wed, Jun 14, 2006 at 08:52:37AM -0400, M S wrote:<br>> nice document! this is great stuff.<br><br>Thanks. And note that data elaboration with the current<br>6.1-CVS is even easier...<br><br>> The v.net.steiner seems to be a realistic functional model by using an
<br>> existing (road) network to know what physical routes it can follow to the<br>> given terminals. this looks fantastic, and i cant wait to build some test<br>> data.<br><br>There should be a roads_net in spearfish6.0
which was recently<br>updated by Radim.<br><br>> is there a function (raster or vector) that would allow for building the<br>> network links/lines by inputting only the points without regards to an<br>> existing (road) network? (using something like the minimum spanning tree
<br>> example below). This function would be great as a first cut in network<br>> analysis.<br><br>You could use v.hull and then v.type to make it lines or use<br>v.extract to only extract the boundaries, then v.type
for<br>boundaries -> lines. (untested)<br><br>> the page below illustrates the minimum spanning tree, but if i understand<br>> right, just nodes are inputted. then the algorithm does at a minimum 3<br>> things 1) identifies clusters of sites 2) builds the links to connect the
<br>> clusters to each other, and 3) then finds from each cluster, the nearest<br>> point to other clusters.<br>> <a href="http://www.cs.sunysb.edu/~algorith/files/minimum-spanning-tree.shtml">http://www.cs.sunysb.edu/~algorith/files/minimum-spanning-tree.shtml
</a><<a href="http://www.cs.sunysb.edu/%7Ealgorith/files/minimum-spanning-tree.shtml">http://www.cs.sunysb.edu/%7Ealgorith/files/minimum-spanning-tree.shtml</a>><br>><br>> i dont think the v.net.steiner function does what the steiner-tree function
<br>> below illustrates, because the GRASS version uses an existing (road) network<br>> to realistically model the existing pathways (nice implementation!).<br><br>Kudos to Roberto Micarelli and Radim.<br><br>> This was the steiner tree example from the same site.
<br>> <a href="http://www.cs.sunysb.edu/~algorith/files/steiner-tree.shtml">http://www.cs.sunysb.edu/~algorith/files/steiner-tree.shtml</a><br>> I'm working with a Network Engineer on using GRASS to solve the network
<br>> analysis problems. Using the NON-GRASS steiner tree (from example above)<br>> wont work becuase as it goes to build the links, but connects lines to<br>> lines, rather than given nodes. in the network implementaion this would be
<br>> a mid-span junction, or splicing the fiber at this junction to connect the<br>> lines. the minimum spanning tree is more applicable. However, i suspect<br>> that the GRASS minimum steiner tree is the most applicable and realistic
<br>> model/function.<br><br>It would be great to have some examples online, for<br> <a href="http://grass.itc.it/applications/index.php">http://grass.itc.it/applications/index.php</a><br><br>> The GRASS minimum steiner tree is a realistic functional model that uses
<br>> real network data in conjunction with the terminals. this seems like a<br>> great deployment of the steiner tree in conjunction with consideration to<br>> the existing network such as roads. I cant wait to have some fun with GRASS
<br>> and give this a whirl!<br>><br>> as usual, keep up the great work, and thanks to everyone who makes GRASS GIS<br>> be all it can be! feels great to find a GIS like this one which is fun to<br>> work with, and has such community invovlement. truely a great environmant
<br>> that makes GIS fun (again for me).<br><br>Welcome!<br><br>Markus<br><br>><br>> On 6/14/06, Markus Neteler <<a href="mailto:neteler@itc.it">neteler@itc.it</a>> wrote:<br>> ><br>> >M S wrote on 06/14/2006 03:13 AM:
<br>> ><br>> >> The input parameter seems to be terminals. Can they be points?<br>> ><br>> >They can be points (nodes) which have to be connected to the network.<br>> >You may take a look at:
<br>> ><a href="http://mpa.itc.it/corso_dit2004/grass04_4_vector_network_neteler.pdf">http://mpa.itc.it/corso_dit2004/grass04_4_vector_network_neteler.pdf</a><br>> >slide 19<br>> ><br>> >Markus<br>
> ><br>> >_______________________________________________<br>> >grassuser mailing list<br>> ><a href="mailto:grassuser@grass.itc.it">grassuser@grass.itc.it</a><br>> ><a href="http://grass.itc.it/mailman/listinfo/grassuser">
http://grass.itc.it/mailman/listinfo/grassuser</a><br>> ><br><br>--<br>Markus Neteler <neteler itc it> <a href="http://mpa.itc.it">http://mpa.itc.it</a><br>ITC-irst - Centro per la Ricerca Scientifica e Tecnologica
<br>MPBA - Predictive Models for Biol. & Environ. Data Analysis<br>Via
Sommarive,
18 -
38050 Povo (Trento), Italy<br><br>_______________________________________________<br>grassuser mailing list<br><a href="mailto:grassuser@grass.itc.it">grassuser@grass.itc.it</a><br><a href="http://grass.itc.it/mailman/listinfo/grassuser">
http://grass.itc.it/mailman/listinfo/grassuser</a><br></blockquote></div><br>