Timeline for Creating polygons around extent of similar points using ArcGIS Desktop?
Current License: CC BY-SA 3.0
10 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Feb 18, 2016 at 8:21 | history | edited | PolyGeo♦ | CC BY-SA 3.0 |
deleted 2 characters in body
|
Apr 27, 2012 at 21:44 | vote | accept | Ramakrishna Billakanti | ||
Apr 27, 2012 at 21:44 | |||||
Feb 13, 2012 at 19:30 | comment | added | Ramakrishna Billakanti | @whuber The tools from the ArcGIS didn't consumed much of time for processing 28 million records. It was quicker in reading the points and processing them to the grid and then to Euclidean Allocation. I really appreciate for taking time and posting your answers on the blog. Thank you again. | |
Feb 9, 2012 at 22:02 | comment | added | user681 | _@Bill, I didn't take offense, term precludes an assessment a present but it is now a sticky note on my monitor :) I will report much later. In the interim, anyone with an ArcInfo license could report Arc's implementation times for point files of various sizes so I could compare the pure Python implementation to it. Regards | |
Feb 9, 2012 at 21:58 | comment | added | whuber | I wasn't trying to be sarcastic, @Dan: I'm sorry to have sounded that way. I do understand your intention to identify an alternative for those without ArcInfo licenses (and appreciate your consistent efforts over many years to help people in that way). And (although I'm ignorant of the details of the code) I actually do think your solution might work, because in principle it should scale well. I'm genuinely curious to see what happens. | |
Feb 9, 2012 at 21:52 | comment | added | user681 | _ @Bill, I should have been clearer, my comment was directed as an alternative to the use of ArcMap's Thiessen polygons and not to methodology that you proposed. Should someone have a less onerous data set and require an implementation of Steve Fortune's algorithm without the ArcInfo license, then it provides an alternative. | |
Feb 9, 2012 at 20:26 | comment | added | whuber | I would be very interested, @Dan, to know how well your solution handles "millions of points." :-) It can be a pain to generate a dataset that large purely for testing; so, Ramakrishna, if you do try either of the vector solutions mentioned here, would you be so kind as to tell us about their performance afterwards? | |
Feb 9, 2012 at 18:48 | comment | added | user681 | The listed thread requires an ArcInfo license, if you have an Arcview license, then you can try resources.arcgis.com/gallery/file/geoprocessing/… | |
Feb 9, 2012 at 18:30 | comment | added | whuber | I discuss this solution at the end of my reply: Thiessen polygons are synonymous with a Voronoi tessellation. Thanks for providing a link to the software! | |
Feb 9, 2012 at 17:37 | history | answered | nmpeterson | CC BY-SA 3.0 |