Timeline for Position a polygon to maximise number of points within it
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 22, 2016 at 1:44 | answer | added | FelixIP | timeline score: 1 | |
| Sep 21, 2016 at 18:11 | comment | added | Spacedman | For a fixed radius a simple hexagonal lattice of circles will cover about 90% of the space. So that gives you a benchmark of spatial coverage that might give you 90% point coverage. There's still 3 degrees of freedom with this (x-y translation and rotation) so you could optimise over those and maybe do better.... | |
| Sep 21, 2016 at 14:46 | comment | added | user82635 | Yes with a defined/fixed radius. | |
| Sep 21, 2016 at 14:36 | comment | added | Spacedman | - with a given, fixed radius, yes? Otherwise one circle of radius 100000000 might cover all of them! | |
| Sep 21, 2016 at 13:29 | comment | added | user82635 | Yes @Spacedman that is correct. However if it can make the problem simpler, we can relax the constraint of r being function of location. So simply, non overlapping circles that maximises points in it. | |
| Sep 21, 2016 at 12:30 | comment | added | Spacedman | You want to find the set of non-overlapping circles defined by (x,y,r) that maximises overlap with a set of points with the additional constraint that r is a function of location. Yes? | |
| Sep 21, 2016 at 11:50 | history | edited | Hornbydd | CC BY-SA 3.0 |
added 1 character in body
|
| Sep 21, 2016 at 9:54 | history | edited | PolyGeo♦ | CC BY-SA 3.0 |
deleted 11 characters in body
|
| Sep 21, 2016 at 9:49 | history | asked | user82635 | CC BY-SA 3.0 |