Timeline for Successive Inner or Outer Approximation of Simple Polygons with Hierarchies of Implicit Functions
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 14, 2017 at 23:15 | history | edited | Joseph O'Rourke | CC BY-SA 3.0 |
Broken link fixed.
|
| Jan 31, 2014 at 12:26 | comment | added | Joseph O'Rourke | @ManfredWeis: Now that you've explained the problem more fully, I wonder if it might not be best to find inscribing and circumscribing polygons of fewer edges (for which there are algorithms), and use ray-shooting on those as a filter. | |
| Jan 31, 2014 at 5:24 | comment | added | Manfred Weis | thanks for your reply; I have some CG background and know the standard algorithms for point in polygon tests. What I really want, but did not state explicitly, is an algorithm that yields 'fastest' execution on the average given the probability that a point is inside the polygon vs outside of it - hence the inner/outer approximation. The implicit functions (e.g. ellipse) would promise quick decisions if the polygons enclose large empty areas despite having a very rugged boundary like e.g. borders of countries. I will edit problem description accordingly. | |
| Jan 30, 2014 at 15:46 | history | answered | Joseph O'Rourke | CC BY-SA 3.0 |