SPAM-LOW: [mapguide-users] Re: Shortest Path

[Andy Morsell]

I think it's great that people are considering contributing modules to the
project.  A routing module is a good example that many people could use.
But, if you do, it should be web extension language neutral so it will run
on PHP, Java, and .NET implementations.  If you did do something like this,
it would work for both MGOS and MGE.
 

Andy Morsell, P.E. 
Spatial Integrators, Inc. 
http://www.SpatialGIS.com 

  _____  

From: Alejandro Guzman [mailto:lguzmanc at gmail.com] 
Sent: Thursday, October 05, 2006 9:31 PM
To: users at mapguide.osgeo.org
Cc: Trevor Wekel
Subject: SPAM-LOW: [mapguide-users] Re: Shortest Path


Hi Trevor, 

Thanks for your quickly response. I continued investigating about other
transportation problems that I want to solve and show in MapGuide, and I
concluded that I must develop a module to manipulate topologies into
MapGuide in order to solve this and other transportation problems. I
recognize that it involves a lot of work and theoretical acknowledge, but if
I can solve this it could be a contribution to MapGuide Open Source or to a
Plug-in of Mapguide Enterprise. Therefore, now my questions are the
following:

 Can the manipulation of topologies into MapGuide be solved by means of ASPX
pages?  

 Could this solution serve for MapGuide Open Source and Mapguide Enterprise?


Thanks

 Alejandro Guzmàn


On 10/3/06, Trevor Wekel <trevor.wekel at autodesk.com> wrote: 

Hi Alejandro,
 
Yes.  You could implement a shortest path command as a C# aspx web page.
This page could then be called from a web application similar to the
existing buffer.aspx script.  MapGuide does not currently support topology
so you would have to create the topology out of the raw geometry before
running the shortest path algorithm.
 
Here is a general outline:
 
Select the features of interest using FeatureService::SelectFeatures()
Iterate through the features recording the end points and identity
properties
Using some heuristics, iterate through the end points to determine which
"touch" and create the network topology.  An intersects call with a small
circle around each end point may be appropriate.
Using the network topology, determine the shortest path.
Using the identity properties for the shortest path features, highlight the
shortest path using a technique similar to measure.aspx
 
 
This algorithm could also be coded in C++.  A C++ version would be faster
but also more difficult to implement.
 
 
Thanks,
Trevor
 

  _____  

From: Alejandro Guzman [mailto:lguzmanc at gmail.com] 
Sent: Tuesday, October 03, 2006 9:56 AM
To: users at mapguide.osgeo.org
Subject: Shortest Path




Hello 

Nowadays I am evaluating some Internet Map Servers to use one of them in a
project. Till now, due to diverse benefits that this one offers, I have
decided on MapGuide Open Source, nevertheless even I do not still have
totally cleared some questions. Specifically my questions are directed to:

 

Can I create a new command to find shortest path?

If it is true, can I programme it with C#? 

Or would I have to modify to the source code of Mapguide to do this, and
therefore use a specific language of programming?

Do solutions exist type plug-in to find the shortest path with mapguide?

 

Thanks 

Alejandro Guzmán


-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://lists.osgeo.org/pipermail/mapguide_users/attachments/20061006/85a00419/attachment.html