Timeline for Finding boundary co-ordinates from given set of point co-ordinates?
Current License: CC BY-SA 3.0
25 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 26, 2016 at 22:36 | history | edited | PolyGeo♦ | CC BY-SA 3.0 |
deleted 102 characters in body; edited tags; edited title
|
| Jan 27, 2011 at 4:48 | vote | accept | Khaja Minhajuddin | ||
| Jan 25, 2011 at 21:17 | answer | added | WolfOdrade | timeline score: 1 | |
| Jan 25, 2011 at 21:01 | history | edited | underdark |
edited tags
|
|
| Jan 25, 2011 at 18:37 | answer | added | underdark | timeline score: 23 | |
| Jan 25, 2011 at 5:52 | comment | added | Khaja Minhajuddin | @whuber Yeah, now I see what you mean, I want a convex polygon with the minimal area. My ultimate goal is to do a proximity search. The way we want our proximity search to work is: In a given city (convex hull), if we search for homes (each home has a coordinate) within "x" miles, it should give me all the homes which are either inside the convex hull or are at an orthogonal distance of less than "x" miles | |
| Jan 25, 2011 at 5:46 | comment | added | Khaja Minhajuddin | @WolfOdrade I wanted an algorithm, but it seems like this is a common problem and there are lots of pre-built functions in SQL Server to help with this. This is one => dotnetsolutions.co.uk/blog/archive/2010/02/08/… | |
| Jan 25, 2011 at 5:44 | comment | added | Khaja Minhajuddin | @radek This is being used in an asp.net mvc web application, and I am planning to do this computation on our database (SQL Server 2008 R2) | |
| Jan 24, 2011 at 19:55 | history | tweeted | twitter.com/#!/StackGIS/status/29628439875031040 | ||
| Jan 24, 2011 at 19:54 | comment | added | whuber | @Khaja Re the edit (Figure 2): Convexity is the key property here, not area. However, it is not clear what either of these has to do with proximity, which is what seems to be your ultimate interest. Are you looking for a data structure that makes proximity searches more efficient? | |
| Jan 24, 2011 at 19:50 | answer | added | Mark Ireland | timeline score: 1 | |
| Jan 24, 2011 at 19:47 | history | edited | Khaja Minhajuddin | CC BY-SA 2.5 |
label images
|
| Jan 24, 2011 at 19:44 | comment | added | Khaja Minhajuddin | The question linked to by @iant has a lot of pointers, Thanks, I'll look into it. | |
| Jan 24, 2011 at 19:39 | history | edited | Khaja Minhajuddin | CC BY-SA 2.5 |
added more information about the problem.
|
| Jan 24, 2011 at 19:17 | comment | added | whuber | Re: the votes to close. This question would duplicate gis.stackexchange.com/questions/8/… only if the desired solution is in ArcGIS. Otherwise there is no valid reason to close it. | |
| Jan 24, 2011 at 19:16 | history | edited | whuber |
edited tags
|
|
| Jan 24, 2011 at 19:15 | comment | added | whuber | @Khaja No, you don't want to maximize the area, you want to minimize it among all convex polygons containing the points. (The only way to maximize the area is to use the entire world as the containing polygon.) | |
| Jan 24, 2011 at 18:32 | answer | added | Pablo | timeline score: 8 | |
| Jan 24, 2011 at 18:25 | answer | added | user173 | timeline score: 3 | |
| Jan 24, 2011 at 18:18 | comment | added | user173 | What software / platform are you wiling to use for that? | |
| Jan 24, 2011 at 17:29 | comment | added | WolfOdrade | Are you looking for code, theoretical references, or solutions in specific existing software environments? | |
| Jan 24, 2011 at 17:24 | comment | added | Nicklas Avén | No, not duplicate, this is convex hull, not concave | |
| Jan 24, 2011 at 17:23 | answer | added | Nicklas Avén | timeline score: 3 | |
| Jan 24, 2011 at 16:41 | comment | added | Ian Turton | possible duplicate of Concave Hull: Definition, Algorithms and Practical Solutions | |
| Jan 24, 2011 at 16:28 | history | asked | Khaja Minhajuddin | CC BY-SA 2.5 |