<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" version="2.0">
  <channel>
    <title>topic Re: Proc Ginside with Shapefile that has multiple overlapping polygons, How to ID each polygon in Graphics Programming</title>
    <link>https://communities.sas.com/t5/Graphics-Programming/Proc-Ginside-with-Shapefile-that-has-multiple-overlapping/m-p/564732#M18279</link>
    <description>&lt;H1 id="Using-the-polygon-package-for-IML-in-place-of-PROC-GINSIDE-for-calculating-point-intersection-with-multiple-overlapping-polygons"&gt;Using the polygon package for IML in place of PROC GINSIDE for calculating point intersection with multiple overlapping polygons&lt;/H1&gt;
&lt;P&gt;&amp;nbsp;&lt;/P&gt;
&lt;P&gt;This notebook utilizes the polygon package for IML created by Rick Wicklin in order determine whether any of a set of points are inside a set of non-simple (intersecting) polygons. In this example we have two overlapping shapes and five points.&lt;/P&gt;
&lt;P&gt;&amp;nbsp;&lt;/P&gt;
&lt;P&gt;&lt;A href="https://github.com/FriedEgg/Papers/blob/master/Random/Alternative%20to%20PROC%20GINSIDE%20for%20non-simple%20(intersecting)%20polygons.ipynb" target="_blank"&gt;https://github.com/FriedEgg/Papers/blob/master/Random/Alternative%20to%20PROC%20GINSIDE%20for%20non-simple%20(intersecting)%20polygons.ipynb&lt;/A&gt;&lt;/P&gt;</description>
    <pubDate>Sun, 09 Jun 2019 05:37:33 GMT</pubDate>
    <dc:creator>FriedEgg</dc:creator>
    <dc:date>2019-06-09T05:37:33Z</dc:date>
    <item>
      <title>Proc Ginside with Shapefile that has multiple overlapping polygons, How to ID each polygon</title>
      <link>https://communities.sas.com/t5/Graphics-Programming/Proc-Ginside-with-Shapefile-that-has-multiple-overlapping/m-p/564243#M18262</link>
      <description>&lt;P&gt;Proc ginside is running accurately for me, but I want more detailed results.&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;I have a shapefile that is made up of many overlapping polygons. Imagine the radio broadcast reach within a metro area. Each station has particular power and broadcast location, so each station has its own signal shadow polygon. One shapefile has all these overlapping polygons. Using ArcGis, if I select a particular point, it will select many records within the shapefile representing all of the stations that can be heard at that point.&amp;nbsp;&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;I have many points and am using proc ginside to find which stations can be heard at that point, i.e. which polygons that point is in.&amp;nbsp; But proc ginside only tells me whether a point is inside that entire shapefile. I'm using the station call-ID as the proc ginside ID. It seems to pick the call-ID of the first record of a matching polygon.&amp;nbsp; I want to know every polygon it intersected.&amp;nbsp;&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;Is there a way to get proc ginside to do that?&amp;nbsp; I'm not in a position to post the data.&amp;nbsp;&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;Otherwise I think I have to&amp;nbsp;&lt;/P&gt;&lt;P&gt;1) make a list of the call-ids&lt;/P&gt;&lt;P&gt;2) write a looping macro to do the proc ginside individually for every station using a where statement so only that one polygon within the shapefile will be used (if proc ginside will let me do that). Otherwise I fear I have to use a macro to create separate polygons.&amp;nbsp;&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;That sound right?&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;SAS 9.4&amp;nbsp;&lt;/P&gt;&lt;P&gt;&amp;nbsp;&lt;/P&gt;&lt;P&gt;Thanks.&amp;nbsp;&lt;/P&gt;&lt;P&gt;Dan Keating&lt;/P&gt;&lt;P&gt;Washington Post&lt;/P&gt;&lt;P&gt;dan.keating@washpost.com&lt;/P&gt;</description>
      <pubDate>Thu, 06 Jun 2019 18:07:41 GMT</pubDate>
      <guid>https://communities.sas.com/t5/Graphics-Programming/Proc-Ginside-with-Shapefile-that-has-multiple-overlapping/m-p/564243#M18262</guid>
      <dc:creator>NewsGuy</dc:creator>
      <dc:date>2019-06-06T18:07:41Z</dc:date>
    </item>
    <item>
      <title>Re: Proc Ginside with Shapefile that has multiple overlapping polygons, How to ID each polygon</title>
      <link>https://communities.sas.com/t5/Graphics-Programming/Proc-Ginside-with-Shapefile-that-has-multiple-overlapping/m-p/564732#M18279</link>
      <description>&lt;H1 id="Using-the-polygon-package-for-IML-in-place-of-PROC-GINSIDE-for-calculating-point-intersection-with-multiple-overlapping-polygons"&gt;Using the polygon package for IML in place of PROC GINSIDE for calculating point intersection with multiple overlapping polygons&lt;/H1&gt;
&lt;P&gt;&amp;nbsp;&lt;/P&gt;
&lt;P&gt;This notebook utilizes the polygon package for IML created by Rick Wicklin in order determine whether any of a set of points are inside a set of non-simple (intersecting) polygons. In this example we have two overlapping shapes and five points.&lt;/P&gt;
&lt;P&gt;&amp;nbsp;&lt;/P&gt;
&lt;P&gt;&lt;A href="https://github.com/FriedEgg/Papers/blob/master/Random/Alternative%20to%20PROC%20GINSIDE%20for%20non-simple%20(intersecting)%20polygons.ipynb" target="_blank"&gt;https://github.com/FriedEgg/Papers/blob/master/Random/Alternative%20to%20PROC%20GINSIDE%20for%20non-simple%20(intersecting)%20polygons.ipynb&lt;/A&gt;&lt;/P&gt;</description>
      <pubDate>Sun, 09 Jun 2019 05:37:33 GMT</pubDate>
      <guid>https://communities.sas.com/t5/Graphics-Programming/Proc-Ginside-with-Shapefile-that-has-multiple-overlapping/m-p/564732#M18279</guid>
      <dc:creator>FriedEgg</dc:creator>
      <dc:date>2019-06-09T05:37:33Z</dc:date>
    </item>
  </channel>
</rss>

