POST
|
Thanks a lot, Patrick. I have my problems solved with your comments. (try to work out with in-memory Workspace and finally decide to use just a polyline to display the route :D) My GUI is now functional. But the problem is that it run very slow, in compare with the running time of non-GUI app. For example, to calculate the route, non-GUI app only need ~1s, but the GUI take about 30s to finished :(. Both apps use the same code, same algorithm. Could you give me some advice for speeding up this stuff ? Thanks and MERRY CHRISTMAS TO ALL !!! Phu Nguyen.
... View more
12-22-2011
10:17 AM
|
0
|
0
|
252
|
POST
|
I have two more questions regard to my problem. They're about GUI implementation: - After running the algorithm and find a shortest route, how can I draw the route on map so that user can easily regconizes that route. I found out piece of code in C#. Can I do the same with Java (I use ArcEngine 9.3) http://help.arcgis.com/en/sdk/10.0/arcobjects_net/componenthelp/index.html#/RoutingForm/00480000014m000000/ - How I can let user choose a junction or an edge on a map by visually clicking on those elements (for example, choose the start point) Thanks for any help!
... View more
11-22-2011
11:05 AM
|
0
|
0
|
252
|
POST
|
Thank you, Michael ! I am going to work on the materials.....
... View more
11-18-2011
08:32 AM
|
0
|
0
|
252
|
POST
|
Thank you all ! My algorithm is an improvement of LPA*, thus, it needs a heuristic estimation like the one of A*. As Michael said, I look at the coordinate system of my shapefiles, and found out that it is in "GCS_Assumed_Geographic_1". So, i change the Geographic Coordinate System to Projected Coordinate System using Project tool in ArcToolbox. (i changed it to NAD_1983_California_Teale_Albers, pretty uncertain about how they work :D). Is that OK? After that, i re-create my network dataset and check out the distance using Pythagorean theorem. It work ! The result is real distance in meter 😄
... View more
11-17-2011
11:12 PM
|
0
|
0
|
252
|
POST
|
Hi Patrick, This product is great. I just want to write a piece of code to get optimal path bw 2 points in the network using a kind of heuristic algorithm. Its for my project in the university. I have one more question. How to get the distance between two junctions in a street network in meter. I've tried several ways but all of them give the same result as using Pythagorean theorem for x, y coordinates of the two Point. This result make no sense when compare with the result from Measure tool in ArcMap. Is there any thing that need to be converted or processed before we can get real distance ? (I want to get the distance using java). Thanks in advance for your help!
... View more
11-17-2011
10:26 AM
|
0
|
0
|
680
|
POST
|
Thank you Jay ! This field is really new to me and I've got stuck by this problem for some days. Thanks alot for your help.:D Phu Nguyen.
... View more
11-08-2011
08:27 AM
|
0
|
0
|
680
|
POST
|
Thanks for your reply ! Actually, i want to write a new shortest path solver that used an algorithm like A* algorithm. So what I need is the connectivity information of the network, like knowing adjacent vertices of a junction. Do you mean the dataset that I used must contain those information in its attribute table ? I take a look at sample data for network analyst in my ArcGIS dir, it contains road feature class and junction feature class, but in the attribute table of street junction, there is only FID, Shapefile and ZELEV, no information about connectivities. So, how the shortest path solver of NetworkAnalyst obtain those information? Sorry for my bad English.
... View more
11-07-2011
10:20 PM
|
0
|
0
|
680
|
POST
|
I want to code a simple application using java that read data from street shapefile, calculate the shortest path between two vertices using an algorithm and display the route in MapBean of my app. What is want is a custom and simple route solver, for algorithm demo purpose only. It might be simple task but the problem is that I am new with ArcGIS, and new with geographic field too. So I found many difficults in implementing the demo. I think the trouble is how to determine the adjacent edges of a vertex in the network. Is there any kind of junction connectivity table stored in shapefile and how to read these data, using java. Any help would be greatly appreciated !
... View more
11-07-2011
06:13 AM
|
0
|
15
|
3366
|
Online Status |
Offline
|
Date Last Visited |
11-11-2020
02:24 AM
|